{"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/green","entry":"green","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":8,"n_papers_ran_no_instrument_failure":6,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":0,"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":2,"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":"e5eb532b2f8c9e32","code_sha256_prefix":"e5eb532b2f8c9e32","mcp_get_code":{"code_sha256":"e5eb532b2f8c9e32"}},{"arxiv_id":"2605.22898","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22898","title":"FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hedjrachid/FIRMA","path":"fibfl/fibfl.py","file_url":"https://github.com/Hedjrachid/FIRMA/blob/HEAD/fibfl/fibfl.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":"c6ff25372e8ba15a","code_sha256_prefix":"c6ff25372e8ba15a","mcp_get_code":{"code_sha256":"c6ff25372e8ba15a"}},{"arxiv_id":"2310.00108","arxiv_id_is_arxiv":true,"paper":"/paper/practical-membership-inference-attacks-1","title":"Practical Membership Inference Attacks Against Large-Scale Multi-Modal Models: A Pilot Study","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruoxi-jia-group/clip-mia","path":"util.py","file_url":"https://github.com/ruoxi-jia-group/clip-mia/blob/HEAD/util.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":"6c22ac743d271a9e","code_sha256_prefix":"6c22ac743d271a9e","mcp_get_code":{"code_sha256":"6c22ac743d271a9e"}},{"arxiv_id":"2303.01751","arxiv_id_is_arxiv":true,"paper":"/paper/deep-momentum-multi-marginal-schrodinger","title":"Deep Momentum Multi-Marginal Schrödinger Bridge","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianrongChen/DMSB","path":"util.py","file_url":"https://github.com/TianrongChen/DMSB/blob/HEAD/util.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":"6c22ac743d271a9e","code_sha256_prefix":"6c22ac743d271a9e","mcp_get_code":{"code_sha256":"6c22ac743d271a9e"}},{"arxiv_id":"2110.11291","arxiv_id_is_arxiv":true,"paper":"/paper/likelihood-training-of-schrodinger-bridge-1","title":"Likelihood Training of Schrödinger Bridge using Forward-Backward SDEs Theory","date":"2021-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghliu/sb-fbsde","path":"util.py","file_url":"https://github.com/ghliu/sb-fbsde/blob/HEAD/util.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":"6c22ac743d271a9e","code_sha256_prefix":"6c22ac743d271a9e","mcp_get_code":{"code_sha256":"6c22ac743d271a9e"}},{"arxiv_id":"2104.06405","arxiv_id_is_arxiv":true,"paper":"/paper/barf-bundle-adjusting-neural-radiance-fields","title":"BARF: Bundle-Adjusting Neural Radiance Fields","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/bundle-adjusting-NeRF","path":"util.py","file_url":"https://github.com/chenhsuanlin/bundle-adjusting-NeRF/blob/HEAD/util.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":"a84f43afe520c054","code_sha256_prefix":"a84f43afe520c054","mcp_get_code":{"code_sha256":"a84f43afe520c054"}},{"arxiv_id":"2010.10505","arxiv_id_is_arxiv":true,"paper":"/paper/sdf-srn-learning-signed-distance-3d-object","title":"SDF-SRN: Learning Signed Distance 3D Object Reconstruction from Static Images","date":"2020-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/signed-distance-SRN","path":"util.py","file_url":"https://github.com/chenhsuanlin/signed-distance-SRN/blob/HEAD/util.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":"a84f43afe520c054","code_sha256_prefix":"a84f43afe520c054","mcp_get_code":{"code_sha256":"a84f43afe520c054"}},{"arxiv_id":"1903.08642","arxiv_id_is_arxiv":true,"paper":"/paper/photometric-mesh-optimization-for-video","title":"Photometric Mesh Optimization for Video-Aligned 3D Object Reconstruction","date":"2019-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/photometric-mesh-optim","path":"util.py","file_url":"https://github.com/chenhsuanlin/photometric-mesh-optim/blob/HEAD/util.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":"6c22ac743d271a9e","code_sha256_prefix":"6c22ac743d271a9e","mcp_get_code":{"code_sha256":"6c22ac743d271a9e"}}],"record_sha256":"0d20b4c906185bc86d071c73c9aea3157a897008f5284706ba616c820e5e2ba2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}