Home › Code › solve

solve

Syntologyentry name in harvested coderead from the graph 2026-09-24

solve appears in the code Syntology harvested for 25 papers, as 25 distinct code bodies found in 25 places (a place is one code body under one paper). At least one of them ran in 6 of the papers; 2 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named solve do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 6 of the 25 distinct code bodies named solve; 19 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
2ran · our draft was wrong
2ran · fixture could not drive it
2ran
19unverified
2fingerprinted

Licence is a property of each copy, so it is counted per place: 7 of the 25 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

25 papers shown of 25, newest first; 25 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology; 1 papers have no page here and are shown by arXiv id only. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Scalable Bayesian Optimization of Composite Functions for Image-Based Inverse Problems in Materials Characterization added by Syntology 2026-09 (from id) dasol-yoon/bott/bott/optimization.py 7f9fa7c5ba518d1e unverified no licence file found · pointer only
Goal-Autopilot: A Verifiable Anti-Fabrication Firewall for Unattended Long-Horizon Agents added by Syntology 2026-06 (from id) EpistemicaLab/goal-compiled-autopilot/bench/p1_corpus/bootstrap.py 31e93a1851209eb0 ran fingerprinted licence not identified · pointer only
Olica: Efficient Structured Pruning of Large Language Models without Retraining 10 Jun 2025 bettertmrr/llm-olica/model_pruning.py 8d18b53fd9470446 ran · our draft was wrong no licence file found · pointer only
Beyond In-Distribution Success: Scaling Curves of CoT Granularity for Language Model Generalization 25 Feb 2025 physicsru/Scaling-Curves-of-CoT-Granularity-for-Language-Model-Generalization/LIS/data.py e6181fa93b6e7103 ran · fixture could not drive it no licence file found · pointer only
arXiv:2502.04043 2025-02 (from id) nguyenngocbaocmt02/EFI/utils.py a56e7cc059c4da9f unverified MIT (permissive)
Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design 15 Jan 2025 zz1358m/mcts-ahd-master/problems/asp_constructive/eval-test.py 940f893bc7c2c6d2 unverified MIT (permissive)
PDLP: A Practical First-Order Method for Large-Scale Linear Programming 2025-01 (from id) mmaaz-git/pdlp/pdlp.py d4ec6c6df72cb4b0 ran · fixture could not drive it fingerprinted no licence file found · pointer only
Integrated Hardware Architecture and Device Placement Search 18 Jul 2024 msr-fiddle/phaze/Solver/solver.py 48468011bfdc665a unverified MIT (permissive)
RouteFinder: Towards Foundation Models for Vehicle Routing Problems 21 Jun 2024 ai4co/routefinder/routefinder/baselines/solve.py f64c7bc065a4c013 unverified MIT (permissive)
On the Hardness of Probabilistic Neurosymbolic Learning 6 Jun 2024 jjcmoon/hardness-nesy/scripts/run_approx_solver.py 9d3e18d956810d1a ran · our draft was wrong MIT (permissive)
Individualizing Glioma Radiotherapy Planning by Optimization of Data and Physics-Informed Discrete Loss 2023-12 (from id) m1balcerak/gliodil/code/linsolver.py c69526301d326901 ran MIT (permissive)
Abstract Visual Reasoning: An Algebraic Approach for Solving Raven's Progressive Matrices 21 Mar 2023 xu-jingyi/algebraicmr/m2interface.py 5414e759b363af0c unverified no licence file found · pointer only
Flow reconstruction by multiresolution optimization of a discrete loss with automatic differentiation 2023-03 (from id) cselab/odil/src/odil/linsolver.py 98b02d0c221514de unverified MIT (permissive)
Faithful Chain-of-Thought Reasoning 31 Jan 2023 veronica320/faithful-cot/source/model/solver/CLUTRR/CLUTRR_solver.py 09e91d6ca5d39a6d unverified MIT (permissive)
Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies 2 May 2022 mikhail247/IAMAX/src/iam_optimization_cp.py adde8df688a11d8e unverified no licence file found · pointer only
Bayes-Newton Methods for Approximate Bayesian Inference with PSD Guarantees 2 Nov 2021 AaltoML/BayesNewton/bayesnewton/utils.py d6b5c53748778f80 unverified Apache-2.0 (permissive)
Scaling Scaling Laws with Board Games 7 Apr 2021 andyljones/boardlaw/boardlaw/elos.py 36de63ed4f7ee176 unverified MIT (permissive)
DeepReach: A Deep Learning Approach to High-Dimensional Reachability 4 Nov 2020 stanfordasl/hj_reachability/hj_reachability/solver.py 332737e9b8783564 unverified MIT (permissive)
Scale-Localized Abstract Reasoning 20 Sep 2020 yanivbenny/RAVEN_FAIR/src/solver.py b8c75f90a1932121 unverified MIT (permissive)
State Space Expectation Propagation: Efficient Inference Schemes for Temporal Gaussian Processes 12 Jul 2020 AaltoML/kalman-jax/kalmanjax/utils.py 89e6795a9c2df510 unverified Apache-2.0 (permissive)
dynoNet: a neural network architecture for learning dynamical systems 3 Jun 2020 forgi86/rnn-adaptation/worlds/worlds.py 0e8cbe19b00bf520 unverified MIT (permissive)
Machine Learning in Python: Main developments and technology trends in data science, machine learning, and artificial intelligence 12 Feb 2020 danielhanchen/hyperlearn/__hyperlearn_archive/hyperlearn/solvers.py 98afce249f4bd06d unverified Apache-2.0 (permissive)
Trajectory Forecasts in Unknown Environments Conditioned on Grid-Based Plans 3 Jan 2020 nachiket92/P2T/models/rl.py acccec4f3a55e83b unverified MIT (permissive)
GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism 16 Nov 2018 KakaoBrain/torchgpipe/torchgpipe/balance/blockpartition.py d97c0eee80161ec7 unverified BSD-3-Clause (permissive)
OBOE: Collaborative Filtering for AutoML Model Selection 9 Aug 2018 udellgroup/oboe/oboe/experiment_design.py 35a4536bc536046d unverified BSD-3-Clause (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections