{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QMSOLGLOJ7WHSGSDL4MHWYLT4S","short_pith_number":"pith:QMSOLGLO","canonical_record":{"source":{"id":"1304.7318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-27T02:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"c3a1d5e9f29982c448b54884b1f8dea0202c79bc80d51742ec76d9ef4a48d6e2","abstract_canon_sha256":"46527fdb327858621ec706aa7326b6f05d46e9561877550a5582aefa6f891681"},"schema_version":"1.0"},"canonical_sha256":"8324e5996e4fec791a435f187b6173e48cdc2f4df5ecc9b053ecd31e94530ed4","source":{"kind":"arxiv","id":"1304.7318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7318","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7318v1","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7318","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"QMSOLGLOJ7WH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMSOLGLOJ7WHSGSD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMSOLGLO","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QMSOLGLOJ7WHSGSDL4MHWYLT4S","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-27T02:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"c3a1d5e9f29982c448b54884b1f8dea0202c79bc80d51742ec76d9ef4a48d6e2","abstract_canon_sha256":"46527fdb327858621ec706aa7326b6f05d46e9561877550a5582aefa6f891681"},"schema_version":"1.0"},"canonical_sha256":"8324e5996e4fec791a435f187b6173e48cdc2f4df5ecc9b053ecd31e94530ed4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:00.540231Z","signature_b64":"kTUBEjBR/9kIjKxx4Sq79NawR3c8W1tSXc0w/yaQwDbvKJlIDpKsR9qZtbEjqnwsAMWuNTeDwQKGiQPmuVXgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8324e5996e4fec791a435f187b6173e48cdc2f4df5ecc9b053ecd31e94530ed4","last_reissued_at":"2026-05-18T03:27:00.539512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:00.539512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7318","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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSceOiVgCgYMiF6DGJ7qjlc/aEHhOXbOyG66yuJRnsWvsVE2I+0e3Dw+rs5a0wVSRyna6cyqqkc2bABK252EBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:17:01.043622Z"},"content_sha256":"f5e809379dbe6e3a8185e8bd50423aee475a51c66937a2d95f5f24c03feef83d","schema_version":"1.0","event_id":"sha256:f5e809379dbe6e3a8185e8bd50423aee475a51c66937a2d95f5f24c03feef83d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QMSOLGLOJ7WHSGSDL4MHWYLT4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alina Ene, Benjamin Raichel, Sariel Har-Peled","submitted_at":"2013-04-27T02:36:20Z","abstract_excerpt":"We study the \\LowerBoundedCenter (\\lbc) problem, which is a clustering problem that can be viewed as a variant of the \\kCenter problem. In the \\lbc problem, we are given a set of points P in a metric space and a lower bound \\lambda, and the goal is to select a set C \\subseteq P of centers and an assignment that maps each point in P to a center of C such that each center of C is assigned at least \\lambda points. The price of an assignment is the maximum distance between a point and the center it is assigned to, and the goal is to find a set of centers and an assignment of minimum price. We give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7318","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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94LkODZzBAPlFpm2fmg8Bj+/KeFYeyLFOXTTxNGuL03Lu3hK2ZOEwPJky7pC1KUCyUlbWNKu+W/620extkr3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:17:01.044335Z"},"content_sha256":"e85d6390fb2bd8faafa0ef328015095d80d490200415cafee83ad89bdd0fd068","schema_version":"1.0","event_id":"sha256:e85d6390fb2bd8faafa0ef328015095d80d490200415cafee83ad89bdd0fd068"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/bundle.json","state_url":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/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-08T21:17:01Z","links":{"resolver":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S","bundle":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/bundle.json","state":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QMSOLGLOJ7WHSGSDL4MHWYLT4S","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":"46527fdb327858621ec706aa7326b6f05d46e9561877550a5582aefa6f891681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-27T02:36:20Z","title_canon_sha256":"c3a1d5e9f29982c448b54884b1f8dea0202c79bc80d51742ec76d9ef4a48d6e2"},"schema_version":"1.0","source":{"id":"1304.7318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7318","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7318v1","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7318","created_at":"2026-05-18T03:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"QMSOLGLOJ7WH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMSOLGLOJ7WHSGSD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMSOLGLO","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:e85d6390fb2bd8faafa0ef328015095d80d490200415cafee83ad89bdd0fd068","target":"graph","created_at":"2026-05-18T03:27: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 study the \\LowerBoundedCenter (\\lbc) problem, which is a clustering problem that can be viewed as a variant of the \\kCenter problem. In the \\lbc problem, we are given a set of points P in a metric space and a lower bound \\lambda, and the goal is to select a set C \\subseteq P of centers and an assignment that maps each point in P to a center of C such that each center of C is assigned at least \\lambda points. The price of an assignment is the maximum distance between a point and the center it is assigned to, and the goal is to find a set of centers and an assignment of minimum price. We give","authors_text":"Alina Ene, Benjamin Raichel, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-27T02:36:20Z","title":"Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7318","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:f5e809379dbe6e3a8185e8bd50423aee475a51c66937a2d95f5f24c03feef83d","target":"record","created_at":"2026-05-18T03:27: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":"46527fdb327858621ec706aa7326b6f05d46e9561877550a5582aefa6f891681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-27T02:36:20Z","title_canon_sha256":"c3a1d5e9f29982c448b54884b1f8dea0202c79bc80d51742ec76d9ef4a48d6e2"},"schema_version":"1.0","source":{"id":"1304.7318","kind":"arxiv","version":1}},"canonical_sha256":"8324e5996e4fec791a435f187b6173e48cdc2f4df5ecc9b053ecd31e94530ed4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8324e5996e4fec791a435f187b6173e48cdc2f4df5ecc9b053ecd31e94530ed4","first_computed_at":"2026-05-18T03:27:00.539512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:00.539512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kTUBEjBR/9kIjKxx4Sq79NawR3c8W1tSXc0w/yaQwDbvKJlIDpKsR9qZtbEjqnwsAMWuNTeDwQKGiQPmuVXgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:00.540231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5e809379dbe6e3a8185e8bd50423aee475a51c66937a2d95f5f24c03feef83d","sha256:e85d6390fb2bd8faafa0ef328015095d80d490200415cafee83ad89bdd0fd068"],"state_sha256":"3d36f65c4f325220dc2fe9ab4e706e3194c48cdba6ca4ec90cea5a240867e56b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4BT2e/iSyjf/c6aZJFNqoJ7nAL1X8TH7iKiVIqZ9QuojSwmR/7VwQh/nAc/RLNORlCpIAZQ313KbAwu9XsCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:17:01.048831Z","bundle_sha256":"3ccea40d61d7063c8284f5ab460bf5f92e6d1dadecb78e7efd093aea304d4584"}}