{"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":"/code/solver","entry":"Solver","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":10,"n_samples_ran":6,"n_samples_constructed":5,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":4},"key_notes":{"n_samples_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_samples_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)"},"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":"2605.23414","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23414","title":"When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"wzhSteve/EPC-AW","path":"MAS/epc_aw/solver.py","file_url":"https://github.com/wzhSteve/EPC-AW/blob/HEAD/MAS/epc_aw/solver.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wzhSteve/EPC-AW when it was checked","code_sha256":"b9f5b9aaa47e5aa8","code_sha256_prefix":"b9f5b9aaa47e5aa8","mcp_get_code":{"code_sha256":"b9f5b9aaa47e5aa8"}},{"arxiv_id":"2605.05330","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05330","title":"Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vislearn/libmpopt","path":"python/mpopt/mwis/solver.py","file_url":"https://github.com/vislearn/libmpopt/blob/HEAD/python/mpopt/mwis/solver.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf51804eb1997207","code_sha256_prefix":"bf51804eb1997207","mcp_get_code":{"code_sha256":"bf51804eb1997207"}},{"arxiv_id":"2511.04117","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-04117","title":"Tortoise and Hare Guidance: Accelerating Diffusion Model Inference with Multirate Integration","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"yhlee-add/THG","path":"solvers/ddim.py","file_url":"https://github.com/yhlee-add/THG/blob/HEAD/solvers/ddim.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yhlee-add/THG when it was checked","code_sha256":"e059f92a3f7185ac","code_sha256_prefix":"e059f92a3f7185ac","mcp_get_code":{"code_sha256":"e059f92a3f7185ac"}},{"arxiv_id":"2505.19820","arxiv_id_is_arxiv":true,"paper":"/paper/infocons-identifying-interpretable-critical","title":"InfoCons: Identifying Interpretable Critical Concepts in Point Clouds via Information Theory","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llffff/infocons-pc","path":"code/core/attention_bottleneck.py","file_url":"https://github.com/llffff/infocons-pc/blob/HEAD/code/core/attention_bottleneck.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, llffff/infocons-pc when it was checked","code_sha256":"1b8f5321259b5acc","code_sha256_prefix":"1b8f5321259b5acc","mcp_get_code":{"code_sha256":"1b8f5321259b5acc"}},{"arxiv_id":"2407.13766","arxiv_id_is_arxiv":true,"paper":"/paper/visual-haystacks-answering-harder-questions","title":"Visual Haystacks: A Vision-Centric Needle-In-A-Haystack Benchmark","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visual-haystacks/vhs_benchmark","path":"solvers/caption_aggregation_solver.py","file_url":"https://github.com/visual-haystacks/vhs_benchmark/blob/HEAD/solvers/caption_aggregation_solver.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aee4f4b7957bf3ec","code_sha256_prefix":"aee4f4b7957bf3ec","mcp_get_code":{"code_sha256":"aee4f4b7957bf3ec"}},{"arxiv_id":"2305.09645","arxiv_id_is_arxiv":true,"paper":"/paper/structgpt-a-general-framework-for-large","title":"StructGPT: A General Framework for Large Language Model to Reason over Structured Data","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUCAIBox/StructGPT","path":"structgpt_for_tableqa.py","file_url":"https://github.com/RUCAIBox/StructGPT/blob/HEAD/structgpt_for_tableqa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"930ccc93da2ca9ed","code_sha256_prefix":"930ccc93da2ca9ed","mcp_get_code":{"code_sha256":"930ccc93da2ca9ed"}},{"arxiv_id":"2210.15722","arxiv_id_is_arxiv":true,"paper":"/paper/patchrot-a-self-supervised-technique-for","title":"PatchRot: A Self-Supervised Technique for Training Vision Transformers","date":"2022-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-chh/patchrot","path":"solver_pretrain.py","file_url":"https://github.com/s-chh/patchrot/blob/HEAD/solver_pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"decc3f36ccf0b149","code_sha256_prefix":"decc3f36ccf0b149","mcp_get_code":{"code_sha256":"decc3f36ccf0b149"}},{"arxiv_id":"2201.07609","arxiv_id_is_arxiv":true,"paper":"/paper/a-confidence-based-iterative-solver-of-depths-1","title":"A Confidence-based Iterative Solver of Depths and Surface Normals for Deep Multi-view Stereo","date":"2022-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuzhaowang/idn-solver","path":"core/networks/solver.py","file_url":"https://github.com/thuzhaowang/idn-solver/blob/HEAD/core/networks/solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48ee9dbd9f84db8c","code_sha256_prefix":"48ee9dbd9f84db8c","mcp_get_code":{"code_sha256":"48ee9dbd9f84db8c"}},{"arxiv_id":"2110.11130","arxiv_id_is_arxiv":true,"paper":"/paper/inverse-optimal-control-adapted-to-the-noise","title":"Inverse Optimal Control Adapted to the Noise Characteristics of the Human Sensorimotor System","date":"2021-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rothkopflab/inverse-optimal-control","path":"ioc/methods/solvers.py","file_url":"https://github.com/rothkopflab/inverse-optimal-control/blob/HEAD/ioc/methods/solvers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, rothkopflab/inverse-optimal-control, is not in the permissive set Syntology serves inline","code_sha256":"c77baa3aef7b9fdd","code_sha256_prefix":"c77baa3aef7b9fdd","mcp_get_code":{"code_sha256":"c77baa3aef7b9fdd"}},{"arxiv_id":"2012.02661","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-semidefinite-programming-based-1","title":"Efficient semidefinite-programming-based inference for binary and multi-class MRFs","date":"2020-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/sdp_mrf","path":"sdp_mrf/solvers.py","file_url":"https://github.com/locuslab/sdp_mrf/blob/HEAD/sdp_mrf/solvers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29da6a3bf1666757","code_sha256_prefix":"29da6a3bf1666757","mcp_get_code":{"code_sha256":"29da6a3bf1666757"}}],"record_sha256":"0431e889a304b00d812d12e849fe11f7b719bde7705bd80a3d236cc681615c9a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}