{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Z67P4TNTO34TBFKQBJSHTHGJRH","short_pith_number":"pith:Z67P4TNT","canonical_record":{"source":{"id":"1112.1978","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-12-08T22:40:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bc21b03920799d0e924b29cbe7dd95609b55f32893746977365d1fa5112cb723","abstract_canon_sha256":"090072611afcce55f5dbb69457b169da26ddce2987c3089c28e26b2f12b0c0a6"},"schema_version":"1.0"},"canonical_sha256":"cfbefe4db376f93095500a64799cc989e5cc5d855a031812e2d05a5580ad3f96","source":{"kind":"arxiv","id":"1112.1978","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1978","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1978v2","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1978","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"pith_short_12","alias_value":"Z67P4TNTO34T","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z67P4TNTO34TBFKQ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z67P4TNT","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Z67P4TNTO34TBFKQBJSHTHGJRH","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1978","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-12-08T22:40:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bc21b03920799d0e924b29cbe7dd95609b55f32893746977365d1fa5112cb723","abstract_canon_sha256":"090072611afcce55f5dbb69457b169da26ddce2987c3089c28e26b2f12b0c0a6"},"schema_version":"1.0"},"canonical_sha256":"cfbefe4db376f93095500a64799cc989e5cc5d855a031812e2d05a5580ad3f96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:15.367368Z","signature_b64":"uPI44ndLcjgKI8EoYEELAf0P7Ixnrl/9awZHkFS+1ygcPvQFU3CBwRbUJdzYl8MEprzOtlLvN+0HBuJthBi5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfbefe4db376f93095500a64799cc989e5cc5d855a031812e2d05a5580ad3f96","last_reissued_at":"2026-05-18T04:00:15.366471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:15.366471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1978","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-18T04:00:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wz3pGADJvQypq/WI0y1d47OtGIeITBumZkO5/WuIz2knr1t0+qYopDEA2ordoP19PMa3SSVf3DjpdveSSWMaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:36:44.142561Z"},"content_sha256":"b234d240e12049c66069ea6c49b1b40611344f3223adac31a2d27928d9f64382","schema_version":"1.0","event_id":"sha256:b234d240e12049c66069ea6c49b1b40611344f3223adac31a2d27928d9f64382"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Z67P4TNTO34TBFKQBJSHTHGJRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reidentification and k-anonymity: a model for disclosure risk in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CR","authors_text":"Klara Stokes, Vicen\\c{c} Torra","submitted_at":"2011-12-08T22:40:52Z","abstract_excerpt":"In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modelling the anonymity of a database table and we prove that n-confusion is a generalization of k- anonymity. After a short survey on the different available definitions of k- anonymity for graphs we provide a new definition for k-anonymous graph, which we consider to be the correct definition. We provide a description of the k-anonymous graphs, both for the regular and the non-regular case. We also introduce the more flexible concept of (k,l)-anonymous graph. Our definition o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1978","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-18T04:00:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oh4z1KGHcAiY7ROdCV8O+//pTlj8pv6hxAQbhX0REuyt6pnOt6EXlDn/vWEFkbBByydQgUFX6WjbxVMn2t4YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:36:44.143276Z"},"content_sha256":"3ca9f8c55858e4b13ac6b79b201ac463bc370e092bf35f7ba89ea75bcf729708","schema_version":"1.0","event_id":"sha256:3ca9f8c55858e4b13ac6b79b201ac463bc370e092bf35f7ba89ea75bcf729708"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/bundle.json","state_url":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/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-09T07:36:44Z","links":{"resolver":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH","bundle":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/bundle.json","state":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Z67P4TNTO34TBFKQBJSHTHGJRH","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":"090072611afcce55f5dbb69457b169da26ddce2987c3089c28e26b2f12b0c0a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-12-08T22:40:52Z","title_canon_sha256":"bc21b03920799d0e924b29cbe7dd95609b55f32893746977365d1fa5112cb723"},"schema_version":"1.0","source":{"id":"1112.1978","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1978","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1978v2","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1978","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"pith_short_12","alias_value":"Z67P4TNTO34T","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z67P4TNTO34TBFKQ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z67P4TNT","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:3ca9f8c55858e4b13ac6b79b201ac463bc370e092bf35f7ba89ea75bcf729708","target":"graph","created_at":"2026-05-18T04:00:15Z","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":"In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modelling the anonymity of a database table and we prove that n-confusion is a generalization of k- anonymity. After a short survey on the different available definitions of k- anonymity for graphs we provide a new definition for k-anonymous graph, which we consider to be the correct definition. We provide a description of the k-anonymous graphs, both for the regular and the non-regular case. We also introduce the more flexible concept of (k,l)-anonymous graph. Our definition o","authors_text":"Klara Stokes, Vicen\\c{c} Torra","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-12-08T22:40:52Z","title":"Reidentification and k-anonymity: a model for disclosure risk in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1978","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:b234d240e12049c66069ea6c49b1b40611344f3223adac31a2d27928d9f64382","target":"record","created_at":"2026-05-18T04:00:15Z","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":"090072611afcce55f5dbb69457b169da26ddce2987c3089c28e26b2f12b0c0a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-12-08T22:40:52Z","title_canon_sha256":"bc21b03920799d0e924b29cbe7dd95609b55f32893746977365d1fa5112cb723"},"schema_version":"1.0","source":{"id":"1112.1978","kind":"arxiv","version":2}},"canonical_sha256":"cfbefe4db376f93095500a64799cc989e5cc5d855a031812e2d05a5580ad3f96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfbefe4db376f93095500a64799cc989e5cc5d855a031812e2d05a5580ad3f96","first_computed_at":"2026-05-18T04:00:15.366471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:15.366471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uPI44ndLcjgKI8EoYEELAf0P7Ixnrl/9awZHkFS+1ygcPvQFU3CBwRbUJdzYl8MEprzOtlLvN+0HBuJthBi5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:15.367368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1978","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b234d240e12049c66069ea6c49b1b40611344f3223adac31a2d27928d9f64382","sha256:3ca9f8c55858e4b13ac6b79b201ac463bc370e092bf35f7ba89ea75bcf729708"],"state_sha256":"1ee4dfb98ad0fcd0063e437ddb6825b60894d8c53e1ac6bf7d882cb15b2f530e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYw9jXtaryMnOZTJpCoFZFUzBP8aa/cG7trkQLo+gqIrB7LGrhZ51ylf6V8sRhIW2cVBhz3eHAXPmRb8hx6JCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:36:44.147135Z","bundle_sha256":"a18f566666e5bf637906b66253add5654d79b35a893617bd2fa4aa6e17f91d47"}}