{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YBTERMGBOTHULXBHJTIFH44YRA","short_pith_number":"pith:YBTERMGB","schema_version":"1.0","canonical_sha256":"c06648b0c174cf45dc274cd053f3988834d36d46ff84603970a9bfc0715c6a76","source":{"kind":"arxiv","id":"2410.06814","version":1},"attestation_state":"computed","paper":{"title":"Defending Membership Inference Attacks via Privacy-aware Sparsity Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hengxiang Zhang, Hongxin Wei, Qiang Hu","submitted_at":"2024-10-09T12:13:49Z","abstract_excerpt":"Over-parameterized models are typically vulnerable to membership inference attacks, which aim to determine whether a specific sample is included in the training of a given model. Previous Weight regularizations (e.g., L1 regularization) typically impose uniform penalties on all parameters, leading to a suboptimal tradeoff between model utility and privacy. In this work, we first show that only a small fraction of parameters substantially impact the privacy risk. In light of this, we propose Privacy-aware Sparsity Tuning (PAST), a simple fix to the L1 Regularization, by employing adaptive penal"},"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":"2410.06814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-09T12:13:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"24571e20f755f468d453a8ac8b0b1d7f8f1e125cee5b7c2b92e2d6e10671288b","abstract_canon_sha256":"c8372c2ad9f0d4cd538e1868609d8adba5cd134240fb3e20837b2155d8a7dbe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:07.236524Z","signature_b64":"z0QhkX/Z3RFNPvkmDezoU/W/yt3TBbVlQ/bAsUKRrIgVUO/BuRv0B8c/ZicR99kOtjWdAk/f3g8+vIfwFxrOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c06648b0c174cf45dc274cd053f3988834d36d46ff84603970a9bfc0715c6a76","last_reissued_at":"2026-07-05T09:18:07.236079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:07.236079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defending Membership Inference Attacks via Privacy-aware Sparsity Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hengxiang Zhang, Hongxin Wei, Qiang Hu","submitted_at":"2024-10-09T12:13:49Z","abstract_excerpt":"Over-parameterized models are typically vulnerable to membership inference attacks, which aim to determine whether a specific sample is included in the training of a given model. Previous Weight regularizations (e.g., L1 regularization) typically impose uniform penalties on all parameters, leading to a suboptimal tradeoff between model utility and privacy. In this work, we first show that only a small fraction of parameters substantially impact the privacy risk. In light of this, we propose Privacy-aware Sparsity Tuning (PAST), a simple fix to the L1 Regularization, by employing adaptive penal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06814","kind":"arxiv","version":1},"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/2410.06814/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":"2410.06814","created_at":"2026-07-05T09:18:07.236152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.06814v1","created_at":"2026-07-05T09:18:07.236152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06814","created_at":"2026-07-05T09:18:07.236152+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBTERMGBOTHU","created_at":"2026-07-05T09:18:07.236152+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBTERMGBOTHULXBH","created_at":"2026-07-05T09:18:07.236152+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBTERMGB","created_at":"2026-07-05T09:18:07.236152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.21197","citing_title":"Toward Efficient Membership Inference Attacks against Federated Large Language Models: A Projection Residual Approach","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA","json":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA.json","graph_json":"https://pith.science/api/pith-number/YBTERMGBOTHULXBHJTIFH44YRA/graph.json","events_json":"https://pith.science/api/pith-number/YBTERMGBOTHULXBHJTIFH44YRA/events.json","paper":"https://pith.science/paper/YBTERMGB"},"agent_actions":{"view_html":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA","download_json":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA.json","view_paper":"https://pith.science/paper/YBTERMGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.06814&json=true","fetch_graph":"https://pith.science/api/pith-number/YBTERMGBOTHULXBHJTIFH44YRA/graph.json","fetch_events":"https://pith.science/api/pith-number/YBTERMGBOTHULXBHJTIFH44YRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA/action/storage_attestation","attest_author":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA/action/author_attestation","sign_citation":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA/action/citation_signature","submit_replication":"https://pith.science/pith/YBTERMGBOTHULXBHJTIFH44YRA/action/replication_record"}},"created_at":"2026-07-05T09:18:07.236152+00:00","updated_at":"2026-07-05T09:18:07.236152+00:00"}