{"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/get-net","entry":"get_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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":2,"ran_fixture":0,"ran":2,"unverified":3},"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.11884","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11884","title":"Sobolev Regularized MMD Gradient Flow","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"FerdTian/SrMMD","path":"src/generative/student_teacher/trainer.py","file_url":"https://github.com/FerdTian/SrMMD/blob/HEAD/src/generative/student_teacher/trainer.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, FerdTian/SrMMD when it was checked","code_sha256":"5f250cec6f2ad6f3","code_sha256_prefix":"5f250cec6f2ad6f3","mcp_get_code":{"code_sha256":"5f250cec6f2ad6f3"}},{"arxiv_id":"2409.14980","arxiv_id_is_arxiv":true,"paper":"/paper/de-regularized-maximum-mean-discrepancy","title":"(De)-regularized Maximum Mean Discrepancy Gradient Flow","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hudsonchen/drmmd","path":"student_teacher/trainer.py","file_url":"https://github.com/hudsonchen/drmmd/blob/HEAD/student_teacher/trainer.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, hudsonchen/drmmd when it was checked","code_sha256":"5f250cec6f2ad6f3","code_sha256_prefix":"5f250cec6f2ad6f3","mcp_get_code":{"code_sha256":"5f250cec6f2ad6f3"}},{"arxiv_id":"2402.02316","arxiv_id_is_arxiv":true,"paper":"/paper/your-diffusion-model-is-secretly-a","title":"Diffusion Models are Certifiably Robust Classifiers","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanranchen/NoisedDiffusionClassifiers","path":"defenses/HighLevelGuidedDenoiser/inceptionresnet.py","file_url":"https://github.com/huanranchen/NoisedDiffusionClassifiers/blob/HEAD/defenses/HighLevelGuidedDenoiser/inceptionresnet.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, huanranchen/NoisedDiffusionClassifiers when it was checked","code_sha256":"f995d502b1dc9eac","code_sha256_prefix":"f995d502b1dc9eac","mcp_get_code":{"code_sha256":"f995d502b1dc9eac"}},{"arxiv_id":"2402.02316","arxiv_id_is_arxiv":true,"paper":"/paper/your-diffusion-model-is-secretly-a","title":"Diffusion Models are Certifiably Robust Classifiers","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanranchen/NoisedDiffusionClassifiers","path":"defenses/HighLevelGuidedDenoiser/resnet.py","file_url":"https://github.com/huanranchen/NoisedDiffusionClassifiers/blob/HEAD/defenses/HighLevelGuidedDenoiser/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, huanranchen/NoisedDiffusionClassifiers when it was checked","code_sha256":"d84e622ec1d0d9f7","code_sha256_prefix":"d84e622ec1d0d9f7","mcp_get_code":{"code_sha256":"d84e622ec1d0d9f7"}},{"arxiv_id":"2310.07152","arxiv_id_is_arxiv":true,"paper":"/paper/no-privacy-left-outside-on-the-in-security-of","title":"No Privacy Left Outside: On the (In-)Security of TEE-Shielded DNN Partition for On-Device ML","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziqi-zhang/teeslice-artifact","path":"membership-inference/knockoff_train.py","file_url":"https://github.com/ziqi-zhang/teeslice-artifact/blob/HEAD/membership-inference/knockoff_train.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, ziqi-zhang/teeslice-artifact when it was checked","code_sha256":"64e9bca534ec9a24","code_sha256_prefix":"64e9bca534ec9a24","mcp_get_code":{"code_sha256":"64e9bca534ec9a24"}},{"arxiv_id":"2202.01402","arxiv_id_is_arxiv":true,"paper":"/paper/galaxy-graph-based-active-learning-at-the","title":"GALAXY: Graph-based Active Learning at the Extreme","date":"2022-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jifanz/GALAXY","path":"src/bait/model.py","file_url":"https://github.com/jifanz/GALAXY/blob/HEAD/src/bait/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":"98b6004d6b335def","code_sha256_prefix":"98b6004d6b335def","mcp_get_code":{"code_sha256":"98b6004d6b335def"}},{"arxiv_id":"2110.04545","arxiv_id_is_arxiv":true,"paper":"/paper/towards-data-free-domain-generalization","title":"Towards Data-Free Domain Generalization","date":"2021-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaokunChen245/DFDG","path":"dfdg/training/train_student_syn_img.py","file_url":"https://github.com/HaokunChen245/DFDG/blob/HEAD/dfdg/training/train_student_syn_img.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9966b8ec681f4404","code_sha256_prefix":"9966b8ec681f4404","mcp_get_code":{"code_sha256":"9966b8ec681f4404"}},{"arxiv_id":"1906.04370","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-mean-discrepancy-gradient-flow","title":"Maximum Mean Discrepancy Gradient Flow","date":"2019-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/MMD-gradient-flow","path":"trainer.py","file_url":"https://github.com/MichaelArbel/MMD-gradient-flow/blob/HEAD/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from FerdTian/SrMMD, and GitHub detected no licence in that repository when it was checked","code_sha256":"5f250cec6f2ad6f3","code_sha256_prefix":"5f250cec6f2ad6f3","mcp_get_code":{"code_sha256":"5f250cec6f2ad6f3"}},{"arxiv_id":"1803.07031","arxiv_id_is_arxiv":true,"paper":"/paper/factorised-spatial-representation-learning","title":"Factorised spatial representation learning: application in semi-supervised myocardial segmentation","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agis85/spatial_factorisation","path":"sdnet.py","file_url":"https://github.com/agis85/spatial_factorisation/blob/HEAD/sdnet.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":"a9aaff12acd6c28d","code_sha256_prefix":"a9aaff12acd6c28d","mcp_get_code":{"code_sha256":"a9aaff12acd6c28d"}}],"record_sha256":"fda90a7cd9abd6842145b36e37538ca2b505a695829c6bf4682a011ff0f336fe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}