{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R4HVLIYKFPGVBQ62HCEBM2XW46","short_pith_number":"pith:R4HVLIYK","canonical_record":{"source":{"id":"1705.07140","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-19T18:41:03Z","cross_cats_sorted":[],"title_canon_sha256":"7c8a3101aaa5e62e2396ad737d0392e8e68264580d8949dc3dd67b387ca39fba","abstract_canon_sha256":"36df5eb0a1b77c96c72177313961318c95fb5512be00868f58ff1d9812d980f1"},"schema_version":"1.0"},"canonical_sha256":"8f0f55a30a2bcd50c3da3888166af6e7a2b07d325be52c845da6406a04a79be2","source":{"kind":"arxiv","id":"1705.07140","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07140","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07140v3","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07140","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"R4HVLIYKFPGV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R4HVLIYKFPGVBQ62","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R4HVLIYK","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R4HVLIYKFPGVBQ62HCEBM2XW46","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07140","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-19T18:41:03Z","cross_cats_sorted":[],"title_canon_sha256":"7c8a3101aaa5e62e2396ad737d0392e8e68264580d8949dc3dd67b387ca39fba","abstract_canon_sha256":"36df5eb0a1b77c96c72177313961318c95fb5512be00868f58ff1d9812d980f1"},"schema_version":"1.0"},"canonical_sha256":"8f0f55a30a2bcd50c3da3888166af6e7a2b07d325be52c845da6406a04a79be2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:57.010781Z","signature_b64":"ZGu2exmUZKFxIHUkzPGNqq4d85ZO0fUx2BC/p91S8H8SOvcfhqUfltl1zRIWcB1dhvT57rsjgZX+L6cxpVyjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f0f55a30a2bcd50c3da3888166af6e7a2b07d325be52c845da6406a04a79be2","last_reissued_at":"2026-05-18T00:03:57.010281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:57.010281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07140","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-18T00:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jeCztPCFg9oTSvXbN6LmzlGSCoG7dBwPFwWHn+4bb7nQNQIpu6VtVmjbDjItZR379Kw53Exm4vsDRrxeT0hiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:28:28.664075Z"},"content_sha256":"df0e9cb452998fe6d7eb928640374f303c668263429255557f4ca6a4e66e742c","schema_version":"1.0","event_id":"sha256:df0e9cb452998fe6d7eb928640374f303c668263429255557f4ca6a4e66e742c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R4HVLIYKFPGVBQ62HCEBM2XW46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Frequent Directions Algorithm for Low Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dan Teng, Delin Chu","submitted_at":"2017-05-19T18:41:03Z","abstract_excerpt":"Recently a deterministic method, frequent directions (FD) is proposed to solve the high dimensional low rank approximation problem. It works well in practice, but experiences high computational cost. In this paper, we establish a fast frequent directions algorithm for the low rank approximation problem, which implants a randomized algorithm, sparse subspace embedding (SpEmb) in FD. This new algorithm makes use of FD's natural block structure and sends more information through SpEmb to each block in FD. We prove that our new algorithm produces a good low rank approximation with a sketch of size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07140","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-18T00:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfcVB8dlD79em7ulG6MWeuuiOmKS4zhiG5JZDOcTQIvmbQruF3KwTt5t/2/81v7ogteBDtBhvE6FmTh67VHfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:28:28.664439Z"},"content_sha256":"73c512f6d18fd5bc3f6dcdd4babde62489d42ba07ad8bf6c26a0d7ca9450f1da","schema_version":"1.0","event_id":"sha256:73c512f6d18fd5bc3f6dcdd4babde62489d42ba07ad8bf6c26a0d7ca9450f1da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4HVLIYKFPGVBQ62HCEBM2XW46/bundle.json","state_url":"https://pith.science/pith/R4HVLIYKFPGVBQ62HCEBM2XW46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4HVLIYKFPGVBQ62HCEBM2XW46/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-01T09:28:28Z","links":{"resolver":"https://pith.science/pith/R4HVLIYKFPGVBQ62HCEBM2XW46","bundle":"https://pith.science/pith/R4HVLIYKFPGVBQ62HCEBM2XW46/bundle.json","state":"https://pith.science/pith/R4HVLIYKFPGVBQ62HCEBM2XW46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4HVLIYKFPGVBQ62HCEBM2XW46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R4HVLIYKFPGVBQ62HCEBM2XW46","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":"36df5eb0a1b77c96c72177313961318c95fb5512be00868f58ff1d9812d980f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-19T18:41:03Z","title_canon_sha256":"7c8a3101aaa5e62e2396ad737d0392e8e68264580d8949dc3dd67b387ca39fba"},"schema_version":"1.0","source":{"id":"1705.07140","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07140","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07140v3","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07140","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"R4HVLIYKFPGV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R4HVLIYKFPGVBQ62","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R4HVLIYK","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:73c512f6d18fd5bc3f6dcdd4babde62489d42ba07ad8bf6c26a0d7ca9450f1da","target":"graph","created_at":"2026-05-18T00:03:57Z","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":"Recently a deterministic method, frequent directions (FD) is proposed to solve the high dimensional low rank approximation problem. It works well in practice, but experiences high computational cost. In this paper, we establish a fast frequent directions algorithm for the low rank approximation problem, which implants a randomized algorithm, sparse subspace embedding (SpEmb) in FD. This new algorithm makes use of FD's natural block structure and sends more information through SpEmb to each block in FD. We prove that our new algorithm produces a good low rank approximation with a sketch of size","authors_text":"Dan Teng, Delin Chu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-19T18:41:03Z","title":"A Fast Frequent Directions Algorithm for Low Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07140","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:df0e9cb452998fe6d7eb928640374f303c668263429255557f4ca6a4e66e742c","target":"record","created_at":"2026-05-18T00:03:57Z","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":"36df5eb0a1b77c96c72177313961318c95fb5512be00868f58ff1d9812d980f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-19T18:41:03Z","title_canon_sha256":"7c8a3101aaa5e62e2396ad737d0392e8e68264580d8949dc3dd67b387ca39fba"},"schema_version":"1.0","source":{"id":"1705.07140","kind":"arxiv","version":3}},"canonical_sha256":"8f0f55a30a2bcd50c3da3888166af6e7a2b07d325be52c845da6406a04a79be2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f0f55a30a2bcd50c3da3888166af6e7a2b07d325be52c845da6406a04a79be2","first_computed_at":"2026-05-18T00:03:57.010281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:57.010281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZGu2exmUZKFxIHUkzPGNqq4d85ZO0fUx2BC/p91S8H8SOvcfhqUfltl1zRIWcB1dhvT57rsjgZX+L6cxpVyjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:57.010781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07140","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df0e9cb452998fe6d7eb928640374f303c668263429255557f4ca6a4e66e742c","sha256:73c512f6d18fd5bc3f6dcdd4babde62489d42ba07ad8bf6c26a0d7ca9450f1da"],"state_sha256":"e1db264c46429382587592ed219cdde40c21ecfb036da29c690f9c3cf1ca311c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYNq0YdbamrbOlv74dMLYx2UrrHyFWjBToRvsZdWFIVVkJjvilYL4kxpkNOSfpG3UOfJ6uvEiqTC/l/InNidDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:28:28.666588Z","bundle_sha256":"cbc4172b8ff7268ab0d2c1d1b661b9e80276dfb25904cfb482f00a97c8ee77f5"}}