30 assessed papers
AI-assisted research signals support discovery; they are not peer review or a finding that a paper is correct. How rankings work · Editorial & AI policy
cs.IT · · Preliminary
Cassie Ding, Min-Hsiu Hsieh
The claimed construction directly supplies a missing hypothesis for several quantum-code constructions.
Thomas Y. Hou, Xiang Qin, Peicong Song et al.
Nonuniqueness for the unforced 3D Navier–Stokes Leray–Hopf class would address a central open issue in fluid dynamics.
Josh Alman, Baitian Li, Neha Pant et al.
The claimed refutation of the hyperclique conjecture and two additional conjectures would substantially affect fine-grained complexity.
Haruhisa Enomoto
The abstract claims resolution of a named conjecture applying to all representation-infinite finite-dimensional algebras over algebraically closed fields.
Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk
The abstract claims a complete characterization of hereditary graph classes with fixed-parameter tractable first-order model checking.
Mohammad Hajiaghayi
It claims to resolve a longstanding logarithmic stretch conjecture and derives consequences for cuts, capacities, and oblivious routing.
Ran Luo, Jiahua Tian
It claims to resolve a longstanding exact-solvability question for the Ising model at nonzero field and extends the result across related lattices and dimensions.
Xian Chen, Pan Peng
The claimed polynomial separation between interactive and noninteractive LEDP subgraph counting could materially influence private graph analysis and differential privacy theory.
Yiming Gao, Xuyuan Han, Honggang Hu
Claims to improve longstanding exponential barriers for both DGS and SVP, with implications for lattice algorithms and cryptography.
Nisarg Chadha, Taige Wang, Pavel A. Nosov et al.
It claims to resolve a longstanding rigorous-status question for a canonical quantum many-body model.
Rishikesh Gajjala, Arindam Khan
It resolves a longstanding local-to-global problem and addresses multiple named conjectures and classical bounds.
Bin Cheng, Naixu Guo, Feng Pan
The method targets a central problem in quantum error-correction evaluation and reports applications to large codes, circuits, and hardware usability.
Jian Ding, Fenglin Huang, Peng Yang
The result confirms a longstanding prediction for the two-dimensional Heisenberg model and covers all temperatures.
Chunyang Wang, Yitong Yin, Yixiao Yu et al.
It claims to resolve longstanding threshold questions in a central random constraint-satisfaction model.
Nicola Wengiel
It claims to resolve a longstanding problem by matching the known upper bound in all fixed dimensions.
Junzhe Liu, Yujie Tu, Yifan Yang et al.
A 39,000-hour corpus covering five major Arabic dialects and reported gains across multiple evaluation settings could substantially affect Arabic speech recognition research.
Zijian Liu
It addresses a longstanding mismatch between theory and the reported practical success of Random Reshuffling.
Artur Czumaj, Pan Peng, Yuyang Wang
The stated lower bound approaches the longstanding linear-query barrier and improves substantially over the prior two-sided bound.
Andrew Gao, William Gao
It addresses a central mechanism underlying in-context learning and links several previously isolated components into a circuit.
Bjoern Bringmann, Sky Cao, Martin Hairer et al.
The abstract claims a first construction of a mathematically significant gauge-theoretic measure.
Eli Goldin, Tomoyuki Morimae
The claimed characterization connects 2QKE to several central quantum cryptographic primitives and challenges the assumed role of one-way functions.
Ivan Karpov, Felix Thimm
It addresses a broad CY4 curve-counting program and derives consequences for two major enumerative theories.
Vinayak M. Kumar, Ray Li, Jonathan Mosheiff et al.
The claimed O(b) threshold characterization and broad derandomization consequences could affect multiple areas of coding theory and combinatorics.
Suvradip Chakraborty
Removing the non-signaling assumption could substantially broaden the threat model for device-independent key agreement.
Zemin Chao, Jianhe Cen, Hengzhao Ma et al.
It resolves a stated remaining confidence regime and characterizes memory requirements across all reported regimes.
Zhe Ju, Jingcheng Liu, Yitong Yin
It connects phase-transition behavior, sampling, counting, Glauber dynamics, and fine-grained SAT complexity through quantitative bounds.
Xiaohong Cai, Mingyang Zhu
It resolves a stated open question and gives dimension-independent information-complexity bounds for matrix multiplication.
Will Donovan, Chengxi Wang, Nantao Zhang
The result resolves the D-equivalence conjecture for generalized Kummer type and, with prior results, covers all known deformation types.
Anibal Aravena, Peize Liu, Jenia Tevelev
The result covers every smooth complex projective hypersurface and multiple important derived categories.
Marshall Ball, Eshan Chattopadhyay, Mohit Gurumukhani et al.
The constructions address central extractor questions and connect directly to cryptographic key selection.
