{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M2KRZHJKOWK2XON5EPH4L42SNQ","short_pith_number":"pith:M2KRZHJK","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"},"canonical_sha256":"66951c9d2a7595abb9bd23cfc5f3526c2c5d3bdef8fee74935c444cc45235153","source":{"kind":"arxiv","id":"1903.06904","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06904","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06904v3","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06904","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"M2KRZHJKOWK2","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"pith_short_16","alias_value":"M2KRZHJKOWK2XON5","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"pith_short_8","alias_value":"M2KRZHJK","created_at":"2026-07-05T00:21:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M2KRZHJKOWK2XON5EPH4L42SNQ","target":"record","payload":{"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"},"canonical_sha256":"66951c9d2a7595abb9bd23cfc5f3526c2c5d3bdef8fee74935c444cc45235153","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"},"source_kind":"arxiv","source_id":"1903.06904","source_version":3,"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-07-05T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4D7b7fl3lyn5kgXdARJjsnTjlvFF8KSsRenAa9Dqjr8RwA/UpSCN58keQNWdGb6XBj44RIgD8h1cZwzHhIYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:58:13.706983Z"},"content_sha256":"aad9f8938e796aa9382aa1e528214940866f4d918189c3c4377ec6e74c210579","schema_version":"1.0","event_id":"sha256:aad9f8938e796aa9382aa1e528214940866f4d918189c3c4377ec6e74c210579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M2KRZHJKOWK2XON5EPH4L42SNQ","target":"graph","payload":{"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"},"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-07-05T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LacRSFoOIIPNlhFuo90SFD5Yf/fxcq0FHUbB7IeMnKKiS9U+x1AfKwO1/HLI8q7oCGVq6WzTpG9lJur2x3KDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:58:13.707564Z"},"content_sha256":"a6c83de05139ffac5961dcb06f7a99fd7bbd321d08110b6f96a724934ab78789","schema_version":"1.0","event_id":"sha256:a6c83de05139ffac5961dcb06f7a99fd7bbd321d08110b6f96a724934ab78789"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/bundle.json","state_url":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/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-08-06T22:58:13Z","links":{"resolver":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ","bundle":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/bundle.json","state":"https://pith.science/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2KRZHJKOWK2XON5EPH4L42SNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M2KRZHJKOWK2XON5EPH4L42SNQ","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":"4f1c6c814e32eb58f257a4776eb23a6d02ca02b48261239d36054c0779dff47d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-16T10:34:52Z","title_canon_sha256":"93e5593e73b99aaaedf9180ebc7cb447620abf7d70d4f4352c3e0774d66fb27f"},"schema_version":"1.0","source":{"id":"1903.06904","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06904","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06904v3","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06904","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"M2KRZHJKOWK2","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"pith_short_16","alias_value":"M2KRZHJKOWK2XON5","created_at":"2026-07-05T00:21:33Z"},{"alias_kind":"pith_short_8","alias_value":"M2KRZHJK","created_at":"2026-07-05T00:21:33Z"}],"graph_snapshots":[{"event_id":"sha256:a6c83de05139ffac5961dcb06f7a99fd7bbd321d08110b6f96a724934ab78789","target":"graph","created_at":"2026-07-05T00:21:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.06904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Dan Feldman, Yair Marom","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-16T10:34:52Z","title":"k-Means Clustering of Lines for Big Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06904","kind":"arxiv","version":3},"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:aad9f8938e796aa9382aa1e528214940866f4d918189c3c4377ec6e74c210579","target":"record","created_at":"2026-07-05T00:21:33Z","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":"4f1c6c814e32eb58f257a4776eb23a6d02ca02b48261239d36054c0779dff47d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-16T10:34:52Z","title_canon_sha256":"93e5593e73b99aaaedf9180ebc7cb447620abf7d70d4f4352c3e0774d66fb27f"},"schema_version":"1.0","source":{"id":"1903.06904","kind":"arxiv","version":3}},"canonical_sha256":"66951c9d2a7595abb9bd23cfc5f3526c2c5d3bdef8fee74935c444cc45235153","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66951c9d2a7595abb9bd23cfc5f3526c2c5d3bdef8fee74935c444cc45235153","first_computed_at":"2026-07-05T00:21:33.459237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:21:33.459237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f/iHuB8V2G4b8HsSTEaPxZOhND/G1Ft4RZRYa2u2f4aa9q8peemxs9ER21TngZ0CmPP1qwsKLoxjsPfF8K6pBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:21:33.459728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06904","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aad9f8938e796aa9382aa1e528214940866f4d918189c3c4377ec6e74c210579","sha256:a6c83de05139ffac5961dcb06f7a99fd7bbd321d08110b6f96a724934ab78789"],"state_sha256":"c21f5b55275764820d9ac6f047271ef3dde61acf2d8e38641fdc09a0cc719f33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZ0EbxCSeMbnYKu8hg6n1XkpQEvSDgWYOWdKUxAK5Kp7jB8dh3SEvOO1edTv1oMn25/7SZQ+SXtnZPaPfxpcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:58:13.712521Z","bundle_sha256":"6f55f6879710deac3b826859cbd0936b3184b07981f881d5af9fbf38bf5a7edb"}}