{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OQUI7H5ZEJ5WL2NH7AQRUXBWBC","short_pith_number":"pith:OQUI7H5Z","schema_version":"1.0","canonical_sha256":"74288f9fb9227b65e9a7f8211a5c3608a8926f3d53387fc7b845d5fc1a57adce","source":{"kind":"arxiv","id":"1809.06987","version":3},"attestation_state":"computed","paper":{"title":"Data-Driven Clustering via Parameterized Lloyd's Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Colin White, Maria-Florina Balcan, Travis Dick","submitted_at":"2018-09-19T02:36:25Z","abstract_excerpt":"Algorithms for clustering points in metric spaces is a long-studied area of research. Clustering has seen a multitude of work both theoretically, in understanding the approximation guarantees possible for many objective functions such as k-median and k-means clustering, and experimentally, in finding the fastest algorithms and seeding procedures for Lloyd's algorithm. The performance of a given clustering algorithm depends on the specific application at hand, and this may not be known up front. For example, a \"typical instance\" may vary depending on the application, and different clustering he"},"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":"1809.06987","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-19T02:36:25Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5808faaa2c1df33d17cb7efc833248f0174553ffa7d5e14112d43d5d80e797d9","abstract_canon_sha256":"f911bdbb077246b5793369c04fac6e6674282844cc4617f950bebfec7ab673c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.353312Z","signature_b64":"mjbL2NWtSaR3s7bKyyuug29cP3JffZqAmjlqMeg4nw73upcFv3swh51NFbxBOjj8gIF2TAon4ePQSrojVapJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74288f9fb9227b65e9a7f8211a5c3608a8926f3d53387fc7b845d5fc1a57adce","last_reissued_at":"2026-05-17T23:45:15.352648Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.352648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Clustering via Parameterized Lloyd's Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Colin White, Maria-Florina Balcan, Travis Dick","submitted_at":"2018-09-19T02:36:25Z","abstract_excerpt":"Algorithms for clustering points in metric spaces is a long-studied area of research. Clustering has seen a multitude of work both theoretically, in understanding the approximation guarantees possible for many objective functions such as k-median and k-means clustering, and experimentally, in finding the fastest algorithms and seeding procedures for Lloyd's algorithm. The performance of a given clustering algorithm depends on the specific application at hand, and this may not be known up front. For example, a \"typical instance\" may vary depending on the application, and different clustering he"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06987","kind":"arxiv","version":3},"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":"1809.06987","created_at":"2026-05-17T23:45:15.352755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06987v3","created_at":"2026-05-17T23:45:15.352755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06987","created_at":"2026-05-17T23:45:15.352755+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQUI7H5ZEJ5W","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQUI7H5ZEJ5WL2NH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQUI7H5Z","created_at":"2026-05-18T12:32:43.782077+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/OQUI7H5ZEJ5WL2NH7AQRUXBWBC","json":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC.json","graph_json":"https://pith.science/api/pith-number/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/graph.json","events_json":"https://pith.science/api/pith-number/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/events.json","paper":"https://pith.science/paper/OQUI7H5Z"},"agent_actions":{"view_html":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC","download_json":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC.json","view_paper":"https://pith.science/paper/OQUI7H5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06987&json=true","fetch_graph":"https://pith.science/api/pith-number/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/graph.json","fetch_events":"https://pith.science/api/pith-number/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/action/storage_attestation","attest_author":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/action/author_attestation","sign_citation":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/action/citation_signature","submit_replication":"https://pith.science/pith/OQUI7H5ZEJ5WL2NH7AQRUXBWBC/action/replication_record"}},"created_at":"2026-05-17T23:45:15.352755+00:00","updated_at":"2026-05-17T23:45:15.352755+00:00"}