{"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/parse-dict","entry":"parse_dict","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":7,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":2,"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":7,"ran_fixture":0,"ran":0,"unverified":0},"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.03802","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-03802","title":"Towards accurate extreme event likelihoods from diffusion model climate emulators","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"NVlabs/cBottle","path":"src/cbottle/dataclass_parser.py","file_url":"https://github.com/NVlabs/cBottle/blob/HEAD/src/cbottle/dataclass_parser.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90d4aeed31657046","code_sha256_prefix":"90d4aeed31657046","mcp_get_code":{"code_sha256":"90d4aeed31657046"}},{"arxiv_id":"2410.23042","arxiv_id_is_arxiv":true,"paper":"/paper/toward-understanding-in-context-vs-in-weight","title":"Toward Understanding In-context vs. In-weight Learning","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chanb/icl_vs_iwl","path":"src/utils.py","file_url":"https://github.com/chanb/icl_vs_iwl/blob/HEAD/src/utils.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, chanb/icl_vs_iwl when it was checked","code_sha256":"4f481719630f7b96","code_sha256_prefix":"4f481719630f7b96","mcp_get_code":{"code_sha256":"4f481719630f7b96"}},{"arxiv_id":"2410.19546","arxiv_id_is_arxiv":true,"paper":"/paper/bongard-in-wonderland-visual-puzzles-that","title":"Bongard in Wonderland: Visual Puzzles that Still Make AI Go Mad?","date":"2024-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/bongard-in-wonderland","path":"experiments/evaluate/bp_llm_judge.py","file_url":"https://github.com/ml-research/bongard-in-wonderland/blob/HEAD/experiments/evaluate/bp_llm_judge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ml-research/bongard-in-wonderland when it was checked","code_sha256":"f3d7664734bd8f19","code_sha256_prefix":"f3d7664734bd8f19","mcp_get_code":{"code_sha256":"f3d7664734bd8f19"}},{"arxiv_id":"2410.19546","arxiv_id_is_arxiv":true,"paper":"/paper/bongard-in-wonderland-visual-puzzles-that","title":"Bongard in Wonderland: Visual Puzzles that Still Make AI Go Mad?","date":"2024-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/bongard-in-wonderland","path":"experiments/evaluate/bp_llm_judge_human.py","file_url":"https://github.com/ml-research/bongard-in-wonderland/blob/HEAD/experiments/evaluate/bp_llm_judge_human.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ml-research/bongard-in-wonderland when it was checked","code_sha256":"24725c4738f9931e","code_sha256_prefix":"24725c4738f9931e","mcp_get_code":{"code_sha256":"24725c4738f9931e"}},{"arxiv_id":"2402.10193","arxiv_id_is_arxiv":true,"paper":"/paper/bitdelta-your-fine-tune-may-only-be-worth-one","title":"BitDelta: Your Fine-Tune May Only Be Worth One Bit","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FasterDecoding/BitDelta","path":"bitdelta/utils.py","file_url":"https://github.com/FasterDecoding/BitDelta/blob/HEAD/bitdelta/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c85ef5aa3bf5041e","code_sha256_prefix":"c85ef5aa3bf5041e","mcp_get_code":{"code_sha256":"c85ef5aa3bf5041e"}},{"arxiv_id":"2312.16983","arxiv_id_is_arxiv":true,"paper":"/paper/pg-lbo-enhancing-high-dimensional-bayesian","title":"PG-LBO: Enhancing High-Dimensional Bayesian Optimization with Pseudo-Label and Gaussian Process Guidance","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taicaichen/pg-lbo","path":"utils/utils_cmd.py","file_url":"https://github.com/taicaichen/pg-lbo/blob/HEAD/utils/utils_cmd.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":"721ea6828e17a8cb","code_sha256_prefix":"721ea6828e17a8cb","mcp_get_code":{"code_sha256":"721ea6828e17a8cb"}},{"arxiv_id":"1805.10196","arxiv_id_is_arxiv":true,"paper":"/paper/maximizing-acquisition-functions-for-bayesian","title":"Maximizing acquisition functions for Bayesian optimization","date":"2018-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"j-wilson/MaximizingAcquisitionFunctions","path":"scripts/run_bayesopt.py","file_url":"https://github.com/j-wilson/MaximizingAcquisitionFunctions/blob/HEAD/scripts/run_bayesopt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, j-wilson/MaximizingAcquisitionFunctions when it was checked","code_sha256":"f48d7d12ddf12647","code_sha256_prefix":"f48d7d12ddf12647","mcp_get_code":{"code_sha256":"f48d7d12ddf12647"}},{"arxiv_id":"aaai_29018","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29018","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TaicaiChen/PG-LBO","path":"utils/utils_cmd.py","file_url":"https://github.com/TaicaiChen/PG-LBO/blob/HEAD/utils/utils_cmd.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":"721ea6828e17a8cb","code_sha256_prefix":"721ea6828e17a8cb","mcp_get_code":{"code_sha256":"721ea6828e17a8cb"}}],"record_sha256":"cfca7547b11e43c107211ff2b569e49c89c6f10fd73fc458c6e094212cecb778","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}