{"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/rnd","entry":"RND","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":9,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":4,"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":0,"ran_fixture":0,"ran":4,"unverified":5},"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":"2310.17537","arxiv_id_is_arxiv":true,"paper":"/paper/neuro-inspired-fragmentation-and-recall-to","title":"Neuro-Inspired Fragmentation and Recall to Overcome Catastrophic Forgetting in Curiosity","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fietelab/farcuriosity","path":"rlpyt/models/curiosity/fragmentation_wrapper.py","file_url":"https://github.com/fietelab/farcuriosity/blob/HEAD/rlpyt/models/curiosity/fragmentation_wrapper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e152d9242f7ae00","code_sha256_prefix":"3e152d9242f7ae00","mcp_get_code":{"code_sha256":"3e152d9242f7ae00"}},{"arxiv_id":"2301.13616","arxiv_id_is_arxiv":true,"paper":"/paper/anti-exploration-by-random-network","title":"Anti-Exploration by Random Network Distillation","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinkoff-ai/sac-rnd","path":"offline_sac/networks.py","file_url":"https://github.com/tinkoff-ai/sac-rnd/blob/HEAD/offline_sac/networks.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":"ffdc71693d91c600","code_sha256_prefix":"ffdc71693d91c600","mcp_get_code":{"code_sha256":"ffdc71693d91c600"}},{"arxiv_id":"2301.13616","arxiv_id_is_arxiv":true,"paper":"/paper/anti-exploration-by-random-network","title":"Anti-Exploration by Random Network Distillation","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzmtsvv/sac_rnd","path":"rnd_modules.py","file_url":"https://github.com/zzmtsvv/sac_rnd/blob/HEAD/rnd_modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zzmtsvv/sac_rnd when it was checked","code_sha256":"28ed96e0bf8e9eab","code_sha256_prefix":"28ed96e0bf8e9eab","mcp_get_code":{"code_sha256":"28ed96e0bf8e9eab"}},{"arxiv_id":"2210.05409","arxiv_id_is_arxiv":true,"paper":"/paper/leco-learnable-episodic-count-for-task","title":"LECO: Learnable Episodic Count for Task-Specific Intrinsic Reward","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/leco","path":"sample_factory/algorithms/appo/intrinsic.py","file_url":"https://github.com/kakaobrain/leco/blob/HEAD/sample_factory/algorithms/appo/intrinsic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kakaobrain/leco when it was checked","code_sha256":"04c8ad4bbc8ab86b","code_sha256_prefix":"04c8ad4bbc8ab86b","mcp_get_code":{"code_sha256":"04c8ad4bbc8ab86b"}},{"arxiv_id":"2006.10159","arxiv_id_is_arxiv":true,"paper":"/paper/ultra-low-latency-low-area-inference","title":"Automatic heterogeneous quantization of deep neural networks for low-latency inference on the edge for particle detectors","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"calad0i/HGQ","path":"src/HGQ/proxy/fixed_point_quantizer.py","file_url":"https://github.com/calad0i/HGQ/blob/HEAD/src/HGQ/proxy/fixed_point_quantizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c7c761fbe641c432","code_sha256_prefix":"c7c761fbe641c432","mcp_get_code":{"code_sha256":"c7c761fbe641c432"}},{"arxiv_id":"1810.12894","arxiv_id_is_arxiv":true,"paper":"/paper/exploration-by-random-network-distillation","title":"Exploration by Random Network Distillation","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forevergj/multithreading_ppo_RND","path":"brain_md.py","file_url":"https://github.com/forevergj/multithreading_ppo_RND/blob/HEAD/brain_md.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, forevergj/multithreading_ppo_RND when it was checked","code_sha256":"e654e54d98b9fc45","code_sha256_prefix":"e654e54d98b9fc45","mcp_get_code":{"code_sha256":"e654e54d98b9fc45"}},{"arxiv_id":"1810.12894","arxiv_id_is_arxiv":true,"paper":"/paper/exploration-by-random-network-distillation","title":"Exploration by Random Network Distillation","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"balloch/rl-exploration-transfer","path":"rlexplore/rnd/rnd.py","file_url":"https://github.com/balloch/rl-exploration-transfer/blob/HEAD/rlexplore/rnd/rnd.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":"7aa70f2869c53e71","code_sha256_prefix":"7aa70f2869c53e71","mcp_get_code":{"code_sha256":"7aa70f2869c53e71"}},{"arxiv_id":"1810.12894","arxiv_id_is_arxiv":true,"paper":"/paper/exploration-by-random-network-distillation","title":"Exploration by Random Network Distillation","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhare96/reinforcement-learning","path":"rlib/RND/model.py","file_url":"https://github.com/jhare96/reinforcement-learning/blob/HEAD/rlib/RND/model.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":"ed8d297030cd46b1","code_sha256_prefix":"ed8d297030cd46b1","mcp_get_code":{"code_sha256":"ed8d297030cd46b1"}},{"arxiv_id":"1810.12894","arxiv_id_is_arxiv":true,"paper":"/paper/exploration-by-random-network-distillation","title":"Exploration by Random Network Distillation","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uoe-agents/derl","path":"derl/intrinsic_rewards/rnd/rnd.py","file_url":"https://github.com/uoe-agents/derl/blob/HEAD/derl/intrinsic_rewards/rnd/rnd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, uoe-agents/derl when it was checked","code_sha256":"96d5517e9763275d","code_sha256_prefix":"96d5517e9763275d","mcp_get_code":{"code_sha256":"96d5517e9763275d"}}],"record_sha256":"1538139d335abbf170ca8a87819d2a5a46e3e77b85b4cc39173e45b073489f5a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}