{"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/get-policy","entry":"get_policy","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":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"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":2,"ran_fixture":1,"ran":3,"unverified":2},"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":"2311.13569","arxiv_id_is_arxiv":true,"paper":"/paper/combinatorial-optimization-with-policy","title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"instadeepai/compass","path":"compass/trainers/trainer_utils.py","file_url":"https://github.com/instadeepai/compass/blob/HEAD/compass/trainers/trainer_utils.py","status":"ran","verification_level":1,"contract_check":null,"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, instadeepai/compass (NOASSERTION)","code_sha256":"1a99ce058696a299","code_sha256_prefix":"1a99ce058696a299","mcp_get_code":{"code_sha256":"1a99ce058696a299"}},{"arxiv_id":"2304.04858","arxiv_id_is_arxiv":true,"paper":"/paper/simulated-annealing-in-early-layers-leads-to","title":"Simulated Annealing in Early Layers Leads to Better Generalization","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amiiir-sarfi/seal","path":"core.py","file_url":"https://github.com/amiiir-sarfi/seal/blob/HEAD/core.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, amiiir-sarfi/seal when it was checked","code_sha256":"84121d5fa2d05bf2","code_sha256_prefix":"84121d5fa2d05bf2","mcp_get_code":{"code_sha256":"84121d5fa2d05bf2"}},{"arxiv_id":"2304.04782","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-from-passive-data-via","title":"Reinforcement Learning from Passive Data via Latent Intentions","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dibyaghosh/icvf_release","path":"experiments/antmaze/train_icvf.py","file_url":"https://github.com/dibyaghosh/icvf_release/blob/HEAD/experiments/antmaze/train_icvf.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":"7efb230a126ddd62","code_sha256_prefix":"7efb230a126ddd62","mcp_get_code":{"code_sha256":"7efb230a126ddd62"}},{"arxiv_id":"2106.05087","arxiv_id_is_arxiv":true,"paper":"/paper/who-is-the-strongest-enemy-towards-optimal","title":"Who Is the Strongest Enemy? Towards Optimal and Efficient Evasion Attacks in Deep RL","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/paad_adv_rl","path":"code_atari/paad_rl/trainer_adv/a2c_pa_attacker.py","file_url":"https://github.com/umd-huang-lab/paad_adv_rl/blob/HEAD/code_atari/paad_rl/trainer_adv/a2c_pa_attacker.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, umd-huang-lab/paad_adv_rl when it was checked","code_sha256":"bf1679c31b6bfadf","code_sha256_prefix":"bf1679c31b6bfadf","mcp_get_code":{"code_sha256":"bf1679c31b6bfadf"}},{"arxiv_id":"2103.05152","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-evolution-in-neural-networks","title":"Knowledge Evolution in Neural Networks","date":"2021-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmdtaha/knowledge_evolution","path":"KE_model.py","file_url":"https://github.com/ahmdtaha/knowledge_evolution/blob/HEAD/KE_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"680e25d1c3bf5523","code_sha256_prefix":"680e25d1c3bf5523","mcp_get_code":{"code_sha256":"680e25d1c3bf5523"}},{"arxiv_id":"2004.14288","arxiv_id_is_arxiv":true,"paper":"/paper/actor-critic-reinforcement-learning-for","title":"Actor-Critic Reinforcement Learning for Control with Stability Guarantee","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hithmh/Actor-critic-with-stability-guarantee","path":"variant.py","file_url":"https://github.com/hithmh/Actor-critic-with-stability-guarantee/blob/HEAD/variant.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, hithmh/Actor-critic-with-stability-guarantee when it was checked","code_sha256":"e452799839fcb1c2","code_sha256_prefix":"e452799839fcb1c2","mcp_get_code":{"code_sha256":"e452799839fcb1c2"}},{"arxiv_id":"1904.09728","arxiv_id_is_arxiv":true,"paper":"/paper/socialiqa-commonsense-reasoning-about-social","title":"SocialIQA: Commonsense Reasoning about Social Interactions","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clear-nus/llm-human-model","path":"table_clearing/table_clearing_trust_pomdp/evaluate/llm_policy.py","file_url":"https://github.com/clear-nus/llm-human-model/blob/HEAD/table_clearing/table_clearing_trust_pomdp/evaluate/llm_policy.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":"f5e0055352d005b6","code_sha256_prefix":"f5e0055352d005b6","mcp_get_code":{"code_sha256":"f5e0055352d005b6"}},{"arxiv_id":"1710.03740","arxiv_id_is_arxiv":true,"paper":"/paper/mixed-precision-training","title":"Mixed Precision Training","date":"2017-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/jmp","path":"jmp/_src/policy.py","file_url":"https://github.com/deepmind/jmp/blob/HEAD/jmp/_src/policy.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":"6fcfc8688017b242","code_sha256_prefix":"6fcfc8688017b242","mcp_get_code":{"code_sha256":"6fcfc8688017b242"}}],"record_sha256":"88aa55ce9a2732f5c09fcfcf6eb94412ecdf740a44c35fce2542b8e6d6b70282","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}