{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZZNSMU3SSMVM3VODUL6WHEGYMI","short_pith_number":"pith:ZZNSMU3S","canonical_record":{"source":{"id":"1301.5022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-21T21:53:56Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"5af6b788a740fc7ba6a40b661d21be770c73c25527511e9c66584636d9faf69d","abstract_canon_sha256":"5027dd6cb2664f630da8ea1a53c456927903e8ee761c2d65ebdc960acae15f33"},"schema_version":"1.0"},"canonical_sha256":"ce5b265372932acdd5c3a2fd6390d86234f3f7356bb670d762587dda20285f51","source":{"kind":"arxiv","id":"1301.5022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5022","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5022v1","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5022","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZZNSMU3SSMVM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZNSMU3SSMVM3VOD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZNSMU3S","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZZNSMU3SSMVM3VODUL6WHEGYMI","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-21T21:53:56Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"5af6b788a740fc7ba6a40b661d21be770c73c25527511e9c66584636d9faf69d","abstract_canon_sha256":"5027dd6cb2664f630da8ea1a53c456927903e8ee761c2d65ebdc960acae15f33"},"schema_version":"1.0"},"canonical_sha256":"ce5b265372932acdd5c3a2fd6390d86234f3f7356bb670d762587dda20285f51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:53.272465Z","signature_b64":"3dm6korXYIz9D1APy9DEgER6Hbk8w6NLOfyIyeZXR/Peps8YSci+XhNuXLjwm6gnqVlP+nsZnq0k+x+eu1YYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce5b265372932acdd5c3a2fd6390d86234f3f7356bb670d762587dda20285f51","last_reissued_at":"2026-05-18T03:35:53.271821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:53.271821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5022","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-18T03:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6NOWq9qe+HupbUFZ2tbT9VX5LdGI87x/IaVv676ZxVM8+j96xHBA/lEW7yNovfX0owFRtBsHVvmS99aJuYZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:38:21.593334Z"},"content_sha256":"0a66c7e336d1d96f637c768157a5807ab2efaf148987483fb8b539fd30cc0955","schema_version":"1.0","event_id":"sha256:0a66c7e336d1d96f637c768157a5807ab2efaf148987483fb8b539fd30cc0955"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZZNSMU3SSMVM3VODUL6WHEGYMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A formalization of re-identification in terms of compatible probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Klara Stokes, Vicen\\c{c} Torra","submitted_at":"2013-01-21T21:53:56Z","abstract_excerpt":"Re-identification algorithms are used in data privacy to measure disclosure risk. They model the situation in which an adversary attacks a published database by means of linking the information of this adversary with the database.\n  In this paper we formalize this type of algorithm in terms of true probabilities and compatible belief functions. The purpose of this work is to leave aside as re-identification algorithms those algorithms that do not satisfy a minimum requirement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5022","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-18T03:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSDPRzFVmgY75eBuA56n08T3pw1ni4osDu/ha3xadyQKxxrg7c07g7LU9J/cnDOFxv+BEJrNlj7xdG2jducIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:38:21.593967Z"},"content_sha256":"c8e1434d4daa59dacf6d186def288617e541a677e97676d762a90d5d4c6d902b","schema_version":"1.0","event_id":"sha256:c8e1434d4daa59dacf6d186def288617e541a677e97676d762a90d5d4c6d902b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZNSMU3SSMVM3VODUL6WHEGYMI/bundle.json","state_url":"https://pith.science/pith/ZZNSMU3SSMVM3VODUL6WHEGYMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZNSMU3SSMVM3VODUL6WHEGYMI/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-09T05:38:21Z","links":{"resolver":"https://pith.science/pith/ZZNSMU3SSMVM3VODUL6WHEGYMI","bundle":"https://pith.science/pith/ZZNSMU3SSMVM3VODUL6WHEGYMI/bundle.json","state":"https://pith.science/pith/ZZNSMU3SSMVM3VODUL6WHEGYMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZNSMU3SSMVM3VODUL6WHEGYMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZZNSMU3SSMVM3VODUL6WHEGYMI","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":"5027dd6cb2664f630da8ea1a53c456927903e8ee761c2d65ebdc960acae15f33","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-21T21:53:56Z","title_canon_sha256":"5af6b788a740fc7ba6a40b661d21be770c73c25527511e9c66584636d9faf69d"},"schema_version":"1.0","source":{"id":"1301.5022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5022","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5022v1","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5022","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZZNSMU3SSMVM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZNSMU3SSMVM3VOD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZNSMU3S","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:c8e1434d4daa59dacf6d186def288617e541a677e97676d762a90d5d4c6d902b","target":"graph","created_at":"2026-05-18T03:35:53Z","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":"Re-identification algorithms are used in data privacy to measure disclosure risk. They model the situation in which an adversary attacks a published database by means of linking the information of this adversary with the database.\n  In this paper we formalize this type of algorithm in terms of true probabilities and compatible belief functions. The purpose of this work is to leave aside as re-identification algorithms those algorithms that do not satisfy a minimum requirement.","authors_text":"Klara Stokes, Vicen\\c{c} Torra","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-21T21:53:56Z","title":"A formalization of re-identification in terms of compatible probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5022","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:0a66c7e336d1d96f637c768157a5807ab2efaf148987483fb8b539fd30cc0955","target":"record","created_at":"2026-05-18T03:35:53Z","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":"5027dd6cb2664f630da8ea1a53c456927903e8ee761c2d65ebdc960acae15f33","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-21T21:53:56Z","title_canon_sha256":"5af6b788a740fc7ba6a40b661d21be770c73c25527511e9c66584636d9faf69d"},"schema_version":"1.0","source":{"id":"1301.5022","kind":"arxiv","version":1}},"canonical_sha256":"ce5b265372932acdd5c3a2fd6390d86234f3f7356bb670d762587dda20285f51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce5b265372932acdd5c3a2fd6390d86234f3f7356bb670d762587dda20285f51","first_computed_at":"2026-05-18T03:35:53.271821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:53.271821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3dm6korXYIz9D1APy9DEgER6Hbk8w6NLOfyIyeZXR/Peps8YSci+XhNuXLjwm6gnqVlP+nsZnq0k+x+eu1YYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:53.272465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a66c7e336d1d96f637c768157a5807ab2efaf148987483fb8b539fd30cc0955","sha256:c8e1434d4daa59dacf6d186def288617e541a677e97676d762a90d5d4c6d902b"],"state_sha256":"8db2c36d5077b62108bb3f02d372aefd07426e77d2c7a2efdb71af0c242e1e00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rPEuT058o2d456Wp6SSPolgZhh92mRlvLJsvnK/r464CFBvCK+DkCUKXOIkePVWXnMTYBe0RTShP/iQBB44CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:38:21.597596Z","bundle_sha256":"382564b4dbc1c32f2e136d8f05fd94c3f05e9a25573e5ae8890ffc9bb2fe923a"}}