{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S4E62RYIRYKLNDHZARZRO7SWAD","short_pith_number":"pith:S4E62RYI","schema_version":"1.0","canonical_sha256":"9709ed47088e14b68cf90473177e5600cabe35fe580f3f5f9648e86b286d0a96","source":{"kind":"arxiv","id":"1606.07992","version":5},"attestation_state":"computed","paper":{"title":"Faster Coreset Construction for Projective Clustering via Low-Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Rameshwar Pratap, Sandeep Sen","submitted_at":"2016-06-26T03:31:02Z","abstract_excerpt":"In this work, we present a randomized coreset construction for projective clustering, which involves computing a set of $k$ closest $j$-dimensional linear (affine) subspaces of a given set of $n$ vectors in $d$ dimensions. Let $A \\in \\mathbb{R}^{n\\times d}$ be an input matrix. An earlier deterministic coreset construction of Feldman \\textit{et. al.} relied on computing the SVD of $A$. The best known algorithms for SVD require $\\min\\{nd^2, n^2d\\}$ time, which may not be feasible for large values of $n$ and $d$. We present a coreset construction by projecting the rows of matrix $A$ on some ortho"},"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":"1606.07992","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-26T03:31:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"154c4f0da95b22a6042a4a7994107e2038071edc069e82058dc6df2fd979f161","abstract_canon_sha256":"b00bae8c357e6af00b614054cbfe8901e36cc7470a36637f1e46abd33715baf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.155405Z","signature_b64":"uZy4U4IJULSgo2UOzWlyUR2DGgDJzYg4UOBmqeAS1t18J9JQQh6GIAf4jGhLWkd7fqP3MkDwkGvgRnv9VbZMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9709ed47088e14b68cf90473177e5600cabe35fe580f3f5f9648e86b286d0a96","last_reissued_at":"2026-05-18T00:10:48.154808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.154808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Coreset Construction for Projective Clustering via Low-Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Rameshwar Pratap, Sandeep Sen","submitted_at":"2016-06-26T03:31:02Z","abstract_excerpt":"In this work, we present a randomized coreset construction for projective clustering, which involves computing a set of $k$ closest $j$-dimensional linear (affine) subspaces of a given set of $n$ vectors in $d$ dimensions. Let $A \\in \\mathbb{R}^{n\\times d}$ be an input matrix. An earlier deterministic coreset construction of Feldman \\textit{et. al.} relied on computing the SVD of $A$. The best known algorithms for SVD require $\\min\\{nd^2, n^2d\\}$ time, which may not be feasible for large values of $n$ and $d$. We present a coreset construction by projecting the rows of matrix $A$ on some ortho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07992","kind":"arxiv","version":5},"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":"1606.07992","created_at":"2026-05-18T00:10:48.154897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07992v5","created_at":"2026-05-18T00:10:48.154897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07992","created_at":"2026-05-18T00:10:48.154897+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4E62RYIRYKL","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4E62RYIRYKLNDHZ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4E62RYI","created_at":"2026-05-18T12:30:41.710351+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/S4E62RYIRYKLNDHZARZRO7SWAD","json":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD.json","graph_json":"https://pith.science/api/pith-number/S4E62RYIRYKLNDHZARZRO7SWAD/graph.json","events_json":"https://pith.science/api/pith-number/S4E62RYIRYKLNDHZARZRO7SWAD/events.json","paper":"https://pith.science/paper/S4E62RYI"},"agent_actions":{"view_html":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD","download_json":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD.json","view_paper":"https://pith.science/paper/S4E62RYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07992&json=true","fetch_graph":"https://pith.science/api/pith-number/S4E62RYIRYKLNDHZARZRO7SWAD/graph.json","fetch_events":"https://pith.science/api/pith-number/S4E62RYIRYKLNDHZARZRO7SWAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/action/storage_attestation","attest_author":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/action/author_attestation","sign_citation":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/action/citation_signature","submit_replication":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/action/replication_record"}},"created_at":"2026-05-18T00:10:48.154897+00:00","updated_at":"2026-05-18T00:10:48.154897+00:00"}