{"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/make-data","entry":"make_data","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":11,"n_papers_ran":6,"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":12,"n_samples_ran":7,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":3,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"unverified":5},"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.05136","paper":"/paper/arxiv-2608-05136","title":"The Loss Does Not See the Basis, but Adam Does","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"idevender/loss-basis-adam","path":"experiments/attention_gauge.py","file_url":"https://github.com/idevender/loss-basis-adam/blob/HEAD/experiments/attention_gauge.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a1a092da791517e","mcp_get_code":{"code_sha256":"5a1a092da791517e"}},{"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":"lm_poc.py","file_url":"https://github.com/zeyuyuyu/sparsity-ceiling/blob/HEAD/lm_poc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a2ee87a04024c071","mcp_get_code":{"code_sha256":"a2ee87a04024c071"}},{"arxiv_id":"2406.11280","paper":"/paper/i-srt-aligning-large-multimodal-models-for","title":"ISR-DPO: Aligning Large Multimodal Models for Videos by Iterative Self-Retrospective DPO","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snumprlab/isr-dpo","path":"Evaluation/eval/eval_qa.py","file_url":"https://github.com/snumprlab/isr-dpo/blob/HEAD/Evaluation/eval/eval_qa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"63c0b0c7b99fe5b6","mcp_get_code":{"code_sha256":"63c0b0c7b99fe5b6"}},{"arxiv_id":"2310.18496","paper":"/paper/how-well-do-feature-additive-explainers","title":"How Well Do Feature-Additive Explainers Explain Feature-Additive Predictors?","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craymichael/PostHocExplainerEvaluation","path":"benchmark_backends.py","file_url":"https://github.com/craymichael/PostHocExplainerEvaluation/blob/HEAD/benchmark_backends.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd757c7b37b51b8e","mcp_get_code":{"code_sha256":"fd757c7b37b51b8e"}},{"arxiv_id":"2309.01213","paper":"/paper/implicit-regularization-of-deep-residual","title":"Implicit regularization of deep residual networks towards neural ODEs","date":"2023-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michaelsdr/implicit-regularization-resnets-nodes","path":"finite_training_time_convergence.py","file_url":"https://github.com/michaelsdr/implicit-regularization-resnets-nodes/blob/HEAD/finite_training_time_convergence.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c4fb8ae9ff35f14","mcp_get_code":{"code_sha256":"5c4fb8ae9ff35f14"}},{"arxiv_id":"2309.01213","paper":"/paper/implicit-regularization-of-deep-residual","title":"Implicit regularization of deep residual networks towards neural ODEs","date":"2023-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michaelsdr/implicit-regularization-resnets-nodes","path":"infinite_training_time.py","file_url":"https://github.com/michaelsdr/implicit-regularization-resnets-nodes/blob/HEAD/infinite_training_time.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9938cf775b5e2a1e","mcp_get_code":{"code_sha256":"9938cf775b5e2a1e"}},{"arxiv_id":"2305.09253","paper":"/paper/online-continual-learning-without-the-storage","title":"Online Continual Learning Without the Storage Constraint","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drimpossible/acm","path":"src/features/trainutils.py","file_url":"https://github.com/drimpossible/acm/blob/HEAD/src/features/trainutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"07b184b35e9e3570","mcp_get_code":{"code_sha256":"07b184b35e9e3570"}},{"arxiv_id":"2209.11628","paper":"/paper/a-neural-model-for-regular-grammar-induction","title":"A Neural Model for Regular Grammar Induction","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pbelcak/neregrain","path":"data.py","file_url":"https://github.com/pbelcak/neregrain/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"906bcbb207d45d5b","mcp_get_code":{"code_sha256":"906bcbb207d45d5b"}},{"arxiv_id":"2209.10280","paper":"/paper/periodic-extrapolative-generalisation-in","title":"Periodic Extrapolative Generalisation in Neural Networks","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pbelcak/perkit","path":"evaluation/data.py","file_url":"https://github.com/pbelcak/perkit/blob/HEAD/evaluation/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84527d07d7e5b801","mcp_get_code":{"code_sha256":"84527d07d7e5b801"}},{"arxiv_id":"2006.08852","paper":"/paper/counterexample-guided-learning-of-monotonic","title":"Counterexample-Guided Learning of Monotonic Neural Networks","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AishwaryaSivaraman/COMET","path":"src/Models/DeepModel_AutoMPG.py","file_url":"https://github.com/AishwaryaSivaraman/COMET/blob/HEAD/src/Models/DeepModel_AutoMPG.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb8cc214bc192416","mcp_get_code":{"code_sha256":"fb8cc214bc192416"}},{"arxiv_id":"1602.02867","paper":"/paper/value-iteration-networks","title":"Value Iteration Networks","date":"2016-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kentsommer/pytorch-value-iteration-networks","path":"dataset/make_training_data.py","file_url":"https://github.com/kentsommer/pytorch-value-iteration-networks/blob/HEAD/dataset/make_training_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"920061d6774dae0c","mcp_get_code":{"code_sha256":"920061d6774dae0c"}},{"arxiv_id":"1311.2540","paper":"/paper/asymmetric-numeral-systems-entropy-coding","title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding","date":null,"month_inferred_from_arxiv_id":"2013-11","title_source":"archive","repo":"GarethCa/Py-tANS","path":"tests/test_coder.py","file_url":"https://github.com/GarethCa/Py-tANS/blob/HEAD/tests/test_coder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe80544ff5c379e8","mcp_get_code":{"code_sha256":"fe80544ff5c379e8"}}]}