{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LIBJQNY5KIKRUM2TAOQKGUZBGZ","short_pith_number":"pith:LIBJQNY5","canonical_record":{"source":{"id":"1208.5247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-26T20:03:04Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4277cf1dd087ee34d49c133a5463c5b6591c66f5cb37fc68508f13d9ffc66981","abstract_canon_sha256":"8b0b414f3ddde4fce1416588d8c296257f780446ab4dd78105451d2aa80fc7f9"},"schema_version":"1.0"},"canonical_sha256":"5a0298371d52151a335303a0a35321366870cc55070a63b26542b35b28c70259","source":{"kind":"arxiv","id":"1208.5247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5247","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5247v1","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5247","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"pith_short_12","alias_value":"LIBJQNY5KIKR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LIBJQNY5KIKRUM2T","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LIBJQNY5","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LIBJQNY5KIKRUM2TAOQKGUZBGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-26T20:03:04Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4277cf1dd087ee34d49c133a5463c5b6591c66f5cb37fc68508f13d9ffc66981","abstract_canon_sha256":"8b0b414f3ddde4fce1416588d8c296257f780446ab4dd78105451d2aa80fc7f9"},"schema_version":"1.0"},"canonical_sha256":"5a0298371d52151a335303a0a35321366870cc55070a63b26542b35b28c70259","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:00.006247Z","signature_b64":"vI0ajD9Y9SyoyOekvSkTZWft8zfC5VmOAXvcb3bu5D/b7FNtSr0+RpYa5c2uGwZ+KBtE2ranhr2TghGzORK+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0298371d52151a335303a0a35321366870cc55070a63b26542b35b28c70259","last_reissued_at":"2026-05-18T03:47:00.005343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:00.005343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5247","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:47:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNIQv2bssENwEai5oHJiKHjTb4RVwkzArqxL2VLtLgwgIhlUbl2qkK/Qh9JM8fsJYQLDvDS/3MSamY13XETlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:13:28.302389Z"},"content_sha256":"70e6b484ca09cbc8d361ef7b9b2e46216a6878590269a838852b780078044146","schema_version":"1.0","event_id":"sha256:70e6b484ca09cbc8d361ef7b9b2e46216a6878590269a838852b780078044146"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LIBJQNY5KIKRUM2TAOQKGUZBGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Clustering via Preprocessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Robert Krauthgamer, Tsvi Kopelowitz","submitted_at":"2012-08-26T20:03:04Z","abstract_excerpt":"We examine the efficiency of clustering a set of points, when the encompassing metric space may be preprocessed in advance. In computational problems of this genre, there is a first stage of preprocessing, whose input is a collection of points $M$; the next stage receives as input a query set $Q\\subset M$, and should report a clustering of $Q$ according to some objective, such as 1-median, in which case the answer is a point $a\\in M$ minimizing $\\sum_{q\\in Q} d_M(a,q)$.\n  We design fast algorithms that approximately solve such problems under standard clustering objectives like $p$-center and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5247","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:47:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSpONhF7JNH9+EzIUtnC7cwC8j1hjWnP8xtKhrigHLfoZ3JiHgwk9MXM4vrVlMbBuujcktorUs/pZDVjxRIhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:13:28.302760Z"},"content_sha256":"adc0c96f2d54123cc1db83aa96e4c4f7daefcb4c71c5bc5d9a91efcce13a1710","schema_version":"1.0","event_id":"sha256:adc0c96f2d54123cc1db83aa96e4c4f7daefcb4c71c5bc5d9a91efcce13a1710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIBJQNY5KIKRUM2TAOQKGUZBGZ/bundle.json","state_url":"https://pith.science/pith/LIBJQNY5KIKRUM2TAOQKGUZBGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIBJQNY5KIKRUM2TAOQKGUZBGZ/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-31T20:13:28Z","links":{"resolver":"https://pith.science/pith/LIBJQNY5KIKRUM2TAOQKGUZBGZ","bundle":"https://pith.science/pith/LIBJQNY5KIKRUM2TAOQKGUZBGZ/bundle.json","state":"https://pith.science/pith/LIBJQNY5KIKRUM2TAOQKGUZBGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIBJQNY5KIKRUM2TAOQKGUZBGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LIBJQNY5KIKRUM2TAOQKGUZBGZ","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":"8b0b414f3ddde4fce1416588d8c296257f780446ab4dd78105451d2aa80fc7f9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-26T20:03:04Z","title_canon_sha256":"4277cf1dd087ee34d49c133a5463c5b6591c66f5cb37fc68508f13d9ffc66981"},"schema_version":"1.0","source":{"id":"1208.5247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5247","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5247v1","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5247","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"pith_short_12","alias_value":"LIBJQNY5KIKR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LIBJQNY5KIKRUM2T","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LIBJQNY5","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:adc0c96f2d54123cc1db83aa96e4c4f7daefcb4c71c5bc5d9a91efcce13a1710","target":"graph","created_at":"2026-05-18T03:47: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":"We examine the efficiency of clustering a set of points, when the encompassing metric space may be preprocessed in advance. In computational problems of this genre, there is a first stage of preprocessing, whose input is a collection of points $M$; the next stage receives as input a query set $Q\\subset M$, and should report a clustering of $Q$ according to some objective, such as 1-median, in which case the answer is a point $a\\in M$ minimizing $\\sum_{q\\in Q} d_M(a,q)$.\n  We design fast algorithms that approximately solve such problems under standard clustering objectives like $p$-center and $","authors_text":"Robert Krauthgamer, Tsvi Kopelowitz","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-26T20:03:04Z","title":"Faster Clustering via Preprocessing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5247","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:70e6b484ca09cbc8d361ef7b9b2e46216a6878590269a838852b780078044146","target":"record","created_at":"2026-05-18T03:47: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":"8b0b414f3ddde4fce1416588d8c296257f780446ab4dd78105451d2aa80fc7f9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-26T20:03:04Z","title_canon_sha256":"4277cf1dd087ee34d49c133a5463c5b6591c66f5cb37fc68508f13d9ffc66981"},"schema_version":"1.0","source":{"id":"1208.5247","kind":"arxiv","version":1}},"canonical_sha256":"5a0298371d52151a335303a0a35321366870cc55070a63b26542b35b28c70259","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a0298371d52151a335303a0a35321366870cc55070a63b26542b35b28c70259","first_computed_at":"2026-05-18T03:47:00.005343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:00.005343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vI0ajD9Y9SyoyOekvSkTZWft8zfC5VmOAXvcb3bu5D/b7FNtSr0+RpYa5c2uGwZ+KBtE2ranhr2TghGzORK+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:00.006247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70e6b484ca09cbc8d361ef7b9b2e46216a6878590269a838852b780078044146","sha256:adc0c96f2d54123cc1db83aa96e4c4f7daefcb4c71c5bc5d9a91efcce13a1710"],"state_sha256":"28abff9a0dc5cbf833f7686c2dc16c27251d5fac664e5f511ad43f2f0a0ffb4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjxJXwSAofr1+sSOttaIVZDVOLznP/B3O/iry0bDO91CKsyPaKPVUcrAKBYPuUP4+sV0jLCyT+0JB1eBbTVkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:13:28.305020Z","bundle_sha256":"69265d78dfa2c96c1b5949d998bc4d1394fd65b5f0239d6ad08b2cb4226bb590"}}