{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KJDXNHSHQIPSHHSR7PKPXJ5IJI","short_pith_number":"pith:KJDXNHSH","schema_version":"1.0","canonical_sha256":"5247769e47821f239e51fbd4fba7a84a1bbc56c624cc7ea2f81ea29482c7fcb7","source":{"kind":"arxiv","id":"2503.07482","version":2},"attestation_state":"computed","paper":{"title":"How does Bayesian Sampling help Membership Inference Attacks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Feng Zhou, Hongxin Wei, Wenyu Jiang, Zhenlong Liu","submitted_at":"2025-03-10T15:58:43Z","abstract_excerpt":"Membership Inference Attacks (MIAs) aim to estimate whether a specific data point was used in the training of a given model. Existing state-of-the-art attacks typically rely on training multiple reference models to approximate the conditional score distribution for individual data points, which leads to significant computational overhead and limits their practical applicability. In this work, we propose a novel approach -- Bayesian Membership Inference Attack (BMIA), which performs conditional attack through Bayesian sampling. Specifically, we apply Laplace approximation to a single reference "},"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":"2503.07482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-10T15:58:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e5ae8ec5464d1d24e683d47782147c164aef469fd39aa866a06b531152051e54","abstract_canon_sha256":"382317350d1a7272cfd35d2039d82b6edcdcfd448cf615d6f2fa8f7684caef4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:59.835732Z","signature_b64":"Cm63YedRgC7bHR/gQ4ceLMju89uGXvNnRFqwvekTxpcq0CL60yKGH0L5S81csr8a+8ovyQAq/+5KxVziH8OZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5247769e47821f239e51fbd4fba7a84a1bbc56c624cc7ea2f81ea29482c7fcb7","last_reissued_at":"2026-05-26T02:04:59.835143Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:59.835143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How does Bayesian Sampling help Membership Inference Attacks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Feng Zhou, Hongxin Wei, Wenyu Jiang, Zhenlong Liu","submitted_at":"2025-03-10T15:58:43Z","abstract_excerpt":"Membership Inference Attacks (MIAs) aim to estimate whether a specific data point was used in the training of a given model. Existing state-of-the-art attacks typically rely on training multiple reference models to approximate the conditional score distribution for individual data points, which leads to significant computational overhead and limits their practical applicability. In this work, we propose a novel approach -- Bayesian Membership Inference Attack (BMIA), which performs conditional attack through Bayesian sampling. Specifically, we apply Laplace approximation to a single reference "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07482","kind":"arxiv","version":2},"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/2503.07482/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":"2503.07482","created_at":"2026-05-26T02:04:59.835240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.07482v2","created_at":"2026-05-26T02:04:59.835240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07482","created_at":"2026-05-26T02:04:59.835240+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJDXNHSHQIPS","created_at":"2026-05-26T02:04:59.835240+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJDXNHSHQIPSHHSR","created_at":"2026-05-26T02:04:59.835240+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJDXNHSH","created_at":"2026-05-26T02:04:59.835240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21543","citing_title":"Provable Joint Decontamination for Benchmarking Multiple Large Language Models","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI","json":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI.json","graph_json":"https://pith.science/api/pith-number/KJDXNHSHQIPSHHSR7PKPXJ5IJI/graph.json","events_json":"https://pith.science/api/pith-number/KJDXNHSHQIPSHHSR7PKPXJ5IJI/events.json","paper":"https://pith.science/paper/KJDXNHSH"},"agent_actions":{"view_html":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI","download_json":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI.json","view_paper":"https://pith.science/paper/KJDXNHSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.07482&json=true","fetch_graph":"https://pith.science/api/pith-number/KJDXNHSHQIPSHHSR7PKPXJ5IJI/graph.json","fetch_events":"https://pith.science/api/pith-number/KJDXNHSHQIPSHHSR7PKPXJ5IJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI/action/storage_attestation","attest_author":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI/action/author_attestation","sign_citation":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI/action/citation_signature","submit_replication":"https://pith.science/pith/KJDXNHSHQIPSHHSR7PKPXJ5IJI/action/replication_record"}},"created_at":"2026-05-26T02:04:59.835240+00:00","updated_at":"2026-05-26T02:04:59.835240+00:00"}