{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L6WO2NEC6225DQ3DVMK5W4EDQS","short_pith_number":"pith:L6WO2NEC","canonical_record":{"source":{"id":"1704.03371","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-11T15:44:49Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"5b62ecf020ade6d70ee22b9a3f0adb701bc9300b8338b02be8810927cad31a59","abstract_canon_sha256":"1828c57654acdeacb7c532291eecce5333a46bac670b6a534bb1f6fb432cdc1b"},"schema_version":"1.0"},"canonical_sha256":"5faced3482f6b5d1c363ab15db708384b909bac7276a303db56516d48c527849","source":{"kind":"arxiv","id":"1704.03371","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03371","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03371v3","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03371","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"pith_short_12","alias_value":"L6WO2NEC6225","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L6WO2NEC6225DQ3D","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L6WO2NEC","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L6WO2NEC6225DQ3DVMK5W4EDQS","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03371","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-11T15:44:49Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"5b62ecf020ade6d70ee22b9a3f0adb701bc9300b8338b02be8810927cad31a59","abstract_canon_sha256":"1828c57654acdeacb7c532291eecce5333a46bac670b6a534bb1f6fb432cdc1b"},"schema_version":"1.0"},"canonical_sha256":"5faced3482f6b5d1c363ab15db708384b909bac7276a303db56516d48c527849","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:03.390147Z","signature_b64":"g194jLvttG7jYI8FRXNcP9B3mKVWI9ds4GfK6At3atsXDUSRbLMzIAE5eDQKmxXGC7x+uSK7abnkJXBpuTcTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5faced3482f6b5d1c363ab15db708384b909bac7276a303db56516d48c527849","last_reissued_at":"2026-05-17T23:57:03.389576Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:03.389576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03371","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-05-17T23:57:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lipQJ1C80t8teo+x9bhcHmRGtYZkyD7ao4fLJiwEFsvrqACpwViha5Ib/jFuu7dVl09kFQi4ZL7NciXwBoXABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:25:14.778119Z"},"content_sha256":"24ec97a3bdc31a542256eccf7ffba88f6fed53739e2e18ab2ef20ecb8acb751f","schema_version":"1.0","event_id":"sha256:24ec97a3bdc31a542256eccf7ffba88f6fed53739e2e18ab2ef20ecb8acb751f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L6WO2NEC6225DQ3DVMK5W4EDQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, David P. Woodruff","submitted_at":"2017-04-11T15:44:49Z","abstract_excerpt":"We show how to compute a relative-error low-rank approximation to any positive semidefinite (PSD) matrix in sublinear time, i.e., for any $n \\times n$ PSD matrix $A$, in $\\tilde O(n \\cdot poly(k/\\epsilon))$ time we output a rank-$k$ matrix $B$, in factored form, for which $\\|A-B\\|_F^2 \\leq (1+\\epsilon)\\|A-A_k\\|_F^2$, where $A_k$ is the best rank-$k$ approximation to $A$. When $k$ and $1/\\epsilon$ are not too large compared to the sparsity of $A$, our algorithm does not need to read all entries of the matrix. Hence, we significantly improve upon previous $nnz(A)$ time algorithms based on oblivi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03371","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":""},"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-17T23:57:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T19Hs6X2mRQ0GZFmUXl1UAcn1GtU/WlxlcXhTrPxAwrNWhKtRhhLIFpUqReE2ANSY2mGfSmsz24Hf++oJDp9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:25:14.778484Z"},"content_sha256":"f6800eb1b54a391f6eee2148e50b2d1218e0226dd3b6407b2931e3f9763be5fa","schema_version":"1.0","event_id":"sha256:f6800eb1b54a391f6eee2148e50b2d1218e0226dd3b6407b2931e3f9763be5fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/bundle.json","state_url":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/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-20T00:25:14Z","links":{"resolver":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS","bundle":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/bundle.json","state":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L6WO2NEC6225DQ3DVMK5W4EDQS","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":"1828c57654acdeacb7c532291eecce5333a46bac670b6a534bb1f6fb432cdc1b","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-11T15:44:49Z","title_canon_sha256":"5b62ecf020ade6d70ee22b9a3f0adb701bc9300b8338b02be8810927cad31a59"},"schema_version":"1.0","source":{"id":"1704.03371","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03371","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03371v3","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03371","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"pith_short_12","alias_value":"L6WO2NEC6225","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L6WO2NEC6225DQ3D","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L6WO2NEC","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:f6800eb1b54a391f6eee2148e50b2d1218e0226dd3b6407b2931e3f9763be5fa","target":"graph","created_at":"2026-05-17T23:57:03Z","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":"We show how to compute a relative-error low-rank approximation to any positive semidefinite (PSD) matrix in sublinear time, i.e., for any $n \\times n$ PSD matrix $A$, in $\\tilde O(n \\cdot poly(k/\\epsilon))$ time we output a rank-$k$ matrix $B$, in factored form, for which $\\|A-B\\|_F^2 \\leq (1+\\epsilon)\\|A-A_k\\|_F^2$, where $A_k$ is the best rank-$k$ approximation to $A$. When $k$ and $1/\\epsilon$ are not too large compared to the sparsity of $A$, our algorithm does not need to read all entries of the matrix. Hence, we significantly improve upon previous $nnz(A)$ time algorithms based on oblivi","authors_text":"Cameron Musco, David P. Woodruff","cross_cats":["cs.LG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-11T15:44:49Z","title":"Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03371","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:24ec97a3bdc31a542256eccf7ffba88f6fed53739e2e18ab2ef20ecb8acb751f","target":"record","created_at":"2026-05-17T23:57:03Z","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":"1828c57654acdeacb7c532291eecce5333a46bac670b6a534bb1f6fb432cdc1b","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-11T15:44:49Z","title_canon_sha256":"5b62ecf020ade6d70ee22b9a3f0adb701bc9300b8338b02be8810927cad31a59"},"schema_version":"1.0","source":{"id":"1704.03371","kind":"arxiv","version":3}},"canonical_sha256":"5faced3482f6b5d1c363ab15db708384b909bac7276a303db56516d48c527849","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5faced3482f6b5d1c363ab15db708384b909bac7276a303db56516d48c527849","first_computed_at":"2026-05-17T23:57:03.389576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:03.389576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g194jLvttG7jYI8FRXNcP9B3mKVWI9ds4GfK6At3atsXDUSRbLMzIAE5eDQKmxXGC7x+uSK7abnkJXBpuTcTDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:03.390147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03371","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24ec97a3bdc31a542256eccf7ffba88f6fed53739e2e18ab2ef20ecb8acb751f","sha256:f6800eb1b54a391f6eee2148e50b2d1218e0226dd3b6407b2931e3f9763be5fa"],"state_sha256":"2ee518c5812d68682186d4d111a71f47841b0e7f1ea078039629b24c3b783d1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fc743pEE9KQ1nn6BS2ZVzA/BlFpHbEsxaiz2NZxory1sBc1JTbxK6UIKWJmlgS7NHrEcwd6cHgIg1ZNjz6WvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T00:25:14.780395Z","bundle_sha256":"0386d54b9dda1e745bed218657f464e993b3ec113bae9b96c498957948e28c97"}}