{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:GS4VCCS7P3GQI2EG7AA4446WWM","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":"d52a3ec3b93a64ca80c1aa18a3759499eb5979a36682810496ddb787612a70b6","cross_cats_sorted":["cs.DB","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-16T16:01:33Z","title_canon_sha256":"fe7215faa5061d75fb80d83242bda6b0f8ef8cfdbe986e89be5a649a2fa58705"},"schema_version":"1.0","source":{"id":"0910.3148","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.3148","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"arxiv_version","alias_value":"0910.3148v2","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3148","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"pith_short_12","alias_value":"GS4VCCS7P3GQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"GS4VCCS7P3GQI2EG","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"GS4VCCS7","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:89c85a9f8f17dc6ef428375b8b9055fe8b27ba00f5ce319cd14325f374060ed3","target":"graph","created_at":"2026-05-18T03:06:52Z","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":"The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the $k$-anonymity. This approach requires that the rows of a table are partitioned in clusters of size at least $k$ and that all the rows in a cluster become the same tuple, after the suppression of some entries. The natural optimization problem, where the goal is to minimize the number of suppressed entries, is known to be APX-hard even when the records values are over a binary alphabet and $k=3$, and when the records have length","authors_text":"Gianluca Della Vedova, Paola Bonizzoni, Riccardo Dondi, Stefano Beretta, Yuri Pirola","cross_cats":["cs.DB","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-16T16:01:33Z","title":"Parameterized Complexity of the k-anonymity Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3148","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:3400f277b8b35e5348547ed7d4f3cd23958b6d54561c133329da7657218e1f1b","target":"record","created_at":"2026-05-18T03:06:52Z","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":"d52a3ec3b93a64ca80c1aa18a3759499eb5979a36682810496ddb787612a70b6","cross_cats_sorted":["cs.DB","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-16T16:01:33Z","title_canon_sha256":"fe7215faa5061d75fb80d83242bda6b0f8ef8cfdbe986e89be5a649a2fa58705"},"schema_version":"1.0","source":{"id":"0910.3148","kind":"arxiv","version":2}},"canonical_sha256":"34b9510a5f7ecd046886f801ce73d6b30c5c85599de738ad7a964b5f89421117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34b9510a5f7ecd046886f801ce73d6b30c5c85599de738ad7a964b5f89421117","first_computed_at":"2026-05-18T03:06:52.258822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:52.258822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a/PFlJQ8MM6lYyTtQf8effuGaoGJhf5eHzdhNULwUEKJ3WG6xReBlGdWebzjeKePtBrOihp0GLlVh3XgmhEsCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:52.259515Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.3148","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3400f277b8b35e5348547ed7d4f3cd23958b6d54561c133329da7657218e1f1b","sha256:89c85a9f8f17dc6ef428375b8b9055fe8b27ba00f5ce319cd14325f374060ed3"],"state_sha256":"b70706bed45c84344b348221fc183d71624d286b83aae01dfae9684d55b733dd"}