{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4SLJEFYWANQEHU72A4XGHT3LCZ","short_pith_number":"pith:4SLJEFYW","schema_version":"1.0","canonical_sha256":"e496921716036043d3fa072e63cf6b165ad140c337dd286c1bd1789365b7ff84","source":{"kind":"arxiv","id":"2001.10648","version":2},"attestation_state":"computed","paper":{"title":"Modelling and Quantifying Membership Information Leakage in Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Farhad Farokhi, Mohamed Ali Kaafar","submitted_at":"2020-01-29T00:42:08Z","abstract_excerpt":"Machine learning models have been shown to be vulnerable to membership inference attacks, i.e., inferring whether individuals' data have been used for training models. The lack of understanding about factors contributing success of these attacks motivates the need for modelling membership information leakage using information theory and for investigating properties of machine learning models and training algorithms that can reduce membership information leakage. We use conditional mutual information leakage to measure the amount of information leakage from the trained machine learning model ab"},"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":"2001.10648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-29T00:42:08Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"b89b19ac76c46f8824562e7bbd54f255360909a97deee98d7993881707d6fd44","abstract_canon_sha256":"03bd6dd41094b75f875028b3a8ecfd27b9638d10d04fd9a476146dc211da33e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:47.549571Z","signature_b64":"/H4YaTVBw2c0HdGqPqSR5DbTmwGYcA9l2AuaV8avtUPhL6+Gcz+21xfAIGfrGgRIiGB7+dgpRomZ0lnpfZ8ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e496921716036043d3fa072e63cf6b165ad140c337dd286c1bd1789365b7ff84","last_reissued_at":"2026-07-05T00:58:47.549101Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:47.549101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modelling and Quantifying Membership Information Leakage in Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Farhad Farokhi, Mohamed Ali Kaafar","submitted_at":"2020-01-29T00:42:08Z","abstract_excerpt":"Machine learning models have been shown to be vulnerable to membership inference attacks, i.e., inferring whether individuals' data have been used for training models. The lack of understanding about factors contributing success of these attacks motivates the need for modelling membership information leakage using information theory and for investigating properties of machine learning models and training algorithms that can reduce membership information leakage. We use conditional mutual information leakage to measure the amount of information leakage from the trained machine learning model ab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10648","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/2001.10648/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":"2001.10648","created_at":"2026-07-05T00:58:47.549171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.10648v2","created_at":"2026-07-05T00:58:47.549171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10648","created_at":"2026-07-05T00:58:47.549171+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SLJEFYWANQE","created_at":"2026-07-05T00:58:47.549171+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SLJEFYWANQEHU72","created_at":"2026-07-05T00:58:47.549171+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SLJEFYW","created_at":"2026-07-05T00:58:47.549171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02913","citing_title":"Real-Time Privacy Risk Measurement with Privacy Tokens for Gradient Leakage","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ","json":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ.json","graph_json":"https://pith.science/api/pith-number/4SLJEFYWANQEHU72A4XGHT3LCZ/graph.json","events_json":"https://pith.science/api/pith-number/4SLJEFYWANQEHU72A4XGHT3LCZ/events.json","paper":"https://pith.science/paper/4SLJEFYW"},"agent_actions":{"view_html":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ","download_json":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ.json","view_paper":"https://pith.science/paper/4SLJEFYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.10648&json=true","fetch_graph":"https://pith.science/api/pith-number/4SLJEFYWANQEHU72A4XGHT3LCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4SLJEFYWANQEHU72A4XGHT3LCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ/action/storage_attestation","attest_author":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ/action/author_attestation","sign_citation":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ/action/citation_signature","submit_replication":"https://pith.science/pith/4SLJEFYWANQEHU72A4XGHT3LCZ/action/replication_record"}},"created_at":"2026-07-05T00:58:47.549171+00:00","updated_at":"2026-07-05T00:58:47.549171+00:00"}