{"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/policynet","entry":"PolicyNet","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":7,"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":8,"n_samples_ran":7,"n_samples_constructed":6,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":8,"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":7,"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":"2605.21168","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21168","title":"ScenePilot: Controllable Boundary-Driven Critical Scenario Generation for Autonomous Driving","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"QiyuRuan/ScenePilot","path":"safebench/scenario/scenario_policy/rl/scenepilot.py","file_url":"https://github.com/QiyuRuan/ScenePilot/blob/HEAD/safebench/scenario/scenario_policy/rl/scenepilot.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, QiyuRuan/ScenePilot when it was checked","code_sha256":"8c9c268ef9281ff9","code_sha256_prefix":"8c9c268ef9281ff9","mcp_get_code":{"code_sha256":"8c9c268ef9281ff9"}},{"arxiv_id":"2409.00342","arxiv_id_is_arxiv":true,"paper":"/paper/adanat-exploring-adaptive-policy-for-token","title":"AdaNAT: Exploring Adaptive Policy for Token-Based Image Generation","date":"2024-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeapLabTHU/AdaNAT","path":"libs/policy.py","file_url":"https://github.com/LeapLabTHU/AdaNAT/blob/HEAD/libs/policy.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, LeapLabTHU/AdaNAT when it was checked","code_sha256":"2d3ac7b0ca72697b","code_sha256_prefix":"2d3ac7b0ca72697b","mcp_get_code":{"code_sha256":"2d3ac7b0ca72697b"}},{"arxiv_id":"2211.15281","arxiv_id_is_arxiv":true,"paper":"/paper/flow-per-instance-personalized-federated","title":"Flow: Per-Instance Personalized Federated Learning Through Dynamic Routing","date":"2022-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astuary/flow","path":"models/cifar100_resnet_dynamic_v6.py","file_url":"https://github.com/astuary/flow/blob/HEAD/models/cifar100_resnet_dynamic_v6.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, astuary/flow when it was checked","code_sha256":"ae51b48b5947e98a","code_sha256_prefix":"ae51b48b5947e98a","mcp_get_code":{"code_sha256":"ae51b48b5947e98a"}},{"arxiv_id":"2206.04646","arxiv_id_is_arxiv":true,"paper":"/paper/globally-optimal-algorithms-for-fixed-budged","title":"Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsuchhiii/fixed-budget-bai","path":"pe_algorithms/mab/optnn.py","file_url":"https://github.com/tsuchhiii/fixed-budget-bai/blob/HEAD/pe_algorithms/mab/optnn.py","status":"ran","verification_level":1,"contract_check":null,"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, tsuchhiii/fixed-budget-bai when it was checked","code_sha256":"a27deb6b78901563","code_sha256_prefix":"a27deb6b78901563","mcp_get_code":{"code_sha256":"a27deb6b78901563"}},{"arxiv_id":"2205.06187","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-deep-visual-and-inertial-odometry","title":"Efficient Deep Visual and Inertial Odometry with Adaptive Visual Modality Selection","date":"2022-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyuyng/Visual-Selective-VIO","path":"model.py","file_url":"https://github.com/mingyuyng/Visual-Selective-VIO/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mingyuyng/Visual-Selective-VIO when it was checked","code_sha256":"09120974770168bc","code_sha256_prefix":"09120974770168bc","mcp_get_code":{"code_sha256":"09120974770168bc"}},{"arxiv_id":"2111.09189","arxiv_id_is_arxiv":true,"paper":"/paper/tom2c-target-oriented-multi-agent-1","title":"ToM2C: Target-oriented Multi-agent Communication and Cooperation with Theory of Mind","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unrealtracking/tom2c","path":"model.py","file_url":"https://github.com/unrealtracking/tom2c/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, unrealtracking/tom2c when it was checked","code_sha256":"19d9c2989f973f48","code_sha256_prefix":"19d9c2989f973f48","mcp_get_code":{"code_sha256":"19d9c2989f973f48"}},{"arxiv_id":"2010.13110","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multi-agent-coordination-for","title":"Learning Multi-Agent Coordination for Enhancing Target Coverage in Directional Sensor Networks","date":"2020-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XuJing1022/HiT-MAC","path":"model.py","file_url":"https://github.com/XuJing1022/HiT-MAC/blob/HEAD/model.py","status":"ran","verification_level":1,"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, XuJing1022/HiT-MAC when it was checked","code_sha256":"5f94395dba9cf01d","code_sha256_prefix":"5f94395dba9cf01d","mcp_get_code":{"code_sha256":"5f94395dba9cf01d"}},{"arxiv_id":"1802.03268","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neural-architecture-search-via-1","title":"Efficient Neural Architecture Search via Parameter Sharing","date":"2018-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RualPerez/AutoML","path":"policy.py","file_url":"https://github.com/RualPerez/AutoML/blob/HEAD/policy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, RualPerez/AutoML when it was checked","code_sha256":"196af5ccc39415a7","code_sha256_prefix":"196af5ccc39415a7","mcp_get_code":{"code_sha256":"196af5ccc39415a7"}}],"record_sha256":"64b2e6e643cd4d4107fea8a97dce7023d54283c2cf10f9010009cb7086ed5268","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}