{"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/networkblock","entry":"NetworkBlock","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":5,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":8,"n_samples_constructed":6,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":9,"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":0,"ran_fixture":0,"ran":8,"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":"2410.23091","arxiv_id_is_arxiv":true,"paper":"/paper/causaldiff-causality-inspired-disentanglement","title":"CausalDiff: Causality-Inspired Disentanglement via Diffusion Model for Adversarial Defense","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cas-aisafetybasicresearchgroup/causaldiff","path":"model/unet_autoenc.py","file_url":"https://github.com/cas-aisafetybasicresearchgroup/causaldiff/blob/HEAD/model/unet_autoenc.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":"7e8b3a3ffd864e29","code_sha256_prefix":"7e8b3a3ffd864e29","mcp_get_code":{"code_sha256":"7e8b3a3ffd864e29"}},{"arxiv_id":"2307.11030","arxiv_id_is_arxiv":true,"paper":"/paper/cluster-aware-semi-supervised-learning","title":"Cluster-aware Semi-supervised Learning: Relational Knowledge Distillation Provably Learns Clustering","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyjdongyijun/semi_supervised_knowledge_distillation","path":"models/wideresnet.py","file_url":"https://github.com/dyjdongyijun/semi_supervised_knowledge_distillation/blob/HEAD/models/wideresnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4636e780898f2ee","code_sha256_prefix":"c4636e780898f2ee","mcp_get_code":{"code_sha256":"c4636e780898f2ee"}},{"arxiv_id":"2111.12139","arxiv_id_is_arxiv":true,"paper":"/paper/cheblienet-invariant-spectral-graph-nns","title":"ChebLieNet: Invariant Spectral Graph NNs Turned Equivariant by Riemannian Geometry on Lie Groups","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haguettaz/cheblienet","path":"cheblienet/nn/models/chebnets.py","file_url":"https://github.com/haguettaz/cheblienet/blob/HEAD/cheblienet/nn/models/chebnets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e3858afd2801cd25","code_sha256_prefix":"e3858afd2801cd25","mcp_get_code":{"code_sha256":"e3858afd2801cd25"}},{"arxiv_id":"2010.08001","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-entropy-adversarial-data-augmentation","title":"Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustness","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"garyzhao/ME-ADA","path":"model_cifar.py","file_url":"https://github.com/garyzhao/ME-ADA/blob/HEAD/model_cifar.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6aa4a39a16fbc4fc","code_sha256_prefix":"6aa4a39a16fbc4fc","mcp_get_code":{"code_sha256":"6aa4a39a16fbc4fc"}},{"arxiv_id":"1905.02249","arxiv_id_is_arxiv":true,"paper":"/paper/mixmatch-a-holistic-approach-to-semi","title":"MixMatch: A Holistic Approach to Semi-Supervised Learning","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atinghosh/mixmatch_pytorch","path":"network_mod.py","file_url":"https://github.com/atinghosh/mixmatch_pytorch/blob/HEAD/network_mod.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, atinghosh/mixmatch_pytorch when it was checked","code_sha256":"2950d5425e9dd18b","code_sha256_prefix":"2950d5425e9dd18b","mcp_get_code":{"code_sha256":"2950d5425e9dd18b"}},{"arxiv_id":"1605.07146","arxiv_id_is_arxiv":true,"paper":"/paper/wide-residual-networks","title":"Wide Residual Networks","date":"2016-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertmillan/adversarial-training-pytorch","path":"model.py","file_url":"https://github.com/albertmillan/adversarial-training-pytorch/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db462e0cc17e19f9","code_sha256_prefix":"db462e0cc17e19f9","mcp_get_code":{"code_sha256":"db462e0cc17e19f9"}},{"arxiv_id":"1605.07146","arxiv_id_is_arxiv":true,"paper":"/paper/wide-residual-networks","title":"Wide Residual Networks","date":"2016-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sour4bh/cifar-10","path":"wide_resnet.py","file_url":"https://github.com/sour4bh/cifar-10/blob/HEAD/wide_resnet.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, sour4bh/cifar-10 when it was checked","code_sha256":"dc96cf9441e16644","code_sha256_prefix":"dc96cf9441e16644","mcp_get_code":{"code_sha256":"dc96cf9441e16644"}},{"arxiv_id":"1605.07146","arxiv_id_is_arxiv":true,"paper":"/paper/wide-residual-networks","title":"Wide Residual Networks","date":"2016-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishabh135/foodx","path":"wideresnet.py","file_url":"https://github.com/rishabh135/foodx/blob/HEAD/wideresnet.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, rishabh135/foodx when it was checked","code_sha256":"75491d4aaaddaa7c","code_sha256_prefix":"75491d4aaaddaa7c","mcp_get_code":{"code_sha256":"75491d4aaaddaa7c"}},{"arxiv_id":"1605.07146","arxiv_id_is_arxiv":true,"paper":"/paper/wide-residual-networks","title":"Wide Residual Networks","date":"2016-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanivbl6/fixup","path":"model.py","file_url":"https://github.com/yanivbl6/fixup/blob/HEAD/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, yanivbl6/fixup when it was checked","code_sha256":"39279dbee87752b7","code_sha256_prefix":"39279dbee87752b7","mcp_get_code":{"code_sha256":"39279dbee87752b7"}}],"record_sha256":"9d3bba7444f7639eac5d008dcee6fcd7ce044be0a405f87802e1971ee8153b63","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}