{"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/samples","entry":"samples","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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.24610","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24610","title":"Conditional GraphGANFed: Optimizing Graph-Structured Molecule Generation in Federated Generative Adversarial Networks","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"danielmanu93/Conditional-GraphGANFed","path":"utils.py","file_url":"https://github.com/danielmanu93/Conditional-GraphGANFed/blob/HEAD/utils.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, danielmanu93/Conditional-GraphGANFed when it was checked","code_sha256":"0eb9080e5f758c2f","code_sha256_prefix":"0eb9080e5f758c2f","mcp_get_code":{"code_sha256":"0eb9080e5f758c2f"}},{"arxiv_id":"2410.22322","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-posterior-samples-for-bayesian","title":"Optimizing Posterior Samples for Bayesian Optimization via Rootfinding","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UQUH/TSRoots","path":"src/tsroots/max_k_sum.py","file_url":"https://github.com/UQUH/TSRoots/blob/HEAD/src/tsroots/max_k_sum.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b31ec9b27f95e648","code_sha256_prefix":"b31ec9b27f95e648","mcp_get_code":{"code_sha256":"b31ec9b27f95e648"}},{"arxiv_id":"2310.06498","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-benchmark-and-reverse-validation-method","title":"A New Benchmark and Reverse Validation Method for Passage-level Hallucination Detection","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maybenotime/phd","path":"SelfCheckBERTScore/sample_PHD.py","file_url":"https://github.com/maybenotime/phd/blob/HEAD/SelfCheckBERTScore/sample_PHD.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, maybenotime/phd when it was checked","code_sha256":"0b65abd27e708564","code_sha256_prefix":"0b65abd27e708564","mcp_get_code":{"code_sha256":"0b65abd27e708564"}},{"arxiv_id":"1805.11973","arxiv_id_is_arxiv":true,"paper":"/paper/molgan-an-implicit-generative-model-for-small","title":"MolGAN: An implicit generative model for small molecular graphs","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicola-decao/MolGAN","path":"utils/utils.py","file_url":"https://github.com/nicola-decao/MolGAN/blob/HEAD/utils/utils.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":"e457edf9de530e0b","code_sha256_prefix":"e457edf9de530e0b","mcp_get_code":{"code_sha256":"e457edf9de530e0b"}},{"arxiv_id":"1512.00727","arxiv_id_is_arxiv":true,"paper":"/paper/tinylfu-a-highly-efficient-cache-admission","title":"TinyLFU: A Highly Efficient Cache Admission Policy","date":null,"month_inferred_from_arxiv_id":"2015-12","title_source":"archive","repo":"ben-manes/caffeine","path":".claude/skills/audit-regret/workload.py","file_url":"https://github.com/ben-manes/caffeine/blob/HEAD/.claude/skills/audit-regret/workload.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":"e4efc8ed9bc39e33","code_sha256_prefix":"e4efc8ed9bc39e33","mcp_get_code":{"code_sha256":"e4efc8ed9bc39e33"}}],"record_sha256":"3f60e8fbc514cf22de8786c21455eddd47a045bf0628219e313a5f1b360dd433","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}