{"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/makedirs","entry":"makedirs","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":2,"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":4,"n_samples_ran":1,"n_samples_fingerprinted":1,"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":3},"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.19662","paper":"/paper/arxiv-2608-19662","title":"ReCache: Efficient KV Cache Reuse and Compression for Tool-Augmented LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"EIT-NLP/ReCache","path":"capsule/src/utils.py","file_url":"https://github.com/EIT-NLP/ReCache/blob/HEAD/capsule/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df02a4d06d5ad0f2","mcp_get_code":{"code_sha256":"df02a4d06d5ad0f2"}},{"arxiv_id":"2401.06532","paper":"/paper/inters-unlocking-the-power-of-large-language","title":"INTERS: Unlocking the Power of Large Language Models in Search with Instruction Tuning","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DaoD/INTERS","path":"evaluation/qdu-tasks/src/utils.py","file_url":"https://github.com/DaoD/INTERS/blob/HEAD/evaluation/qdu-tasks/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df02a4d06d5ad0f2","mcp_get_code":{"code_sha256":"df02a4d06d5ad0f2"}},{"arxiv_id":"2212.12672","paper":"/paper/real-or-fake-text-investigating-human-ability","title":"Real or Fake Text?: Investigating Human Ability to Detect Boundaries Between Human-Written and Machine-Generated Text","date":"2022-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liamdugan/human-detection","path":"generation/process_datasets/process-NYT.py","file_url":"https://github.com/liamdugan/human-detection/blob/HEAD/generation/process_datasets/process-NYT.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e8d6dbed9143eea","mcp_get_code":{"code_sha256":"4e8d6dbed9143eea"}},{"arxiv_id":"2210.00999","paper":"/paper/latent-state-marginalization-as-a-low-cost","title":"Latent State Marginalization as a Low-cost Approach for Improving Exploration","date":"2022-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zdhnarsil/stochastic-marginal-actor-critic","path":"lib/utils.py","file_url":"https://github.com/zdhnarsil/stochastic-marginal-actor-critic/blob/HEAD/lib/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b86ab8fb8c757fcc","mcp_get_code":{"code_sha256":"b86ab8fb8c757fcc"}},{"arxiv_id":"1912.05663","paper":"/paper/measuring-the-reliability-of-reinforcement-1","title":"Measuring the Reliability of Reinforcement Learning Algorithms","date":"2019-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/rl-reliability-metrics","path":"rl_reliability_metrics/analysis/io_utils_oss.py","file_url":"https://github.com/google-research/rl-reliability-metrics/blob/HEAD/rl_reliability_metrics/analysis/io_utils_oss.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":"647076147597c7cf","mcp_get_code":{"code_sha256":"647076147597c7cf"}}]}