{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/solve","entry":"solve","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":25,"n_papers_ran":6,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":25,"n_samples_ran":6,"n_samples_fingerprinted":2,"n_places":25,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":2,"ran":2,"unverified":19},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2609.02126","paper":"/paper/arxiv-2609-02126","title":"Scalable Bayesian Optimization of Composite Functions for Image-Based Inverse Problems in Materials Characterization","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"dasol-yoon/bott","path":"bott/optimization.py","file_url":"https://github.com/dasol-yoon/bott/blob/HEAD/bott/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7f9fa7c5ba518d1e","mcp_get_code":{"code_sha256":"7f9fa7c5ba518d1e"}},{"arxiv_id":"2606.11688","paper":"/paper/arxiv-2606-11688","title":"Goal-Autopilot: A Verifiable Anti-Fabrication Firewall for Unattended Long-Horizon Agents","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"EpistemicaLab/goal-compiled-autopilot","path":"bench/p1_corpus/bootstrap.py","file_url":"https://github.com/EpistemicaLab/goal-compiled-autopilot/blob/HEAD/bench/p1_corpus/bootstrap.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"31e93a1851209eb0","mcp_get_code":{"code_sha256":"31e93a1851209eb0"}},{"arxiv_id":"2506.08436","paper":"/paper/olica-efficient-structured-pruning-of-large","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bettertmrr/llm-olica","path":"model_pruning.py","file_url":"https://github.com/bettertmrr/llm-olica/blob/HEAD/model_pruning.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8d18b53fd9470446","mcp_get_code":{"code_sha256":"8d18b53fd9470446"}},{"arxiv_id":"2502.18273","paper":"/paper/beyond-in-distribution-success-scaling-curves","title":"Beyond In-Distribution Success: Scaling Curves of CoT Granularity for Language Model Generalization","date":"2025-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"physicsru/Scaling-Curves-of-CoT-Granularity-for-Language-Model-Generalization","path":"LIS/data.py","file_url":"https://github.com/physicsru/Scaling-Curves-of-CoT-Granularity-for-Language-Model-Generalization/blob/HEAD/LIS/data.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e6181fa93b6e7103","mcp_get_code":{"code_sha256":"e6181fa93b6e7103"}},{"arxiv_id":"2502.04043","paper":null,"title":"arXiv:2502.04043","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":null,"repo":"nguyenngocbaocmt02/EFI","path":"utils.py","file_url":"https://github.com/nguyenngocbaocmt02/EFI/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a56e7cc059c4da9f","mcp_get_code":{"code_sha256":"a56e7cc059c4da9f"}},{"arxiv_id":"2501.08603","paper":"/paper/monte-carlo-tree-search-for-comprehensive","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","date":"2025-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zz1358m/mcts-ahd-master","path":"problems/asp_constructive/eval-test.py","file_url":"https://github.com/zz1358m/mcts-ahd-master/blob/HEAD/problems/asp_constructive/eval-test.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"940f893bc7c2c6d2","mcp_get_code":{"code_sha256":"940f893bc7c2c6d2"}},{"arxiv_id":"2501.07018","paper":"/paper/pdlp-a-practical-first-order-method-for-large","title":"PDLP: A Practical First-Order Method for Large-Scale Linear Programming","date":null,"month_inferred_from_arxiv_id":"2025-01","title_source":"archive","repo":"mmaaz-git/pdlp","path":"pdlp.py","file_url":"https://github.com/mmaaz-git/pdlp/blob/HEAD/pdlp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"none","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d4ec6c6df72cb4b0","mcp_get_code":{"code_sha256":"d4ec6c6df72cb4b0"}},{"arxiv_id":"2407.13143","paper":"/paper/integrated-hardware-architecture-and-device","title":"Integrated Hardware Architecture and Device Placement Search","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"msr-fiddle/phaze","path":"Solver/solver.py","file_url":"https://github.com/msr-fiddle/phaze/blob/HEAD/Solver/solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48468011bfdc665a","mcp_get_code":{"code_sha256":"48468011bfdc665a"}},{"arxiv_id":"2406.15007","paper":"/paper/routefinder-towards-foundation-models-for","title":"RouteFinder: Towards Foundation Models for Vehicle Routing Problems","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4co/routefinder","path":"routefinder/baselines/solve.py","file_url":"https://github.com/ai4co/routefinder/blob/HEAD/routefinder/baselines/solve.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f64c7bc065a4c013","mcp_get_code":{"code_sha256":"f64c7bc065a4c013"}},{"arxiv_id":"2406.04472","paper":"/paper/on-the-hardness-of-probabilistic","title":"On the Hardness of Probabilistic Neurosymbolic Learning","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjcmoon/hardness-nesy","path":"scripts/run_approx_solver.py","file_url":"https://github.com/jjcmoon/hardness-nesy/blob/HEAD/scripts/run_approx_solver.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d3e18d956810d1a","mcp_get_code":{"code_sha256":"9d3e18d956810d1a"}},{"arxiv_id":"2312.05063","paper":"/paper/individualizing-glioma-radiotherapy-planning","title":"Individualizing Glioma Radiotherapy Planning by Optimization of Data and Physics-Informed Discrete Loss","date":null,"month_inferred_from_arxiv_id":"2023-12","title_source":"archive","repo":"m1balcerak/gliodil","path":"code/linsolver.py","file_url":"https://github.com/m1balcerak/gliodil/blob/HEAD/code/linsolver.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c69526301d326901","mcp_get_code":{"code_sha256":"c69526301d326901"}},{"arxiv_id":"2303.11730","paper":"/paper/abstract-visual-reasoning-an-algebraic","title":"Abstract Visual Reasoning: An Algebraic Approach for Solving Raven's Progressive Matrices","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xu-jingyi/algebraicmr","path":"m2interface.py","file_url":"https://github.com/xu-jingyi/algebraicmr/blob/HEAD/m2interface.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5414e759b363af0c","mcp_get_code":{"code_sha256":"5414e759b363af0c"}},{"arxiv_id":"2303.04679","paper":"/paper/flow-reconstruction-by-multiresolution","title":"Flow reconstruction by multiresolution optimization of a discrete loss with automatic differentiation","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"cselab/odil","path":"src/odil/linsolver.py","file_url":"https://github.com/cselab/odil/blob/HEAD/src/odil/linsolver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"98b02d0c221514de","mcp_get_code":{"code_sha256":"98b02d0c221514de"}},{"arxiv_id":"2301.13379","paper":"/paper/faithful-chain-of-thought-reasoning","title":"Faithful Chain-of-Thought Reasoning","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"veronica320/faithful-cot","path":"source/model/solver/CLUTRR/CLUTRR_solver.py","file_url":"https://github.com/veronica320/faithful-cot/blob/HEAD/source/model/solver/CLUTRR/CLUTRR_solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09e91d6ca5d39a6d","mcp_get_code":{"code_sha256":"09e91d6ca5d39a6d"}},{"arxiv_id":"2205.01240","paper":"/paper/using-constraint-programming-and-graph","title":"Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mikhail247/IAMAX","path":"src/iam_optimization_cp.py","file_url":"https://github.com/mikhail247/IAMAX/blob/HEAD/src/iam_optimization_cp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"adde8df688a11d8e","mcp_get_code":{"code_sha256":"adde8df688a11d8e"}},{"arxiv_id":"2111.01721","paper":"/paper/bayes-newton-methods-for-approximate-bayesian","title":"Bayes-Newton Methods for Approximate Bayesian Inference with PSD Guarantees","date":"2021-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AaltoML/BayesNewton","path":"bayesnewton/utils.py","file_url":"https://github.com/AaltoML/BayesNewton/blob/HEAD/bayesnewton/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d6b5c53748778f80","mcp_get_code":{"code_sha256":"d6b5c53748778f80"}},{"arxiv_id":"2104.03113","paper":"/paper/scaling-scaling-laws-with-board-games","title":"Scaling Scaling Laws with Board Games","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyljones/boardlaw","path":"boardlaw/elos.py","file_url":"https://github.com/andyljones/boardlaw/blob/HEAD/boardlaw/elos.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36de63ed4f7ee176","mcp_get_code":{"code_sha256":"36de63ed4f7ee176"}},{"arxiv_id":"2011.02082","paper":"/paper/deepreach-a-deep-learning-approach-to-high","title":"DeepReach: A Deep Learning Approach to High-Dimensional Reachability","date":"2020-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordasl/hj_reachability","path":"hj_reachability/solver.py","file_url":"https://github.com/stanfordasl/hj_reachability/blob/HEAD/hj_reachability/solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"332737e9b8783564","mcp_get_code":{"code_sha256":"332737e9b8783564"}},{"arxiv_id":"2009.09405","paper":"/paper/scale-localized-abstract-reasoning","title":"Scale-Localized Abstract Reasoning","date":"2020-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanivbenny/RAVEN_FAIR","path":"src/solver.py","file_url":"https://github.com/yanivbenny/RAVEN_FAIR/blob/HEAD/src/solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8c75f90a1932121","mcp_get_code":{"code_sha256":"b8c75f90a1932121"}},{"arxiv_id":"2007.05994","paper":"/paper/state-space-expectation-propagation-efficient","title":"State Space Expectation Propagation: Efficient Inference Schemes for Temporal Gaussian Processes","date":"2020-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AaltoML/kalman-jax","path":"kalmanjax/utils.py","file_url":"https://github.com/AaltoML/kalman-jax/blob/HEAD/kalmanjax/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"89e6795a9c2df510","mcp_get_code":{"code_sha256":"89e6795a9c2df510"}},{"arxiv_id":"2006.02250","paper":"/paper/dynonet-a-neural-network-architecture-for","title":"dynoNet: a neural network architecture for learning dynamical systems","date":"2020-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forgi86/rnn-adaptation","path":"worlds/worlds.py","file_url":"https://github.com/forgi86/rnn-adaptation/blob/HEAD/worlds/worlds.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e8cbe19b00bf520","mcp_get_code":{"code_sha256":"0e8cbe19b00bf520"}},{"arxiv_id":"2002.04803","paper":"/paper/machine-learning-in-python-main-developments","title":"Machine Learning in Python: Main developments and technology trends in data science, machine learning, and artificial intelligence","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielhanchen/hyperlearn","path":"__hyperlearn_archive/hyperlearn/solvers.py","file_url":"https://github.com/danielhanchen/hyperlearn/blob/HEAD/__hyperlearn_archive/hyperlearn/solvers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"98afce249f4bd06d","mcp_get_code":{"code_sha256":"98afce249f4bd06d"}},{"arxiv_id":"2001.00735","paper":"/paper/trajectory-forecasts-in-unknown-environments","title":"Trajectory Forecasts in Unknown Environments Conditioned on Grid-Based Plans","date":"2020-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nachiket92/P2T","path":"models/rl.py","file_url":"https://github.com/nachiket92/P2T/blob/HEAD/models/rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"acccec4f3a55e83b","mcp_get_code":{"code_sha256":"acccec4f3a55e83b"}},{"arxiv_id":"1811.06965","paper":"/paper/gpipe-efficient-training-of-giant-neural","title":"GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism","date":"2018-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KakaoBrain/torchgpipe","path":"torchgpipe/balance/blockpartition.py","file_url":"https://github.com/KakaoBrain/torchgpipe/blob/HEAD/torchgpipe/balance/blockpartition.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"d97c0eee80161ec7","mcp_get_code":{"code_sha256":"d97c0eee80161ec7"}},{"arxiv_id":"1808.03233","paper":"/paper/oboe-collaborative-filtering-for-automl","title":"OBOE: Collaborative Filtering for AutoML Model Selection","date":"2018-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"udellgroup/oboe","path":"oboe/experiment_design.py","file_url":"https://github.com/udellgroup/oboe/blob/HEAD/oboe/experiment_design.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"35a4536bc536046d","mcp_get_code":{"code_sha256":"35a4536bc536046d"}}]}