{"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/cache","entry":"cache","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":9,"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":8,"n_samples_ran":4,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"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":"2604.08438","paper":"/paper/arxiv-2604-08438","title":"Adalina: Adaptive Linear Approximation for the Shapley Value and Beyond","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"watml/TreeGrad","path":"linearTreeShap/linearTreeShap.py","file_url":"https://github.com/watml/TreeGrad/blob/HEAD/linearTreeShap/linearTreeShap.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79c9a61608039a03","mcp_get_code":{"code_sha256":"79c9a61608039a03"}},{"arxiv_id":"2410.10816","paper":"/paper/lvd-2m-a-long-take-video-dataset-with","title":"LVD-2M: A Long-take Video Dataset with Temporally Dense Captions","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silentview/lvd-2m","path":"pytube/helpers.py","file_url":"https://github.com/silentview/lvd-2m/blob/HEAD/pytube/helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd8738bf3f18e932","mcp_get_code":{"code_sha256":"fd8738bf3f18e932"}},{"arxiv_id":"2409.07440","paper":"/paper/super-evaluating-agents-on-setting-up-and","title":"SUPER: Evaluating Agents on Setting Up and Executing Tasks from Research Repositories","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/super-benchmark","path":"super/agent/llm_utils.py","file_url":"https://github.com/allenai/super-benchmark/blob/HEAD/super/agent/llm_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"dc11f1ca1fc0162f","mcp_get_code":{"code_sha256":"dc11f1ca1fc0162f"}},{"arxiv_id":"2311.04584","paper":"/paper/weakly-supervised-deepfake-localization-in","title":"Weakly-supervised deepfake localization in diffusion-generated images","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bit-ml/dolos","path":"dolos/utils.py","file_url":"https://github.com/bit-ml/dolos/blob/HEAD/dolos/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0a2c8bd0a93544b9","mcp_get_code":{"code_sha256":"0a2c8bd0a93544b9"}},{"arxiv_id":"2208.10449","paper":"/paper/scone-surface-coverage-optimization-in","title":"SCONE: Surface Coverage Optimization in Unknown Environments by Volumetric Integration","date":"2022-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Anttwo/SCONE","path":"SCONE/spherical_harmonics.py","file_url":"https://github.com/Anttwo/SCONE/blob/HEAD/SCONE/spherical_harmonics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"084d89c4bc23147b","mcp_get_code":{"code_sha256":"084d89c4bc23147b"}},{"arxiv_id":"2003.11211","paper":"/paper/two-stage-discriminative-re-ranking-for-large","title":"Two-stage Discriminative Re-ranking for Large-scale Landmark Retrieval","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyakaap/Landmark2019-1st-and-3rd-Place-Solution","path":"src/reranking.py","file_url":"https://github.com/lyakaap/Landmark2019-1st-and-3rd-Place-Solution/blob/HEAD/src/reranking.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"58024c2129ac7ee2","mcp_get_code":{"code_sha256":"58024c2129ac7ee2"}},{"arxiv_id":"1810.00440","paper":"/paper/minimal-random-code-learning-getting-bits","title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters","date":"2018-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/miracle","path":"models/cache.py","file_url":"https://github.com/cambridge-mlg/miracle/blob/HEAD/models/cache.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ab005a11f614a7a","mcp_get_code":{"code_sha256":"2ab005a11f614a7a"}},{"arxiv_id":"1806.07470","paper":"/paper/contrastive-explanations-with-local-foil","title":"Contrastive Explanations with Local Foil Trees","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MarcelRobeer/ContrastiveExplanation","path":"contrastive_explanation/utils.py","file_url":"https://github.com/MarcelRobeer/ContrastiveExplanation/blob/HEAD/contrastive_explanation/utils.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":"5fc1f2be9d33baf3","mcp_get_code":{"code_sha256":"5fc1f2be9d33baf3"}},{"arxiv_id":"2024.findings-emnlp.680","paper":null,"title":"arXiv:2024.findings-emnlp.680","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"pytube/pytube","path":"pytube/helpers.py","file_url":"https://github.com/pytube/pytube/blob/HEAD/pytube/helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"code_sha256_prefix":"fd8738bf3f18e932","mcp_get_code":{"code_sha256":"fd8738bf3f18e932"}}]}