{"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/likelihood","entry":"likelihood","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":3,"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":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":2},"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":"2312.00761","paper":"/paper/deep-unlearning-fast-and-efficient-training","title":"Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangamesh-kodge/class_forgetting","path":"analysis/interclass_confusion.py","file_url":"https://github.com/sangamesh-kodge/class_forgetting/blob/HEAD/analysis/interclass_confusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"223cc02f83103318","mcp_get_code":{"code_sha256":"223cc02f83103318"}},{"arxiv_id":"2210.16774","paper":"/paper/dataset-distillation-via-factorization","title":"Dataset Distillation via Factorization","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huage001/datasetfactorization","path":"contrastive_loss.py","file_url":"https://github.com/huage001/datasetfactorization/blob/HEAD/contrastive_loss.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":"063c36a0255c1823","mcp_get_code":{"code_sha256":"063c36a0255c1823"}},{"arxiv_id":"2001.04761","paper":"/paper/adversarial-disentanglement-with-grouped","title":"Adversarial Disentanglement with Grouped Observations","date":"2020-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jonemeth/aaai20","path":"src/Model.py","file_url":"https://github.com/jonemeth/aaai20/blob/HEAD/src/Model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a0d399021922a47","mcp_get_code":{"code_sha256":"4a0d399021922a47"}},{"arxiv_id":"1506.00171","paper":"/paper/polychord-next-generation-nested-sampling","title":"PolyChord: next-generation nested sampling","date":null,"month_inferred_from_arxiv_id":"2015-06","title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"7c1f7135d16b8ae0","mcp_get_code":{"code_sha256":"7c1f7135d16b8ae0"}},{"arxiv_id":"1502.01856","paper":"/paper/polychord-nested-sampling-for-cosmology","title":"PolyChord: nested sampling for cosmology","date":null,"month_inferred_from_arxiv_id":"2015-02","title_source":"archive","repo":"PolyChord/PolyChordLite","path":"quickstart.py","file_url":"https://github.com/PolyChord/PolyChordLite/blob/HEAD/quickstart.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"7c1f7135d16b8ae0","mcp_get_code":{"code_sha256":"7c1f7135d16b8ae0"}}]}