{"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-network","entry":"build_network","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":11,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":13,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":5,"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":4,"unverified":6},"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":"2607.14018","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14018","title":"Transforming Rank: How Architecture Navigates the Spectral Pathologies of Depth","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"everettk/transforming-rank-paper","path":"norm_model.py","file_url":"https://github.com/everettk/transforming-rank-paper/blob/HEAD/norm_model.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":"e663da71a75b4ef9","code_sha256_prefix":"e663da71a75b4ef9","mcp_get_code":{"code_sha256":"e663da71a75b4ef9"}},{"arxiv_id":"2607.14018","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14018","title":"Transforming Rank: How Architecture Navigates the Spectral Pathologies of Depth","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"everettk/transforming-rank-paper","path":"coherence_model.py","file_url":"https://github.com/everettk/transforming-rank-paper/blob/HEAD/coherence_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":"90cc0b9e90bf4298","code_sha256_prefix":"90cc0b9e90bf4298","mcp_get_code":{"code_sha256":"90cc0b9e90bf4298"}},{"arxiv_id":"2601.23075","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-23075","title":"RN-D: Discretized Categorical Actors for On-Policy Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"alwaysbyx/RND-RL","path":"rnd.py","file_url":"https://github.com/alwaysbyx/RND-RL/blob/HEAD/rnd.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, alwaysbyx/RND-RL when it was checked","code_sha256":"51d67812d14ecbf6","code_sha256_prefix":"51d67812d14ecbf6","mcp_get_code":{"code_sha256":"51d67812d14ecbf6"}},{"arxiv_id":"2501.15510","arxiv_id_is_arxiv":true,"paper":"/paper/universal-image-restoration-pre-training-via","title":"Universal Image Restoration Pre-training via Degradation Classification","date":"2025-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milab-pku/dcpt","path":"basicsr/models/degradation_classification_pretrain_model.py","file_url":"https://github.com/milab-pku/dcpt/blob/HEAD/basicsr/models/degradation_classification_pretrain_model.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, milab-pku/dcpt when it was checked","code_sha256":"1364e5aeb7f4920b","code_sha256_prefix":"1364e5aeb7f4920b","mcp_get_code":{"code_sha256":"1364e5aeb7f4920b"}},{"arxiv_id":"2404.01692","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-image-super-resolution-for-image","title":"Beyond Image Super-Resolution for Image Recognition with Task-Driven Perceptual Loss","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JaehaKim97/SR4IR","path":"src/archs/cls/resnet.py","file_url":"https://github.com/JaehaKim97/SR4IR/blob/HEAD/src/archs/cls/resnet.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, JaehaKim97/SR4IR when it was checked","code_sha256":"40c29c070d07c55f","code_sha256_prefix":"40c29c070d07c55f","mcp_get_code":{"code_sha256":"40c29c070d07c55f"}},{"arxiv_id":"2304.13892","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-object-centric-generalized-value","title":"Discovering Object-Centric Generalized Value Functions From Pixels","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Somjit77/oc_gvfs","path":"agent.py","file_url":"https://github.com/Somjit77/oc_gvfs/blob/HEAD/agent.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":"4f1d87d8590a8749","code_sha256_prefix":"4f1d87d8590a8749","mcp_get_code":{"code_sha256":"4f1d87d8590a8749"}},{"arxiv_id":"2212.09518","arxiv_id_is_arxiv":true,"paper":"/paper/fedtadbench-federated-time-series-anomaly","title":"FedTADBench: Federated Time-Series Anomaly Detection Benchmark","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanxingliu2020/fedtadbench","path":"algorithms/DeepSVDD/DeepSVDD.py","file_url":"https://github.com/fanxingliu2020/fedtadbench/blob/HEAD/algorithms/DeepSVDD/DeepSVDD.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f30f025c203a642","code_sha256_prefix":"7f30f025c203a642","mcp_get_code":{"code_sha256":"7f30f025c203a642"}},{"arxiv_id":"2210.09054","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-identifiability-and-estimation-of","title":"On the Identifiability and Estimation of Causal Location-Scale Noise Models","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleximmer/loci","path":"run_individual.py","file_url":"https://github.com/aleximmer/loci/blob/HEAD/run_individual.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, aleximmer/loci when it was checked","code_sha256":"afb671fb44014507","code_sha256_prefix":"afb671fb44014507","mcp_get_code":{"code_sha256":"afb671fb44014507"}},{"arxiv_id":"2210.09054","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-identifiability-and-estimation-of","title":"On the Identifiability and Estimation of Causal Location-Scale Noise Models","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleximmer/loci","path":"generate_figures_and_tables.py","file_url":"https://github.com/aleximmer/loci/blob/HEAD/generate_figures_and_tables.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, aleximmer/loci when it was checked","code_sha256":"cefef482f657e2d0","code_sha256_prefix":"cefef482f657e2d0","mcp_get_code":{"code_sha256":"cefef482f657e2d0"}},{"arxiv_id":"2005.05960","arxiv_id_is_arxiv":true,"paper":"/paper/planning-to-explore-via-self-supervised-world","title":"Planning to Explore via Self-Supervised World Models","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kc-ml2/SimpleDreamer","path":"dreamer/utils/utils.py","file_url":"https://github.com/kc-ml2/SimpleDreamer/blob/HEAD/dreamer/utils/utils.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":"e4d4684737ef6b03","code_sha256_prefix":"e4d4684737ef6b03","mcp_get_code":{"code_sha256":"e4d4684737ef6b03"}},{"arxiv_id":"2003.10955","arxiv_id_is_arxiv":true,"paper":"/paper/maskflownet-asymmetric-feature-matching-with","title":"MaskFlownet: Asymmetric Feature Matching with Learnable Occlusion Mask","date":"2020-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/MaskFlownet","path":"network/pipeline.py","file_url":"https://github.com/microsoft/MaskFlownet/blob/HEAD/network/pipeline.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":"94b4a76fdab01f90","code_sha256_prefix":"94b4a76fdab01f90","mcp_get_code":{"code_sha256":"94b4a76fdab01f90"}},{"arxiv_id":"1903.07768","arxiv_id_is_arxiv":true,"paper":"/paper/lorenz-trajectories-prediction-travel-through","title":"Neural Networks for Lorenz Map Prediction: A Trip Through Time","date":"2019-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-Roberts/dl_ts_video","path":"quick_start/multi_channel_cnn_mxnet.py","file_url":"https://github.com/D-Roberts/dl_ts_video/blob/HEAD/quick_start/multi_channel_cnn_mxnet.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":"55705322409634b3","code_sha256_prefix":"55705322409634b3","mcp_get_code":{"code_sha256":"55705322409634b3"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanyanair/segmentation_uncertainty","path":"bunet/models/bunet.py","file_url":"https://github.com/tanyanair/segmentation_uncertainty/blob/HEAD/bunet/models/bunet.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":"141fc771997e025d","code_sha256_prefix":"141fc771997e025d","mcp_get_code":{"code_sha256":"141fc771997e025d"}}],"record_sha256":"ebf17dd74c9ad946de29265bbfc3a9c9c6a20fd0858d332339ac95872c8d525d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}