{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/mathematical-proofs","name":"Mathematical Proofs","slug":"mathematical-proofs","description_markdown":null,"categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"},{"name":"Reasoning","url":"/area/reasoning"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":90,"papers_with_code":29,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":1,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/naturalproofs","name":"NaturalProofs","full_name":"","num_papers_in_archive":13},{"url":"/dataset/holstep","name":"HolStep","full_name":"","num_papers_in_archive":10},{"url":"/dataset/constructivebench","name":"ConstructiveBench","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/automated-theorem-proving","name":"Automated Theorem Proving"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":90,"of":90,"of_with_code":29,"tagged_in_all":90,"counts":{"archive_papers_tagged":90,"with_a_code_link":29,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":90,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/breastscreening-on-the-use-of-multi-modality","slug":"breastscreening-on-the-use-of-multi-modality","title":"BreastScreening: On the Use of Multi-Modality in Medical Imaging Diagnosis","date":"2020-04-07","arxiv_id":"2004.03500","repositories_listed":8,"syntology":null},{"url":"/paper/draft-sketch-and-prove-guiding-formal-theorem","slug":"draft-sketch-and-prove-guiding-formal-theorem","title":"Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs","date":"2022-10-21","arxiv_id":"2210.12283","repositories_listed":3,"syntology":null},{"url":"/paper/transerr-translation-based-knowledge-graph","slug":"transerr-translation-based-knowledge-graph","title":"TransERR: Translation-based Knowledge Graph Embedding via Efficient Relation Rotation","date":"2023-06-26","arxiv_id":"2306.14580","repositories_listed":2,"syntology":null},{"url":"/paper/modelling-high-level-mathematical-reasoning","slug":"modelling-high-level-mathematical-reasoning","title":"IsarStep: a Benchmark for High-level Mathematical Reasoning","date":"2020-06-13","arxiv_id":"2006.09265","repositories_listed":2,"syntology":{"n":8,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/modelling-high-level-mathematical-reasoning#ran","syntology_url":"https://syntology.ai/paper/2006.09265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09265"}},"official":null}},{"url":"/paper/adaswarm-a-novel-pso-optimization-method-for","slug":"adaswarm-a-novel-pso-optimization-method-for","title":"AdaSwarm: Augmenting Gradient-Based optimizers in Deep Learning with Swarm Intelligence","date":"2020-05-19","arxiv_id":"2006.09875","repositories_listed":2,"syntology":null},{"url":"/paper/2506-10558","slug":"2506-10558","title":"StepProof: Step-by-step verification of natural language mathematical proofs","date":"2025-06-12","arxiv_id":"2506.10558","repositories_listed":1,"syntology":null},{"url":"/paper/a-theoretical-analysis-of-compositional","slug":"a-theoretical-analysis-of-compositional","title":"A Theoretical Analysis of Compositional Generalization in Neural Networks: A Necessary and Sufficient Condition","date":"2025-05-05","arxiv_id":"2505.02627","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-attention-generates-better","slug":"hierarchical-attention-generates-better","title":"Hierarchical Attention Generates Better Proofs","date":"2025-04-27","arxiv_id":"2504.19188","repositories_listed":1,"syntology":null},{"url":"/paper/distance-adaptive-quaternion-knowledge-graph","slug":"distance-adaptive-quaternion-knowledge-graph","title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","date":"2024-12-05","arxiv_id":"2412.04076","repositories_listed":1,"syntology":null},{"url":"/paper/learning-rules-explaining-interactive-theorem","slug":"learning-rules-explaining-interactive-theorem","title":"Learning Rules Explaining Interactive Theorem Proving Tactic Prediction","date":"2024-11-02","arxiv_id":"2411.01188","repositories_listed":1,"syntology":null},{"url":"/paper/odgs-3d-scene-reconstruction-from","slug":"odgs-3d-scene-reconstruction-from","title":"ODGS: 3D Scene Reconstruction from Omnidirectional Images with 3D Gaussian Splattings","date":"2024-10-28","arxiv_id":"2410.20686","repositories_listed":1,"syntology":null},{"url":"/paper/formalalign-automated-alignment-evaluation","slug":"formalalign-automated-alignment-evaluation","title":"FormalAlign: Automated Alignment Evaluation for Autoformalization","date":"2024-10-14","arxiv_id":"2410.10135","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/formalalign-automated-alignment-evaluation#ran","syntology_url":"https://syntology.ai/paper/2410.10135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10135"}},"official":{"repos":["rookie-joe/formalalign"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ai-for-mathematics-mathematical-formalized","slug":"ai-for-mathematics-mathematical-formalized","title":"Mathematical Formalized Problem Solving and Theorem Proving in Different Fields in Lean 4","date":"2024-09-09","arxiv_id":"2409.05977","repositories_listed":1,"syntology":null},{"url":"/paper/simple-but-effective-compound-geometric","slug":"simple-but-effective-compound-geometric","title":"Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion","date":"2024-08-13","arxiv_id":"2408.06603","repositories_listed":1,"syntology":null},{"url":"/paper/sciex-benchmarking-large-language-models-on","slug":"sciex-benchmarking-large-language-models-on","title":"SciEx: Benchmarking Large Language Models on Scientific Exams with Human Expert Grading and Automatic Grading","date":"2024-06-14","arxiv_id":"2406.10421","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-approach-towards-autoformalization","slug":"a-new-approach-towards-autoformalization","title":"A New Approach Towards Autoformalization","date":"2023-10-12","arxiv_id":"2310.07957","repositories_listed":1,"syntology":null},{"url":"/paper/gentle-a-genre-diverse-multilayer-challenge","slug":"gentle-a-genre-diverse-multilayer-challenge","title":"GENTLE: A Genre-Diverse Multilayer Challenge Set for English NLP and Linguistic Evaluation","date":"2023-06-03","arxiv_id":"2306.01966","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-era-in-software-security-towards-self","slug":"a-new-era-in-software-security-towards-self","title":"A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verification","date":"2023-05-24","arxiv_id":"2305.14752","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-relation-between-sharpness-aware","slug":"on-the-relation-between-sharpness-aware","title":"Sharpness-Aware Minimization Alone can Improve Adversarial Robustness","date":"2023-05-09","arxiv_id":"2305.05392","repositories_listed":1,"syntology":null},{"url":"/paper/towards-autoformalization-of-mathematics-and","slug":"towards-autoformalization-of-mathematics-and","title":"Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs","date":"2023-01-05","arxiv_id":"2301.02195","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-autoformalization-of-mathematics-and#ran","syntology_url":"https://syntology.ai/paper/2301.02195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02195"}},"official":{"repos":["gc974517/autoformalization"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/formal-development-of-safe-automated-driving","slug":"formal-development-of-safe-automated-driving","title":"Formal Development of Safe Automated Driving using Differential Dynamic Logic","date":"2022-04-14","arxiv_id":"2204.06873","repositories_listed":1,"syntology":null},{"url":"/paper/calibration-of-p-values-for-calibration-and","slug":"calibration-of-p-values-for-calibration-and","title":"Calibration of P-values for calibration and for deviation of a subpopulation from the full population","date":"2022-01-31","arxiv_id":"2202.00100","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/calibration-of-p-values-for-calibration-and#ran","syntology_url":"https://syntology.ai/paper/2202.00100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.00100"}},"official":{"repos":["facebookresearch/cdeets"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/theory-guided-hard-constraint-projection-hcp","slug":"theory-guided-hard-constraint-projection-hcp","title":"Theory-guided hard constraint projection (HCP): a knowledge-based data-driven scientific machine learning method","date":"2020-12-11","arxiv_id":"2012.06148","repositories_listed":1,"syntology":null},{"url":"/paper/differential-machine-learning","slug":"differential-machine-learning","title":"Differential Machine Learning","date":"2020-05-05","arxiv_id":"2005.02347","repositories_listed":1,"syntology":null},{"url":"/paper/explosive-proofs-of-mathematical-truths","slug":"explosive-proofs-of-mathematical-truths","title":"Epistemic Phase Transitions in Mathematical Proofs","date":"2020-03-31","arxiv_id":"2004.00055","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-prove-theorems-via-interacting","slug":"learning-to-prove-theorems-via-interacting","title":"Learning to Prove Theorems via Interacting with Proof Assistants","date":"2019-05-21","arxiv_id":"1905.09381","repositories_listed":1,"syntology":null},{"url":"/paper/-rank-multi-agent-evaluation-by-evolution","slug":"-rank-multi-agent-evaluation-by-evolution","title":"α-Rank: Multi-Agent Evaluation by Evolution","date":"2019-03-04","arxiv_id":"1903.01373","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-parallel-algorithm-for-regularized","slug":"a-unified-parallel-algorithm-for-regularized","title":"A Unified Parallel Algorithm for Regularized Group PLS Scalable to Big Data","date":"2017-02-23","arxiv_id":"1702.07066","repositories_listed":1,"syntology":null},{"url":"/paper/premise-selection-for-mathematics-by-corpus","slug":"premise-selection-for-mathematics-by-corpus","title":"Premise Selection for Mathematics by Corpus Analysis and Kernel Methods","date":"2011-08-17","arxiv_id":"1108.3446","repositories_listed":1,"syntology":null},{"url":null,"slug":"prover-agent-an-agent-based-framework-for","title":"Prover Agent: An Agent-based Framework for Formal Mathematical Proofs","date":"2025-06-24","arxiv_id":"2506.19923","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-10304","title":"The Alignment Trap: Complexity Barriers","date":"2025-06-12","arxiv_id":"2506.10304","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-08321","title":"LeanTutor: A Formally-Verified AI Tutor for Mathematical Proofs","date":"2025-06-10","arxiv_id":"2506.08321","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-chemical-qa-evaluating-llm-s-chemical","title":"Beyond Chemical QA: Evaluating LLM's Chemical Reasoning with Modular Chemical Operations","date":"2025-05-27","arxiv_id":"2505.21318","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybridprover-augmenting-theorem-proving-with","title":"HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement","date":"2025-05-21","arxiv_id":"2505.15740","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-probabilities-of-causation","title":"Identification of Probabilities of Causation: A Complete Characterization","date":"2025-05-21","arxiv_id":"2505.15274","repositories_listed":0,"syntology":null},{"url":null,"slug":"provably-safe-and-human-like-car-following","title":"Provably safe and human-like car-following behaviors: Part 2. A parsimonious multi-phase model with projected braking","date":"2025-05-15","arxiv_id":"2505.09988","repositories_listed":0,"syntology":null},{"url":null,"slug":"agentic-neurodivergence-as-a-contingent","title":"Neurodivergent Influenceability as a Contingent Solution to the AI Alignment Problem","date":"2025-05-05","arxiv_id":"2505.02581","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-guarantees-in-synthetic-data","title":"Statistical Guarantees in Synthetic Data through Conformal Adversarial Generation","date":"2025-04-23","arxiv_id":"2504.17058","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathematical-approach-in-hybrid-beamforming","title":"Mathematical Approach in Hybrid Beamforming for ISAC Systems","date":"2025-04-07","arxiv_id":"2504.07988","repositories_listed":0,"syntology":null},{"url":null,"slug":"boundary-effects-in-planar-networks-pentagons","title":"Boundary Effects in Biological Planar Networks: Pentagons Dominate Marginal Cells","date":"2025-03-24","arxiv_id":"2503.18855","repositories_listed":0,"syntology":null},{"url":null,"slug":"fence-theorem-preprocessing-is-dual-objective","title":"Fence Theorem: Preprocessing is Dual-Objective Semantic Structure Isolator in 3D Anomaly Detection","date":"2025-03-03","arxiv_id":"2503.01100","repositories_listed":0,"syntology":null},{"url":null,"slug":"theorem-prover-as-a-judge-for-synthetic-data","title":"Theorem Prover as a Judge for Synthetic Data Generation","date":"2025-02-18","arxiv_id":"2502.13137","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-long-decoding-inference-with","title":"Efficient Long-Decoding Inference with Reasoning-Aware Attention Sparsity","date":"2025-02-16","arxiv_id":"2502.11147","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-millions-of-lean-theorems-with","title":"Generating Millions Of Lean Theorems With Proofs By Exploring State Transition Graphs","date":"2025-02-16","arxiv_id":"2503.04772","repositories_listed":0,"syntology":null},{"url":null,"slug":"automating-mathematical-proof-generation","title":"Automating Mathematical Proof Generation Using Large Language Model Agents and Knowledge Graphs","date":"2025-02-04","arxiv_id":"2503.11657","repositories_listed":0,"syntology":null},{"url":null,"slug":"lemmahead-rag-assisted-proof-generation-using","title":"LemmaHead: RAG Assisted Proof Generation Using Large Language Models","date":"2025-01-27","arxiv_id":"2501.15797","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-proofs-of-the-summation-and","title":"Simple Proofs of the Summation and Connectivity Theorems in Metabolic Control Analysis","date":"2025-01-21","arxiv_id":"2501.12519","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-convex-optimization-layers-in","title":"Differentiable Convex Optimization Layers in Neural Architectures: Foundations and Perspectives","date":"2024-12-30","arxiv_id":"2412.20679","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-language-knowledge-corpus-for","title":"Formal Language Knowledge Corpus for Retrieval Augmented Generation","date":"2024-12-21","arxiv_id":"2412.16689","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-analysis-can-teach-us-the-optimal-way-to","title":"How Analysis Can Teach Us the Optimal Way to Design Neural Operators","date":"2024-11-04","arxiv_id":"2411.01763","repositories_listed":0,"syntology":null},{"url":null,"slug":"gender-bias-of-llm-in-economics-an","title":"Gender Bias of LLM in Economics: An Existentialism Perspective","date":"2024-10-14","arxiv_id":"2410.19775","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithms-are-significantly","title":"Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It","date":"2024-08-31","arxiv_id":"2409.00306","repositories_listed":0,"syntology":null},{"url":null,"slug":"examining-the-impact-of-forcing-function","title":"Examining the impact of forcing function inputs on structural identifiability","date":"2024-07-03","arxiv_id":"2407.02771","repositories_listed":0,"syntology":null},{"url":null,"slug":"autograding-mathematical-induction-proofs","title":"Autograding Mathematical Induction Proofs with Natural Language Processing","date":"2024-06-11","arxiv_id":"2406.10268","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-deduction-systems-can-help-you-to-verify","title":"How Deduction Systems Can Help You To Verify Stability Properties","date":"2024-04-16","arxiv_id":"2404.10747","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semantic-search-engine-for-mathlib4","title":"A Semantic Search Engine for Mathlib4","date":"2024-03-20","arxiv_id":"2403.13310","repositories_listed":0,"syntology":null},{"url":null,"slug":"class-information-guided-reconstruction-for","title":"Class Information Guided Reconstruction for Automatic Modulation Open-Set Recognition","date":"2023-12-20","arxiv_id":"2312.13023","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-planning-techniques-for-elementary","title":"Automated Planning Techniques for Elementary Proofs in Abstract Algebra","date":"2023-12-11","arxiv_id":"2312.06490","repositories_listed":0,"syntology":null},{"url":null,"slug":"fastpart-over-parameterized-stochastic","title":"FastPart: Over-Parameterized Stochastic Gradient Descent for Sparse optimisation on Measures","date":"2023-12-10","arxiv_id":"2312.05993","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-understanding-of-math","title":"Large Language Models' Understanding of Math: Source Criticism and Extrapolation","date":"2023-11-12","arxiv_id":"2311.07618","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-the-conditions-for-indefinite","title":"Characterizing the Conditions for Indefinite Growth in Open Chemical Reaction Networks","date":"2023-10-12","arxiv_id":"2310.08345","repositories_listed":0,"syntology":null},{"url":null,"slug":"total-effect-test-may-erroneously-reject-so","title":"Total-effect Test May Erroneously Reject So-called \"Full\" or \"Complete\" Mediation","date":"2023-09-16","arxiv_id":"2309.08910","repositories_listed":0,"syntology":null},{"url":null,"slug":"anomaly-zones-for-uniformly-sampled-gene","title":"Anomaly zones for uniformly sampled gene trees under the gene duplication and loss model","date":"2023-09-04","arxiv_id":"2309.01663","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-data-analysis-method-for-big","title":"An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression","date":"2023-08-24","arxiv_id":"2308.12691","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithm-assisted-discovery-of-an-intrinsic","title":"Algorithm-assisted discovery of an intrinsic order among mathematical constants","date":"2023-08-22","arxiv_id":"2308.11829","repositories_listed":0,"syntology":null},{"url":null,"slug":"codecot-and-beyond-learning-to-program-and","title":"CodeCoT: Tackling Code Syntax Errors in CoT Reasoning for Code Generation","date":"2023-08-17","arxiv_id":"2308.08784","repositories_listed":0,"syntology":null},{"url":null,"slug":"smartdca-superiority","title":"SmartDCA superiority","date":"2023-08-09","arxiv_id":"2308.05200","repositories_listed":0,"syntology":null},{"url":null,"slug":"computation-with-sequences-in-the-brain","title":"Computation with Sequences in a Model of the Brain","date":"2023-06-06","arxiv_id":"2306.03812","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-uncertainty-analysis-of-the-data","title":"On the uncertainty analysis of the data-enabled physics-informed neural network for solving neutron diffusion eigenvalue problem","date":"2023-03-15","arxiv_id":"2303.08455","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-quasi-optimal-power-flow-of-flexible-dc","title":"Fast Quasi-Optimal Power Flow of Flexible DC Traction Power Systems","date":"2022-11-05","arxiv_id":"2211.02852","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-provably-secure-encrypted-control","title":"Towards Provably Secure Encrypted Control Using Homomorphic Encryption","date":"2022-10-17","arxiv_id":"2210.08849","repositories_listed":0,"syntology":null},{"url":null,"slug":"snlp-at-textgraphs-2022-shared-task","title":"SNLP at TextGraphs 2022 Shared Task: Unsupervised Natural Language Premise Selection in Mathematical Texts Using Sentence-MPNet","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-uncertainty-principle-of-neural","title":"On the uncertainty principle of neural networks","date":"2022-05-03","arxiv_id":"2205.01493","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-partial-credit-grading-of-proof","title":"Efficient Feedback and Partial Credit Grading for Proof Blocks Problems","date":"2022-04-08","arxiv_id":"2204.04196","repositories_listed":0,"syntology":null},{"url":null,"slug":"better-approximation-guarantees-for-the-nsga","title":"Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)","date":"2022-03-05","arxiv_id":"2203.02693","repositories_listed":0,"syntology":null},{"url":null,"slug":"black-scholes-option-pricing-revisited","title":"Black-Scholes-Merton Option Pricing Revisited: Did we Find a Fatal Flaw?","date":"2022-01-09","arxiv_id":"2202.05671","repositories_listed":0,"syntology":null},{"url":null,"slug":"combing-policy-evaluation-and-policy","title":"The $f$-Divergence Reinforcement Learning Framework","date":"2021-09-24","arxiv_id":"2109.11867","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-gans-with-gradient-penalty","title":"Wasserstein GANs with Gradient Penalty Compute Congested Transport","date":"2021-09-01","arxiv_id":"2109.00528","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-generalizing-monotonic","title":"Understanding and Generalizing Monotonic Proximity Graphs for Approximate Nearest Neighbor Search","date":"2021-07-27","arxiv_id":"2107.13052","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-computational-model-of-infant-learning-and","title":"A Computational Model of Infant Learning and Reasoning with Probabilities","date":"2021-06-30","arxiv_id":"2106.16059","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-swarm-variant-for-the-schrodinger-solver","title":"A Swarm Variant for the Schrödinger Solver","date":"2021-04-10","arxiv_id":"2104.04795","repositories_listed":0,"syntology":null},{"url":null,"slug":"bio-plausible-unsupervised-delay-learning-for","title":"Bio-plausible Unsupervised Delay Learning for Extracting Temporal Features in Spiking Neural Networks","date":"2020-11-18","arxiv_id":"2011.09380","repositories_listed":0,"syntology":null},{"url":null,"slug":"agi-agent-safety-by-iteratively-improving-the","title":"AGI Agent Safety by Iteratively Improving the Utility Function","date":"2020-07-10","arxiv_id":"2007.05411","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-functions-to-study-the-benefit-of","title":"Learning Functions to Study the Benefit of Multitask Learning","date":"2020-06-09","arxiv_id":"2006.05561","repositories_listed":0,"syntology":null},{"url":null,"slug":"critical-overview-of-privacy-preserving","title":"A Critical Overview of Privacy-Preserving Approaches for Collaborative Forecasting","date":"2020-04-20","arxiv_id":"2004.09612","repositories_listed":0,"syntology":null},{"url":null,"slug":"secure-multiparty-computations-in-floating","title":"Secure multiparty computations in floating-point arithmetic","date":"2020-01-09","arxiv_id":"2001.03192","repositories_listed":0,"syntology":null},{"url":null,"slug":"sat-solvers-and-computer-algebra-systems-a","title":"SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics","date":"2019-07-09","arxiv_id":"1907.04408","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-constraint-satisfaction-problems-with","title":"Solving constraint-satisfaction problems with distributed neocortical-like neuronal networks","date":"2018-01-14","arxiv_id":"1801.04515","repositories_listed":0,"syntology":null},{"url":null,"slug":"interleaver-design-for-deep-neural-networks","title":"Interleaver Design for Deep Neural Networks","date":"2017-11-18","arxiv_id":"1711.06935","repositories_listed":0,"syntology":null},{"url":null,"slug":"investor-s-sentiment-in-multi-agent-model-of","title":"Investor's sentiment in multi-agent model of the continuous double auction","date":"2016-02-17","arxiv_id":"1208.3083","repositories_listed":0,"syntology":null}],"syntology_records":4,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/task/mathematical-proofs/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/mathematical-proofs/papers/ran/1","json":"/task/mathematical-proofs/papers/ran/1.json","rows":4}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"ea07e6327a4764ba9f0a737bf3ec0cfb7073d86e301c615178e7b3f562f7ee62","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}