{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HDJVEZJNXQ7Y5E7XO2P2ATIEZB","short_pith_number":"pith:HDJVEZJN","canonical_record":{"source":{"id":"1410.8802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2014-10-31T16:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"579813b1fe1500daf42f9dcffd32477a7664328804499a34a822af2fdba6f2b6","abstract_canon_sha256":"29db4f79aa236a8eecc85b9badc97152782cb1455896e00d8492a0f2ad71b599"},"schema_version":"1.0"},"canonical_sha256":"38d352652dbc3f8e93f7769fa04d04c84a1ec3f4f327c74205047ac7954aa514","source":{"kind":"arxiv","id":"1410.8802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8802","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8802v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8802","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"HDJVEZJNXQ7Y","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDJVEZJNXQ7Y5E7X","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDJVEZJN","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HDJVEZJNXQ7Y5E7XO2P2ATIEZB","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2014-10-31T16:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"579813b1fe1500daf42f9dcffd32477a7664328804499a34a822af2fdba6f2b6","abstract_canon_sha256":"29db4f79aa236a8eecc85b9badc97152782cb1455896e00d8492a0f2ad71b599"},"schema_version":"1.0"},"canonical_sha256":"38d352652dbc3f8e93f7769fa04d04c84a1ec3f4f327c74205047ac7954aa514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.666285Z","signature_b64":"815mBmzFf9qbiWzBk5NSPvIWWrxdnykb2vzZ/xr8Sh5qlCW+58yAZTsi1hjRg9R8Qcdu3k48iu96oYF/mjdlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38d352652dbc3f8e93f7769fa04d04c84a1ec3f4f327c74205047ac7954aa514","last_reissued_at":"2026-05-18T02:38:53.665896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.665896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8802","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:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZATi4XNtGm5KJslfNPfnvbwypFxAkGUTpNTPfZgcAx8xC4TSJVt5HLSoqO6YKCFqV/9i0Xlwjn9r3WZGeBrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:51:46.765913Z"},"content_sha256":"9b527f72fea40720a787554db81519faee3055c952196350bcbcb8ed747aa484","schema_version":"1.0","event_id":"sha256:9b527f72fea40720a787554db81519faee3055c952196350bcbcb8ed747aa484"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HDJVEZJNXQ7Y5E7XO2P2ATIEZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Rank Matrix Approximation in Linear Time","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled","submitted_at":"2014-10-31T16:46:36Z","abstract_excerpt":"$\\newcommand{\\MatA}{\\mathcal{M}}$ $\\newcommand{\\eps}{\\varepsilon}$ $\\newcommand{\\NSize}{\\mathsf{N}{}}$ $\\newcommand{\\MatB}{\\mathcal{B}}$ $\\newcommand{\\Fnorm}[1]{\\left\\| {#1} \\right\\|_F}$ $\\newcommand{\\PrcOpt}[2]{\\mu_{\\mathrm{opt}}\\pth{#1, #2}}$ $\\newcommand{\\pth}[1]{\\left(#1\\right)}$\n  Given a matrix $\\MatA$ with $n$ rows and $d$ columns, and fixed $k$ and $\\eps$, we present an algorithm that in linear time (i.e., $O(\\NSize )$) computes a $k$-rank matrix $\\MatB$ with approximation error $\\Fnorm{\\MatA - \\MatB}^2 \\leq (1+\\eps) \\PrcOpt{\\MatA}{k}$, where $\\NSize = n d$ is the input size, and $\\Prc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8802","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:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtIVUQyG9Ubusxlj8liUo1mh5uUZYUFpZkKNTI+qvmAvCpkJUrmSp+ZDfcLH7HxZetMKWVw2IDiMkxeqLQOeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:51:46.766247Z"},"content_sha256":"653fee6cc290ed7831bcde027f1084635901d4752261ebad4054c5de065735c0","schema_version":"1.0","event_id":"sha256:653fee6cc290ed7831bcde027f1084635901d4752261ebad4054c5de065735c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/bundle.json","state_url":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/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-08T12:51:46Z","links":{"resolver":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB","bundle":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/bundle.json","state":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HDJVEZJNXQ7Y5E7XO2P2ATIEZB","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":"29db4f79aa236a8eecc85b9badc97152782cb1455896e00d8492a0f2ad71b599","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2014-10-31T16:46:36Z","title_canon_sha256":"579813b1fe1500daf42f9dcffd32477a7664328804499a34a822af2fdba6f2b6"},"schema_version":"1.0","source":{"id":"1410.8802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8802","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8802v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8802","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"HDJVEZJNXQ7Y","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDJVEZJNXQ7Y5E7X","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDJVEZJN","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:653fee6cc290ed7831bcde027f1084635901d4752261ebad4054c5de065735c0","target":"graph","created_at":"2026-05-18T02:38:53Z","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":"$\\newcommand{\\MatA}{\\mathcal{M}}$ $\\newcommand{\\eps}{\\varepsilon}$ $\\newcommand{\\NSize}{\\mathsf{N}{}}$ $\\newcommand{\\MatB}{\\mathcal{B}}$ $\\newcommand{\\Fnorm}[1]{\\left\\| {#1} \\right\\|_F}$ $\\newcommand{\\PrcOpt}[2]{\\mu_{\\mathrm{opt}}\\pth{#1, #2}}$ $\\newcommand{\\pth}[1]{\\left(#1\\right)}$\n  Given a matrix $\\MatA$ with $n$ rows and $d$ columns, and fixed $k$ and $\\eps$, we present an algorithm that in linear time (i.e., $O(\\NSize )$) computes a $k$-rank matrix $\\MatB$ with approximation error $\\Fnorm{\\MatA - \\MatB}^2 \\leq (1+\\eps) \\PrcOpt{\\MatA}{k}$, where $\\NSize = n d$ is the input size, and $\\Prc","authors_text":"Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2014-10-31T16:46:36Z","title":"Low Rank Matrix Approximation in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8802","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:9b527f72fea40720a787554db81519faee3055c952196350bcbcb8ed747aa484","target":"record","created_at":"2026-05-18T02:38:53Z","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":"29db4f79aa236a8eecc85b9badc97152782cb1455896e00d8492a0f2ad71b599","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2014-10-31T16:46:36Z","title_canon_sha256":"579813b1fe1500daf42f9dcffd32477a7664328804499a34a822af2fdba6f2b6"},"schema_version":"1.0","source":{"id":"1410.8802","kind":"arxiv","version":1}},"canonical_sha256":"38d352652dbc3f8e93f7769fa04d04c84a1ec3f4f327c74205047ac7954aa514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38d352652dbc3f8e93f7769fa04d04c84a1ec3f4f327c74205047ac7954aa514","first_computed_at":"2026-05-18T02:38:53.665896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:53.665896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"815mBmzFf9qbiWzBk5NSPvIWWrxdnykb2vzZ/xr8Sh5qlCW+58yAZTsi1hjRg9R8Qcdu3k48iu96oYF/mjdlDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:53.666285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b527f72fea40720a787554db81519faee3055c952196350bcbcb8ed747aa484","sha256:653fee6cc290ed7831bcde027f1084635901d4752261ebad4054c5de065735c0"],"state_sha256":"1fe34786a6e3c105382d6be8a64f15bf4de08bdb66b9a201b79a79b8d25a67f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4ZZgy9fvhsyYhJBSZcdxAjIy8kLLRj+uI6oN+qgnd1iRyChwkd22wWUZGSCLPgo2et7n8gjIqZLUpkZQXcOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:51:46.768516Z","bundle_sha256":"da12b0840f29ddb409ce3af6e00986de725eb91bfffbdcc8be5d89753daa173a"}}