{"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/systematic-resample","entry":"systematic_resample","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":5,"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_fingerprinted":3,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":0},"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":"2609.12243","paper":"/paper/arxiv-2609-12243","title":"Chopthin-Consensus Power Sampling: A Diversity-Preserving Approach to LLM Decoding","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MinooAhmadii/chopthin-consensus-power-sampling","path":"ccps/smc.py","file_url":"https://github.com/MinooAhmadii/chopthin-consensus-power-sampling/blob/HEAD/ccps/smc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bbe0dd4540175572","mcp_get_code":{"code_sha256":"bbe0dd4540175572"}},{"arxiv_id":"2602.10273","paper":"/paper/arxiv-2602-10273","title":"Power-SMC: Low-Latency Sequence-Level Power Sampling for Training-Free LLM Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ArminAzizi98/Power-SMC","path":"smc_samp_utils.py","file_url":"https://github.com/ArminAzizi98/Power-SMC/blob/HEAD/smc_samp_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bbe0dd4540175572","mcp_get_code":{"code_sha256":"bbe0dd4540175572"}},{"arxiv_id":"2601.10403","paper":"/paper/arxiv-2601-10403","title":"Discrete Feynman-Kac Correctors","date":"2026-01-15","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"hasanmohsin/discrete_fkc","path":"fk_steering.py","file_url":"https://github.com/hasanmohsin/discrete_fkc/blob/HEAD/fk_steering.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"03df37a33ebd1d43","mcp_get_code":{"code_sha256":"03df37a33ebd1d43"}},{"arxiv_id":"2408.05834","paper":"/paper/divide-and-conquer-predictive-coding-a","title":"Divide-and-Conquer Predictive Coding: a structured Bayesian inference algorithm","date":"2024-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"esennesh/dcpc_paper","path":"model/inference.py","file_url":"https://github.com/esennesh/dcpc_paper/blob/HEAD/model/inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7cf7761f7f1af544","mcp_get_code":{"code_sha256":"7cf7761f7f1af544"}},{"arxiv_id":"2402.06025","paper":"/paper/doing-experiments-and-revising-rules-with","title":"Doing Experiments and Revising Rules with Natural Language and Probabilistic Reasoning","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"topwasu/doing-experiments-and-revising-rules","path":"agents/zendo/utils.py","file_url":"https://github.com/topwasu/doing-experiments-and-revising-rules/blob/HEAD/agents/zendo/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fa5fb4014bc9ea5b","mcp_get_code":{"code_sha256":"fa5fb4014bc9ea5b"}}]}