{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RM2NRRW647SEX45OLGU4PGKFYM","short_pith_number":"pith:RM2NRRW6","canonical_record":{"source":{"id":"1602.01409","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-03T18:56:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"84c4543b6daa4833da5903bb778f3485f950724497cb8674eb1f8b0d6e638011","abstract_canon_sha256":"40252730d6363f307ca31fa5fb479d12cc4592f7c9fe9de828abbdb75163b6d2"},"schema_version":"1.0"},"canonical_sha256":"8b34d8c6dee7e44bf3ae59a9c79945c317e75502eaac8780874e8845aa3b8102","source":{"kind":"arxiv","id":"1602.01409","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01409","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01409v4","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01409","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"RM2NRRW647SE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RM2NRRW647SEX45O","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RM2NRRW6","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RM2NRRW647SEX45OLGU4PGKFYM","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01409","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-03T18:56:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"84c4543b6daa4833da5903bb778f3485f950724497cb8674eb1f8b0d6e638011","abstract_canon_sha256":"40252730d6363f307ca31fa5fb479d12cc4592f7c9fe9de828abbdb75163b6d2"},"schema_version":"1.0"},"canonical_sha256":"8b34d8c6dee7e44bf3ae59a9c79945c317e75502eaac8780874e8845aa3b8102","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:39.352751Z","signature_b64":"z1hkSiwBqazjgURBhmQVCgUiFcn91+okpxeN8rWuiHu0gWoQeXWgOUaDpz32AworwSgPkxYY2ZgoL8yaQHDBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b34d8c6dee7e44bf3ae59a9c79945c317e75502eaac8780874e8845aa3b8102","last_reissued_at":"2026-05-18T00:55:39.352239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:39.352239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01409","source_version":4,"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-18T00:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3AmTqz5jXsNMNiLRm9x1yUfZi320hWsb5QaY45GNLCmZqdFooi0Pslqcf3VcdrDAlcsHaWHL/BvhnYs6YFC0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:23.882904Z"},"content_sha256":"8535e7dd99c3a834cdbcf35c21992b40e3e9f397ce378fc6598969aa0cbba044","schema_version":"1.0","event_id":"sha256:8535e7dd99c3a834cdbcf35c21992b40e3e9f397ce378fc6598969aa0cbba044"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RM2NRRW647SEX45OLGU4PGKFYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal De-Anonymization in Random Graphs with Community Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SI","authors_text":"Efe Onaran, Elza Erkip, Siddharth Garg","submitted_at":"2016-02-03T18:56:15Z","abstract_excerpt":"Anonymized social network graphs published for academic or advertisement purposes are subject to de-anonymization attacks by leveraging side information in the form of a second, public social network graph correlated with the anonymized graph. This is because the two are from the same underlying graph of true social relationships. In this paper, we (i) characterize the maximum a posteriori (MAP) estimates of user identities for the anonymized graph and (ii) provide sufficient conditions for successful de-anonymization for underlying graphs with community structure. Our results generalize prior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01409","kind":"arxiv","version":4},"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-18T00:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fzkrm8cpOSrkeXZcuRxzck5/i/VazIXOUWVe2Zs2FpaR7o8FajL/hEhHBFCzgcWgtqnHZI/NPJJ700wQUNQNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:23.883309Z"},"content_sha256":"013254a142e93deea7c109955df2a49703d2f7d78a9bb9248cf78f253cd8c131","schema_version":"1.0","event_id":"sha256:013254a142e93deea7c109955df2a49703d2f7d78a9bb9248cf78f253cd8c131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RM2NRRW647SEX45OLGU4PGKFYM/bundle.json","state_url":"https://pith.science/pith/RM2NRRW647SEX45OLGU4PGKFYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RM2NRRW647SEX45OLGU4PGKFYM/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-06T18:03:23Z","links":{"resolver":"https://pith.science/pith/RM2NRRW647SEX45OLGU4PGKFYM","bundle":"https://pith.science/pith/RM2NRRW647SEX45OLGU4PGKFYM/bundle.json","state":"https://pith.science/pith/RM2NRRW647SEX45OLGU4PGKFYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RM2NRRW647SEX45OLGU4PGKFYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RM2NRRW647SEX45OLGU4PGKFYM","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":"40252730d6363f307ca31fa5fb479d12cc4592f7c9fe9de828abbdb75163b6d2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-03T18:56:15Z","title_canon_sha256":"84c4543b6daa4833da5903bb778f3485f950724497cb8674eb1f8b0d6e638011"},"schema_version":"1.0","source":{"id":"1602.01409","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01409","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01409v4","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01409","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"RM2NRRW647SE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RM2NRRW647SEX45O","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RM2NRRW6","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:013254a142e93deea7c109955df2a49703d2f7d78a9bb9248cf78f253cd8c131","target":"graph","created_at":"2026-05-18T00:55:39Z","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":"Anonymized social network graphs published for academic or advertisement purposes are subject to de-anonymization attacks by leveraging side information in the form of a second, public social network graph correlated with the anonymized graph. This is because the two are from the same underlying graph of true social relationships. In this paper, we (i) characterize the maximum a posteriori (MAP) estimates of user identities for the anonymized graph and (ii) provide sufficient conditions for successful de-anonymization for underlying graphs with community structure. Our results generalize prior","authors_text":"Efe Onaran, Elza Erkip, Siddharth Garg","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-03T18:56:15Z","title":"Optimal De-Anonymization in Random Graphs with Community Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01409","kind":"arxiv","version":4},"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:8535e7dd99c3a834cdbcf35c21992b40e3e9f397ce378fc6598969aa0cbba044","target":"record","created_at":"2026-05-18T00:55:39Z","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":"40252730d6363f307ca31fa5fb479d12cc4592f7c9fe9de828abbdb75163b6d2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-03T18:56:15Z","title_canon_sha256":"84c4543b6daa4833da5903bb778f3485f950724497cb8674eb1f8b0d6e638011"},"schema_version":"1.0","source":{"id":"1602.01409","kind":"arxiv","version":4}},"canonical_sha256":"8b34d8c6dee7e44bf3ae59a9c79945c317e75502eaac8780874e8845aa3b8102","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b34d8c6dee7e44bf3ae59a9c79945c317e75502eaac8780874e8845aa3b8102","first_computed_at":"2026-05-18T00:55:39.352239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:39.352239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z1hkSiwBqazjgURBhmQVCgUiFcn91+okpxeN8rWuiHu0gWoQeXWgOUaDpz32AworwSgPkxYY2ZgoL8yaQHDBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:39.352751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01409","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8535e7dd99c3a834cdbcf35c21992b40e3e9f397ce378fc6598969aa0cbba044","sha256:013254a142e93deea7c109955df2a49703d2f7d78a9bb9248cf78f253cd8c131"],"state_sha256":"9b4ab7e97cbc269a4ffe235e4b7d26c1669c1c15259bfb4268d540bc935f48db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3XDUGOpL27Huul//MXz8BTmHps659bk8cM343enAVhmvC7RsYO4Taylz9PR0hHLDE5KwHe2O+rgRHcN5lBLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:03:23.887172Z","bundle_sha256":"5d4810075842a33c610928f72d71fe17b41136ced26ee5c55913357cbf4bb17a"}}