{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BZ3563243BZL6X6VDDQS3IV3ID","short_pith_number":"pith:BZ356324","schema_version":"1.0","canonical_sha256":"0e77df6f5cd872bf5fd518e12da2bb40d56b077e7c6f0c95ea1ea2c8465eb3fa","source":{"kind":"arxiv","id":"1408.1209","version":1},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.1209","created_at":"2026-05-18T02:45:47.955342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1209v1","created_at":"2026-05-18T02:45:47.955342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1209","created_at":"2026-05-18T02:45:47.955342+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZ3563243BZL","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZ3563243BZL6X6V","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZ356324","created_at":"2026-05-18T12:28:22.404517+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/BZ3563243BZL6X6VDDQS3IV3ID","json":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID.json","graph_json":"https://pith.science/api/pith-number/BZ3563243BZL6X6VDDQS3IV3ID/graph.json","events_json":"https://pith.science/api/pith-number/BZ3563243BZL6X6VDDQS3IV3ID/events.json","paper":"https://pith.science/paper/BZ356324"},"agent_actions":{"view_html":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID","download_json":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID.json","view_paper":"https://pith.science/paper/BZ356324","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1209&json=true","fetch_graph":"https://pith.science/api/pith-number/BZ3563243BZL6X6VDDQS3IV3ID/graph.json","fetch_events":"https://pith.science/api/pith-number/BZ3563243BZL6X6VDDQS3IV3ID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/action/storage_attestation","attest_author":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/action/author_attestation","sign_citation":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/action/citation_signature","submit_replication":"https://pith.science/pith/BZ3563243BZL6X6VDDQS3IV3ID/action/replication_record"}},"created_at":"2026-05-18T02:45:47.955342+00:00","updated_at":"2026-05-18T02:45:47.955342+00:00"}