{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:MZ6TK4QD6KOLDWFQEXA6VRFT7W","short_pith_number":"pith:MZ6TK4QD","schema_version":"1.0","canonical_sha256":"667d357203f29cb1d8b025c1eac4b3fd993228bdc3d61c5f0c4a0c89a3ad1850","source":{"kind":"arxiv","id":"cs/0610105","version":2},"attestation_state":"computed","paper":{"title":"How To Break Anonymity of the Netflix Prize Dataset","license":"","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CR","authors_text":"Arvind Narayanan, Vitaly Shmatikov","submitted_at":"2006-10-18T06:03:41Z","abstract_excerpt":"We present a new class of statistical de-anonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. Our techniques are robust to perturbation in the data and tolerate some mistakes in the adversary's background knowledge.\n  We apply our de-anonymization methodology to the Netflix Prize dataset, which contains anonymous movie ratings of 500,000 subscribers of Netflix, the world's largest online movie rental service. We demonstrate that an adversary who knows only a little bit about an individual subscriber can easil"},"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":"cs/0610105","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.CR","submitted_at":"2006-10-18T06:03:41Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"27814a207511301920483768cb6895454618e835377b27a49758f7e5ccd1c071","abstract_canon_sha256":"261025370d7f6dbb4794e46c2005ebd89d985e1402aa42717bdad747380763ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:05:46.294028Z","signature_b64":"tAOARCFCSsWxabZSy5H9+1/swfH1mF12jVYm9IJKHmbtsTnSX3SdEk5KIERJnQpAB+zzHRCfvx99rWLssQdoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"667d357203f29cb1d8b025c1eac4b3fd993228bdc3d61c5f0c4a0c89a3ad1850","last_reissued_at":"2026-07-04T15:05:46.293649Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:05:46.293649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How To Break Anonymity of the Netflix Prize Dataset","license":"","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CR","authors_text":"Arvind Narayanan, Vitaly Shmatikov","submitted_at":"2006-10-18T06:03:41Z","abstract_excerpt":"We present a new class of statistical de-anonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. Our techniques are robust to perturbation in the data and tolerate some mistakes in the adversary's background knowledge.\n  We apply our de-anonymization methodology to the Netflix Prize dataset, which contains anonymous movie ratings of 500,000 subscribers of Netflix, the world's largest online movie rental service. We demonstrate that an adversary who knows only a little bit about an individual subscriber can easil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610105","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/cs/0610105/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":"cs/0610105","created_at":"2026-07-04T15:05:46.293705+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0610105v2","created_at":"2026-07-04T15:05:46.293705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610105","created_at":"2026-07-04T15:05:46.293705+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZ6TK4QD6KOL","created_at":"2026-07-04T15:05:46.293705+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZ6TK4QD6KOLDWFQ","created_at":"2026-07-04T15:05:46.293705+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZ6TK4QD","created_at":"2026-07-04T15:05:46.293705+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2606.10333","citing_title":"Privacy-Preserving Credit Risk Prediction with Alternative Data","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04683","citing_title":"Minimax Private Estimation of Smooth Optimal-Transport Maps","ref_index":82,"is_internal_anchor":true},{"citing_arxiv_id":"1907.10387","citing_title":"Privacy Parameter Variation Using RAPPOR on a Malware Dataset","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19644","citing_title":"Inferring Sensitive Attributes from Knowledge Graph Embeddings: Attack and Defense Strategies","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2506.17185","citing_title":"A Common Pool of Privacy Problems: Legal and Technical Lessons from a Large-Scale Web-Scraped Machine Learning Dataset","ref_index":94,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04901","citing_title":"On the (In-)Security of the Shuffling Defense in the Transformer Secure Inference","ref_index":176,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W","json":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W.json","graph_json":"https://pith.science/api/pith-number/MZ6TK4QD6KOLDWFQEXA6VRFT7W/graph.json","events_json":"https://pith.science/api/pith-number/MZ6TK4QD6KOLDWFQEXA6VRFT7W/events.json","paper":"https://pith.science/paper/MZ6TK4QD"},"agent_actions":{"view_html":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W","download_json":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W.json","view_paper":"https://pith.science/paper/MZ6TK4QD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0610105&json=true","fetch_graph":"https://pith.science/api/pith-number/MZ6TK4QD6KOLDWFQEXA6VRFT7W/graph.json","fetch_events":"https://pith.science/api/pith-number/MZ6TK4QD6KOLDWFQEXA6VRFT7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W/action/storage_attestation","attest_author":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W/action/author_attestation","sign_citation":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W/action/citation_signature","submit_replication":"https://pith.science/pith/MZ6TK4QD6KOLDWFQEXA6VRFT7W/action/replication_record"}},"created_at":"2026-07-04T15:05:46.293705+00:00","updated_at":"2026-07-04T15:05:46.293705+00:00"}