{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7UANUXQPH4DOSPOVP726AY7WRW","short_pith_number":"pith:7UANUXQP","canonical_record":{"source":{"id":"1402.6239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-25T16:53:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"356d31d1960944906b97db0c4ced7357c3e3da4931a9173a8df1dffc224d9fa2","abstract_canon_sha256":"7953688c9b8f765dbf1f2117ee4efaa194fd1009bf82005ef3af45be7b54178d"},"schema_version":"1.0"},"canonical_sha256":"fd00da5e0f3f06e93dd57ff5e063f68daec082a411f7d768d0720efe46a48bb4","source":{"kind":"arxiv","id":"1402.6239","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6239","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6239v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6239","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"7UANUXQPH4DO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7UANUXQPH4DOSPOV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7UANUXQP","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7UANUXQPH4DOSPOVP726AY7WRW","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-25T16:53:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"356d31d1960944906b97db0c4ced7357c3e3da4931a9173a8df1dffc224d9fa2","abstract_canon_sha256":"7953688c9b8f765dbf1f2117ee4efaa194fd1009bf82005ef3af45be7b54178d"},"schema_version":"1.0"},"canonical_sha256":"fd00da5e0f3f06e93dd57ff5e063f68daec082a411f7d768d0720efe46a48bb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.342750Z","signature_b64":"JINBH/OcQInakThSm0y9kI2aT83QJ4l0Tr0bEZs2k1Dn0PILCMDxdrdMTDOpymGGJ+4EtPaJgqBEYVHZe3JzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd00da5e0f3f06e93dd57ff5e063f68daec082a411f7d768d0720efe46a48bb4","last_reissued_at":"2026-05-18T02:57:51.342107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.342107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6239","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MP+89CHsYXWCCy4RbL8f80TtjRVS4RdvDeY3kyWmu/5cigyqBOpCKCyVJgj+rdtnCdlhfIDJ9A7Rp2aNYBSlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:25:33.675735Z"},"content_sha256":"4ce4ce52ec1fb9d5ef445a9417b4a34c03efb73f5950839be31d6de3d42a15a5","schema_version":"1.0","event_id":"sha256:4ce4ce52ec1fb9d5ef445a9417b4a34c03efb73f5950839be31d6de3d42a15a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7UANUXQPH4DOSPOVP726AY7WRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Andr\\'e Nichterlein, Clemens Hoffmann, Sepp Hartung","submitted_at":"2014-02-25T16:53:32Z","abstract_excerpt":"Motivated by a strongly growing interest in anonymizing social network data, we investigate the NP-hard Degree Anonymization problem: given an undirected graph, the task is to add a minimum number of edges such that the graph becomes k-anonymous. That is, for each vertex there have to be at least k-1 other vertices of exactly the same degree. The model of degree anonymization has been introduced by Liu and Terzi [ACM SIGMOD'08], who also proposed and evaluated a two-phase heuristic. We present an enhancement of this heuristic, including new algorithms for each phase which significantly improve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6239","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wU/XnOWzMBLIA7tDDAynmX3ZwZRoxVOdNouhlHllKHJPcqrEueRcGqqrNQlvexj/14WPDwe7jbvuKTlCIdNdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:25:33.676080Z"},"content_sha256":"2c84a8099bcc81b767100152913cdf190e25366030986cbe2b3b1be28b68fe7d","schema_version":"1.0","event_id":"sha256:2c84a8099bcc81b767100152913cdf190e25366030986cbe2b3b1be28b68fe7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UANUXQPH4DOSPOVP726AY7WRW/bundle.json","state_url":"https://pith.science/pith/7UANUXQPH4DOSPOVP726AY7WRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UANUXQPH4DOSPOVP726AY7WRW/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-01T10:25:33Z","links":{"resolver":"https://pith.science/pith/7UANUXQPH4DOSPOVP726AY7WRW","bundle":"https://pith.science/pith/7UANUXQPH4DOSPOVP726AY7WRW/bundle.json","state":"https://pith.science/pith/7UANUXQPH4DOSPOVP726AY7WRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UANUXQPH4DOSPOVP726AY7WRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7UANUXQPH4DOSPOVP726AY7WRW","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":"7953688c9b8f765dbf1f2117ee4efaa194fd1009bf82005ef3af45be7b54178d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-25T16:53:32Z","title_canon_sha256":"356d31d1960944906b97db0c4ced7357c3e3da4931a9173a8df1dffc224d9fa2"},"schema_version":"1.0","source":{"id":"1402.6239","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6239","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6239v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6239","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"7UANUXQPH4DO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7UANUXQPH4DOSPOV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7UANUXQP","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:2c84a8099bcc81b767100152913cdf190e25366030986cbe2b3b1be28b68fe7d","target":"graph","created_at":"2026-05-18T02:57:51Z","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":"Motivated by a strongly growing interest in anonymizing social network data, we investigate the NP-hard Degree Anonymization problem: given an undirected graph, the task is to add a minimum number of edges such that the graph becomes k-anonymous. That is, for each vertex there have to be at least k-1 other vertices of exactly the same degree. The model of degree anonymization has been introduced by Liu and Terzi [ACM SIGMOD'08], who also proposed and evaluated a two-phase heuristic. We present an enhancement of this heuristic, including new algorithms for each phase which significantly improve","authors_text":"Andr\\'e Nichterlein, Clemens Hoffmann, Sepp Hartung","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-25T16:53:32Z","title":"Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6239","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:4ce4ce52ec1fb9d5ef445a9417b4a34c03efb73f5950839be31d6de3d42a15a5","target":"record","created_at":"2026-05-18T02:57:51Z","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":"7953688c9b8f765dbf1f2117ee4efaa194fd1009bf82005ef3af45be7b54178d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-25T16:53:32Z","title_canon_sha256":"356d31d1960944906b97db0c4ced7357c3e3da4931a9173a8df1dffc224d9fa2"},"schema_version":"1.0","source":{"id":"1402.6239","kind":"arxiv","version":1}},"canonical_sha256":"fd00da5e0f3f06e93dd57ff5e063f68daec082a411f7d768d0720efe46a48bb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd00da5e0f3f06e93dd57ff5e063f68daec082a411f7d768d0720efe46a48bb4","first_computed_at":"2026-05-18T02:57:51.342107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:51.342107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JINBH/OcQInakThSm0y9kI2aT83QJ4l0Tr0bEZs2k1Dn0PILCMDxdrdMTDOpymGGJ+4EtPaJgqBEYVHZe3JzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:51.342750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6239","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ce4ce52ec1fb9d5ef445a9417b4a34c03efb73f5950839be31d6de3d42a15a5","sha256:2c84a8099bcc81b767100152913cdf190e25366030986cbe2b3b1be28b68fe7d"],"state_sha256":"68b30e17bb5e77a707fbf9d1a034badf37e18d35dfe6d2c42af1723b3d905062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OigxDBw0w1Emi9M9Lal7q/cz/v9PnJqlGcU3k4Q/yPUusH1+D1Yptz/kd5U7FEKFbgpyJDvV3LLK6b3o2DVfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:25:33.678023Z","bundle_sha256":"1a7de397c0613e115453160d6cf2eef91d233861c03ea80e399aae57a14a5c8b"}}