{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LUY47WAISGK7RKQOZHUJYIK5TB","short_pith_number":"pith:LUY47WAI","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"},"canonical_sha256":"5d31cfd8089195f8aa0ec9e89c215d984c46285edfd9f6f50aa14bb9a4ebfebe","source":{"kind":"arxiv","id":"1408.1276","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1276","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1276v2","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1276","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"LUY47WAISGK7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LUY47WAISGK7RKQO","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LUY47WAI","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LUY47WAISGK7RKQOZHUJYIK5TB","target":"record","payload":{"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"},"canonical_sha256":"5d31cfd8089195f8aa0ec9e89c215d984c46285edfd9f6f50aa14bb9a4ebfebe","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"},"source_kind":"arxiv","source_id":"1408.1276","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2HCog8O2l3Afc2ZmHIm2n5OfqnQ7lPky0WfOLGpiC7456X0rSE8gaDyxbjiUB5s4KhxwRDj2F4NUtN2ALdiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T00:24:45.941649Z"},"content_sha256":"e7561a1dc9809a4ea1b647e586b29f7a92f5cba3cceac74625b26ee15a4be80c","schema_version":"1.0","event_id":"sha256:e7561a1dc9809a4ea1b647e586b29f7a92f5cba3cceac74625b26ee15a4be80c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LUY47WAISGK7RKQOZHUJYIK5TB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5etPcq+OGx8O7Ijsx/d6K+xAggUw8yZRjuquSZp8zVzTsZssOWO3CV2oeWHl7B2sAzapuTyDZYcRgMFdTRJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T00:24:45.942199Z"},"content_sha256":"9d516bfd171e8d39a86f5a1fb3f5e588be25d35630b71e8e773c312825aa98a7","schema_version":"1.0","event_id":"sha256:9d516bfd171e8d39a86f5a1fb3f5e588be25d35630b71e8e773c312825aa98a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/bundle.json","state_url":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUY47WAISGK7RKQOZHUJYIK5TB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T00:24:45Z","links":{"resolver":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB","bundle":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/bundle.json","state":"https://pith.science/pith/LUY47WAISGK7RKQOZHUJYIK5TB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUY47WAISGK7RKQOZHUJYIK5TB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LUY47WAISGK7RKQOZHUJYIK5TB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"816efcb6e09ccb92f0f0b1e3090dfaf193610834fc47a6a7c7242d0a0c7a637a","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2014-08-06T13:42:48Z","title_canon_sha256":"aeaeeca43a64b0088d7ffc392e42aee1747a75dccb61f3cdb699e3a312efce6f"},"schema_version":"1.0","source":{"id":"1408.1276","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1276","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1276v2","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1276","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"LUY47WAISGK7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LUY47WAISGK7RKQO","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LUY47WAI","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:9d516bfd171e8d39a86f5a1fb3f5e588be25d35630b71e8e773c312825aa98a7","target":"graph","created_at":"2026-05-18T02:45:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"George Danezis, Kumar Sharad","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2014-08-06T13:42:48Z","title":"An Automated Social Graph De-anonymization Technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1276","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e7561a1dc9809a4ea1b647e586b29f7a92f5cba3cceac74625b26ee15a4be80c","target":"record","created_at":"2026-05-18T02:45:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"816efcb6e09ccb92f0f0b1e3090dfaf193610834fc47a6a7c7242d0a0c7a637a","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2014-08-06T13:42:48Z","title_canon_sha256":"aeaeeca43a64b0088d7ffc392e42aee1747a75dccb61f3cdb699e3a312efce6f"},"schema_version":"1.0","source":{"id":"1408.1276","kind":"arxiv","version":2}},"canonical_sha256":"5d31cfd8089195f8aa0ec9e89c215d984c46285edfd9f6f50aa14bb9a4ebfebe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d31cfd8089195f8aa0ec9e89c215d984c46285edfd9f6f50aa14bb9a4ebfebe","first_computed_at":"2026-05-18T02:45:40.613647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:40.613647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"anSCM84U5Ww7hLRQS3TT28Fc87Qo6M5Jx4WgzwaI2eQLtD3tENUJQAzruadUcfXxF/bRGIy2e9hcQ4csoCfOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:40.614161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1276","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7561a1dc9809a4ea1b647e586b29f7a92f5cba3cceac74625b26ee15a4be80c","sha256:9d516bfd171e8d39a86f5a1fb3f5e588be25d35630b71e8e773c312825aa98a7"],"state_sha256":"baf6c7e7f292082d26a915fbd81477d85664e05ef18f505a6dcf0f83901432bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSQyFbrvUgRg9daWCKiLvOHLQpkrVCE82r5+68F/lm6w1Q771X3GD4NQWWWE40SbzrrndyrY+hcg/4TB0UD0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T00:24:45.944906Z","bundle_sha256":"5b6b47afffaeff94a6ad45dbe0f3fbe3d7997d9c8b2dad029f2717eb33b1dba7"}}