{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2CLF6AGDYW4EO5T3M32KQDOYMO","short_pith_number":"pith:2CLF6AGD","schema_version":"1.0","canonical_sha256":"d0965f00c3c5b847767b66f4a80dd863bbfe0ae45921f367da0a46f1ac7a3bd5","source":{"kind":"arxiv","id":"2111.09076","version":3},"attestation_state":"computed","paper":{"title":"To Trust or Not To Trust Prediction Scores for Membership Inference Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Dominik Hintersdorf, Kristian Kersting, Lukas Struppek","submitted_at":"2021-11-17T12:39:04Z","abstract_excerpt":"Membership inference attacks (MIAs) aim to determine whether a specific sample was used to train a predictive model. Knowing this may indeed lead to a privacy breach. Most MIAs, however, make use of the model's prediction scores - the probability of each output given some input - following the intuition that the trained model tends to behave differently on its training data. We argue that this is a fallacy for many modern deep network architectures. Consequently, MIAs will miserably fail since overconfidence leads to high false-positive rates not only on known domains but also on out-of-distri"},"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":"2111.09076","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-17T12:39:04Z","cross_cats_sorted":["cs.CR","cs.CV"],"title_canon_sha256":"b73179b453d9cc0b8ae2d0aaae9eba0040e0cc1c8e9739e990f6d973eb664e19","abstract_canon_sha256":"4c8e4c71cdb8934a660b344840c33afa216ae45d7bc74902b0e47d044126bcd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:12.036852Z","signature_b64":"M+dmgQYbl3v30/VA/Fod+K0kNnVlhNiVTQ+i6F3+/Hee9VlloSZeb9ltcqroB8QSOv84ViT3W3zQP3Qu88VdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0965f00c3c5b847767b66f4a80dd863bbfe0ae45921f367da0a46f1ac7a3bd5","last_reissued_at":"2026-07-05T05:35:12.036406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:12.036406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"To Trust or Not To Trust Prediction Scores for Membership Inference Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Dominik Hintersdorf, Kristian Kersting, Lukas Struppek","submitted_at":"2021-11-17T12:39:04Z","abstract_excerpt":"Membership inference attacks (MIAs) aim to determine whether a specific sample was used to train a predictive model. Knowing this may indeed lead to a privacy breach. Most MIAs, however, make use of the model's prediction scores - the probability of each output given some input - following the intuition that the trained model tends to behave differently on its training data. We argue that this is a fallacy for many modern deep network architectures. Consequently, MIAs will miserably fail since overconfidence leads to high false-positive rates not only on known domains but also on out-of-distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09076","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/2111.09076/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":"2111.09076","created_at":"2026-07-05T05:35:12.036462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.09076v3","created_at":"2026-07-05T05:35:12.036462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09076","created_at":"2026-07-05T05:35:12.036462+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CLF6AGDYW4E","created_at":"2026-07-05T05:35:12.036462+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CLF6AGDYW4EO5T3","created_at":"2026-07-05T05:35:12.036462+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CLF6AGD","created_at":"2026-07-05T05:35:12.036462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20074","citing_title":"An Out-Of-Distribution Membership Inference Attack Approach for Cross-Domain Graph Attacks","ref_index":2021,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO","json":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO.json","graph_json":"https://pith.science/api/pith-number/2CLF6AGDYW4EO5T3M32KQDOYMO/graph.json","events_json":"https://pith.science/api/pith-number/2CLF6AGDYW4EO5T3M32KQDOYMO/events.json","paper":"https://pith.science/paper/2CLF6AGD"},"agent_actions":{"view_html":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO","download_json":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO.json","view_paper":"https://pith.science/paper/2CLF6AGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.09076&json=true","fetch_graph":"https://pith.science/api/pith-number/2CLF6AGDYW4EO5T3M32KQDOYMO/graph.json","fetch_events":"https://pith.science/api/pith-number/2CLF6AGDYW4EO5T3M32KQDOYMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO/action/storage_attestation","attest_author":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO/action/author_attestation","sign_citation":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO/action/citation_signature","submit_replication":"https://pith.science/pith/2CLF6AGDYW4EO5T3M32KQDOYMO/action/replication_record"}},"created_at":"2026-07-05T05:35:12.036462+00:00","updated_at":"2026-07-05T05:35:12.036462+00:00"}