{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QMSOLGLOJ7WHSGSDL4MHWYLT4S","short_pith_number":"pith:QMSOLGLO","schema_version":"1.0","canonical_sha256":"8324e5996e4fec791a435f187b6173e48cdc2f4df5ecc9b053ecd31e94530ed4","source":{"kind":"arxiv","id":"1304.7318","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.7318","created_at":"2026-05-18T03:27:00.539632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7318v1","created_at":"2026-05-18T03:27:00.539632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7318","created_at":"2026-05-18T03:27:00.539632+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMSOLGLOJ7WH","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMSOLGLOJ7WHSGSD","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMSOLGLO","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S","json":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S.json","graph_json":"https://pith.science/api/pith-number/QMSOLGLOJ7WHSGSDL4MHWYLT4S/graph.json","events_json":"https://pith.science/api/pith-number/QMSOLGLOJ7WHSGSDL4MHWYLT4S/events.json","paper":"https://pith.science/paper/QMSOLGLO"},"agent_actions":{"view_html":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S","download_json":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S.json","view_paper":"https://pith.science/paper/QMSOLGLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7318&json=true","fetch_graph":"https://pith.science/api/pith-number/QMSOLGLOJ7WHSGSDL4MHWYLT4S/graph.json","fetch_events":"https://pith.science/api/pith-number/QMSOLGLOJ7WHSGSDL4MHWYLT4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/action/storage_attestation","attest_author":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/action/author_attestation","sign_citation":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/action/citation_signature","submit_replication":"https://pith.science/pith/QMSOLGLOJ7WHSGSDL4MHWYLT4S/action/replication_record"}},"created_at":"2026-05-18T03:27:00.539632+00:00","updated_at":"2026-05-18T03:27:00.539632+00:00"}