{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/samples","entry":"samples","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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","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,"code_sha256_prefix":"0eb9080e5f758c2f","mcp_get_code":{"code_sha256":"0eb9080e5f758c2f"}},{"arxiv_id":"2410.22322","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b31ec9b27f95e648","mcp_get_code":{"code_sha256":"b31ec9b27f95e648"}},{"arxiv_id":"2310.06498","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,"code_sha256_prefix":"0b65abd27e708564","mcp_get_code":{"code_sha256":"0b65abd27e708564"}},{"arxiv_id":"1805.11973","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e457edf9de530e0b","mcp_get_code":{"code_sha256":"e457edf9de530e0b"}},{"arxiv_id":"1512.00727","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e4efc8ed9bc39e33","mcp_get_code":{"code_sha256":"e4efc8ed9bc39e33"}}]}