Home › Code › get_solver

get_solver

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

get_solver appears in the code Syntology harvested for 10 papers, as 5 distinct code bodies found in 10 places (a place is one code body under one paper). At least one of them ran in 0 of the papers; 0 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 get_solver 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 0 of the 5 distinct code bodies named get_solver; 5 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

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

Licence is a property of each copy, so it is counted per place: 4 of the 10 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

10 papers shown of 10, newest first; 10 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 4 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
BOCoDe: Engineering-Centered Benchmarking for Bayesian Optimization added by Syntology 2026-08 (from id) yunshengtian/DGEMO/mobo/factory.py 642bd668f157ee74 unverified MIT (permissive)
A Stability Benchmark of Generative Regularizers for Inverse Problems added by Syntology 2026-05 (from id) alexdenker/GenRegBench/reconstruction_methods/flow_dps.py 4f078fd69624c31f unverified no licence file found · pointer only
Measurement-Consistent Langevin Corrector for Stabilizing Latent Diffusion Inverse Problem Solvers added by Syntology 2026-01 (from id) FlowDPS-Inverse/FlowDPS/sd3_sampler.py 4f078fd69624c31f unverified no licence file found · pointer only
MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions added by Syntology 2025-10 (from id) Alaleh/PDBO/mobo/factory.py 545970a789de193c unverified no licence file found · pointer only
Minority-Focused Text-to-Image Generation via Prompt Optimization 10 Oct 2024 anonymous5293/minorityprompt/latent_diffusion.py 4f078fd69624c31f unverified MIT (permissive)
Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization 13 Jun 2024 alaleh/pdbo/mobo/factory.py 545970a789de193c unverified no licence file found · pointer only
Treeffuser: Probabilistic Predictions via Conditional Diffusions with Gradient-Boosted Trees 11 Jun 2024 blei-lab/treeffuser/src/treeffuser/sde/base_solver.py c8646bb45df3df0e unverified MIT (permissive)
Pareto Set Learning for Expensive Multi-Objective Optimization 16 Oct 2022 xi-l/psl-mobo/mobo/factory.py 642bd668f157ee74 unverified MIT (permissive)
Active Domain Adaptation via Clustering Uncertainty-weighted Embeddings 16 Oct 2020 virajprabhu/clue/adapt/solvers/solver.py 6a049409bc8f279e unverified MIT (permissive)
arXiv:Prabhu_Active_Domain_Adaptation_via_Clustering_Uncertainty-Weighted_Embeddings_ICCV_2021_paper virajprabhu/CLUE/adapt/solvers/solver.py 6a049409bc8f279e unverified MIT (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