{"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/describe","entry":"describe","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":1,"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":"2606.19542","paper":"/paper/arxiv-2606-19542","title":"Tracking Representation Dynamics in Large Language Models with Persistent Homology","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"malhotranaman/tracking-representation-dynamics-with-persistent-homology","path":"src/phlatent/device.py","file_url":"https://github.com/malhotranaman/tracking-representation-dynamics-with-persistent-homology/blob/HEAD/src/phlatent/device.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3171b6f56f728abf","mcp_get_code":{"code_sha256":"3171b6f56f728abf"}},{"arxiv_id":"2603.25976","paper":"/paper/arxiv-2603-25976","title":"Second-Order, First-Class: A Composable Stack for Curvature-Aware Training","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"cor3bit/somax","path":"src/somax/presets.py","file_url":"https://github.com/cor3bit/somax/blob/HEAD/src/somax/presets.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":"fe60c4cd5931c27e","mcp_get_code":{"code_sha256":"fe60c4cd5931c27e"}},{"arxiv_id":"2404.00859","paper":"/paper/do-language-models-plan-ahead-for-future","title":"Do language models plan ahead for future tokens?","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wiwu2390/futuregpt2-public","path":"src/evals/utils.py","file_url":"https://github.com/wiwu2390/futuregpt2-public/blob/HEAD/src/evals/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cdd5384d07a9e3fd","mcp_get_code":{"code_sha256":"cdd5384d07a9e3fd"}},{"arxiv_id":"1710.10723","paper":"/paper/simple-and-effective-multi-paragraph-reading","title":"Simple and Effective Multi-Paragraph Reading Comprehension","date":"2017-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/document-qa","path":"docqa/configurable.py","file_url":"https://github.com/allenai/document-qa/blob/HEAD/docqa/configurable.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":"0a371114688eec02","mcp_get_code":{"code_sha256":"0a371114688eec02"}},{"arxiv_id":"1606.07892","paper":"/paper/large-scale-kernel-methods-for-independence","title":"Large-Scale Kernel Methods for Independence Testing","date":"2016-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/SIC","path":"utils.py","file_url":"https://github.com/IBM/SIC/blob/HEAD/utils.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":"d204ab0c6f9c28e9","mcp_get_code":{"code_sha256":"d204ab0c6f9c28e9"}}]}