{"list":"other","total":166,"rows":[{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"id":"2304.06364","title":"AGIEval: A Human-Centric Benchmark for Evaluating Foundation Models","created":"2023-04-13","cited_by_count":716},{"id":"2507.19457","title":"GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning","created":"2025-07-25","cited_by_count":542},{"id":"2111.15366","title":"AI and the Everything in the Whole Wide World Benchmark","created":"2021-11-26","cited_by_count":349},{"id":"2504.01848","title":"PaperBench: Evaluating AI's Ability to Replicate AI Research","created":"2025-04-02","cited_by_count":321},{"id":"2505.23281","title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","created":"2025-05-29","cited_by_count":297},{"id":"2502.03544","title":"Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2","created":"2025-02-05","cited_by_count":97},{"id":"2302.00615","title":"GFlowNets for AI-Driven Scientific Discovery","created":"2023-02-01","cited_by_count":63},{"id":"2401.06961","title":"CHAMP: A Competition-level Dataset for Fine-Grained Analyses of LLMs' Mathematical Reasoning Capabilities","created":"2024-01-13","cited_by_count":44},{"id":"2303.12921","title":"Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization","created":"2023-03-22","cited_by_count":42},{"id":"2501.17205","title":"Near-Optimal Algorithms for Omniprediction","created":"2025-01-28","cited_by_count":33},{"id":"2310.19647","title":"Fast swap regret minimization and applications to approximate correlated equilibria","created":"2023-10-30","cited_by_count":32},{"id":"2505.03171","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","created":"2025-05-06","cited_by_count":31},{"id":"2506.21621","title":"The Open Proof Corpus: A Large-Scale Study of LLM-Generated Mathematical Proofs","created":"2025-06-23","cited_by_count":30},{"id":"2303.15832","title":"The transformative potential of machine learning for experiments in fluid mechanics","created":"2023-03-28","cited_by_count":27},{"id":"2510.04721","title":"BrokenMath: A Benchmark for Sycophancy in Theorem Proving with LLMs","created":"2025-10-06","cited_by_count":27},{"id":"2310.02243","title":"Learning quantum Hamiltonians at any temperature in polynomial time","created":"2023-10-03","cited_by_count":23},{"id":"2502.13834","title":"Proving Olympiad Inequalities by Synergizing LLMs and Symbolic Reasoning","created":"2025-02-19","cited_by_count":17},{"id":"2502.10197","title":"MathConstruct: Challenging LLM Reasoning with Constructive Proofs","created":"2025-02-14","cited_by_count":16},{"id":"2207.10889","title":"Correlation Clustering with Sherali-Adams","created":"2022-07-22","cited_by_count":15},{"id":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15},{"id":"2111.03158","title":"Pricing Query Complexity of Revenue Maximization","created":"2021-11-04","cited_by_count":12},{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12},{"id":"2103.01640","title":"Double Coverage with Machine-Learned Advice","created":"2021-03-02","cited_by_count":10},{"id":"2602.24173","title":"LemmaBench: A Live, Research-Level Benchmark to Evaluate LLM Capabilities in Mathematics","created":"2026-02-27","cited_by_count":10},{"id":"2603.15617","title":"Measuring Progress in Reasoning Toward Mathematical Discovery with Automatic Verification","created":"2026-03-16","cited_by_count":9},{"id":"2111.03174","title":"Single-Sample Prophet Inequalities via Greedy-Ordered Selection","created":"2021-11-04","cited_by_count":8},{"id":"2201.13128","title":"Deletion Robust Submodular Maximization over Matroids","created":"2022-01-31","cited_by_count":7},{"id":"2307.07304","title":"Breaking the $3/4$ Barrier for Approximate Maximin Share","created":"2023-07-14","cited_by_count":7},{"id":"2404.07281","title":"Certifying almost all quantum states with few single-qubit measurements","created":"2024-04-10","cited_by_count":7},{"id":"2509.22563","title":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","created":"2025-09-26","cited_by_count":7},{"id":"2101.05549","title":"Spectral Clustering Oracles in Sublinear Time","created":"2021-01-14","cited_by_count":6},{"id":"2107.02058","title":"Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack","created":"2021-07-05","cited_by_count":6},{"id":"2104.12695","title":"The Reachability Problem for Petri Nets is Not Primitive Recursive","created":"2021-04-26","cited_by_count":5},{"id":"2106.02397","title":"On Classifying Continuous Constraint Satisfaction Problems","created":"2021-06-04","cited_by_count":5},{"id":"2410.21635","title":"Learning the structure of any Hamiltonian from minimal assumptions","created":"2024-10-29","cited_by_count":5},{"id":"2405.15084","title":"Efficient Certificates of Anti-Concentration Beyond Gaussians","created":"2024-05-23","cited_by_count":4},{"id":"2405.19752","title":"Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits","created":"2024-05-30","cited_by_count":4},{"id":"2412.00717","title":"Data-Driven Solution Portfolios","created":"2024-12-01","cited_by_count":4},{"id":"2001.10809","title":"Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler","created":"2020-01-29","cited_by_count":3},{"id":"2107.05746","title":"Computational Hardness of the Hylland-Zeckhauser Scheme","created":"2021-07-12","cited_by_count":3},{"id":"2111.06308","title":"Online Discrepancy with Recourse for Vectors and Graphs","created":"2021-11-11","cited_by_count":3},{"id":"2311.09095","title":"New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms","created":"2023-11-15","cited_by_count":3},{"id":"2407.20659","title":"Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching","created":"2024-07-30","cited_by_count":3},{"id":"2411.03121","title":"Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse","created":"2024-11-05","cited_by_count":3},{"id":"2508.18587","title":"A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants","created":"2025-08-26","cited_by_count":3},{"id":"1907.04585","title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs","created":"2019-07-10","cited_by_count":2},{"id":"2101.02003","title":"Algorithms and Hardness for Multidimensional Range Updates and Queries","created":"2021-01-06","cited_by_count":2},{"id":"2106.06037","title":"Small space and streaming pattern matching with k edits","created":"2021-06-10","cited_by_count":2},{"id":"2110.11712","title":"Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier","created":"2021-10-22","cited_by_count":2},{"id":"2203.15627","title":"Low Treewidth Embeddings of Planar and Minor-Free Metrics","created":"2022-03-29","cited_by_count":2},{"id":"2205.03930","title":"Near-Optimal Deterministic Vertex-Failure Connectivity Oracles","created":"2022-05-08","cited_by_count":2},{"id":"2207.05150","title":"Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median","created":"2022-07-11","cited_by_count":2},{"id":"2209.14462","title":"What Can Cryptography Do For Decentralized Mechanism Design","created":"2022-09-28","cited_by_count":2},{"id":"2210.12601","title":"Sublinear-Time Algorithms for Max Cut, Max E2Lin$(q)$, and Unique Label Cover on Expanders","created":"2022-10-23","cited_by_count":2},{"id":"2212.00083","title":"The Smoothed Complexity of Policy Iteration for Markov Decision Processes","created":"2022-11-30","cited_by_count":2},{"id":"2305.03194","title":"Testing and Learning Convex Sets in the Ternary Hypercube","created":"2023-05-04","cited_by_count":2},{"id":"2305.15738","title":"Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time","created":"2023-05-25","cited_by_count":2},{"id":"2311.10204","title":"The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds","created":"2023-11-16","cited_by_count":2},{"id":"2405.06616","title":"Fast Mixing in Sparse Random Ising Models","created":"2024-05-10","cited_by_count":2},{"id":"2405.14575","title":"Share-Based Fairness for Arbitrary Entitlements","created":"2024-05-23","cited_by_count":2},{"id":"2405.14765","title":"A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix","created":"2024-05-23","cited_by_count":2},{"id":"2408.10332","title":"Spectral Guarantees for Adversarial Streaming PCA","created":"2024-08-19","cited_by_count":2},{"id":"2503.23404","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","created":"2025-03-30","cited_by_count":2},{"id":"1911.07378","title":"Finding Skewed Subcubes Under a Distribution","created":"2019-11-18","cited_by_count":1},{"id":"2001.10801","title":"Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds","created":"2020-01-29","cited_by_count":1},{"id":"2011.03778","title":"A Gap-ETH-Tight Approximation Scheme for Euclidean TSP","created":"2020-11-07","cited_by_count":1},{"id":"2011.10446","title":"Hop-Constrained Oblivious Routing","created":"2020-11-20","cited_by_count":1},{"id":"2104.05093","title":"Load Balancing with Dynamic Set of Balls and Bins","created":"2021-04-11","cited_by_count":1},{"id":"2104.06576","title":"Dimension-Preserving Reductions Between SVP and CVP in Different $p$-Norms","created":"2021-04-14","cited_by_count":1},{"id":"2107.06961","title":"On complete classes of valuated matroids","created":"2021-07-14","cited_by_count":1},{"id":"2107.11530","title":"Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces","created":"2021-07-24","cited_by_count":1},{"id":"2108.01161","title":"Approximate counting and sampling via local central limit theorems","created":"2021-08-02","cited_by_count":1},{"id":"2109.08042","title":"Vertex Fault-Tolerant Emulators","created":"2021-09-16","cited_by_count":1},{"id":"2111.01422","title":"Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast","created":"2021-11-02","cited_by_count":1},{"id":"2111.02336","title":"An Improved Algorithm for The $k$-Dyck Edit Distance Problem","created":"2021-11-03","cited_by_count":1},{"id":"2111.02544","title":"Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union","created":"2021-11-03","cited_by_count":1},{"id":"2111.05016","title":"Pattern Matching on Grammar-Compressed Strings in Linear Time","created":"2021-11-09","cited_by_count":1},{"id":"2111.05450","title":"Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models","created":"2021-11-09","cited_by_count":1},{"id":"2112.03791","title":"Online Sorting and Translational Packing of Convex Polygons","created":"2021-12-07","cited_by_count":1},{"id":"2202.02174","title":"Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion","created":"2022-02-04","cited_by_count":1},{"id":"2202.06827","title":"A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs","created":"2022-02-14","cited_by_count":1},{"id":"2202.08066","title":"Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime","created":"2022-02-16","cited_by_count":1},{"id":"2204.10465","title":"Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond","created":"2022-04-22","cited_by_count":1},{"id":"2207.04318","title":"Determinant Maximization via Matroid Intersection Algorithms","created":"2022-07-09","cited_by_count":1},{"id":"2207.07809","title":"Curve Simplification and Clustering under Fr\\'echet Distance","created":"2022-07-16","cited_by_count":1},{"id":"2207.11832","title":"New Additive Spanner Lower Bounds by an Unlayered Obstacle Product","created":"2022-07-24","cited_by_count":1},{"id":"2208.13920","title":"Fitting Metrics and Ultrametrics with Minimum Disagreements","created":"2022-08-29","cited_by_count":1},{"id":"2209.04177","title":"Tensor Reconstruction Beyond Constant Rank","created":"2022-09-09","cited_by_count":1},{"id":"2211.06920","title":"Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets","created":"2022-11-13","cited_by_count":1},{"id":"2211.07058","title":"Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics","created":"2022-11-14","cited_by_count":1},{"id":"2211.10556","title":"A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems","created":"2022-11-19","cited_by_count":1},{"id":"2211.11384","title":"Expander Decomposition in Dynamic Streams","created":"2022-11-21","cited_by_count":1},{"id":"2211.12441","title":"Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees","created":"2022-11-22","cited_by_count":1},{"id":"2211.16104","title":"Non-uniform complexity via non-wellfounded proofs","created":"2022-11-29","cited_by_count":1},{"id":"2302.01858","title":"A Computational Separation Between Quantum No-cloning and No-telegraphing","created":"2023-02-03","cited_by_count":1},{"id":"2302.04229","title":"Weighted Edit Distance Computation: Strings, Trees and Dyck","created":"2023-02-08","cited_by_count":1},{"id":"2302.04475","title":"Locally consistent decomposition of strings with applications to edit distance sketching","created":"2023-02-09","cited_by_count":1},{"id":"2303.16043","title":"Faster Deterministic Distributed MIS and Approximate Matching","created":"2023-03-28","cited_by_count":1},{"id":"2304.02091","title":"Determinantal Sieving","created":"2023-04-04","cited_by_count":1}],"next_cursor":"100"}