{"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/filter-state-dict","entry":"filter_state_dict","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":6,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":1,"ran_fixture":0,"ran":2,"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":"2503.14118","arxiv_id_is_arxiv":true,"paper":"/paper/pet-mad-a-universal-interatomic-potential-for","title":"PET-MAD, a universal interatomic potential for advanced materials modeling","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lab-cosmo/pet-mad","path":"src/upet/nvalchemi/utils.py","file_url":"https://github.com/lab-cosmo/pet-mad/blob/HEAD/src/upet/nvalchemi/utils.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":"9aafd104f104cd47","code_sha256_prefix":"9aafd104f104cd47","mcp_get_code":{"code_sha256":"9aafd104f104cd47"}},{"arxiv_id":"2408.09458","arxiv_id_is_arxiv":true,"paper":"/paper/g2face-high-fidelity-reversible-face","title":"G2Face: High-Fidelity Reversible Face Anonymization via Generative and Geometric Priors","date":"2024-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harxis/g2face","path":"model/d3dfr/networks.py","file_url":"https://github.com/harxis/g2face/blob/HEAD/model/d3dfr/networks.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":"0f6c5532e66c554c","code_sha256_prefix":"0f6c5532e66c554c","mcp_get_code":{"code_sha256":"0f6c5532e66c554c"}},{"arxiv_id":"2405.16262","arxiv_id_is_arxiv":true,"paper":"/paper/layer-aware-analysis-of-catastrophic","title":"Layer-Aware Analysis of Catastrophic Overfitting: Revealing the Pseudo-Robust Shortcut Dependency","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2024_ICML_LAP","path":"CIFAR10/eval_aa.py","file_url":"https://github.com/tmllab/2024_ICML_LAP/blob/HEAD/CIFAR10/eval_aa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from inspire-group/variation-regularization, and GitHub detected no licence in that repository when it was checked","code_sha256":"18b797b7c88af64d","code_sha256_prefix":"18b797b7c88af64d","mcp_get_code":{"code_sha256":"18b797b7c88af64d"}},{"arxiv_id":"2401.08503","arxiv_id_is_arxiv":true,"paper":"/paper/real3d-portrait-one-shot-realistic-3d-talking","title":"Real3D-Portrait: One-shot Realistic 3D Talking Portrait Synthesis","date":"2024-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yerfor/Real3DPortrait","path":"deep_3drecon/deep_3drecon_models/networks.py","file_url":"https://github.com/yerfor/Real3DPortrait/blob/HEAD/deep_3drecon/deep_3drecon_models/networks.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":"0f6c5532e66c554c","code_sha256_prefix":"0f6c5532e66c554c","mcp_get_code":{"code_sha256":"0f6c5532e66c554c"}},{"arxiv_id":"2210.03543","arxiv_id_is_arxiv":true,"paper":"/paper/a2-efficient-automated-attacker-for-boosting","title":"A2: Efficient Automated Attacker for Boosting Adversarial Training","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alipay/A2-efficient-automated-attacker-for-boosting-adversarial-training","path":"attack.py","file_url":"https://github.com/alipay/A2-efficient-automated-attacker-for-boosting-adversarial-training/blob/HEAD/attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from inspire-group/variation-regularization, and GitHub detected no licence in that repository when it was checked","code_sha256":"18b797b7c88af64d","code_sha256_prefix":"18b797b7c88af64d","mcp_get_code":{"code_sha256":"18b797b7c88af64d"}},{"arxiv_id":"2206.08675","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-robust-overfitting-of","title":"Understanding Robust Overfitting of Adversarial Training and Beyond","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"18b797b7c88af64d","code_sha256_prefix":"18b797b7c88af64d","mcp_get_code":{"code_sha256":"18b797b7c88af64d"}},{"arxiv_id":"2204.13779","arxiv_id_is_arxiv":true,"paper":"/paper/formulating-robustness-against-unforeseen","title":"Formulating Robustness Against Unforeseen Attacks","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"inspire-group/variation-regularization","path":"eval/eval_var.py","file_url":"https://github.com/inspire-group/variation-regularization/blob/HEAD/eval/eval_var.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, inspire-group/variation-regularization when it was checked","code_sha256":"18b797b7c88af64d","code_sha256_prefix":"18b797b7c88af64d","mcp_get_code":{"code_sha256":"18b797b7c88af64d"}},{"arxiv_id":"2107.14110","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-adversarial-robustness-via-test","title":"Enhancing Adversarial Robustness via Test-time Transformation Ensembling","date":"2021-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juancprzs/TTE","path":"experiments/adv_weight_pert.py","file_url":"https://github.com/juancprzs/TTE/blob/HEAD/experiments/adv_weight_pert.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, juancprzs/TTE when it was checked","code_sha256":"18b797b7c88af64d","code_sha256_prefix":"18b797b7c88af64d","mcp_get_code":{"code_sha256":"18b797b7c88af64d"}},{"arxiv_id":"2103.14347","arxiv_id_is_arxiv":true,"paper":"/paper/combating-adversaries-with-anti-adversaries","title":"Combating Adversaries with Anti-Adversaries","date":"2021-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MotasemAlfarra/Combating-Adversaries-with-Anti-Adversaries","path":"experiments/adv_weight_pert.py","file_url":"https://github.com/MotasemAlfarra/Combating-Adversaries-with-Anti-Adversaries/blob/HEAD/experiments/adv_weight_pert.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from inspire-group/variation-regularization, and GitHub detected no licence in that repository when it was checked","code_sha256":"18b797b7c88af64d","code_sha256_prefix":"18b797b7c88af64d","mcp_get_code":{"code_sha256":"18b797b7c88af64d"}},{"arxiv_id":"2007.04118","arxiv_id_is_arxiv":true,"paper":"/paper/delving-into-the-adversarial-robustness-on","title":"RobFR: Benchmarking Adversarial Robustness on Face Recognition","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/realsafe","path":"ares/model/cifar10_cls.py","file_url":"https://github.com/thu-ml/realsafe/blob/HEAD/ares/model/cifar10_cls.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":"68e05d78529d3a4b","code_sha256_prefix":"68e05d78529d3a4b","mcp_get_code":{"code_sha256":"68e05d78529d3a4b"}},{"arxiv_id":"1903.08527","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-3d-face-reconstruction-with-weakly","title":"Accurate 3D Face Reconstruction with Weakly-Supervised Learning: From Single Image to Image Set","date":"2019-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sicxu/Deep3DFaceRecon_pytorch","path":"models/networks.py","file_url":"https://github.com/sicxu/Deep3DFaceRecon_pytorch/blob/HEAD/models/networks.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":"0f6c5532e66c554c","code_sha256_prefix":"0f6c5532e66c554c","mcp_get_code":{"code_sha256":"0f6c5532e66c554c"}},{"arxiv_id":"Wang_3D_Face_Reconstruction_with_the_Geometric_Guidance_of_Facial_Part_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_3D_Face_Reconstruction_with_the_Geometric_Guidance_of_Facial_Part_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wang-zidu/3DDFA-V3","path":"model/networks.py","file_url":"https://github.com/wang-zidu/3DDFA-V3/blob/HEAD/model/networks.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":"0f6c5532e66c554c","code_sha256_prefix":"0f6c5532e66c554c","mcp_get_code":{"code_sha256":"0f6c5532e66c554c"}}],"record_sha256":"e65c6c26b3e4e3d625e2951d769a3a4e988732c6eb860661a9c2cf63f85cf5a7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}