{"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/normalized-columns-initializer","entry":"normalized_columns_initializer","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":0,"n_papers_ran_instrument_only":7,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":4,"ran_fixture":0,"ran":0,"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":"2402.15546","arxiv_id_is_arxiv":true,"paper":"/paper/himap-learning-heuristics-informed-policies","title":"HiMAP: Learning Heuristics-Informed Policies for Large-Scale Multi-Agent Pathfinding","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/himap","path":"src/models/vggnet.py","file_url":"https://github.com/kaist-silab/himap/blob/HEAD/src/models/vggnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, kaist-silab/himap when it was checked","code_sha256":"157c2af2dc5c2860","code_sha256_prefix":"157c2af2dc5c2860","mcp_get_code":{"code_sha256":"157c2af2dc5c2860"}},{"arxiv_id":"2003.07069","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-discovering-of-causal","title":"Self-Supervised Discovering of Interpretable Features for Reinforcement Learning","date":"2020-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shiwj16/SSINet","path":"src/networks.py","file_url":"https://github.com/shiwj16/SSINet/blob/HEAD/src/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"96708b203eb62ef3","code_sha256_prefix":"96708b203eb62ef3","mcp_get_code":{"code_sha256":"96708b203eb62ef3"}},{"arxiv_id":"2001.06680","arxiv_id_is_arxiv":true,"paper":"/paper/tree-structured-policy-based-progressive","title":"Tree-Structured Policy based Progressive Reinforcement Learning for Temporally Language Grounding in Video","date":"2020-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WuJie1010/TSP-PRL","path":"model.py","file_url":"https://github.com/WuJie1010/TSP-PRL/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, WuJie1010/TSP-PRL when it was checked","code_sha256":"e0cbd595581568d9","code_sha256_prefix":"e0cbd595581568d9","mcp_get_code":{"code_sha256":"e0cbd595581568d9"}},{"arxiv_id":"1907.02874","arxiv_id_is_arxiv":true,"paper":"/paper/attentive-multi-task-deep-reinforcement","title":"Attentive Multi-Task Deep Reinforcement Learning","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"braemt/attentive-multi-task-deep-reinforcement-learning","path":"model.py","file_url":"https://github.com/braemt/attentive-multi-task-deep-reinforcement-learning/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from pathak22/noreward-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"ef2d50dfca29c664","code_sha256_prefix":"ef2d50dfca29c664","mcp_get_code":{"code_sha256":"ef2d50dfca29c664"}},{"arxiv_id":"1705.05363","arxiv_id_is_arxiv":true,"paper":"/paper/curiosity-driven-exploration-by-self","title":"Curiosity-driven Exploration by Self-supervised Prediction","date":"2017-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pathak22/noreward-rl","path":"src/model.py","file_url":"https://github.com/pathak22/noreward-rl/blob/HEAD/src/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, pathak22/noreward-rl (NOASSERTION)","code_sha256":"ef2d50dfca29c664","code_sha256_prefix":"ef2d50dfca29c664","mcp_get_code":{"code_sha256":"ef2d50dfca29c664"}},{"arxiv_id":"1703.03864","arxiv_id_is_arxiv":true,"paper":"/paper/evolution-strategies-as-a-scalable","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atgambardella/pytorch-es","path":"model.py","file_url":"https://github.com/atgambardella/pytorch-es/blob/HEAD/model.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":"2b7f271057272097","code_sha256_prefix":"2b7f271057272097","mcp_get_code":{"code_sha256":"2b7f271057272097"}},{"arxiv_id":"1611.05763","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-reinforcement-learn","title":"Learning to reinforcement learn","date":"2016-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awjuliani/Meta-RL","path":"helper.py","file_url":"https://github.com/awjuliani/Meta-RL/blob/HEAD/helper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from pathak22/noreward-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"ef2d50dfca29c664","code_sha256_prefix":"ef2d50dfca29c664","mcp_get_code":{"code_sha256":"ef2d50dfca29c664"}},{"arxiv_id":"1602.01783","arxiv_id_is_arxiv":true,"paper":"/paper/asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsinghnegi/atari_RL_agent","path":"models/a3c.py","file_url":"https://github.com/dsinghnegi/atari_RL_agent/blob/HEAD/models/a3c.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"96708b203eb62ef3","code_sha256_prefix":"96708b203eb62ef3","mcp_get_code":{"code_sha256":"96708b203eb62ef3"}},{"arxiv_id":"1602.01783","arxiv_id_is_arxiv":true,"paper":"/paper/asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/universe-starter-agent","path":"model.py","file_url":"https://github.com/openai/universe-starter-agent/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from pathak22/noreward-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"ef2d50dfca29c664","code_sha256_prefix":"ef2d50dfca29c664","mcp_get_code":{"code_sha256":"ef2d50dfca29c664"}}],"record_sha256":"ba3bbb3527b8d9c1c5028e3ce73974b6345f6bbaae5494b6e10de6e06a7f01b0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}