{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FU2DXHRUL2NJLHKKP2PLKYJKXV","short_pith_number":"pith:FU2DXHRU","schema_version":"1.0","canonical_sha256":"2d343b9e345e9a959d4a7e9eb5612abd77aa6681b82a1d68d849d805d76f2695","source":{"kind":"arxiv","id":"2402.09478","version":3},"attestation_state":"computed","paper":{"title":"Data Reconstruction Attacks and Defenses: A Systematic Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Qi Lei, Sheng Liu, Yuxiao Chen, Zihan Wang","submitted_at":"2024-02-13T05:06:34Z","abstract_excerpt":"Reconstruction attacks and defenses are essential in understanding the data leakage problem in machine learning. However, prior work has centered around empirical observations of gradient inversion attacks, lacks theoretical grounding, and cannot disentangle the usefulness of defending methods from the computational limitation of attacking methods. In this work, we propose to view the problem as an inverse problem, enabling us to theoretically and systematically evaluate the data reconstruction attack. On various defense methods, we derived the algorithmic upper bound and the matching (in feat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.09478","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-02-13T05:06:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65486a8dd448811bfe51e44746fee7fc5b74ddaa0f918ad0eba62edf2abe3790","abstract_canon_sha256":"a027a3efe5efd2fa87f1bcdb1632165839789500ad389ee5ab34a981729b914d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:24.251950Z","signature_b64":"izyiQuzxD1zK50SFvU0gI+AxK50ph9jMTBw2eqwKKL9NDah1vDpc71dJU88plqwQLkcuDqultSFdew0jxhsoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d343b9e345e9a959d4a7e9eb5612abd77aa6681b82a1d68d849d805d76f2695","last_reissued_at":"2026-07-05T10:37:24.251333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:24.251333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Reconstruction Attacks and Defenses: A Systematic Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Qi Lei, Sheng Liu, Yuxiao Chen, Zihan Wang","submitted_at":"2024-02-13T05:06:34Z","abstract_excerpt":"Reconstruction attacks and defenses are essential in understanding the data leakage problem in machine learning. However, prior work has centered around empirical observations of gradient inversion attacks, lacks theoretical grounding, and cannot disentangle the usefulness of defending methods from the computational limitation of attacking methods. In this work, we propose to view the problem as an inverse problem, enabling us to theoretically and systematically evaluate the data reconstruction attack. On various defense methods, we derived the algorithmic upper bound and the matching (in feat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09478","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.09478/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.09478","created_at":"2026-07-05T10:37:24.251403+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09478v3","created_at":"2026-07-05T10:37:24.251403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09478","created_at":"2026-07-05T10:37:24.251403+00:00"},{"alias_kind":"pith_short_12","alias_value":"FU2DXHRUL2NJ","created_at":"2026-07-05T10:37:24.251403+00:00"},{"alias_kind":"pith_short_16","alias_value":"FU2DXHRUL2NJLHKK","created_at":"2026-07-05T10:37:24.251403+00:00"},{"alias_kind":"pith_short_8","alias_value":"FU2DXHRU","created_at":"2026-07-05T10:37:24.251403+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.15842","citing_title":"Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learning","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV","json":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV.json","graph_json":"https://pith.science/api/pith-number/FU2DXHRUL2NJLHKKP2PLKYJKXV/graph.json","events_json":"https://pith.science/api/pith-number/FU2DXHRUL2NJLHKKP2PLKYJKXV/events.json","paper":"https://pith.science/paper/FU2DXHRU"},"agent_actions":{"view_html":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV","download_json":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV.json","view_paper":"https://pith.science/paper/FU2DXHRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09478&json=true","fetch_graph":"https://pith.science/api/pith-number/FU2DXHRUL2NJLHKKP2PLKYJKXV/graph.json","fetch_events":"https://pith.science/api/pith-number/FU2DXHRUL2NJLHKKP2PLKYJKXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV/action/storage_attestation","attest_author":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV/action/author_attestation","sign_citation":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV/action/citation_signature","submit_replication":"https://pith.science/pith/FU2DXHRUL2NJLHKKP2PLKYJKXV/action/replication_record"}},"created_at":"2026-07-05T10:37:24.251403+00:00","updated_at":"2026-07-05T10:37:24.251403+00:00"}