{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OIXHK47UAF25W4UGQJRCQTI4J4","short_pith_number":"pith:OIXHK47U","canonical_record":{"source":{"id":"1503.01663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T15:39:49Z","cross_cats_sorted":[],"title_canon_sha256":"2d4dbcabc240097d406d0ed404a99a260b15bb22bf70d842c73f505b8ffe802c","abstract_canon_sha256":"c741617a7433f20d9f38b0b838a9f1968739e20f40c5dbf92f424bc4b865a63b"},"schema_version":"1.0"},"canonical_sha256":"722e7573f40175db72868262284d1c4f0e57ddde691be9c06fffe5770422c869","source":{"kind":"arxiv","id":"1503.01663","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01663","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01663v1","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01663","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"OIXHK47UAF25","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OIXHK47UAF25W4UG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OIXHK47U","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OIXHK47UAF25W4UGQJRCQTI4J4","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T15:39:49Z","cross_cats_sorted":[],"title_canon_sha256":"2d4dbcabc240097d406d0ed404a99a260b15bb22bf70d842c73f505b8ffe802c","abstract_canon_sha256":"c741617a7433f20d9f38b0b838a9f1968739e20f40c5dbf92f424bc4b865a63b"},"schema_version":"1.0"},"canonical_sha256":"722e7573f40175db72868262284d1c4f0e57ddde691be9c06fffe5770422c869","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:33.167490Z","signature_b64":"+Um35d6RguO6UFgNkhZnzW50oVvTs5Fteg1a+mPyfnh/eOjh3dwuk/cm3HEtySFgK8p/3mwRMJ3PVAahOjYrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722e7573f40175db72868262284d1c4f0e57ddde691be9c06fffe5770422c869","last_reissued_at":"2026-05-18T02:25:33.166967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:33.166967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01663","source_version":1,"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-18T02:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlKvpEmFWd3cVflRotUzc5li/AbLNuuwc72Eg6rFE8RQvLt/PE4Pw+zkTQl+e8NePs19JtFAeoCIzyLWQho9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:02:07.175240Z"},"content_sha256":"93f1a7dde2f3959b07ceb7864a03b7cbef2cb4c6422dda38c5de2d2a48363859","schema_version":"1.0","event_id":"sha256:93f1a7dde2f3959b07ceb7864a03b7cbef2cb4c6422dda38c5de2d2a48363859"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OIXHK47UAF25W4UGQJRCQTI4J4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dimensionality Reduction of Massive Sparse Datasets Using Coresets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dan Feldman, Daniela Rus, Mikhail Volkov","submitted_at":"2015-03-05T15:39:49Z","abstract_excerpt":"In this paper we present a practical solution with performance guarantees to the problem of dimensionality reduction for very large scale sparse matrices. We show applications of our approach to computing the low rank approximation (reduced SVD) of such matrices. Our solution uses coresets, which is a subset of $O(k/\\eps^2)$ scaled rows from the $n\\times d$ input matrix, that approximates the sub of squared distances from its rows to every $k$-dimensional subspace in $\\REAL^d$, up to a factor of $1\\pm\\eps$. An open theoretical problem has been whether we can compute such a coreset that is inde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01663","kind":"arxiv","version":1},"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-18T02:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RfKdKdcpAUBA7l+L6uXqeA5JsqP3qyExL/f1UoXzlYFpstgyEyRAJbcqI5ixjtraTkRAPNW/Ywfch8WbyfqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:02:07.175859Z"},"content_sha256":"a2438de26a77f92b2aaf7a07d5fc73c710b370b3cdf1e5f8d19ea46102d8d32f","schema_version":"1.0","event_id":"sha256:a2438de26a77f92b2aaf7a07d5fc73c710b370b3cdf1e5f8d19ea46102d8d32f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIXHK47UAF25W4UGQJRCQTI4J4/bundle.json","state_url":"https://pith.science/pith/OIXHK47UAF25W4UGQJRCQTI4J4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIXHK47UAF25W4UGQJRCQTI4J4/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-05-20T13:02:07Z","links":{"resolver":"https://pith.science/pith/OIXHK47UAF25W4UGQJRCQTI4J4","bundle":"https://pith.science/pith/OIXHK47UAF25W4UGQJRCQTI4J4/bundle.json","state":"https://pith.science/pith/OIXHK47UAF25W4UGQJRCQTI4J4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIXHK47UAF25W4UGQJRCQTI4J4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OIXHK47UAF25W4UGQJRCQTI4J4","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":"c741617a7433f20d9f38b0b838a9f1968739e20f40c5dbf92f424bc4b865a63b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T15:39:49Z","title_canon_sha256":"2d4dbcabc240097d406d0ed404a99a260b15bb22bf70d842c73f505b8ffe802c"},"schema_version":"1.0","source":{"id":"1503.01663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01663","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01663v1","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01663","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"OIXHK47UAF25","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OIXHK47UAF25W4UG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OIXHK47U","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:a2438de26a77f92b2aaf7a07d5fc73c710b370b3cdf1e5f8d19ea46102d8d32f","target":"graph","created_at":"2026-05-18T02:25: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"},"paper":{"abstract_excerpt":"In this paper we present a practical solution with performance guarantees to the problem of dimensionality reduction for very large scale sparse matrices. We show applications of our approach to computing the low rank approximation (reduced SVD) of such matrices. Our solution uses coresets, which is a subset of $O(k/\\eps^2)$ scaled rows from the $n\\times d$ input matrix, that approximates the sub of squared distances from its rows to every $k$-dimensional subspace in $\\REAL^d$, up to a factor of $1\\pm\\eps$. An open theoretical problem has been whether we can compute such a coreset that is inde","authors_text":"Dan Feldman, Daniela Rus, Mikhail Volkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T15:39:49Z","title":"Dimensionality Reduction of Massive Sparse Datasets Using Coresets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01663","kind":"arxiv","version":1},"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:93f1a7dde2f3959b07ceb7864a03b7cbef2cb4c6422dda38c5de2d2a48363859","target":"record","created_at":"2026-05-18T02:25: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":"c741617a7433f20d9f38b0b838a9f1968739e20f40c5dbf92f424bc4b865a63b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T15:39:49Z","title_canon_sha256":"2d4dbcabc240097d406d0ed404a99a260b15bb22bf70d842c73f505b8ffe802c"},"schema_version":"1.0","source":{"id":"1503.01663","kind":"arxiv","version":1}},"canonical_sha256":"722e7573f40175db72868262284d1c4f0e57ddde691be9c06fffe5770422c869","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"722e7573f40175db72868262284d1c4f0e57ddde691be9c06fffe5770422c869","first_computed_at":"2026-05-18T02:25:33.166967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:33.166967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Um35d6RguO6UFgNkhZnzW50oVvTs5Fteg1a+mPyfnh/eOjh3dwuk/cm3HEtySFgK8p/3mwRMJ3PVAahOjYrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:33.167490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93f1a7dde2f3959b07ceb7864a03b7cbef2cb4c6422dda38c5de2d2a48363859","sha256:a2438de26a77f92b2aaf7a07d5fc73c710b370b3cdf1e5f8d19ea46102d8d32f"],"state_sha256":"bae13e11a9f6620d3372b578cf3bf97b59b0f31245f192bd3d010c2c46af1899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEy/eoXRVvbP9ynTCG5f1uEoNWM4uSkhkZWUsTA7gZslwmjxR2BuSPhejF+se/mD3txJCI3MuNEbTUTtszWXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T13:02:07.179028Z","bundle_sha256":"bc9ca0a4b7b18ddcf03f23b952aa76d693151bcd24bb3d7448fac724e80d5acc"}}