{"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/device","entry":"device","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":7,"n_samples_ran":6,"n_samples_constructed":2,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":1,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"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":"2506.02612","arxiv_id_is_arxiv":true,"paper":"/paper/simple-good-fast-self-supervised-world-models","title":"Simple, Good, Fast: Self-Supervised World Models Free of Baggage","date":"2025-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jrobine/sgf","path":"src/wm.py","file_url":"https://github.com/jrobine/sgf/blob/HEAD/src/wm.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":"e332d55367824ddd","code_sha256_prefix":"e332d55367824ddd","mcp_get_code":{"code_sha256":"e332d55367824ddd"}},{"arxiv_id":"2211.17226","arxiv_id_is_arxiv":true,"paper":"/paper/gennape-towards-generalized-neural","title":"GENNAPE: Towards Generalized Neural Architecture Performance Estimators","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ascend-Research/GENNAPE","path":"utils/model_utils.py","file_url":"https://github.com/Ascend-Research/GENNAPE/blob/HEAD/utils/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, Ascend-Research/GENNAPE, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"5ad2fe246f975b4e","code_sha256_prefix":"5ad2fe246f975b4e","mcp_get_code":{"code_sha256":"5ad2fe246f975b4e"}},{"arxiv_id":"2203.16481","arxiv_id_is_arxiv":true,"paper":"/paper/on-uncertainty-tempering-and-data","title":"On Uncertainty, Tempering, and Data Augmentation in Bayesian Classification","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/bayesian-classification","path":"src/bnn_priors/bnn_priors/exp_utils.py","file_url":"https://github.com/activatedgeek/bayesian-classification/blob/HEAD/src/bnn_priors/bnn_priors/exp_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":"f35c35e0ab818b93","code_sha256_prefix":"f35c35e0ab818b93","mcp_get_code":{"code_sha256":"f35c35e0ab818b93"}},{"arxiv_id":"2110.13223","arxiv_id_is_arxiv":true,"paper":"/paper/identifying-and-benchmarking-natural-out-of","title":"Identifying and Benchmarking Natural Out-of-Context Prediction Problems","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmadras/nooch","path":"src/utils/utils.py","file_url":"https://github.com/dmadras/nooch/blob/HEAD/src/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ae3d74510d82d77","code_sha256_prefix":"2ae3d74510d82d77","mcp_get_code":{"code_sha256":"2ae3d74510d82d77"}},{"arxiv_id":"2108.03456","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-model-for-zero-shot-music-source","title":"A Unified Model for Zero-shot Music Source Separation, Transcription and Synthesis","date":"2021-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kikyo-16/a-unified-model-for-zero-shot-musical-source-separation-transcription-and-synthesis","path":"src/inference/inference.py","file_url":"https://github.com/kikyo-16/a-unified-model-for-zero-shot-musical-source-separation-transcription-and-synthesis/blob/HEAD/src/inference/inference.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":"c7118f4e5f88879b","code_sha256_prefix":"c7118f4e5f88879b","mcp_get_code":{"code_sha256":"c7118f4e5f88879b"}},{"arxiv_id":"2105.06964","arxiv_id_is_arxiv":true,"paper":"/paper/bnnpriors-a-library-for-bayesian-neural","title":"BNNpriors: A library for Bayesian neural network inference with different prior distributions","date":"2021-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ratschlab/bnn_priors","path":"bnn_priors/exp_utils.py","file_url":"https://github.com/ratschlab/bnn_priors/blob/HEAD/bnn_priors/exp_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":"f35c35e0ab818b93","code_sha256_prefix":"f35c35e0ab818b93","mcp_get_code":{"code_sha256":"f35c35e0ab818b93"}},{"arxiv_id":"1908.09791","arxiv_id_is_arxiv":true,"paper":"/paper/once-for-all-train-one-network-and-specialize","title":"Once-for-All: Train One Network and Specialize it for Efficient Deployment","date":"2019-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"analogdevicesinc/ai8x-training","path":"devices.py","file_url":"https://github.com/analogdevicesinc/ai8x-training/blob/HEAD/devices.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":"438c11e6440fc7fb","code_sha256_prefix":"438c11e6440fc7fb","mcp_get_code":{"code_sha256":"438c11e6440fc7fb"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Howuhh/prioritized_experience_replay","path":"memory/buffer.py","file_url":"https://github.com/Howuhh/prioritized_experience_replay/blob/HEAD/memory/buffer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"21a7a1ad47b2bc08","code_sha256_prefix":"21a7a1ad47b2bc08","mcp_get_code":{"code_sha256":"21a7a1ad47b2bc08"}}],"record_sha256":"16dcec4baf544786814aa75e87235a404e5d602e1caeac54f6cac50715cc42e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}