{"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/mlpnetwork","entry":"MLPNetwork","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_ran":6,"n_samples_constructed":4,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":6,"unverified":0},"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.24862","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-24862","title":"Unifying Value Alignment and Assignment in Cross-Domain Offline Reinforcement Learning with Heterogeneous Datasets","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"zq2r/V2A","path":"algo/offline_offline/v2a_igdf.py","file_url":"https://github.com/zq2r/V2A/blob/HEAD/algo/offline_offline/v2a_igdf.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, zq2r/V2A when it was checked","code_sha256":"df54328b8327c1f5","code_sha256_prefix":"df54328b8327c1f5","mcp_get_code":{"code_sha256":"df54328b8327c1f5"}},{"arxiv_id":"2512.02486","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-02486","title":"Dual-Robust Cross-Domain Offline Reinforcement Learning Against Dynamics Shifts","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"zq2r/DROCO","path":"algo/offline_offline/droco.py","file_url":"https://github.com/zq2r/DROCO/blob/HEAD/algo/offline_offline/droco.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":"c62cb3511f9129eb","code_sha256_prefix":"c62cb3511f9129eb","mcp_get_code":{"code_sha256":"c62cb3511f9129eb"}},{"arxiv_id":"2405.19690","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-policies-creating-a-trust-region","title":"Diffusion Policies creating a Trust Region for Offline Reinforcement Learning","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyucodings/diffusion_trusted_q_learning","path":"agents/dtql.py","file_url":"https://github.com/tianyucodings/diffusion_trusted_q_learning/blob/HEAD/agents/dtql.py","status":"ran","verification_level":1,"contract_check":null,"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, tianyucodings/diffusion_trusted_q_learning when it was checked","code_sha256":"b4d20c11cf5cfc46","code_sha256_prefix":"b4d20c11cf5cfc46","mcp_get_code":{"code_sha256":"b4d20c11cf5cfc46"}},{"arxiv_id":"2307.11685","arxiv_id_is_arxiv":true,"paper":"/paper/towards-generalizable-reinforcement-learning","title":"Towards Generalizable Reinforcement Learning for Trade Execution","date":"2023-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangchuheng123/RL4Execution","path":"code/policy_cate.py","file_url":"https://github.com/zhangchuheng123/RL4Execution/blob/HEAD/code/policy_cate.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, zhangchuheng123/RL4Execution when it was checked","code_sha256":"875c961ba78603c3","code_sha256_prefix":"875c961ba78603c3","mcp_get_code":{"code_sha256":"875c961ba78603c3"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yutongamber/MADDPG","path":"maddpg-pytorch/algorithms/maddpg.py","file_url":"https://github.com/Yutongamber/MADDPG/blob/HEAD/maddpg-pytorch/algorithms/maddpg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d91c262ff01c1192","code_sha256_prefix":"d91c262ff01c1192","mcp_get_code":{"code_sha256":"d91c262ff01c1192"}},{"arxiv_id":"1312.5602","arxiv_id_is_arxiv":true,"paper":"/paper/playing-atari-with-deep-reinforcement","title":"Playing Atari with Deep Reinforcement Learning","date":"2013-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/RLHive","path":"hive/agents/qnets/atari/nature_atari_dqn.py","file_url":"https://github.com/chandar-lab/RLHive/blob/HEAD/hive/agents/qnets/atari/nature_atari_dqn.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":"7af2befd6fd71b28","code_sha256_prefix":"7af2befd6fd71b28","mcp_get_code":{"code_sha256":"7af2befd6fd71b28"}}],"record_sha256":"e066672cf3cf87c84f2869114fc263d31d92b11b0efeaccd8129bb5f960971e6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}