{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GBW4P7BWOI4J6H2SC6MJH3S3T2","short_pith_number":"pith:GBW4P7BW","schema_version":"1.0","canonical_sha256":"306dc7fc3672389f1f52179893ee5b9e9914c8908d54a24ec7617e811417fbf6","source":{"kind":"arxiv","id":"2312.03262","version":3},"attestation_state":"computed","paper":{"title":"Low-Cost High-Power Membership Inference Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Philippe Liu, Reza Shokri, Sajjad Zarifzadeh","submitted_at":"2023-12-06T03:18:49Z","abstract_excerpt":"Membership inference attacks aim to detect if a particular data point was used in training a model. We design a novel statistical test to perform robust membership inference attacks (RMIA) with low computational overhead. We achieve this by a fine-grained modeling of the null hypothesis in our likelihood ratio tests, and effectively leveraging both reference models and reference population data samples. RMIA has superior test power compared with prior methods, throughout the TPR-FPR curve (even at extremely low FPR, as low as 0). Under computational constraints, where only a limited number of "},"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":"2312.03262","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-12-06T03:18:49Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"7a86581e81409585b430c9f1f84b1407de71a868bded08fc31210728746b05b0","abstract_canon_sha256":"71dd9232391d87c6adcfad3b4a71cc57684e84b0051883fb9e274d1132014313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:49.012730Z","signature_b64":"/CqLBM/huZ2Gi0VuPOTTblrDbXLvKVGPHkpx+N3S6CiQWgBfUg/Vuf7ltYXnb1aWhsazVYZXcmaOUNBH+iWrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"306dc7fc3672389f1f52179893ee5b9e9914c8908d54a24ec7617e811417fbf6","last_reissued_at":"2026-07-05T08:30:49.012253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:49.012253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Cost High-Power Membership Inference Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Philippe Liu, Reza Shokri, Sajjad Zarifzadeh","submitted_at":"2023-12-06T03:18:49Z","abstract_excerpt":"Membership inference attacks aim to detect if a particular data point was used in training a model. We design a novel statistical test to perform robust membership inference attacks (RMIA) with low computational overhead. We achieve this by a fine-grained modeling of the null hypothesis in our likelihood ratio tests, and effectively leveraging both reference models and reference population data samples. RMIA has superior test power compared with prior methods, throughout the TPR-FPR curve (even at extremely low FPR, as low as 0). Under computational constraints, where only a limited number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03262","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/2312.03262/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":"2312.03262","created_at":"2026-07-05T08:30:49.012307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.03262v3","created_at":"2026-07-05T08:30:49.012307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03262","created_at":"2026-07-05T08:30:49.012307+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBW4P7BWOI4J","created_at":"2026-07-05T08:30:49.012307+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBW4P7BWOI4J6H2S","created_at":"2026-07-05T08:30:49.012307+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBW4P7BW","created_at":"2026-07-05T08:30:49.012307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26021","citing_title":"Privacy Vulnerabilities of Attention Layers in Tabular Foundation Models and Protection of High-Risk Queries","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26257","citing_title":"Dataset Usage Inference without Shadow Models or Held-out Data","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30462","citing_title":"idSCD: Identifying Training Datasets through Semantic Correlation Descriptors","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2501.02407","citing_title":"Towards the Anonymization of the Language Modeling","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2","json":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2.json","graph_json":"https://pith.science/api/pith-number/GBW4P7BWOI4J6H2SC6MJH3S3T2/graph.json","events_json":"https://pith.science/api/pith-number/GBW4P7BWOI4J6H2SC6MJH3S3T2/events.json","paper":"https://pith.science/paper/GBW4P7BW"},"agent_actions":{"view_html":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2","download_json":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2.json","view_paper":"https://pith.science/paper/GBW4P7BW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.03262&json=true","fetch_graph":"https://pith.science/api/pith-number/GBW4P7BWOI4J6H2SC6MJH3S3T2/graph.json","fetch_events":"https://pith.science/api/pith-number/GBW4P7BWOI4J6H2SC6MJH3S3T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2/action/storage_attestation","attest_author":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2/action/author_attestation","sign_citation":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2/action/citation_signature","submit_replication":"https://pith.science/pith/GBW4P7BWOI4J6H2SC6MJH3S3T2/action/replication_record"}},"created_at":"2026-07-05T08:30:49.012307+00:00","updated_at":"2026-07-05T08:30:49.012307+00:00"}