{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BZ3563243BZL6X6VDDQS3IV3ID","short_pith_number":"pith:BZ356324","canonical_record":{"source":{"id":"1408.1209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-06T08:31:50Z","cross_cats_sorted":[],"title_canon_sha256":"ddd357349303590ca1a1b406a92e3038e3894dbca51605518395a38bbb239622","abstract_canon_sha256":"797ab94d1e35134647c250c16ee0314c75b95e2e32990d8eeab43dfa552d78b2"},"schema_version":"1.0"},"canonical_sha256":"0e77df6f5cd872bf5fd518e12da2bb40d56b077e7c6f0c95ea1ea2c8465eb3fa","source":{"kind":"arxiv","id":"1408.1209","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1209","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1209v1","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1209","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"BZ3563243BZL","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BZ3563243BZL6X6V","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BZ356324","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BZ3563243BZL6X6VDDQS3IV3ID","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-06T08:31:50Z","cross_cats_sorted":[],"title_canon_sha256":"ddd357349303590ca1a1b406a92e3038e3894dbca51605518395a38bbb239622","abstract_canon_sha256":"797ab94d1e35134647c250c16ee0314c75b95e2e32990d8eeab43dfa552d78b2"},"schema_version":"1.0"},"canonical_sha256":"0e77df6f5cd872bf5fd518e12da2bb40d56b077e7c6f0c95ea1ea2c8465eb3fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:47.955787Z","signature_b64":"U+ZYU9GP8rL8xBC0rmKUezC/zF52UpVtsJbK6edB0MQ1Rvc1J/z9Hu7LH1U8pJHW+7Fls+J5P0KA44sBS7GVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e77df6f5cd872bf5fd518e12da2bb40d56b077e7c6f0c95ea1ea2c8465eb3fa","last_reissued_at":"2026-05-18T02:45:47.955269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:47.955269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1209","source_version":1,"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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FM77SL+FA0Uo1XKBhabOoNTgn88P4ALWFQdnlsGtUJu5VQSbMnswqaQOBxmBB/vJzdbJa7c1Kt7n6dBGwgeyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T03:17:22.013117Z"},"content_sha256":"f224b11293e650650e0ca8346811b992ce4489b39decae99f712850bf7e92aa1","schema_version":"1.0","event_id":"sha256:f224b11293e650650e0ca8346811b992ce4489b39decae99f712850bf7e92aa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BZ3563243BZL6X6VDDQS3IV3ID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anonymizing Social Graphs via Uncertainty Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Abdessamad Imine, Hiep H. Nguyen, Micha\\\"el Rusinowitch","submitted_at":"2014-08-06T08:31:50Z","abstract_excerpt":"Rather than anonymizing social graphs by generalizing them to super nodes/edges or adding/removing nodes and edges to satisfy given privacy parameters, recent methods exploit the semantics of uncertain graphs to achieve privacy protection of participating entities and their relationship. These techniques anonymize a deterministic graph by converting it into an uncertain form. In this paper, we propose a generalized obfuscation model based on uncertain adjacency matrices that keep expected node degrees equal to those in the unanonymized graph. We analyze two recently proposed schemes and show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1209","kind":"arxiv","version":1},"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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkjHPgNj7ZN2kN7KBqgRIaDDRmdcA4gWaW8vfCuEGmFXmY99zNs7wFkpwl7+YtwBHgEIz8TGHd6De+zLW3/oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T03:17:22.013468Z"},"content_sha256":"782a0eb32f39b93669745666cbc7b88f1ae3caa7ac518625f684c3f06c47afba","schema_version":"1.0","event_id":"sha256:782a0eb32f39b93669745666cbc7b88f1ae3caa7ac518625f684c3f06c47afba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/bundle.json","state_url":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZ3563243BZL6X6VDDQS3IV3ID/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-07-01T03:17:22Z","links":{"resolver":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID","bundle":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/bundle.json","state":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZ3563243BZL6X6VDDQS3IV3ID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BZ3563243BZL6X6VDDQS3IV3ID","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":"797ab94d1e35134647c250c16ee0314c75b95e2e32990d8eeab43dfa552d78b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-06T08:31:50Z","title_canon_sha256":"ddd357349303590ca1a1b406a92e3038e3894dbca51605518395a38bbb239622"},"schema_version":"1.0","source":{"id":"1408.1209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1209","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1209v1","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1209","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"BZ3563243BZL","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BZ3563243BZL6X6V","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BZ356324","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:782a0eb32f39b93669745666cbc7b88f1ae3caa7ac518625f684c3f06c47afba","target":"graph","created_at":"2026-05-18T02:45:47Z","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":"Rather than anonymizing social graphs by generalizing them to super nodes/edges or adding/removing nodes and edges to satisfy given privacy parameters, recent methods exploit the semantics of uncertain graphs to achieve privacy protection of participating entities and their relationship. These techniques anonymize a deterministic graph by converting it into an uncertain form. In this paper, we propose a generalized obfuscation model based on uncertain adjacency matrices that keep expected node degrees equal to those in the unanonymized graph. We analyze two recently proposed schemes and show t","authors_text":"Abdessamad Imine, Hiep H. Nguyen, Micha\\\"el Rusinowitch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-06T08:31:50Z","title":"Anonymizing Social Graphs via Uncertainty Semantics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1209","kind":"arxiv","version":1},"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:f224b11293e650650e0ca8346811b992ce4489b39decae99f712850bf7e92aa1","target":"record","created_at":"2026-05-18T02:45:47Z","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":"797ab94d1e35134647c250c16ee0314c75b95e2e32990d8eeab43dfa552d78b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-06T08:31:50Z","title_canon_sha256":"ddd357349303590ca1a1b406a92e3038e3894dbca51605518395a38bbb239622"},"schema_version":"1.0","source":{"id":"1408.1209","kind":"arxiv","version":1}},"canonical_sha256":"0e77df6f5cd872bf5fd518e12da2bb40d56b077e7c6f0c95ea1ea2c8465eb3fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e77df6f5cd872bf5fd518e12da2bb40d56b077e7c6f0c95ea1ea2c8465eb3fa","first_computed_at":"2026-05-18T02:45:47.955269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:47.955269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U+ZYU9GP8rL8xBC0rmKUezC/zF52UpVtsJbK6edB0MQ1Rvc1J/z9Hu7LH1U8pJHW+7Fls+J5P0KA44sBS7GVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:47.955787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f224b11293e650650e0ca8346811b992ce4489b39decae99f712850bf7e92aa1","sha256:782a0eb32f39b93669745666cbc7b88f1ae3caa7ac518625f684c3f06c47afba"],"state_sha256":"4910a1a7c28f17d9f3f30ea4c818d348ff2c812a36a4cae3c3eb81843c3db62c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRGSwtC9Tf6dHuOHZFhcA/KB8Xw1o+2+CzG4VbLZFthx8Pm5ldy3wUrPikmK31kgWrWJHY3FUQfh4xd9yAARCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T03:17:22.015405Z","bundle_sha256":"1dc39a29a2d00fe5ee4869bab8fc70b26f34f5e1ec60641f66b8bb0274911f8e"}}