{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S4E62RYIRYKLNDHZARZRO7SWAD","short_pith_number":"pith:S4E62RYI","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"},"canonical_sha256":"9709ed47088e14b68cf90473177e5600cabe35fe580f3f5f9648e86b286d0a96","source":{"kind":"arxiv","id":"1606.07992","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07992","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07992v5","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07992","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"S4E62RYIRYKL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S4E62RYIRYKLNDHZ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S4E62RYI","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S4E62RYIRYKLNDHZARZRO7SWAD","target":"record","payload":{"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"},"canonical_sha256":"9709ed47088e14b68cf90473177e5600cabe35fe580f3f5f9648e86b286d0a96","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"},"source_kind":"arxiv","source_id":"1606.07992","source_version":5,"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-05-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTzwOdZ08d/+AFQG+nc/x1CnqMxGs3L4m7S0+jTrm9MdSDXJK9faE5BDLQZGdbp0GVZ/dE8VNt/bLhhiIq9XDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:32:35.460581Z"},"content_sha256":"7e3f677fb09e4a8edc30ab43b0b6f1cfe610734363943a022aee785c3ba694d1","schema_version":"1.0","event_id":"sha256:7e3f677fb09e4a8edc30ab43b0b6f1cfe610734363943a022aee785c3ba694d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S4E62RYIRYKLNDHZARZRO7SWAD","target":"graph","payload":{"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"},"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-05-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFFGdbvoIkhWCiFqKoj0K1h1cjAxPRQTI4NdfKUZW2laG0CaY9YGWfxL4Udw8BDIcX3FzGivdZfhDSjRbj9kDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:32:35.460945Z"},"content_sha256":"c25cc635eebdc7640ff99839193c6fb86a6a4308137154c87a456b4ceb85bb49","schema_version":"1.0","event_id":"sha256:c25cc635eebdc7640ff99839193c6fb86a6a4308137154c87a456b4ceb85bb49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/bundle.json","state_url":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4E62RYIRYKLNDHZARZRO7SWAD/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-06-03T02:32:35Z","links":{"resolver":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD","bundle":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/bundle.json","state":"https://pith.science/pith/S4E62RYIRYKLNDHZARZRO7SWAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4E62RYIRYKLNDHZARZRO7SWAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S4E62RYIRYKLNDHZARZRO7SWAD","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":"b00bae8c357e6af00b614054cbfe8901e36cc7470a36637f1e46abd33715baf2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-26T03:31:02Z","title_canon_sha256":"154c4f0da95b22a6042a4a7994107e2038071edc069e82058dc6df2fd979f161"},"schema_version":"1.0","source":{"id":"1606.07992","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07992","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07992v5","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07992","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"S4E62RYIRYKL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S4E62RYIRYKLNDHZ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S4E62RYI","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:c25cc635eebdc7640ff99839193c6fb86a6a4308137154c87a456b4ceb85bb49","target":"graph","created_at":"2026-05-18T00:10:48Z","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"},"paper":{"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","authors_text":"Rameshwar Pratap, Sandeep Sen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-26T03:31:02Z","title":"Faster Coreset Construction for Projective Clustering via Low-Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07992","kind":"arxiv","version":5},"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:7e3f677fb09e4a8edc30ab43b0b6f1cfe610734363943a022aee785c3ba694d1","target":"record","created_at":"2026-05-18T00:10:48Z","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":"b00bae8c357e6af00b614054cbfe8901e36cc7470a36637f1e46abd33715baf2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-26T03:31:02Z","title_canon_sha256":"154c4f0da95b22a6042a4a7994107e2038071edc069e82058dc6df2fd979f161"},"schema_version":"1.0","source":{"id":"1606.07992","kind":"arxiv","version":5}},"canonical_sha256":"9709ed47088e14b68cf90473177e5600cabe35fe580f3f5f9648e86b286d0a96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9709ed47088e14b68cf90473177e5600cabe35fe580f3f5f9648e86b286d0a96","first_computed_at":"2026-05-18T00:10:48.154808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:48.154808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uZy4U4IJULSgo2UOzWlyUR2DGgDJzYg4UOBmqeAS1t18J9JQQh6GIAf4jGhLWkd7fqP3MkDwkGvgRnv9VbZMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:48.155405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07992","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e3f677fb09e4a8edc30ab43b0b6f1cfe610734363943a022aee785c3ba694d1","sha256:c25cc635eebdc7640ff99839193c6fb86a6a4308137154c87a456b4ceb85bb49"],"state_sha256":"502caaadb375dfcf505e90e8296ba9309b4fba799fed32f0ec171a1774fa167b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5aRxLiyHansNpcofcrCUIGDY9lz0ak0IyFfRM+ZvExwaLVFO/RPyPDAgRNFhXuM/tAKSlq8e3koxmmqRDfeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:32:35.463037Z","bundle_sha256":"6b29c36dd476c8fb27b1ca19b680bcac2a6537de4aca2b2cb3a0dc4178f98c52"}}