{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KCZQRXFP2JS3RD4D4HLZHTDNNO","short_pith_number":"pith:KCZQRXFP","canonical_record":{"source":{"id":"1611.01391","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T02:43:20Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"80e49effeede6c35b1415c7520acf95cad1ce3e80ef78c75f6782474ddad2704","abstract_canon_sha256":"a22a7a71a39c84966ad2393ff87c86c3636fcd499dd6daafa13d08b48bc92477"},"schema_version":"1.0"},"canonical_sha256":"50b308dcafd265b88f83e1d793cc6d6b9b839093b33dda0c043980a7ef4d1563","source":{"kind":"arxiv","id":"1611.01391","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01391","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01391v5","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01391","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"KCZQRXFP2JS3","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KCZQRXFP2JS3RD4D","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KCZQRXFP","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KCZQRXFP2JS3RD4D4HLZHTDNNO","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01391","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T02:43:20Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"80e49effeede6c35b1415c7520acf95cad1ce3e80ef78c75f6782474ddad2704","abstract_canon_sha256":"a22a7a71a39c84966ad2393ff87c86c3636fcd499dd6daafa13d08b48bc92477"},"schema_version":"1.0"},"canonical_sha256":"50b308dcafd265b88f83e1d793cc6d6b9b839093b33dda0c043980a7ef4d1563","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.861764Z","signature_b64":"YQHBcFBIjhh0MT8n1it/AM96xvAxoT6fLZaRxRTcwVkx2Qzfp2uh2U92vo/Udu+GjICfpmYoKFIPMNCNCIH3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50b308dcafd265b88f83e1d793cc6d6b9b839093b33dda0c043980a7ef4d1563","last_reissued_at":"2026-05-18T00:05:05.861132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.861132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01391","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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2c8A5XSkZ5ZJw98G7z2Z4+i/JeBT0PsLsjVEgEgutyXSCqvQYnjOHcHT2LqEU0F26kuIG2ukws/88LBviyvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:41.486335Z"},"content_sha256":"251c1ec3a87cd0998877920e75cd717cb9cbfd2c68f557ea3602bb42a7d77ebf","schema_version":"1.0","event_id":"sha256:251c1ec3a87cd0998877920e75cd717cb9cbfd2c68f557ea3602bb42a7d77ebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KCZQRXFP2JS3RD4D4HLZHTDNNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superfast Low-Rank Approximation and Least Squares Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.NA","authors_text":"John Svadlenka, Liang Zhao, Qi Luan, Victor Y. Pan","submitted_at":"2016-11-03T02:43:20Z","abstract_excerpt":"Low Rank Approximation is among most fundamental subjects of numerical linear algebra having important applications to various areas of modern computing and %they range from machine learning theory and %neural networks to data mining and analysis. The known algorithms compute such approximations by using more flops than the input matrix has entries, but we prove that much fewer flops than entries are sufficient in the case of the average input (\"flop\" stands for \"floating point arithmetic operation\"). We prove this twice -- for the solutions by means of two distinct algorithms, and we analyze "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01391","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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZqhg3iw+9wbuZufwp8sI/7fQhstdvvZvhRa/EVEbi3kjb5aOMqctHKwZogkZzutUp0lGM+F6AlbQbT5zb1JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:41.486888Z"},"content_sha256":"1736b607ad78bb007f8231c107856a6834daa6657eddc902e6707ce25a2063e4","schema_version":"1.0","event_id":"sha256:1736b607ad78bb007f8231c107856a6834daa6657eddc902e6707ce25a2063e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCZQRXFP2JS3RD4D4HLZHTDNNO/bundle.json","state_url":"https://pith.science/pith/KCZQRXFP2JS3RD4D4HLZHTDNNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCZQRXFP2JS3RD4D4HLZHTDNNO/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-07T16:14:41Z","links":{"resolver":"https://pith.science/pith/KCZQRXFP2JS3RD4D4HLZHTDNNO","bundle":"https://pith.science/pith/KCZQRXFP2JS3RD4D4HLZHTDNNO/bundle.json","state":"https://pith.science/pith/KCZQRXFP2JS3RD4D4HLZHTDNNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCZQRXFP2JS3RD4D4HLZHTDNNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KCZQRXFP2JS3RD4D4HLZHTDNNO","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":"a22a7a71a39c84966ad2393ff87c86c3636fcd499dd6daafa13d08b48bc92477","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T02:43:20Z","title_canon_sha256":"80e49effeede6c35b1415c7520acf95cad1ce3e80ef78c75f6782474ddad2704"},"schema_version":"1.0","source":{"id":"1611.01391","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01391","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01391v5","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01391","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"KCZQRXFP2JS3","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KCZQRXFP2JS3RD4D","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KCZQRXFP","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:1736b607ad78bb007f8231c107856a6834daa6657eddc902e6707ce25a2063e4","target":"graph","created_at":"2026-05-18T00:05:05Z","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":"Low Rank Approximation is among most fundamental subjects of numerical linear algebra having important applications to various areas of modern computing and %they range from machine learning theory and %neural networks to data mining and analysis. The known algorithms compute such approximations by using more flops than the input matrix has entries, but we prove that much fewer flops than entries are sufficient in the case of the average input (\"flop\" stands for \"floating point arithmetic operation\"). We prove this twice -- for the solutions by means of two distinct algorithms, and we analyze ","authors_text":"John Svadlenka, Liang Zhao, Qi Luan, Victor Y. Pan","cross_cats":["math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T02:43:20Z","title":"Superfast Low-Rank Approximation and Least Squares Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01391","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:251c1ec3a87cd0998877920e75cd717cb9cbfd2c68f557ea3602bb42a7d77ebf","target":"record","created_at":"2026-05-18T00:05:05Z","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":"a22a7a71a39c84966ad2393ff87c86c3636fcd499dd6daafa13d08b48bc92477","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T02:43:20Z","title_canon_sha256":"80e49effeede6c35b1415c7520acf95cad1ce3e80ef78c75f6782474ddad2704"},"schema_version":"1.0","source":{"id":"1611.01391","kind":"arxiv","version":5}},"canonical_sha256":"50b308dcafd265b88f83e1d793cc6d6b9b839093b33dda0c043980a7ef4d1563","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50b308dcafd265b88f83e1d793cc6d6b9b839093b33dda0c043980a7ef4d1563","first_computed_at":"2026-05-18T00:05:05.861132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:05.861132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YQHBcFBIjhh0MT8n1it/AM96xvAxoT6fLZaRxRTcwVkx2Qzfp2uh2U92vo/Udu+GjICfpmYoKFIPMNCNCIH3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:05.861764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01391","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:251c1ec3a87cd0998877920e75cd717cb9cbfd2c68f557ea3602bb42a7d77ebf","sha256:1736b607ad78bb007f8231c107856a6834daa6657eddc902e6707ce25a2063e4"],"state_sha256":"1a0d1a377b62b550dac5443f64302e4b12be16a8e015cef83e2c97d8cfece14f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4ct48moqsHbx0h5BwyMsHHtVFJGBIJHYLzejdqcwD4k9Q4bhFi+0Ga8njO5BU45lj9zHt6OsqtKGkIcS8KyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:14:41.489962Z","bundle_sha256":"8f16802c3e52177abb0928bd8af00ec5dbdfe96999777a0630aba41bc96bf1c7"}}