Core Insights - The research team from Shanghai Institute of Science and Intelligence, Peking University, and Fudan University has made significant breakthroughs in the classical mathematical problem of kissing numbers, utilizing the PackingStar reinforcement learning system to explore complex high-dimensional spaces beyond human intuition [1][2] Group 1: Breakthroughs in Kissing Numbers - The team has achieved new best-known kissing number structures in dimensions 25-31, and has broken long-standing records in dimensions 14, 17, 12, 20, and 21 [1] - The PackingStar system transforms high-dimensional packing problems into multi-agent game learning on cosine matrices, allowing for a unified approach to complex geometric issues [3] Group 2: Applications and Implications - Kissing number problems are not just abstract geometric challenges; they are central to discrete geometry and coding theory, with applications in satellite communication, quantum coding, and data compression [2] - The advancements in this area could lead to improved signal distribution methods in engineering, highlighting the practical significance of the research [2] Group 3: Research Methodology and Efficiency - The research has resulted in a 2-3 times increase in search efficiency and saved over 100,000 GPU hours, showcasing the computational potential of the AI model [3] - The methods developed through the PackingStar project have become a reusable interdisciplinary computational paradigm, enabling systematic exploration of previously deemed "intractable" scientific problems [3] Group 4: Team and Institutional Support - The project is led by young researchers, including AIMath researcher Ma Chengdong, who aims to tackle more niche and high-risk problems after achieving existing academic results [3][5] - The Shanghai Institute of Science and Intelligence promotes an inclusive environment for young researchers, encouraging independent exploration without hierarchical constraints [5]

Core Viewpoint - A breakthrough in the kissing number problem has been achieved by a collaborative research team from the Shanghai Institute of Science and Intelligence, Peking University, and Fudan University, utilizing the PackingStar reinforcement learning system to explore complex high-dimensional spaces and surpass previous human-known optimal structures [1][4]. Group 1: Research Breakthroughs - The research team has broken the known optimal kissing number structures in dimensions 25-31, as well as the long-standing values for 14 and 17 dimensions for "two-ball kissing numbers," and 12, 20, and 21 dimensions for "three-ball kissing numbers" [1]. - The PackingStar system has transformed the complex high-dimensional geometric problem into an algebraic problem compatible with GPU parallel logic, significantly enhancing the computational potential of AI models [4][6]. Group 2: AI and Mathematics Integration - The research represents a bidirectional attempt between AI and mathematics, with AI advancements lowering the barriers for researchers to tackle complex problems [2]. - Previous attempts to use AI in the kissing number problem, such as DeepMind's AlphaEvolve, resulted in limited breakthroughs, highlighting the unique approach of the PackingStar system in achieving substantial improvements [3][4]. Group 3: Future Plans and Applications - The research team plans to improve the system further, expand to the entire space of sphere packing problems, explore applications in graph theory, and collaborate with more mathematicians [8]. - The results from the PackingStar project have led to a 2-3 times increase in search efficiency and saved over 100,000 GPU hours, establishing a reusable interdisciplinary intelligent computing paradigm [6].

Core Insights - The research team from Shanghai Institute of Science and Intelligent Technology, in collaboration with Peking University and Fudan University, has developed a multi-agent reinforcement learning system called PackingStar, which has set new records in the long-standing mathematical problem known as the "kissing number" problem, marking a significant breakthrough in the field of mathematical structures [1][2][3] Group 1: Research and Development - PackingStar addresses high-dimensional combinatorial optimization problems, similar to challenges in new material design and drug discovery, by finding optimal solutions in exponentially growing search spaces [3] - The system has revealed solutions that possess clear geometric rules while breaking global symmetry, leading to new mathematical constructs that were previously incomprehensible [3] - The collaboration between human intuition and AI in the research process has transformed the role of mathematicians from tedious calculations to becoming "mathematical observers" and "intuition designers" [3][4] Group 2: AI and Human Collaboration - The project signifies a shift towards a new paradigm of collaborative research where human mathematicians provide insights and intuition, while AI constructs structures and searches for proofs, creating a feedback loop that enhances both AI capabilities and human mathematical intuition [4][5] - The development of PackingStar is compared to AlphaFold in biology, highlighting the need for deep collaboration between AI experts and mathematicians to tackle problems that lack existing training data [4][6] Group 3: Cultural and Philosophical Context - The team embodies a cross-disciplinary approach, merging backgrounds in physics, AI, and mathematics, which fosters a creative environment conducive to scientific breakthroughs [7][8] - The name "PackingStar" reflects both the research focus on high-dimensional space and the diverse talents of the team members, symbolizing a new generation of scientific inquiry at the intersection of technology and humanities [7][8]

Core Insights - The Shanghai Institute of Intelligent Science (SIIS) has achieved a breakthrough in the kissing number problem, marking a significant advancement in mathematical research through the collaboration of AI and human researchers [1][5]. Group 1: Breakthrough Details - The PackingStar reinforcement learning system, developed in collaboration with Peking University and Fudan University, has set new records for kissing numbers across multiple dimensions, including 12, 13, 14, 17, 20, 21, and 25 to 31 [1]. - This achievement represents a systematic breakthrough in high-dimensional combinatorial geometry and coding theory, validating a new human-AI collaborative research approach [1][5]. Group 2: Historical Context - The kissing number problem, first proposed by Newton and Gregory in 1694, has a long history, with significant developments occurring only sporadically over the past 300 years [1][2]. - The problem is linked to various mathematical branches and has practical applications in satellite communication, quantum coding, and data compression [1]. Group 3: Methodological Innovations - The breakthrough has led to a methodological transformation in the research of the kissing number problem, moving from traditional symmetric constructions to discovering asymmetric configurations that maintain multi-dimensional records [5]. - The PackingStar project has redefined the problem by converting high-dimensional geometric challenges into algebraic computations, facilitating cross-dimensional migration paths [5]. Group 4: Engineering Support - The research is supported by a robust engineering framework, with the SIIS focusing on dismantling scientific goals through an open platform and leveraging engineering capabilities to mitigate exploration uncertainties [5]. - The project has optimized GPU computing processes and established an automatic checkpoint mechanism, significantly enhancing search speeds and saving over 100,000 GPU hours [5].

Core Insights - A systematic breakthrough in the "Kissing Number Problem" has been achieved by a research team from Shanghai Institute of Science and Intelligence, Peking University, and Fudan University, utilizing a multi-agent reinforcement learning system called PackingStar [1][2] - The research has resulted in the discovery of new optimal structures in dimensions 25 to 31, breaking long-standing records in dimensions 14, 17, 12, 20, and 21, and identifying over 6000 new configurations [2] Group 1 - The Kissing Number Problem, proposed by Isaac Newton and David Gregory in 1694, seeks to determine the maximum number of identical spheres that can touch another identical sphere in three-dimensional space [1] - The PackingStar system transforms the high-dimensional packing problem into a cosine matrix filling problem, significantly enhancing computational efficiency and establishing a stable fault-tolerant mechanism for large-scale calculations [1][2] Group 2 - The research team has developed a stable human-AI collaboration model, allowing for the breakdown of large scientific goals into specific projects, thus enabling AI and researchers to work together effectively [3] - This advancement signifies a new exploration path in mathematical research, driven by the integration of artificial intelligence into fundamental scientific fields [3]

Core Viewpoint - The article discusses the breakthrough in solving the Kissing Number Problem using AI, specifically through a system called PackingStar, which has achieved significant advancements in high-dimensional geometry [1][10][49]. Group 1: Kissing Number Problem Overview - The Kissing Number Problem investigates how many equal-sized spheres can touch another sphere without overlapping in n-dimensional space [2][4]. - The problem has historical significance, originating from a debate between Newton and Gregory in 1694 regarding the arrangement of spheres in three-dimensional space [5][6]. - Recent advancements have been limited, with only seven substantial progressions in nearly 50 years [9]. Group 2: Breakthrough Achievements - The PackingStar system, developed by a collaborative team from Shanghai Science and Technology Institute, Peking University, and Fudan University, has set new records for dimensions 25 to 31 [10][11]. - The system has also discovered over 6,000 new configurations in various dimensions and broken long-standing records in generalized kissing numbers [10][11]. Group 3: Methodology and AI Integration - PackingStar transforms the high-dimensional geometric problem into a multi-agent game, allowing AI to explore potential structures autonomously [18][24]. - The approach involves using a cosine matrix to represent the positions of spheres, which is well-suited for parallel computation on GPUs [18][24]. - The system employs a collaborative mechanism between two agents to fill, prune, and reconstruct geometric structures, significantly reducing the complexity of high-dimensional exploration [25][31]. Group 4: Implications for Mathematics and AI - The discoveries made by PackingStar challenge traditional human intuitions about symmetry in geometric structures, revealing many non-symmetric configurations that yield better results [27][28]. - The project exemplifies a shift in AI's role from merely assisting in calculations to actively participating in scientific exploration, marking a new phase in AI for Science [64][65]. - The results have implications across various mathematical fields, connecting concepts from sphere packing, number theory, and group theory, thus enhancing the overall mathematical discourse [34][60]. Group 5: Infrastructure and Future Directions - The project highlights the importance of robust AI infrastructure, which is crucial for tackling complex mathematical problems that require extensive computational resources [39][40]. - The development of custom CUDA operators and an automatic checkpointing system has improved the efficiency and stability of long-duration tasks [42][46]. - The success of PackingStar indicates a promising future for AI in mathematics, suggesting that previously unsolvable problems may become accessible through innovative AI methodologies [49][60].

Core Viewpoint - The article discusses the breakthrough achieved by the PackingStar reinforcement learning system in solving the Kissing Number Problem, showcasing a significant advancement in both mathematical understanding and AI application in high-dimensional geometry [2][3][4]. Group 1: Breakthrough Achievements - PackingStar has set new records in multiple dimensions, including 25-31 dimensions, and has broken records for the kissing numbers in 12, 14, 17, 20, and 21 dimensions, as well as discovering over 6000 new structures [15][21]. - The system's approach involved transforming high-dimensional geometric problems into a cosine matrix filling problem, allowing for a systematic search and generation of new geometric configurations [12][25]. Group 2: Methodology and Collaboration - The breakthrough was achieved through a multi-agent reinforcement learning architecture, where two agents collaborated: one for filling the matrix and the other for pruning suboptimal structures [6][9][11]. - This collaborative approach mirrors the dynamics of a partnership, where one agent explores boldly while the other refines and optimizes the results [8][30]. Group 3: AI and Mathematical Integration - PackingStar represents a shift in the AI for Math paradigm, demonstrating that AI can not only solve problems but also actively construct new geometric possibilities in high-dimensional spaces [26][27]. - The project emphasizes the importance of human-AI collaboration, where human intuition and mathematical insight guide the AI's exploration and construction processes [32][41]. Group 4: Engineering and Computational Efficiency - The engineering team optimized the underlying operators, significantly enhancing computational efficiency and enabling large-scale operations, which resulted in a 2-3 times increase in search efficiency and saved over 100,000 GPU hours [36][37]. - This optimization is crucial for sustaining mathematical exploration and ensuring that the system can tackle increasingly complex problems [36][37].

Core Insights - The article discusses a significant breakthrough in solving the "kissing number problem," a mathematical challenge that has persisted for over 300 years, achieved through the collaboration of AI and researchers from Shanghai, Peking University, and Fudan University [3][4]. Group 1: Kissing Number Problem - The kissing number problem involves determining the maximum number of identical spheres that can touch another identical sphere in N-dimensional space, with historical debates dating back to Isaac Newton and David Gregory [4]. - Recent advancements have been made in high-dimensional spaces, particularly by Marina Viazovska, who received the Fields Medal for her work on the 8-dimensional and 24-dimensional cases [4]. Group 2: AI's Role in Research - The research team utilized AI to tackle the kissing number problem, with the belief that AI could enhance mathematical problem-solving capabilities, despite skepticism from some mathematicians [6][7]. - The development of the PackingStar reinforcement learning system led to the discovery of new optimal packing structures in dimensions 25-31 and over 6000 new solutions in various dimensions [8]. Group 3: Collaborative Research Environment - The collaborative environment in Shanghai allows young researchers to lead projects based on innovative ideas, emphasizing the importance of interdisciplinary teamwork in solving complex scientific problems [10]. - The integration of AI in mathematical research represents a paradigm shift, where AI acts as a partner in scientific exploration, potentially accelerating the pace of discovery [8][10].