{"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/load-statistics","entry":"load_statistics","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":0,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"ran":8,"unverified":1},"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":"2405.11881","arxiv_id_is_arxiv":true,"paper":"/paper/out-of-distribution-detection-with-a-single","title":"Out-of-Distribution Detection with a Single Unconditional Diffusion Model","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clear-nus/diffpath","path":"eval_1d.py","file_url":"https://github.com/clear-nus/diffpath/blob/HEAD/eval_1d.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f5ee25e205016d9c","code_sha256_prefix":"f5ee25e205016d9c","mcp_get_code":{"code_sha256":"f5ee25e205016d9c"}},{"arxiv_id":"2405.11881","arxiv_id_is_arxiv":true,"paper":"/paper/out-of-distribution-detection-with-a-single","title":"Out-of-Distribution Detection with a Single Unconditional Diffusion Model","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clear-nus/diffpath","path":"eval_6d.py","file_url":"https://github.com/clear-nus/diffpath/blob/HEAD/eval_6d.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"922efb65e6bb4ae9","code_sha256_prefix":"922efb65e6bb4ae9","mcp_get_code":{"code_sha256":"922efb65e6bb4ae9"}},{"arxiv_id":"2112.05848","arxiv_id_is_arxiv":true,"paper":"/paper/deep-q-network-with-proximal-iteration-1","title":"Faster Deep Reinforcement Learning with Slower Online Network","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/fast-rl-with-slow-updates","path":"dopamine/colab/utils.py","file_url":"https://github.com/amazon-research/fast-rl-with-slow-updates/blob/HEAD/dopamine/colab/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00989d2027cbd4f1","code_sha256_prefix":"00989d2027cbd4f1","mcp_get_code":{"code_sha256":"00989d2027cbd4f1"}},{"arxiv_id":"2006.11615","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-identification-of-partially-observed","title":"Scalable Identification of Partially Observed Systems with Certainty-Equivalent EM","date":"2020-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sisl/CEEM","path":"ceem/data_utils.py","file_url":"https://github.com/sisl/CEEM/blob/HEAD/ceem/data_utils.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":"05ede9c21387428f","code_sha256_prefix":"05ede9c21387428f","mcp_get_code":{"code_sha256":"05ede9c21387428f"}},{"arxiv_id":"1906.05895","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-forget-for-meta-learning","title":"Learning to Forget for Meta-Learning","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baiksung/L2F","path":"utils/storage.py","file_url":"https://github.com/baiksung/L2F/blob/HEAD/utils/storage.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":"b85351bca4ccbe20","code_sha256_prefix":"b85351bca4ccbe20","mcp_get_code":{"code_sha256":"b85351bca4ccbe20"}},{"arxiv_id":"1905.11092","arxiv_id_is_arxiv":true,"paper":"/paper/a-rate-distortion-framework-for-explaining","title":"A Rate-Distortion Framework for Explaining Neural Network Decisions","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zib-iol/fw-rde","path":"mnist/instances.py","file_url":"https://github.com/zib-iol/fw-rde/blob/HEAD/mnist/instances.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":"7992eead5cc0cfa9","code_sha256_prefix":"7992eead5cc0cfa9","mcp_get_code":{"code_sha256":"7992eead5cc0cfa9"}},{"arxiv_id":"1905.11092","arxiv_id_is_arxiv":true,"paper":"/paper/a-rate-distortion-framework-for-explaining","title":"A Rate-Distortion Framework for Explaining Neural Network Decisions","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zib-iol/fw-rde","path":"stl10/instances.py","file_url":"https://github.com/zib-iol/fw-rde/blob/HEAD/stl10/instances.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":"6439167f97ab00e5","code_sha256_prefix":"6439167f97ab00e5","mcp_get_code":{"code_sha256":"6439167f97ab00e5"}},{"arxiv_id":"1905.10295","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-learn-by-self-critique","title":"Learning to learn via Self-Critique","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AntreasAntoniou/Learning_to_Learn_via_Self-Critique","path":"utils/storage.py","file_url":"https://github.com/AntreasAntoniou/Learning_to_Learn_via_Self-Critique/blob/HEAD/utils/storage.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":"b85351bca4ccbe20","code_sha256_prefix":"b85351bca4ccbe20","mcp_get_code":{"code_sha256":"b85351bca4ccbe20"}},{"arxiv_id":"1905.06331","arxiv_id_is_arxiv":true,"paper":"/paper/lgm-net-learning-to-generate-matching","title":"LGM-Net: Learning to Generate Matching Networks for Few-Shot Learning","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"likesiwell/LGM-Net","path":"storage.py","file_url":"https://github.com/likesiwell/LGM-Net/blob/HEAD/storage.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":"2683934575ba603a","code_sha256_prefix":"2683934575ba603a","mcp_get_code":{"code_sha256":"2683934575ba603a"}},{"arxiv_id":"1812.06110","arxiv_id_is_arxiv":true,"paper":"/paper/dopamine-a-research-framework-for-deep","title":"Dopamine: A Research Framework for Deep Reinforcement Learning","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GoingMyWay/dopamine_reward_decomposition","path":"dopamine/colab/utils.py","file_url":"https://github.com/GoingMyWay/dopamine_reward_decomposition/blob/HEAD/dopamine/colab/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eab6e85f41bad3ef","code_sha256_prefix":"eab6e85f41bad3ef","mcp_get_code":{"code_sha256":"eab6e85f41bad3ef"}},{"arxiv_id":"1812.06110","arxiv_id_is_arxiv":true,"paper":"/paper/dopamine-a-research-framework-for-deep","title":"Dopamine: A Research Framework for Deep Reinforcement Learning","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ACampero/dopamine","path":"dopamine/colab/utils.py","file_url":"https://github.com/ACampero/dopamine/blob/HEAD/dopamine/colab/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b6006008d2481d0","code_sha256_prefix":"5b6006008d2481d0","mcp_get_code":{"code_sha256":"5b6006008d2481d0"}},{"arxiv_id":"1606.04080","arxiv_id_is_arxiv":true,"paper":"/paper/matching-networks-for-one-shot-learning","title":"Matching Networks for One Shot Learning","date":"2016-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AntreasAntoniou/MatchingNetworks","path":"utils/storage.py","file_url":"https://github.com/AntreasAntoniou/MatchingNetworks/blob/HEAD/utils/storage.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":"348fc98221adb8ed","code_sha256_prefix":"348fc98221adb8ed","mcp_get_code":{"code_sha256":"348fc98221adb8ed"}}],"record_sha256":"f1be1f45b9a44354386b091f18c3c18a3a4d68b81a170d84b4007745ea1a43bf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}