{"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/dense","entry":"Dense","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":22,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":17,"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":22,"n_samples_ran":17,"n_samples_constructed":13,"n_samples_ran_checked":17,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":4,"n_places":22,"n_places_pointer_only":10,"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":17,"unverified":5},"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.24278","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-24278","title":"Fourier Feature Pyramids for Physics-Informed Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"PredictiveIntelligenceLab/jaxpi","path":"jaxpi/archs.py","file_url":"https://github.com/PredictiveIntelligenceLab/jaxpi/blob/HEAD/jaxpi/archs.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, PredictiveIntelligenceLab/jaxpi (NOASSERTION)","code_sha256":"2ebf924aaa6dac9f","code_sha256_prefix":"2ebf924aaa6dac9f","mcp_get_code":{"code_sha256":"2ebf924aaa6dac9f"}},{"arxiv_id":"2602.16198","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16198","title":"Training-Free Adaptation of Diffusion Models via Doob's h-Transform","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"liamyzq/Doob_training_free_adaptation","path":"search/doob_search.py","file_url":"https://github.com/liamyzq/Doob_training_free_adaptation/blob/HEAD/search/doob_search.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, liamyzq/Doob_training_free_adaptation when it was checked","code_sha256":"cf2e38c8b4950425","code_sha256_prefix":"cf2e38c8b4950425","mcp_get_code":{"code_sha256":"cf2e38c8b4950425"}},{"arxiv_id":"2602.09793","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-09793","title":"Fully-automated sleep staging: multicenter validation of a generalizable deep neural network for Parkinson's disease and isolated REM sleep behavior disorder Authors","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jesperstroem/U-Sleep-for-RBD-PD","path":"ml_architectures/usleep/usleep.py","file_url":"https://github.com/jesperstroem/U-Sleep-for-RBD-PD/blob/HEAD/ml_architectures/usleep/usleep.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, jesperstroem/U-Sleep-for-RBD-PD when it was checked","code_sha256":"8aa1db90898fee4f","code_sha256_prefix":"8aa1db90898fee4f","mcp_get_code":{"code_sha256":"8aa1db90898fee4f"}},{"arxiv_id":"2601.12379","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12379","title":"Utilizing the Score of Data Distribution for Hyperspectral Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"jiahuisheng/ScoreAD","path":"model.py","file_url":"https://github.com/jiahuisheng/ScoreAD/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, jiahuisheng/ScoreAD when it was checked","code_sha256":"dd69a8392d353345","code_sha256_prefix":"dd69a8392d353345","mcp_get_code":{"code_sha256":"dd69a8392d353345"}},{"arxiv_id":"2507.11589","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.11589","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"AndreiB137/EinFields","path":"einstein_fields/nn_models/PirateNet.py","file_url":"https://github.com/AndreiB137/EinFields/blob/HEAD/einstein_fields/nn_models/PirateNet.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":"ed2eccebbe71e7cb","code_sha256_prefix":"ed2eccebbe71e7cb","mcp_get_code":{"code_sha256":"ed2eccebbe71e7cb"}},{"arxiv_id":"2408.10159","arxiv_id_is_arxiv":true,"paper":"/paper/customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akalikong/ilora","path":"model/peft/tuners/moelora.py","file_url":"https://github.com/akalikong/ilora/blob/HEAD/model/peft/tuners/moelora.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, akalikong/ilora when it was checked","code_sha256":"0f7faa1a9bdea8d3","code_sha256_prefix":"0f7faa1a9bdea8d3","mcp_get_code":{"code_sha256":"0f7faa1a9bdea8d3"}},{"arxiv_id":"2407.06124","arxiv_id_is_arxiv":true,"paper":"/paper/structured-generations-using-hierarchical","title":"Structured Generations: Using Hierarchical Clusters to guide Diffusion Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoGo175/diffuse-treevae","path":"models/model.py","file_url":"https://github.com/JoGo175/diffuse-treevae/blob/HEAD/models/model.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, JoGo175/diffuse-treevae when it was checked","code_sha256":"d45ce2ed0c59593e","code_sha256_prefix":"d45ce2ed0c59593e","mcp_get_code":{"code_sha256":"d45ce2ed0c59593e"}},{"arxiv_id":"2405.11198","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-stabilization-based-on-machine","title":"Adaptive Stabilization Based on Machine Learning for Column Generation","date":"2024-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunzhuangshen/ml-based-adaptive-stabilization","path":"ml/models/models.py","file_url":"https://github.com/yunzhuangshen/ml-based-adaptive-stabilization/blob/HEAD/ml/models/models.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, yunzhuangshen/ml-based-adaptive-stabilization when it was checked","code_sha256":"be8d8e1b1367c144","code_sha256_prefix":"be8d8e1b1367c144","mcp_get_code":{"code_sha256":"be8d8e1b1367c144"}},{"arxiv_id":"2402.13717","arxiv_id_is_arxiv":true,"paper":"/paper/neeko-leveraging-dynamic-lora-for-efficient","title":"Neeko: Leveraging Dynamic LoRA for Efficient Multi-Character Role-Playing Agent","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiyifan1023/neeko","path":"moelora/tuners/moelora.py","file_url":"https://github.com/weiyifan1023/neeko/blob/HEAD/moelora/tuners/moelora.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":"60ee43fda6864a3d","code_sha256_prefix":"60ee43fda6864a3d","mcp_get_code":{"code_sha256":"60ee43fda6864a3d"}},{"arxiv_id":"2402.08393","arxiv_id_is_arxiv":true,"paper":"/paper/nfgtransformer-equivariant-representation","title":"NfgTransformer: Equivariant Representation Learning for Normal-form Games","date":null,"month_inferred_from_arxiv_id":"2024-02","title_source":"archive","repo":"google-deepmind/nfg_transformer","path":"nfg_transformer/network.py","file_url":"https://github.com/google-deepmind/nfg_transformer/blob/HEAD/nfg_transformer/network.py","status":"unverified","verification_level":0,"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":"68b110bcde6505cc","code_sha256_prefix":"68b110bcde6505cc","mcp_get_code":{"code_sha256":"68b110bcde6505cc"}},{"arxiv_id":"2312.16427","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-embed-time-series-patches","title":"Learning to Embed Time Series Patches Independently","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WenjieDu/PyPOTS","path":"pypots/nn/modules/imputeformer/mlp.py","file_url":"https://github.com/WenjieDu/PyPOTS/blob/HEAD/pypots/nn/modules/imputeformer/mlp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c59b546356d88c3","code_sha256_prefix":"2c59b546356d88c3","mcp_get_code":{"code_sha256":"2c59b546356d88c3"}},{"arxiv_id":"2312.01456","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-policy-learning-in-stochastic-1","title":"Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlech26l/neural_martingales","path":"rsm_learner.py","file_url":"https://github.com/mlech26l/neural_martingales/blob/HEAD/rsm_learner.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":"f1e4fbbcfa50bc57","code_sha256_prefix":"f1e4fbbcfa50bc57","mcp_get_code":{"code_sha256":"f1e4fbbcfa50bc57"}},{"arxiv_id":"2311.17643","arxiv_id_is_arxiv":true,"paper":"/paper/neural-fields-with-thermal-activations-for","title":"Neural Fields with Thermal Activations for Arbitrary-Scale Super-Resolution","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prs-eth/thera","path":"model/swin_ir.py","file_url":"https://github.com/prs-eth/thera/blob/HEAD/model/swin_ir.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":"eaa96cc883399233","code_sha256_prefix":"eaa96cc883399233","mcp_get_code":{"code_sha256":"eaa96cc883399233"}},{"arxiv_id":"2307.12493","arxiv_id_is_arxiv":true,"paper":"/paper/tf-icon-diffusion-based-training-free-cross","title":"TF-ICON: Diffusion-Based Training-Free Cross-Domain Image Composition","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shilin-lu/vine","path":"vine/src/vine_turbo.py","file_url":"https://github.com/shilin-lu/vine/blob/HEAD/vine/src/vine_turbo.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, shilin-lu/vine (NOASSERTION)","code_sha256":"c3b3a2d8b7a04439","code_sha256_prefix":"c3b3a2d8b7a04439","mcp_get_code":{"code_sha256":"c3b3a2d8b7a04439"}},{"arxiv_id":"2305.16646","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-can-improve-event-prediction-1","title":"Language Models Can Improve Event Prediction by Few-Shot Abductive Reasoning","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilampard/lamp","path":"models/ke_anhp/_model.py","file_url":"https://github.com/ilampard/lamp/blob/HEAD/models/ke_anhp/_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9a448be7eb920dac","code_sha256_prefix":"9a448be7eb920dac","mcp_get_code":{"code_sha256":"9a448be7eb920dac"}},{"arxiv_id":"2303.04791","arxiv_id_is_arxiv":true,"paper":"/paper/ewald-based-long-range-message-passing-for","title":"Ewald-based Long-Range Message Passing for Molecular Graphs","date":"2023-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arthurkosmala/EwaldMP","path":"ocpmodels/models/ewald_block.py","file_url":"https://github.com/arthurkosmala/EwaldMP/blob/HEAD/ocpmodels/models/ewald_block.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","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, arthurkosmala/EwaldMP (NOASSERTION)","code_sha256":"71e2f19131d26ded","code_sha256_prefix":"71e2f19131d26ded","mcp_get_code":{"code_sha256":"71e2f19131d26ded"}},{"arxiv_id":"2210.05811","arxiv_id_is_arxiv":true,"paper":"/paper/deep-counterfactual-estimation-with","title":"Deep Counterfactual Estimation with Categorical Background Variables","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edebrouwer/cfqp","path":"condgen/models/deepscm.py","file_url":"https://github.com/edebrouwer/cfqp/blob/HEAD/condgen/models/deepscm.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":"94d4f204a05beb0f","code_sha256_prefix":"94d4f204a05beb0f","mcp_get_code":{"code_sha256":"94d4f204a05beb0f"}},{"arxiv_id":"2210.04123","arxiv_id_is_arxiv":true,"paper":"/paper/dimes-a-differentiable-meta-solver-for","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dimesteam/dimes","path":"MIS/solvers/intel_treesearch/NPHard/gcn/models.py","file_url":"https://github.com/dimesteam/dimes/blob/HEAD/MIS/solvers/intel_treesearch/NPHard/gcn/models.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":"fec438a4bb79bc5e","code_sha256_prefix":"fec438a4bb79bc5e","mcp_get_code":{"code_sha256":"fec438a4bb79bc5e"}},{"arxiv_id":"2110.14446","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkhuang81/UniFilter","path":"non-homo/models.py","file_url":"https://github.com/kkhuang81/UniFilter/blob/HEAD/non-homo/models.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":"382d674885c1d7a8","code_sha256_prefix":"382d674885c1d7a8","mcp_get_code":{"code_sha256":"382d674885c1d7a8"}},{"arxiv_id":"2106.02248","arxiv_id_is_arxiv":true,"paper":"/paper/knowing-the-no-match-entity-alignment-with","title":"Knowing the No-match: Entity Alignment with Dangling Cases","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/OpenEA","path":"src/openea/approaches/gmnn.py","file_url":"https://github.com/nju-websoft/OpenEA/blob/HEAD/src/openea/approaches/gmnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, nju-websoft/OpenEA, is not in the permissive set Syntology serves inline","code_sha256":"9bccf1fdbfb84b5d","code_sha256_prefix":"9bccf1fdbfb84b5d","mcp_get_code":{"code_sha256":"9bccf1fdbfb84b5d"}},{"arxiv_id":"2102.03150","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-message-passing-for-the","title":"Equivariant message passing for the prediction of tensorial properties and molecular spectra","date":"2021-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learningmatter-mit/NeuralForceField","path":"nff/nn/models/painn.py","file_url":"https://github.com/learningmatter-mit/NeuralForceField/blob/HEAD/nff/nn/models/painn.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":"dc349a5755ad2883","code_sha256_prefix":"dc349a5755ad2883","mcp_get_code":{"code_sha256":"dc349a5755ad2883"}},{"arxiv_id":"1711.00851","arxiv_id_is_arxiv":true,"paper":"/paper/provable-defenses-against-adversarial","title":"Provable defenses against adversarial examples via the convex outer adversarial polytope","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fra31/mmr-universal","path":"kolter_wong/convex_adversarial/dual_network.py","file_url":"https://github.com/fra31/mmr-universal/blob/HEAD/kolter_wong/convex_adversarial/dual_network.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":"bc7271d7a6811f02","code_sha256_prefix":"bc7271d7a6811f02","mcp_get_code":{"code_sha256":"bc7271d7a6811f02"}}],"record_sha256":"95af31a7c6b97b9b73b163d5e073bb3895ad1ae822f40414643fa63a4b798c89","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}