{"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/total-variation","entry":"total_variation","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":8,"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":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":14,"n_places_pointer_only":2,"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":3,"ran":5,"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":"2609.04166","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-04166","title":"From Deceptive Outputs to Deceptive Mechanisms: A Causal Framework for Language-Model Deception Research","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"yshk-mxim/deceptive-mechanism","path":"replication_package/experiment1/analysis/src/deceit_analysis/metrics.py","file_url":"https://github.com/yshk-mxim/deceptive-mechanism/blob/HEAD/replication_package/experiment1/analysis/src/deceit_analysis/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a236a9c5479d07f","code_sha256_prefix":"5a236a9c5479d07f","mcp_get_code":{"code_sha256":"5a236a9c5479d07f"}},{"arxiv_id":"2603.17623","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-17623","title":"ARES: Scalable and Practical Gradient Inversion Attack in Federated Learning through Activation Recovery","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"gaow0007/ATSPrivacy","path":"inversefed/metrics.py","file_url":"https://github.com/gaow0007/ATSPrivacy/blob/HEAD/inversefed/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3d23162c75564e01","code_sha256_prefix":"3d23162c75564e01","mcp_get_code":{"code_sha256":"3d23162c75564e01"}},{"arxiv_id":"2410.17760","arxiv_id_is_arxiv":true,"paper":"/paper/topology-meets-machine-learning-an","title":"Topology meets Machine Learning: An Introduction using the Euler Characteristic Transform","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidos-lab/ECT","path":"ect_image.py","file_url":"https://github.com/aidos-lab/ECT/blob/HEAD/ect_image.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":"1c472c25567e467e","code_sha256_prefix":"1c472c25567e467e","mcp_get_code":{"code_sha256":"1c472c25567e467e"}},{"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/metrics.py","file_url":"https://github.com/tasi-lab/unlearning-inversion-attacks/blob/HEAD/recovery/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, tasi-lab/unlearning-inversion-attacks when it was checked","code_sha256":"3d23162c75564e01","code_sha256_prefix":"3d23162c75564e01","mcp_get_code":{"code_sha256":"3d23162c75564e01"}},{"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/metrics.py","file_url":"https://github.com/illidanlab/inversion-influence-function/blob/HEAD/inversefed/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3d23162c75564e01","code_sha256_prefix":"3d23162c75564e01","mcp_get_code":{"code_sha256":"3d23162c75564e01"}},{"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/metrics.py","file_url":"https://github.com/ffhibnese/GIFD/blob/HEAD/inversefed/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3d23162c75564e01","code_sha256_prefix":"3d23162c75564e01","mcp_get_code":{"code_sha256":"3d23162c75564e01"}},{"arxiv_id":"2306.00127","arxiv_id_is_arxiv":true,"paper":"/paper/surrogate-model-extension-sme-a-fast-and","title":"Surrogate Model Extension (SME): A Fast and Accurate Weight Update Attack on Federated Learning","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junyizhu-ai/surrogate_model_extension","path":"sme/Adversary/adversary.py","file_url":"https://github.com/junyizhu-ai/surrogate_model_extension/blob/HEAD/sme/Adversary/adversary.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, junyizhu-ai/surrogate_model_extension when it was checked","code_sha256":"751c3b578dca1309","code_sha256_prefix":"751c3b578dca1309","mcp_get_code":{"code_sha256":"751c3b578dca1309"}},{"arxiv_id":"2107.01154","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-leakage-resilient-federated-learning","title":"Gradient-Leakage Resilient Federated Learning","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaiyuanZh/censor","path":"inversefed/metrics.py","file_url":"https://github.com/KaiyuanZh/censor/blob/HEAD/inversefed/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3d23162c75564e01","code_sha256_prefix":"3d23162c75564e01","mcp_get_code":{"code_sha256":"3d23162c75564e01"}},{"arxiv_id":"1910.02190","arxiv_id_is_arxiv":true,"paper":"/paper/kornia-an-open-source-differentiable-computer","title":"Kornia: an Open Source Differentiable Computer Vision Library for PyTorch","date":"2019-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manyids2/kornia","path":"kornia/losses/total_variation.py","file_url":"https://github.com/manyids2/kornia/blob/HEAD/kornia/losses/total_variation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ace65b30a9175199","code_sha256_prefix":"ace65b30a9175199","mcp_get_code":{"code_sha256":"ace65b30a9175199"}},{"arxiv_id":"1907.06679","arxiv_id_is_arxiv":true,"paper":"/paper/towards-near-imperceptible-steganographic","title":"Towards Near-imperceptible Steganographic Text","date":"2019-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"falcondai/lm-steganography","path":"bucket.py","file_url":"https://github.com/falcondai/lm-steganography/blob/HEAD/bucket.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":"5c50495d583afb43","code_sha256_prefix":"5c50495d583afb43","mcp_get_code":{"code_sha256":"5c50495d583afb43"}},{"arxiv_id":"1806.07421","arxiv_id_is_arxiv":true,"paper":"/paper/rise-randomized-input-sampling-for","title":"RISE: Randomized Input Sampling for Explanation of Black-box Models","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlue-c/PyTorch-Explanations","path":"torchvex/meaningful_perturbation/mask.py","file_url":"https://github.com/vlue-c/PyTorch-Explanations/blob/HEAD/torchvex/meaningful_perturbation/mask.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":"b0396293b38da996","code_sha256_prefix":"b0396293b38da996","mcp_get_code":{"code_sha256":"b0396293b38da996"}},{"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":"utils/reconstructed.py","file_url":"https://github.com/czhang024/CI-Net/blob/HEAD/utils/reconstructed.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":"4131f97dcfa84ceb","code_sha256_prefix":"4131f97dcfa84ceb","mcp_get_code":{"code_sha256":"4131f97dcfa84ceb"}},{"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/metrics.py","file_url":"https://github.com/jeremy313/Soteria/blob/HEAD/GS_attack/inversefed/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3d23162c75564e01","code_sha256_prefix":"3d23162c75564e01","mcp_get_code":{"code_sha256":"3d23162c75564e01"}},{"arxiv_id":"Gan_GaussianOcc_Fully_Self-supervised_and_Efficient_3D_Occupancy_Estimation_with_Gaussian_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Gan_GaussianOcc_Fully_Self-supervised_and_Efficient_3D_Occupancy_Estimation_with_Gaussian_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"GANWANSHUI/GaussianOcc","path":"networks/occupancy_decoder.py","file_url":"https://github.com/GANWANSHUI/GaussianOcc/blob/HEAD/networks/occupancy_decoder.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":"9951c8a5bcd02850","code_sha256_prefix":"9951c8a5bcd02850","mcp_get_code":{"code_sha256":"9951c8a5bcd02850"}}],"record_sha256":"b8ff1e966b175a1bf0f9accd4457f3a6054ee257ab0c0b0e43f132f519c7e2e6","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}