{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TUPXPFOX32ENVV4FGHUBY2MN74","short_pith_number":"pith:TUPXPFOX","canonical_record":{"source":{"id":"1607.02925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T12:47:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2d70f9f35bb5cf7372adb502d1190ca25b5942148e3f708aa743146dc7d05e6","abstract_canon_sha256":"d0b24a540e47040ddd18c224cfe40016f5b891858ed8df7f480000f8af48af71"},"schema_version":"1.0"},"canonical_sha256":"9d1f7795d7de88dad78531e81c698dff28e469ef3e4431248fc66a56a40a180e","source":{"kind":"arxiv","id":"1607.02925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02925","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02925v1","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02925","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"pith_short_12","alias_value":"TUPXPFOX32EN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TUPXPFOX32ENVV4F","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TUPXPFOX","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TUPXPFOX32ENVV4FGHUBY2MN74","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T12:47:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2d70f9f35bb5cf7372adb502d1190ca25b5942148e3f708aa743146dc7d05e6","abstract_canon_sha256":"d0b24a540e47040ddd18c224cfe40016f5b891858ed8df7f480000f8af48af71"},"schema_version":"1.0"},"canonical_sha256":"9d1f7795d7de88dad78531e81c698dff28e469ef3e4431248fc66a56a40a180e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:14.371048Z","signature_b64":"34zHq9X2pBEFwwxDy9yUldSiGW24gzTmtNO8I5LJt1ptuaAg4m/cgdMRMBaQbIPh6vWvMyM5rJyqfWTr5atKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d1f7795d7de88dad78531e81c698dff28e469ef3e4431248fc66a56a40a180e","last_reissued_at":"2026-05-18T01:11:14.370460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:14.370460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02925","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-18T01:11:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vebg+KM2UkqWfeN0b9XEy+EffJkaUSXVQIupbmiyVVWSkvDTkhRlv3np3OMr6n/zc5iuAmkUADnIC3/9uHUZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:20:37.604289Z"},"content_sha256":"dbd2abade5aa9250afd25f8817649c583486f45b22b2cecb627eefc6287cf3b9","schema_version":"1.0","event_id":"sha256:dbd2abade5aa9250afd25f8817649c583486f45b22b2cecb627eefc6287cf3b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TUPXPFOX32ENVV4FGHUBY2MN74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Low-rank Approximation using Adaptive Gap-based Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alon Gonen, Shai Shalev-Shwartz","submitted_at":"2016-07-11T12:47:39Z","abstract_excerpt":"We propose a method for rank $k$ approximation to a given input matrix $X \\in \\mathbb{R}^{d \\times n}$ which runs in time \\[ \\tilde{O} \\left(d ~\\cdot~ \\min\\left\\{n + \\tilde{sr}(X) \\,G^{-2}_{k,p+1}\\ ,\\ n^{3/4}\\, \\tilde{sr}(X)^{1/4} \\,G^{-1/2}_{k,p+1} \\right\\} ~\\cdot~ \\text{poly}(p)\\right) ~, \\] where $p>k$, $\\tilde{sr}(X)$ is related to stable rank of $X$, and $G_{k,p+1} = \\frac{\\sigma_k-\\sigma_p}{\\sigma_k}$ is the multiplicative gap between the $k$-th and the $(p+1)$-th singular values of $X$. In particular, this yields a linear time algorithm if the gap is at least $1/\\sqrt{n}$ and $k,p,\\tild"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02925","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-18T01:11:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvw7OyGmkdcgGa0L8dOjvhFi3Ps/4rgqVcXc6F2TK4UbCRaClo+1SL3gykF3J76bTOeHqP4X8Qr4/iNk6kSFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:20:37.604927Z"},"content_sha256":"ab4551562a0ddc266496ea7bc88c9a4311d1bfb94e2be25b37470635d2021ab5","schema_version":"1.0","event_id":"sha256:ab4551562a0ddc266496ea7bc88c9a4311d1bfb94e2be25b37470635d2021ab5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUPXPFOX32ENVV4FGHUBY2MN74/bundle.json","state_url":"https://pith.science/pith/TUPXPFOX32ENVV4FGHUBY2MN74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUPXPFOX32ENVV4FGHUBY2MN74/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-05-26T15:20:37Z","links":{"resolver":"https://pith.science/pith/TUPXPFOX32ENVV4FGHUBY2MN74","bundle":"https://pith.science/pith/TUPXPFOX32ENVV4FGHUBY2MN74/bundle.json","state":"https://pith.science/pith/TUPXPFOX32ENVV4FGHUBY2MN74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUPXPFOX32ENVV4FGHUBY2MN74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TUPXPFOX32ENVV4FGHUBY2MN74","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":"d0b24a540e47040ddd18c224cfe40016f5b891858ed8df7f480000f8af48af71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T12:47:39Z","title_canon_sha256":"a2d70f9f35bb5cf7372adb502d1190ca25b5942148e3f708aa743146dc7d05e6"},"schema_version":"1.0","source":{"id":"1607.02925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02925","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02925v1","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02925","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"pith_short_12","alias_value":"TUPXPFOX32EN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TUPXPFOX32ENVV4F","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TUPXPFOX","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:ab4551562a0ddc266496ea7bc88c9a4311d1bfb94e2be25b37470635d2021ab5","target":"graph","created_at":"2026-05-18T01:11:14Z","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 propose a method for rank $k$ approximation to a given input matrix $X \\in \\mathbb{R}^{d \\times n}$ which runs in time \\[ \\tilde{O} \\left(d ~\\cdot~ \\min\\left\\{n + \\tilde{sr}(X) \\,G^{-2}_{k,p+1}\\ ,\\ n^{3/4}\\, \\tilde{sr}(X)^{1/4} \\,G^{-1/2}_{k,p+1} \\right\\} ~\\cdot~ \\text{poly}(p)\\right) ~, \\] where $p>k$, $\\tilde{sr}(X)$ is related to stable rank of $X$, and $G_{k,p+1} = \\frac{\\sigma_k-\\sigma_p}{\\sigma_k}$ is the multiplicative gap between the $k$-th and the $(p+1)$-th singular values of $X$. In particular, this yields a linear time algorithm if the gap is at least $1/\\sqrt{n}$ and $k,p,\\tild","authors_text":"Alon Gonen, Shai Shalev-Shwartz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T12:47:39Z","title":"Faster Low-rank Approximation using Adaptive Gap-based Preconditioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02925","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:dbd2abade5aa9250afd25f8817649c583486f45b22b2cecb627eefc6287cf3b9","target":"record","created_at":"2026-05-18T01:11:14Z","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":"d0b24a540e47040ddd18c224cfe40016f5b891858ed8df7f480000f8af48af71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T12:47:39Z","title_canon_sha256":"a2d70f9f35bb5cf7372adb502d1190ca25b5942148e3f708aa743146dc7d05e6"},"schema_version":"1.0","source":{"id":"1607.02925","kind":"arxiv","version":1}},"canonical_sha256":"9d1f7795d7de88dad78531e81c698dff28e469ef3e4431248fc66a56a40a180e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d1f7795d7de88dad78531e81c698dff28e469ef3e4431248fc66a56a40a180e","first_computed_at":"2026-05-18T01:11:14.370460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:14.370460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34zHq9X2pBEFwwxDy9yUldSiGW24gzTmtNO8I5LJt1ptuaAg4m/cgdMRMBaQbIPh6vWvMyM5rJyqfWTr5atKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:14.371048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbd2abade5aa9250afd25f8817649c583486f45b22b2cecb627eefc6287cf3b9","sha256:ab4551562a0ddc266496ea7bc88c9a4311d1bfb94e2be25b37470635d2021ab5"],"state_sha256":"06dea95052f1b305a7881a7589de1f6299bf43e6211b764b5cb0f55f14d5f397"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1c6tV0SSxVzW9KeDsPTV5ndE/bdfvNfhEwzGskXTDSURe2cYl4JR8NMQPyHjVL3Rrbzxli23COI9CpmnbY4zBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:20:37.608121Z","bundle_sha256":"ea0f9db264f651ad2b26b3ac3160005499270205eb1ad1dc83e8b60c92be24b3"}}