{"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/label","entry":"label","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":6,"n_papers_ran":4,"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":7,"n_samples_ran":5,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"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":"2607.26648","paper":"/paper/arxiv-2607-26648","title":"The Sparsity Ceiling: Where Spiking Networks Canand Cannot-Trade Activity for Energy","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"zeyuyuyu/sparsity-ceiling","path":"agg_stream.py","file_url":"https://github.com/zeyuyuyu/sparsity-ceiling/blob/HEAD/agg_stream.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec060dce8d9f07c6","mcp_get_code":{"code_sha256":"ec060dce8d9f07c6"}},{"arxiv_id":"2607.26648","paper":"/paper/arxiv-2607-26648","title":"The Sparsity Ceiling: Where Spiking Networks Canand Cannot-Trade Activity for Energy","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"zeyuyuyu/sparsity-ceiling","path":"energy_datapath.py","file_url":"https://github.com/zeyuyuyu/sparsity-ceiling/blob/HEAD/energy_datapath.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ae8400477d5a6dce","mcp_get_code":{"code_sha256":"ae8400477d5a6dce"}},{"arxiv_id":"2502.12018","paper":"/paper/atom-of-thoughts-for-markov-llm-test-time","title":"Atom of Thoughts for Markov LLM Test-Time Scaling","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qixucen/atom","path":"experiment/module.py","file_url":"https://github.com/qixucen/atom/blob/HEAD/experiment/module.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d1aae91057e5fd6","mcp_get_code":{"code_sha256":"9d1aae91057e5fd6"}},{"arxiv_id":"2405.07932","paper":"/paper/parden-can-you-repeat-that-defending-against","title":"PARDEN, Can You Repeat That? Defending against Jailbreaks via Repetition","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ed-zh/parden","path":"utils.py","file_url":"https://github.com/ed-zh/parden/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5eb7c0a94ef52840","mcp_get_code":{"code_sha256":"5eb7c0a94ef52840"}},{"arxiv_id":"1905.06401","paper":"/paper/correlating-neural-and-symbolic","title":"Correlating neural and symbolic representations of language","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gchrupala/ursa","path":"ursa/kernel.py","file_url":"https://github.com/gchrupala/ursa/blob/HEAD/ursa/kernel.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":"1f3b15f50dbad61c","mcp_get_code":{"code_sha256":"1f3b15f50dbad61c"}},{"arxiv_id":"1810.08575","paper":"/paper/supervising-strong-learners-by-amplifying","title":"Supervising strong learners by amplifying weak experts","date":"2018-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulfchristiano/amplification","path":"experiment.py","file_url":"https://github.com/paulfchristiano/amplification/blob/HEAD/experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad5aed415e724ebd","mcp_get_code":{"code_sha256":"ad5aed415e724ebd"}},{"arxiv_id":"1605.06640","paper":"/paper/programming-with-a-differentiable-forth","title":"Programming with a Differentiable Forth Interpreter","date":"2016-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclmr/d4","path":"d4/intermediate.py","file_url":"https://github.com/uclmr/d4/blob/HEAD/d4/intermediate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b4fc26ce0acfe24","mcp_get_code":{"code_sha256":"1b4fc26ce0acfe24"}}]}