{"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/build-net","entry":"build_net","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":13,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"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":12,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":13,"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":3,"ran_fixture":0,"ran":5,"unverified":4},"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":"2506.12622","arxiv_id_is_arxiv":true,"paper":"/paper/dr-sac-distributionally-robust-soft-actor","title":"DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty","date":"2025-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lemutisme/dr-sac","path":"sac.py","file_url":"https://github.com/lemutisme/dr-sac/blob/HEAD/sac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eae1a13a0cda9f0e","code_sha256_prefix":"eae1a13a0cda9f0e","mcp_get_code":{"code_sha256":"eae1a13a0cda9f0e"}},{"arxiv_id":"2405.11982","arxiv_id_is_arxiv":true,"paper":"/paper/robust-deep-reinforcement-learning-with-1","title":"Robust Deep Reinforcement Learning with Adaptive Adversarial Perturbations in Action Space","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lqm00/a2p-sac","path":"SAC.py","file_url":"https://github.com/lqm00/a2p-sac/blob/HEAD/SAC.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, lqm00/a2p-sac when it was checked","code_sha256":"d96f54381bd4e495","code_sha256_prefix":"d96f54381bd4e495","mcp_get_code":{"code_sha256":"d96f54381bd4e495"}},{"arxiv_id":"2401.09286","arxiv_id_is_arxiv":true,"paper":"/paper/deployable-reinforcement-learning-with","title":"Deployable Reinforcement Learning with Variable Control Rate","date":"2024-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alpaficia/SEAC_Pytorch_release","path":"SEAC.py","file_url":"https://github.com/alpaficia/SEAC_Pytorch_release/blob/HEAD/SEAC.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":"9b95be60df57db51","code_sha256_prefix":"9b95be60df57db51","mcp_get_code":{"code_sha256":"9b95be60df57db51"}},{"arxiv_id":"2310.02233","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-schrodinger-bridge-matching","title":"Generalized Schrödinger Bridge Matching","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/generalized-schrodinger-bridge-matching","path":"gsbm/network.py","file_url":"https://github.com/facebookresearch/generalized-schrodinger-bridge-matching/blob/HEAD/gsbm/network.py","status":"unverified","verification_level":0,"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, facebookresearch/generalized-schrodinger-bridge-matching (NOASSERTION)","code_sha256":"d1843fddf89b8981","code_sha256_prefix":"d1843fddf89b8981","mcp_get_code":{"code_sha256":"d1843fddf89b8981"}},{"arxiv_id":"2308.08231","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2308.08231","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":null,"repo":"ZhangCYG/DDFHO","path":"models/enc.py","file_url":"https://github.com/ZhangCYG/DDFHO/blob/HEAD/models/enc.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, ZhangCYG/DDFHO when it was checked","code_sha256":"64048b7dbc5ece66","code_sha256_prefix":"64048b7dbc5ece66","mcp_get_code":{"code_sha256":"64048b7dbc5ece66"}},{"arxiv_id":"2307.15429","arxiv_id_is_arxiv":true,"paper":"/paper/improvable-gap-balancing-for-multi-task","title":"Improvable Gap Balancing for Multi-Task Learning","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanqidai/igb4mtl","path":"methods/SAC_Agent.py","file_url":"https://github.com/yanqidai/igb4mtl/blob/HEAD/methods/SAC_Agent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6232ce52557336a","code_sha256_prefix":"c6232ce52557336a","mcp_get_code":{"code_sha256":"c6232ce52557336a"}},{"arxiv_id":"2002.02798","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-train-your-neural-ode","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-hash-code/ffjord-rnode-finalweek-mnist","path":"lib/layers/coupling.py","file_url":"https://github.com/D-hash-code/ffjord-rnode-finalweek-mnist/blob/HEAD/lib/layers/coupling.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":"1bfb103fe91e335d","code_sha256_prefix":"1bfb103fe91e335d","mcp_get_code":{"code_sha256":"1bfb103fe91e335d"}},{"arxiv_id":"1812.05905","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-algorithms-and-applications","title":"Soft Actor-Critic Algorithms and Applications","date":"2018-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alpaficia/MOSEAC_Limo","path":"limo-sim/MOSEAC.py","file_url":"https://github.com/alpaficia/MOSEAC_Limo/blob/HEAD/limo-sim/MOSEAC.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":"9b95be60df57db51","code_sha256_prefix":"9b95be60df57db51","mcp_get_code":{"code_sha256":"9b95be60df57db51"}},{"arxiv_id":"1810.06801","arxiv_id_is_arxiv":true,"paper":"/paper/quasi-hyperbolic-momentum-and-adam-for-deep","title":"Quasi-hyperbolic momentum and Adam for deep learning","date":"2018-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/qhoptim","path":"test_qhoptim/tf/util.py","file_url":"https://github.com/facebookresearch/qhoptim/blob/HEAD/test_qhoptim/tf/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/qhoptim, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"8c61c8f36e03fd81","code_sha256_prefix":"8c61c8f36e03fd81","mcp_get_code":{"code_sha256":"8c61c8f36e03fd81"}},{"arxiv_id":"1801.04062","arxiv_id_is_arxiv":true,"paper":"/paper/mine-mutual-information-neural-estimation","title":"MINE: Mutual Information Neural Estimation","date":"2018-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shannonycj/simple-mine","path":"mine_estimator.py","file_url":"https://github.com/shannonycj/simple-mine/blob/HEAD/mine_estimator.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":"b40580a228020fe9","code_sha256_prefix":"b40580a228020fe9","mcp_get_code":{"code_sha256":"b40580a228020fe9"}},{"arxiv_id":"1703.06907","arxiv_id_is_arxiv":true,"paper":"/paper/domain-randomization-for-transferring-deep","title":"Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real World","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinjinghao/sparrow-v1","path":"train_DDQN_vector.py","file_url":"https://github.com/xinjinghao/sparrow-v1/blob/HEAD/train_DDQN_vector.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":"97434e6715c04c04","code_sha256_prefix":"97434e6715c04c04","mcp_get_code":{"code_sha256":"97434e6715c04c04"}},{"arxiv_id":"1606.01286","arxiv_id_is_arxiv":true,"paper":"/paper/incorporating-long-range-consistency-in-cnn","title":"Incorporating long-range consistency in CNN-based texture generation","date":"2016-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ty625911724/texture_generation_master","path":"vgg_model.py","file_url":"https://github.com/ty625911724/texture_generation_master/blob/HEAD/vgg_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":"b7ab84f1f3ea79ff","code_sha256_prefix":"b7ab84f1f3ea79ff","mcp_get_code":{"code_sha256":"b7ab84f1f3ea79ff"}},{"arxiv_id":"1603.04042","arxiv_id_is_arxiv":true,"paper":"/paper/deep-interactive-object-selection","title":"Deep Interactive Object Selection","date":"2016-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IntelVCL/Intseg","path":"IntSeg_Train.py","file_url":"https://github.com/IntelVCL/Intseg/blob/HEAD/IntSeg_Train.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":"374548efb213f810","code_sha256_prefix":"374548efb213f810","mcp_get_code":{"code_sha256":"374548efb213f810"}}],"record_sha256":"7e112fba0f6bbc40c362aabb0f1fdc8fa77c197f09f9e6ca65063b979f7a911b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}