{"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/bold","entry":"bold","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":6,"n_places_pointer_only":1,"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":0,"ran":4,"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":"2608.25158","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-25158","title":"FuzzingBrain-Bench V1: Evaluating Open-Ended Bug Discovery by LLMs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"fuzzingbrain/FuzzingBrain-Bench","path":"fbbench/cli/console.py","file_url":"https://github.com/fuzzingbrain/FuzzingBrain-Bench/blob/HEAD/fbbench/cli/console.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1370e9f752f5f705","code_sha256_prefix":"1370e9f752f5f705","mcp_get_code":{"code_sha256":"1370e9f752f5f705"}},{"arxiv_id":"2310.04870","arxiv_id_is_arxiv":true,"paper":"/paper/lemur-integrating-large-language-models-in","title":"Lemur: Integrating Large Language Models in Automated Program Verification","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wu-haoze/lemur-program-verification","path":"lemur/src/verifier.py","file_url":"https://github.com/wu-haoze/lemur-program-verification/blob/HEAD/lemur/src/verifier.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, wu-haoze/lemur-program-verification when it was checked","code_sha256":"6f6936ea16671f21","code_sha256_prefix":"6f6936ea16671f21","mcp_get_code":{"code_sha256":"6f6936ea16671f21"}},{"arxiv_id":"2204.10555","arxiv_id_is_arxiv":true,"paper":"/paper/kala-knowledge-augmented-language-model-1","title":"KALA: Knowledge-Augmented Language Model Adaptation","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rusty1s/pytorch_scatter","path":"benchmark/scatter_segment.py","file_url":"https://github.com/rusty1s/pytorch_scatter/blob/HEAD/benchmark/scatter_segment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3c87119122db68e","code_sha256_prefix":"b3c87119122db68e","mcp_get_code":{"code_sha256":"b3c87119122db68e"}},{"arxiv_id":"2111.12062","arxiv_id_is_arxiv":true,"paper":"/paper/dabs-a-domain-agnostic-benchmark-for-self","title":"DABS: A Domain-Agnostic Benchmark for Self-Supervised Learning","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alextamkin/dabs","path":"info.py","file_url":"https://github.com/alextamkin/dabs/blob/HEAD/info.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"868479bfba131747","code_sha256_prefix":"868479bfba131747","mcp_get_code":{"code_sha256":"868479bfba131747"}},{"arxiv_id":"2110.14270","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-shapley-additive-explanations","title":"Counterfactual Shapley Additive Explanations","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jpmorganchase/cf-shap-facct22","path":"emutils/latex.py","file_url":"https://github.com/jpmorganchase/cf-shap-facct22/blob/HEAD/emutils/latex.py","status":"ran","verification_level":1,"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":"256d8ce6c60ecba3","code_sha256_prefix":"256d8ce6c60ecba3","mcp_get_code":{"code_sha256":"256d8ce6c60ecba3"}},{"arxiv_id":"1907.03950","arxiv_id_is_arxiv":true,"paper":"/paper/learning-by-abstraction-the-neural-state","title":"Learning by Abstraction: The Neural State Machine","date":"2019-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordnlp/mac-network","path":"preprocess.py","file_url":"https://github.com/stanfordnlp/mac-network/blob/HEAD/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c7aaed4c145f580","code_sha256_prefix":"0c7aaed4c145f580","mcp_get_code":{"code_sha256":"0c7aaed4c145f580"}}],"record_sha256":"283c0f55a8fcec6bc20044f4557247ee405cfc6ec50fac721bd81717a4d8e92d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}