{"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/get-problem","entry":"get_problem","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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"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":2,"ran_fixture":1,"ran":1,"unverified":3},"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":"2608.15073","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-15073","title":"BOCoDe: Engineering-Centered Benchmarking for Bayesian Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rosenyu304/BOCoDe","path":"bocode/registry.py","file_url":"https://github.com/rosenyu304/BOCoDe/blob/HEAD/bocode/registry.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":"7f110d1d19300815","code_sha256_prefix":"7f110d1d19300815","mcp_get_code":{"code_sha256":"7f110d1d19300815"}},{"arxiv_id":"2606.02909","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02909","title":"Scalable Derivative Gaussian Processes via Exact Gradient Reduction","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"hseung88/tera","path":"src/bo_experiments/benchmarks.py","file_url":"https://github.com/hseung88/tera/blob/HEAD/src/bo_experiments/benchmarks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ab4d3e86172d1ea","code_sha256_prefix":"2ab4d3e86172d1ea","mcp_get_code":{"code_sha256":"2ab4d3e86172d1ea"}},{"arxiv_id":"2408.11743","arxiv_id_is_arxiv":true,"paper":"/paper/marlin-mixed-precision-auto-regressive","title":"MARLIN: Mixed-Precision Auto-Regressive Parallel Inference on Large Language Models","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/sparse-marlin","path":"bench_2_4.py","file_url":"https://github.com/ist-daslab/sparse-marlin/blob/HEAD/bench_2_4.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7243559c0e01f359","code_sha256_prefix":"7243559c0e01f359","mcp_get_code":{"code_sha256":"7243559c0e01f359"}},{"arxiv_id":"2405.14854","arxiv_id_is_arxiv":true,"paper":"/paper/terdit-ternary-diffusion-models-with","title":"TerDiT: Ternary Diffusion Models with Transformers","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lucky-Lance/TerDiT","path":"fairscale/benchmarks/oss.py","file_url":"https://github.com/Lucky-Lance/TerDiT/blob/HEAD/fairscale/benchmarks/oss.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":"d457115aa40f2a97","code_sha256_prefix":"d457115aa40f2a97","mcp_get_code":{"code_sha256":"d457115aa40f2a97"}},{"arxiv_id":"2402.11443","arxiv_id_is_arxiv":true,"paper":"/paper/benchmark-self-evolving-a-multi-agent","title":"Benchmark Self-Evolving: A Multi-Agent Framework for Dynamic LLM Evaluation","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nanshineloong/self-evolving-benchmark","path":"gen_dataset.py","file_url":"https://github.com/nanshineloong/self-evolving-benchmark/blob/HEAD/gen_dataset.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, nanshineloong/self-evolving-benchmark when it was checked","code_sha256":"77f7f2e99f715477","code_sha256_prefix":"77f7f2e99f715477","mcp_get_code":{"code_sha256":"77f7f2e99f715477"}},{"arxiv_id":"2104.11667","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-and-flexible-deep-bayesian","title":"Deep Learning for Bayesian Optimization of Scientific Problems with High-Dimensional Structure","date":"2021-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelkim314/DeepBO","path":"opt_scatter.py","file_url":"https://github.com/samuelkim314/DeepBO/blob/HEAD/opt_scatter.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, samuelkim314/DeepBO when it was checked","code_sha256":"8084772e161bccc4","code_sha256_prefix":"8084772e161bccc4","mcp_get_code":{"code_sha256":"8084772e161bccc4"}},{"arxiv_id":"1706.01338","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-learned-iterative-soft","title":"Understanding the Learned Iterative Soft Thresholding Algorithm with matrix factorization","date":"2017-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomMoral/AdaptiveOptim","path":"NIPS_figures.py","file_url":"https://github.com/tomMoral/AdaptiveOptim/blob/HEAD/NIPS_figures.py","status":"unverified","verification_level":0,"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, tomMoral/AdaptiveOptim when it was checked","code_sha256":"d8eb74aaf0c1af20","code_sha256_prefix":"d8eb74aaf0c1af20","mcp_get_code":{"code_sha256":"d8eb74aaf0c1af20"}},{"arxiv_id":"1609.00285","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-trainable-sparse-coding-via","title":"Understanding Trainable Sparse Coding via Matrix Factorization","date":"2016-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d8eb74aaf0c1af20","code_sha256_prefix":"d8eb74aaf0c1af20","mcp_get_code":{"code_sha256":"d8eb74aaf0c1af20"}}],"record_sha256":"0063d2603b5336613e0774f499d22e9e1abe5e2edd4bb3ddbd9fdce00f6cfeb8","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}