{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LUY47WAISGK7RKQOZHUJYIK5TB","short_pith_number":"pith:LUY47WAI","schema_version":"1.0","canonical_sha256":"5d31cfd8089195f8aa0ec9e89c215d984c46285edfd9f6f50aa14bb9a4ebfebe","source":{"kind":"arxiv","id":"1408.1276","version":2},"attestation_state":"computed","paper":{"title":"An Automated Social Graph De-anonymization Technique","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CR","authors_text":"George Danezis, Kumar Sharad","submitted_at":"2014-08-06T13:42:48Z","abstract_excerpt":"We present a generic and automated approach to re-identifying nodes in anonymized social networks which enables novel anonymization techniques to be quickly evaluated. It uses machine learning (decision forests) to matching pairs of nodes in disparate anonymized sub-graphs. The technique uncovers artefacts and invariants of any black-box anonymization scheme from a small set of examples. Despite a high degree of automation, classification succeeds with significant true positive rates even when small false positive rates are sought. Our evaluation uses publicly available real world datasets to "},"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":"1408.1276","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2014-08-06T13:42:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"aeaeeca43a64b0088d7ffc392e42aee1747a75dccb61f3cdb699e3a312efce6f","abstract_canon_sha256":"816efcb6e09ccb92f0f0b1e3090dfaf193610834fc47a6a7c7242d0a0c7a637a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.614161Z","signature_b64":"anSCM84U5Ww7hLRQS3TT28Fc87Qo6M5Jx4WgzwaI2eQLtD3tENUJQAzruadUcfXxF/bRGIy2e9hcQ4csoCfOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d31cfd8089195f8aa0ec9e89c215d984c46285edfd9f6f50aa14bb9a4ebfebe","last_reissued_at":"2026-05-18T02:45:40.613647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.613647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Automated Social Graph De-anonymization Technique","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CR","authors_text":"George Danezis, Kumar Sharad","submitted_at":"2014-08-06T13:42:48Z","abstract_excerpt":"We present a generic and automated approach to re-identifying nodes in anonymized social networks which enables novel anonymization techniques to be quickly evaluated. It uses machine learning (decision forests) to matching pairs of nodes in disparate anonymized sub-graphs. The technique uncovers artefacts and invariants of any black-box anonymization scheme from a small set of examples. Despite a high degree of automation, classification succeeds with significant true positive rates even when small false positive rates are sought. Our evaluation uses publicly available real world datasets to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1276","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":""},"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":"1408.1276","created_at":"2026-05-18T02:45:40.613726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1276v2","created_at":"2026-05-18T02:45:40.613726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1276","created_at":"2026-05-18T02:45:40.613726+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUY47WAISGK7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUY47WAISGK7RKQO","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUY47WAI","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB","json":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB.json","graph_json":"https://pith.science/api/pith-number/LUY47WAISGK7RKQOZHUJYIK5TB/graph.json","events_json":"https://pith.science/api/pith-number/LUY47WAISGK7RKQOZHUJYIK5TB/events.json","paper":"https://pith.science/paper/LUY47WAI"},"agent_actions":{"view_html":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB","download_json":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB.json","view_paper":"https://pith.science/paper/LUY47WAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1276&json=true","fetch_graph":"https://pith.science/api/pith-number/LUY47WAISGK7RKQOZHUJYIK5TB/graph.json","fetch_events":"https://pith.science/api/pith-number/LUY47WAISGK7RKQOZHUJYIK5TB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/action/storage_attestation","attest_author":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/action/author_attestation","sign_citation":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/action/citation_signature","submit_replication":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/action/replication_record"}},"created_at":"2026-05-18T02:45:40.613726+00:00","updated_at":"2026-05-18T02:45:40.613726+00:00"}