{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/make-data","entry":"make_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":4,"unverified":2},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a1a092da791517e","code_sha256_prefix":"5a1a092da791517e","mcp_get_code":{"code_sha256":"5a1a092da791517e"}},{"arxiv_id":"2607.26648","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2ee87a04024c071","code_sha256_prefix":"a2ee87a04024c071","mcp_get_code":{"code_sha256":"a2ee87a04024c071"}},{"arxiv_id":"2406.11280","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, snumprlab/isr-dpo when it was checked","code_sha256":"63c0b0c7b99fe5b6","code_sha256_prefix":"63c0b0c7b99fe5b6","mcp_get_code":{"code_sha256":"63c0b0c7b99fe5b6"}},{"arxiv_id":"2310.18496","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, craymichael/PostHocExplainerEvaluation when it was checked","code_sha256":"fd757c7b37b51b8e","code_sha256_prefix":"fd757c7b37b51b8e","mcp_get_code":{"code_sha256":"fd757c7b37b51b8e"}},{"arxiv_id":"2309.01213","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c4fb8ae9ff35f14","code_sha256_prefix":"5c4fb8ae9ff35f14","mcp_get_code":{"code_sha256":"5c4fb8ae9ff35f14"}},{"arxiv_id":"2309.01213","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9938cf775b5e2a1e","code_sha256_prefix":"9938cf775b5e2a1e","mcp_get_code":{"code_sha256":"9938cf775b5e2a1e"}},{"arxiv_id":"2305.09253","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"07b184b35e9e3570","code_sha256_prefix":"07b184b35e9e3570","mcp_get_code":{"code_sha256":"07b184b35e9e3570"}},{"arxiv_id":"2209.11628","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"906bcbb207d45d5b","code_sha256_prefix":"906bcbb207d45d5b","mcp_get_code":{"code_sha256":"906bcbb207d45d5b"}},{"arxiv_id":"2209.10280","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84527d07d7e5b801","code_sha256_prefix":"84527d07d7e5b801","mcp_get_code":{"code_sha256":"84527d07d7e5b801"}},{"arxiv_id":"2006.08852","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb8cc214bc192416","code_sha256_prefix":"fb8cc214bc192416","mcp_get_code":{"code_sha256":"fb8cc214bc192416"}},{"arxiv_id":"1602.02867","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"920061d6774dae0c","code_sha256_prefix":"920061d6774dae0c","mcp_get_code":{"code_sha256":"920061d6774dae0c"}},{"arxiv_id":"1311.2540","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, GarethCa/Py-tANS when it was checked","code_sha256":"fe80544ff5c379e8","code_sha256_prefix":"fe80544ff5c379e8","mcp_get_code":{"code_sha256":"fe80544ff5c379e8"}}],"record_sha256":"dd5a75aff3cbea31feca8a55d2ef49e31f5c55c5b2688b774f5794107be00a7d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}