{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6ZI4YF4M3XUSNQ3RGDRKRNVLKO","short_pith_number":"pith:6ZI4YF4M","canonical_record":{"source":{"id":"1207.6329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-26T16:59:17Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4d38f0b130401537ce46f8d9377cd16e3f12030931291fb640768ca1cf3e1a49","abstract_canon_sha256":"990a2d534659ce07fb07e86dd87be4a09ab81a81974f15e7888b245c01ebc40b"},"schema_version":"1.0"},"canonical_sha256":"f651cc178cdde926c37130e2a8b6ab53857eef38d123798ebc67d279a99f8241","source":{"kind":"arxiv","id":"1207.6329","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6329","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6329v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6329","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"6ZI4YF4M3XUS","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6ZI4YF4M3XUSNQ3R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6ZI4YF4M","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6ZI4YF4M3XUSNQ3RGDRKRNVLKO","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-26T16:59:17Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4d38f0b130401537ce46f8d9377cd16e3f12030931291fb640768ca1cf3e1a49","abstract_canon_sha256":"990a2d534659ce07fb07e86dd87be4a09ab81a81974f15e7888b245c01ebc40b"},"schema_version":"1.0"},"canonical_sha256":"f651cc178cdde926c37130e2a8b6ab53857eef38d123798ebc67d279a99f8241","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:00.481678Z","signature_b64":"JcCZntYFPbllXiz+uO5j4hAem1thVGtRvXzHJq35JoMcBmCiF7adLx4qtUZKRotv6OryZEiafOfm9TRbXdm8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f651cc178cdde926c37130e2a8b6ab53857eef38d123798ebc67d279a99f8241","last_reissued_at":"2026-05-18T03:50:00.481257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:00.481257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6329","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:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovmcPEoeGeaUWNByCf8mV8dRirTaXauoNH9zlXBUcv10wSYL3+4W7SWZiWGR7kp9/1/6x6XlwlMEOx/5p6e3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:22:30.064219Z"},"content_sha256":"aa4bc2c35ca5c8b9aa877ca7bbfca2235b9ef53455c41f70a265e7c9db29f747","schema_version":"1.0","event_id":"sha256:aa4bc2c35ca5c8b9aa877ca7bbfca2235b9ef53455c41f70a265e7c9db29f747"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6ZI4YF4M3XUSNQ3RGDRKRNVLKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing optimal k-regret minimizing sets with top-k depth contours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DB","authors_text":"Alex Thomo, Sean Chester, Sue Whitesides, S. Venkatesh","submitted_at":"2012-07-26T16:59:17Z","abstract_excerpt":"Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 query on S rather than D is minimally perceptible to any user. To discover an optimal regret minimizing set of a predetermined cardinality is conjectured to be a hard problem. In this paper, we generalize the problem to that of finding an optimal k$regret minimizing set, wherein the difference is computed over top-k queries, rather than top-1 queries.\n  We adapt known geometric ideas of top-k depth contours and the rever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6329","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:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLfWkZkXekK6YpEHXo3WeCsTlelnJrPXApSTDP0balpMMJlIOYnXfFFaBDiTFLImg7UxMrhooT/qJOEsoM7gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:22:30.064599Z"},"content_sha256":"82216df0f10c7f2f14dd99544f6cc3761983c7ded2dc277ad0891464db39cb33","schema_version":"1.0","event_id":"sha256:82216df0f10c7f2f14dd99544f6cc3761983c7ded2dc277ad0891464db39cb33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZI4YF4M3XUSNQ3RGDRKRNVLKO/bundle.json","state_url":"https://pith.science/pith/6ZI4YF4M3XUSNQ3RGDRKRNVLKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZI4YF4M3XUSNQ3RGDRKRNVLKO/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-05-26T21:22:30Z","links":{"resolver":"https://pith.science/pith/6ZI4YF4M3XUSNQ3RGDRKRNVLKO","bundle":"https://pith.science/pith/6ZI4YF4M3XUSNQ3RGDRKRNVLKO/bundle.json","state":"https://pith.science/pith/6ZI4YF4M3XUSNQ3RGDRKRNVLKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZI4YF4M3XUSNQ3RGDRKRNVLKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6ZI4YF4M3XUSNQ3RGDRKRNVLKO","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":"990a2d534659ce07fb07e86dd87be4a09ab81a81974f15e7888b245c01ebc40b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-26T16:59:17Z","title_canon_sha256":"4d38f0b130401537ce46f8d9377cd16e3f12030931291fb640768ca1cf3e1a49"},"schema_version":"1.0","source":{"id":"1207.6329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6329","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6329v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6329","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"6ZI4YF4M3XUS","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6ZI4YF4M3XUSNQ3R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6ZI4YF4M","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:82216df0f10c7f2f14dd99544f6cc3761983c7ded2dc277ad0891464db39cb33","target":"graph","created_at":"2026-05-18T03:50:00Z","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":"Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 query on S rather than D is minimally perceptible to any user. To discover an optimal regret minimizing set of a predetermined cardinality is conjectured to be a hard problem. In this paper, we generalize the problem to that of finding an optimal k$regret minimizing set, wherein the difference is computed over top-k queries, rather than top-1 queries.\n  We adapt known geometric ideas of top-k depth contours and the rever","authors_text":"Alex Thomo, Sean Chester, Sue Whitesides, S. Venkatesh","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-26T16:59:17Z","title":"Computing optimal k-regret minimizing sets with top-k depth contours"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6329","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:aa4bc2c35ca5c8b9aa877ca7bbfca2235b9ef53455c41f70a265e7c9db29f747","target":"record","created_at":"2026-05-18T03:50:00Z","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":"990a2d534659ce07fb07e86dd87be4a09ab81a81974f15e7888b245c01ebc40b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-07-26T16:59:17Z","title_canon_sha256":"4d38f0b130401537ce46f8d9377cd16e3f12030931291fb640768ca1cf3e1a49"},"schema_version":"1.0","source":{"id":"1207.6329","kind":"arxiv","version":1}},"canonical_sha256":"f651cc178cdde926c37130e2a8b6ab53857eef38d123798ebc67d279a99f8241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f651cc178cdde926c37130e2a8b6ab53857eef38d123798ebc67d279a99f8241","first_computed_at":"2026-05-18T03:50:00.481257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:00.481257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JcCZntYFPbllXiz+uO5j4hAem1thVGtRvXzHJq35JoMcBmCiF7adLx4qtUZKRotv6OryZEiafOfm9TRbXdm8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:00.481678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa4bc2c35ca5c8b9aa877ca7bbfca2235b9ef53455c41f70a265e7c9db29f747","sha256:82216df0f10c7f2f14dd99544f6cc3761983c7ded2dc277ad0891464db39cb33"],"state_sha256":"c34416df7d84c3715fcf0a4a4441eaf23d7d670bf5f233ed4ef5245fa89e2b3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0izWNyhk4mb+HDLIF5ZdUsRLQj/jCdNwUVYxm1p9ZmX5DqmR9Mq9l7T+bUQm1l9tK/M0Wi1rUFvnB1hvrBy5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:22:30.067002Z","bundle_sha256":"cbe8be969d5dd3289974b1d0237318e89e661341f16e63ba3336d2992d5a8a5d"}}