{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z67P4TNTO34TBFKQBJSHTHGJRH","short_pith_number":"pith:Z67P4TNT","schema_version":"1.0","canonical_sha256":"cfbefe4db376f93095500a64799cc989e5cc5d855a031812e2d05a5580ad3f96","source":{"kind":"arxiv","id":"1112.1978","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.1978","created_at":"2026-05-18T04:00:15.366621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1978v2","created_at":"2026-05-18T04:00:15.366621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1978","created_at":"2026-05-18T04:00:15.366621+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z67P4TNTO34T","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z67P4TNTO34TBFKQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z67P4TNT","created_at":"2026-05-18T12:26:47.523578+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/Z67P4TNTO34TBFKQBJSHTHGJRH","json":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH.json","graph_json":"https://pith.science/api/pith-number/Z67P4TNTO34TBFKQBJSHTHGJRH/graph.json","events_json":"https://pith.science/api/pith-number/Z67P4TNTO34TBFKQBJSHTHGJRH/events.json","paper":"https://pith.science/paper/Z67P4TNT"},"agent_actions":{"view_html":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH","download_json":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH.json","view_paper":"https://pith.science/paper/Z67P4TNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1978&json=true","fetch_graph":"https://pith.science/api/pith-number/Z67P4TNTO34TBFKQBJSHTHGJRH/graph.json","fetch_events":"https://pith.science/api/pith-number/Z67P4TNTO34TBFKQBJSHTHGJRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/action/storage_attestation","attest_author":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/action/author_attestation","sign_citation":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/action/citation_signature","submit_replication":"https://pith.science/pith/Z67P4TNTO34TBFKQBJSHTHGJRH/action/replication_record"}},"created_at":"2026-05-18T04:00:15.366621+00:00","updated_at":"2026-05-18T04:00:15.366621+00:00"}