{"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/construct-model","entry":"construct_model","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":3,"n_papers_ran_no_instrument_failure":1,"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":11,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"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":2,"ran_fixture":0,"ran":1,"unverified":8},"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":"2405.15243","arxiv_id_is_arxiv":true,"paper":"/paper/less-is-more-discovering-concise-network","title":"Less is More: Discovering Concise Network Explanations","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkondapa/discoveringconcisenetworkexplanations","path":"models/utils.py","file_url":"https://github.com/nkondapa/discoveringconcisenetworkexplanations/blob/HEAD/models/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, nkondapa/discoveringconcisenetworkexplanations when it was checked","code_sha256":"98a37ddb76b59998","code_sha256_prefix":"98a37ddb76b59998","mcp_get_code":{"code_sha256":"98a37ddb76b59998"}},{"arxiv_id":"2404.07662","arxiv_id_is_arxiv":true,"paper":"/paper/pinnacle-pinn-adaptive-collocation-and","title":"PINNACLE: PINN Adaptive ColLocation and Experimental points selection","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apivich-h/pinnacle","path":"pinnacle_code/deepxde_al_patch/model_loader.py","file_url":"https://github.com/apivich-h/pinnacle/blob/HEAD/pinnacle_code/deepxde_al_patch/model_loader.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, apivich-h/pinnacle when it was checked","code_sha256":"672318dd6fafb58b","code_sha256_prefix":"672318dd6fafb58b","mcp_get_code":{"code_sha256":"672318dd6fafb58b"}},{"arxiv_id":"2404.03233","arxiv_id_is_arxiv":true,"paper":"/paper/learn-what-you-want-to-unlearn-unlearning","title":"Learn What You Want to Unlearn: Unlearning Inversion Attacks against Machine Unlearning","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"tasi-lab/unlearning-inversion-attacks","path":"recovery/nn/models.py","file_url":"https://github.com/tasi-lab/unlearning-inversion-attacks/blob/HEAD/recovery/nn/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, tasi-lab/unlearning-inversion-attacks when it was checked","code_sha256":"755e669a609b810f","code_sha256_prefix":"755e669a609b810f","mcp_get_code":{"code_sha256":"755e669a609b810f"}},{"arxiv_id":"2309.13016","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-deep-gradient-leakage-via-1","title":"Understanding Deep Gradient Leakage via Inversion Influence Functions","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"illidanlab/inversion-influence-function","path":"inversefed/nn/models.py","file_url":"https://github.com/illidanlab/inversion-influence-function/blob/HEAD/inversefed/nn/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":"02eff7fd03b9447e","code_sha256_prefix":"02eff7fd03b9447e","mcp_get_code":{"code_sha256":"02eff7fd03b9447e"}},{"arxiv_id":"2308.04699","arxiv_id_is_arxiv":true,"paper":"/paper/gifd-a-generative-gradient-inversion-method","title":"GIFD: A Generative Gradient Inversion Method with Feature Domain Optimization","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ffhibnese/GIFD","path":"inversefed/nn/models.py","file_url":"https://github.com/ffhibnese/GIFD/blob/HEAD/inversefed/nn/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":"1e0ee02f7f2be4e0","code_sha256_prefix":"1e0ee02f7f2be4e0","mcp_get_code":{"code_sha256":"1e0ee02f7f2be4e0"}},{"arxiv_id":"2201.06769","arxiv_id_is_arxiv":true,"paper":"/paper/defer-distributed-edge-inference-for-deep","title":"DEFER: Distributed Edge Inference for Deep Neural Networks","date":"2022-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anrgusc/defer","path":"src/dag_util.py","file_url":"https://github.com/anrgusc/defer/blob/HEAD/src/dag_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74d50cec99584fd7","code_sha256_prefix":"74d50cec99584fd7","mcp_get_code":{"code_sha256":"74d50cec99584fd7"}},{"arxiv_id":"1810.02309","arxiv_id_is_arxiv":true,"paper":"/paper/learning-compressed-transforms-with-low","title":"Learning Compressed Transforms with Low Displacement Rank","date":"2018-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/structured-nets","path":"pytorch/models/nets.py","file_url":"https://github.com/HazyResearch/structured-nets/blob/HEAD/pytorch/models/nets.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":"f16e103b2cd798b5","code_sha256_prefix":"f16e103b2cd798b5","mcp_get_code":{"code_sha256":"f16e103b2cd798b5"}},{"arxiv_id":"1804.05296","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-against-medical-deep","title":"Adversarial Attacks Against Medical Deep Learning Systems","date":"2018-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sgfin/adversarial-medicine","path":"train_models/train_model.py","file_url":"https://github.com/sgfin/adversarial-medicine/blob/HEAD/train_models/train_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":"826517c053cb6c3b","code_sha256_prefix":"826517c053cb6c3b","mcp_get_code":{"code_sha256":"826517c053cb6c3b"}},{"arxiv_id":"1802.07182","arxiv_id_is_arxiv":true,"paper":"/paper/the-gaussian-process-autoregressive","title":"The Gaussian Process Autoregressive Regression Model (GPAR)","date":"2018-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wesselb/gpar","path":"gpar/model.py","file_url":"https://github.com/wesselb/gpar/blob/HEAD/gpar/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c9982c49ada534e","code_sha256_prefix":"9c9982c49ada534e","mcp_get_code":{"code_sha256":"9c9982c49ada534e"}},{"arxiv_id":"Zhang_Generative_Gradient_Inversion_via_Over-Parameterized_Networks_in_Federated_Learning_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhang_Generative_Gradient_Inversion_via_Over-Parameterized_Networks_in_Federated_Learning_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"czhang024/CI-Net","path":"model/model_architectures.py","file_url":"https://github.com/czhang024/CI-Net/blob/HEAD/model/model_architectures.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":"1923cb30bd66afc8","code_sha256_prefix":"1923cb30bd66afc8","mcp_get_code":{"code_sha256":"1923cb30bd66afc8"}},{"arxiv_id":"Sun_Soteria_Provable_Defense_Against_Privacy_Leakage_in_Federated_Learning_From_CVPR_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Sun_Soteria_Provable_Defense_Against_Privacy_Leakage_in_Federated_Learning_From_CVPR_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jeremy313/Soteria","path":"GS_attack/inversefed/nn/models.py","file_url":"https://github.com/jeremy313/Soteria/blob/HEAD/GS_attack/inversefed/nn/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":"57502d3101593960","code_sha256_prefix":"57502d3101593960","mcp_get_code":{"code_sha256":"57502d3101593960"}}],"record_sha256":"3e155c8ec16901654ff2c25a715642bb258a81fc1e656971019cd1a2b647dc66","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}