{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OVYTOTOT4NT6XFJO2KK7ZEFPIB","short_pith_number":"pith:OVYTOTOT","canonical_record":{"source":{"id":"1307.7454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-29T03:50:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"9405b5d4e4d784815250de9adf71f42c855a58b37d7f1f39d1a1ff36a2e8ea92","abstract_canon_sha256":"6124bf5ddedb5f4a64fb195d1ddf6037e43318620078468fc774cd09c750a116"},"schema_version":"1.0"},"canonical_sha256":"7571374dd3e367eb952ed295fc90af406ffd0f2ff649c55ce723fd4ff83b2a4a","source":{"kind":"arxiv","id":"1307.7454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7454","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7454v2","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7454","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"OVYTOTOT4NT6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OVYTOTOT4NT6XFJO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OVYTOTOT","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OVYTOTOT4NT6XFJO2KK7ZEFPIB","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-29T03:50:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"9405b5d4e4d784815250de9adf71f42c855a58b37d7f1f39d1a1ff36a2e8ea92","abstract_canon_sha256":"6124bf5ddedb5f4a64fb195d1ddf6037e43318620078468fc774cd09c750a116"},"schema_version":"1.0"},"canonical_sha256":"7571374dd3e367eb952ed295fc90af406ffd0f2ff649c55ce723fd4ff83b2a4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:20.387006Z","signature_b64":"HYslY74rDsEB811C8Cxosu7BcPLlOZzOae4uTy6u1XFYeSdJgDdR+amwHhIeAIU8kzrq8wOHGobFRm9+KgccCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7571374dd3e367eb952ed295fc90af406ffd0f2ff649c55ce723fd4ff83b2a4a","last_reissued_at":"2026-05-18T03:15:20.386158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:20.386158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7454","source_version":2,"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-18T03:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoB3dFqin6walaEGHvESxbb/ch2UbafeSQAOM+xo81w+qqxy+KoAp1OPkxIqu/ApekBdzCt4npjOn3mPCTHFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:30.340027Z"},"content_sha256":"6716bf96469ac1c2a7d2ee02657fdb91069b01c81be6a044031b0990fd083405","schema_version":"1.0","event_id":"sha256:6716bf96469ac1c2a7d2ee02657fdb91069b01c81be6a044031b0990fd083405"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OVYTOTOT4NT6XFJO2KK7ZEFPIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relative Errors for Deterministic Low-Rank Matrix Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Jeff M. Phillips, Mina Ghashami","submitted_at":"2013-07-29T03:50:16Z","abstract_excerpt":"We consider processing an n x d matrix A in a stream with row-wise updates according to a recent algorithm called Frequent Directions (Liberty, KDD 2013). This algorithm maintains an l x d matrix Q deterministically, processing each row in O(d l^2) time; the processing time can be decreased to O(d l) with a slight modification in the algorithm and a constant increase in space. We show that if one sets l = k+ k/eps and returns Q_k, a k x d matrix that is the best rank k approximation to Q, then we achieve the following properties: ||A - A_k||_F^2 <= ||A||_F^2 - ||Q_k||_F^2 <= (1+eps) ||A - A_k|"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7454","kind":"arxiv","version":2},"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-18T03:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5J297qUMRtwA2PeEsy5iwxHSNIboItHYjjFLvhhcGdYM/lvh7G2lDo4SyNRInrW1ZhMql8Mu/3fjt76eIsyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:30.340397Z"},"content_sha256":"a2a72bd2dc9a7036ec68f9b5d3215dc93d1f48ee773f8899bd124186c4ed3e9d","schema_version":"1.0","event_id":"sha256:a2a72bd2dc9a7036ec68f9b5d3215dc93d1f48ee773f8899bd124186c4ed3e9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVYTOTOT4NT6XFJO2KK7ZEFPIB/bundle.json","state_url":"https://pith.science/pith/OVYTOTOT4NT6XFJO2KK7ZEFPIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVYTOTOT4NT6XFJO2KK7ZEFPIB/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-02T13:06:30Z","links":{"resolver":"https://pith.science/pith/OVYTOTOT4NT6XFJO2KK7ZEFPIB","bundle":"https://pith.science/pith/OVYTOTOT4NT6XFJO2KK7ZEFPIB/bundle.json","state":"https://pith.science/pith/OVYTOTOT4NT6XFJO2KK7ZEFPIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVYTOTOT4NT6XFJO2KK7ZEFPIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OVYTOTOT4NT6XFJO2KK7ZEFPIB","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":"6124bf5ddedb5f4a64fb195d1ddf6037e43318620078468fc774cd09c750a116","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-29T03:50:16Z","title_canon_sha256":"9405b5d4e4d784815250de9adf71f42c855a58b37d7f1f39d1a1ff36a2e8ea92"},"schema_version":"1.0","source":{"id":"1307.7454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7454","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7454v2","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7454","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"OVYTOTOT4NT6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OVYTOTOT4NT6XFJO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OVYTOTOT","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a2a72bd2dc9a7036ec68f9b5d3215dc93d1f48ee773f8899bd124186c4ed3e9d","target":"graph","created_at":"2026-05-18T03:15:20Z","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 consider processing an n x d matrix A in a stream with row-wise updates according to a recent algorithm called Frequent Directions (Liberty, KDD 2013). This algorithm maintains an l x d matrix Q deterministically, processing each row in O(d l^2) time; the processing time can be decreased to O(d l) with a slight modification in the algorithm and a constant increase in space. We show that if one sets l = k+ k/eps and returns Q_k, a k x d matrix that is the best rank k approximation to Q, then we achieve the following properties: ||A - A_k||_F^2 <= ||A||_F^2 - ||Q_k||_F^2 <= (1+eps) ||A - A_k|","authors_text":"Jeff M. Phillips, Mina Ghashami","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-29T03:50:16Z","title":"Relative Errors for Deterministic Low-Rank Matrix Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7454","kind":"arxiv","version":2},"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:6716bf96469ac1c2a7d2ee02657fdb91069b01c81be6a044031b0990fd083405","target":"record","created_at":"2026-05-18T03:15:20Z","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":"6124bf5ddedb5f4a64fb195d1ddf6037e43318620078468fc774cd09c750a116","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-29T03:50:16Z","title_canon_sha256":"9405b5d4e4d784815250de9adf71f42c855a58b37d7f1f39d1a1ff36a2e8ea92"},"schema_version":"1.0","source":{"id":"1307.7454","kind":"arxiv","version":2}},"canonical_sha256":"7571374dd3e367eb952ed295fc90af406ffd0f2ff649c55ce723fd4ff83b2a4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7571374dd3e367eb952ed295fc90af406ffd0f2ff649c55ce723fd4ff83b2a4a","first_computed_at":"2026-05-18T03:15:20.386158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:20.386158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HYslY74rDsEB811C8Cxosu7BcPLlOZzOae4uTy6u1XFYeSdJgDdR+amwHhIeAIU8kzrq8wOHGobFRm9+KgccCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:20.387006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6716bf96469ac1c2a7d2ee02657fdb91069b01c81be6a044031b0990fd083405","sha256:a2a72bd2dc9a7036ec68f9b5d3215dc93d1f48ee773f8899bd124186c4ed3e9d"],"state_sha256":"bd0155b8e52cc31bc62645c6abd0d6c731754c88bcab6ab5ee5eb9f0a5eedf69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+NEdTLH8T4dRhhDYB86YZQEe4MmxAab8CyWmg7eM8ArRH3TNsO+5dymtLAgyy0I5T2SmRxixEnGmd47ypQHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:06:30.342489Z","bundle_sha256":"498b0f34d2103347a980f1c8da144a571135ed706238436b7d8b6639f235308a"}}