{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M2KRZHJKOWK2XON5EPH4L42SNQ","short_pith_number":"pith:M2KRZHJK","schema_version":"1.0","canonical_sha256":"66951c9d2a7595abb9bd23cfc5f3526c2c5d3bdef8fee74935c444cc45235153","source":{"kind":"arxiv","id":"1903.06904","version":3},"attestation_state":"computed","paper":{"title":"k-Means Clustering of Lines for Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Dan Feldman, Yair Marom","submitted_at":"2019-03-16T10:34:52Z","abstract_excerpt":"The input to the $k$-median for lines problem is a set $L$ of $n$ lines in $\\mathbb{R}^d$, and the goal is to compute a set of $k$ centers (points) in $\\mathbb{R}^d$ that minimizes the sum of squared distances over every line in $L$ and its nearest center. This is a straightforward generalization of the $k$-median problem where the input is a set of $n$ points instead of lines.\n  We suggest the first PTAS that computes a $(1+\\epsilon)$-approximation to this problem in time $O(n \\log n)$ for any constant approximation error $\\epsilon \\in (0, 1)$, and constant integers $k, d \\geq 1$. This is by "},"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":"1903.06904","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-16T10:34:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"93e5593e73b99aaaedf9180ebc7cb447620abf7d70d4f4352c3e0774d66fb27f","abstract_canon_sha256":"4f1c6c814e32eb58f257a4776eb23a6d02ca02b48261239d36054c0779dff47d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:33.459728Z","signature_b64":"f/iHuB8V2G4b8HsSTEaPxZOhND/G1Ft4RZRYa2u2f4aa9q8peemxs9ER21TngZ0CmPP1qwsKLoxjsPfF8K6pBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66951c9d2a7595abb9bd23cfc5f3526c2c5d3bdef8fee74935c444cc45235153","last_reissued_at":"2026-07-05T00:21:33.459237Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:33.459237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Means Clustering of Lines for Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Dan Feldman, Yair Marom","submitted_at":"2019-03-16T10:34:52Z","abstract_excerpt":"The input to the $k$-median for lines problem is a set $L$ of $n$ lines in $\\mathbb{R}^d$, and the goal is to compute a set of $k$ centers (points) in $\\mathbb{R}^d$ that minimizes the sum of squared distances over every line in $L$ and its nearest center. This is a straightforward generalization of the $k$-median problem where the input is a set of $n$ points instead of lines.\n  We suggest the first PTAS that computes a $(1+\\epsilon)$-approximation to this problem in time $O(n \\log n)$ for any constant approximation error $\\epsilon \\in (0, 1)$, and constant integers $k, d \\geq 1$. This is by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.06904/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1903.06904","created_at":"2026-07-05T00:21:33.459291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06904v3","created_at":"2026-07-05T00:21:33.459291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06904","created_at":"2026-07-05T00:21:33.459291+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2KRZHJKOWK2","created_at":"2026-07-05T00:21:33.459291+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2KRZHJKOWK2XON5","created_at":"2026-07-05T00:21:33.459291+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2KRZHJK","created_at":"2026-07-05T00:21:33.459291+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/M2KRZHJKOWK2XON5EPH4L42SNQ","json":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ.json","graph_json":"https://pith.science/api/pith-number/M2KRZHJKOWK2XON5EPH4L42SNQ/graph.json","events_json":"https://pith.science/api/pith-number/M2KRZHJKOWK2XON5EPH4L42SNQ/events.json","paper":"https://pith.science/paper/M2KRZHJK"},"agent_actions":{"view_html":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ","download_json":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ.json","view_paper":"https://pith.science/paper/M2KRZHJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06904&json=true","fetch_graph":"https://pith.science/api/pith-number/M2KRZHJKOWK2XON5EPH4L42SNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/M2KRZHJKOWK2XON5EPH4L42SNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/action/storage_attestation","attest_author":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/action/author_attestation","sign_citation":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/action/citation_signature","submit_replication":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/action/replication_record"}},"created_at":"2026-07-05T00:21:33.459291+00:00","updated_at":"2026-07-05T00:21:33.459291+00:00"}