{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LG5M4LK5LKH3UTRS4N2HUBHBGN","short_pith_number":"pith:LG5M4LK5","canonical_record":{"source":{"id":"1510.08896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:47:27Z","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"title_canon_sha256":"b912cddcc9f6b818f7f8b101d39a84bdc8b41cd70b136672e6099ca302e39c64","abstract_canon_sha256":"12c04b2b6d4a467d15b7b4d7a798ebb8176b1a7a7b2aabec7e23465514c057e3"},"schema_version":"1.0"},"canonical_sha256":"59bace2d5d5a8fba4e32e3747a04e1335fd0a22c794903165305d6a4acfa0747","source":{"kind":"arxiv","id":"1510.08896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08896","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08896v2","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08896","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"LG5M4LK5LKH3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LG5M4LK5LKH3UTRS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LG5M4LK5","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LG5M4LK5LKH3UTRS4N2HUBHBGN","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:47:27Z","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"title_canon_sha256":"b912cddcc9f6b818f7f8b101d39a84bdc8b41cd70b136672e6099ca302e39c64","abstract_canon_sha256":"12c04b2b6d4a467d15b7b4d7a798ebb8176b1a7a7b2aabec7e23465514c057e3"},"schema_version":"1.0"},"canonical_sha256":"59bace2d5d5a8fba4e32e3747a04e1335fd0a22c794903165305d6a4acfa0747","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:23.977011Z","signature_b64":"I3lP1bIeJVpIjn7wgRTsbM7+ocsxWUk/Z0ql15fBR+8vH75UJRiTP7GlmQTmqg7H/5630kCt/dEORl1AdPWSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bace2d5d5a8fba4e32e3747a04e1335fd0a22c794903165305d6a4acfa0747","last_reissued_at":"2026-05-18T01:13:23.976486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:23.976486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08896","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-18T01:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZulyOjrtoTsT9NwSWJjdmXiwLal65HKHZ90n7nGWlG1tykRK2pp53ZwVRs3Fsq4+WPVJ4G0xK/To8uyjdzdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:12.568473Z"},"content_sha256":"0cb2ecf39e67f755b6c4e701e9a141ff91d2603c48e30ddab69695c8d5b9b751","schema_version":"1.0","event_id":"sha256:0cb2ecf39e67f755b6c4e701e9a141ff91d2603c48e30ddab69695c8d5b9b751"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LG5M4LK5LKH3UTRS4N2HUBHBGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, Chi Jin, Praneeth Netrapalli, Sham M. Kakade","submitted_at":"2015-10-29T20:47:27Z","abstract_excerpt":"We provide faster algorithms and improved sample complexities for approximating the top eigenvector of a matrix.\n  Offline Setting: Given an $n \\times d$ matrix $A$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O ( [nnz(A) + \\frac{d \\cdot sr(A)}{gap^2}]\\cdot \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d \\cdot sr(A))^{1/4}}{\\sqrt{gap}}]\\cdot \\log1/\\epsilon )$. Here $sr(A)$ is the stable rank and $gap$ is the multiplicative eigenvalue gap. By separating the $gap$ dependence from $nnz(A)$ we improve on the classic power and Lanczos methods. We also im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08896","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-18T01:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oJK3TbPkZhfgna482R1DvV6rU+8yCX2UFlfMHlVkOQn+4Pjm7hOuhGZYyye3ZVXQqgJyRYGGU8KAGbPiSEDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:12.569057Z"},"content_sha256":"aeeb5aed1d084c24efcb3af85a296a04c8903909f6b72509c35196432fb9bdd4","schema_version":"1.0","event_id":"sha256:aeeb5aed1d084c24efcb3af85a296a04c8903909f6b72509c35196432fb9bdd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/bundle.json","state_url":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/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-25T18:26:12Z","links":{"resolver":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN","bundle":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/bundle.json","state":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LG5M4LK5LKH3UTRS4N2HUBHBGN","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":"12c04b2b6d4a467d15b7b4d7a798ebb8176b1a7a7b2aabec7e23465514c057e3","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:47:27Z","title_canon_sha256":"b912cddcc9f6b818f7f8b101d39a84bdc8b41cd70b136672e6099ca302e39c64"},"schema_version":"1.0","source":{"id":"1510.08896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08896","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08896v2","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08896","created_at":"2026-05-18T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"LG5M4LK5LKH3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LG5M4LK5LKH3UTRS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LG5M4LK5","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:aeeb5aed1d084c24efcb3af85a296a04c8903909f6b72509c35196432fb9bdd4","target":"graph","created_at":"2026-05-18T01:13:23Z","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 provide faster algorithms and improved sample complexities for approximating the top eigenvector of a matrix.\n  Offline Setting: Given an $n \\times d$ matrix $A$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O ( [nnz(A) + \\frac{d \\cdot sr(A)}{gap^2}]\\cdot \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d \\cdot sr(A))^{1/4}}{\\sqrt{gap}}]\\cdot \\log1/\\epsilon )$. Here $sr(A)$ is the stable rank and $gap$ is the multiplicative eigenvalue gap. By separating the $gap$ dependence from $nnz(A)$ we improve on the classic power and Lanczos methods. We also im","authors_text":"Aaron Sidford, Cameron Musco, Chi Jin, Praneeth Netrapalli, Sham M. Kakade","cross_cats":["cs.LG","math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:47:27Z","title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08896","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:0cb2ecf39e67f755b6c4e701e9a141ff91d2603c48e30ddab69695c8d5b9b751","target":"record","created_at":"2026-05-18T01:13:23Z","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":"12c04b2b6d4a467d15b7b4d7a798ebb8176b1a7a7b2aabec7e23465514c057e3","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:47:27Z","title_canon_sha256":"b912cddcc9f6b818f7f8b101d39a84bdc8b41cd70b136672e6099ca302e39c64"},"schema_version":"1.0","source":{"id":"1510.08896","kind":"arxiv","version":2}},"canonical_sha256":"59bace2d5d5a8fba4e32e3747a04e1335fd0a22c794903165305d6a4acfa0747","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59bace2d5d5a8fba4e32e3747a04e1335fd0a22c794903165305d6a4acfa0747","first_computed_at":"2026-05-18T01:13:23.976486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:23.976486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I3lP1bIeJVpIjn7wgRTsbM7+ocsxWUk/Z0ql15fBR+8vH75UJRiTP7GlmQTmqg7H/5630kCt/dEORl1AdPWSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:23.977011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cb2ecf39e67f755b6c4e701e9a141ff91d2603c48e30ddab69695c8d5b9b751","sha256:aeeb5aed1d084c24efcb3af85a296a04c8903909f6b72509c35196432fb9bdd4"],"state_sha256":"b8c91cdfb774e03cae415d6863feb71c65cc50813271489af908f94c0ef811cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99y/p+7LK9jUAU0/J1+8VZZGYxnecm7JF9jEvRd91Xx9a+P/WcW2Adb5OW4L4ADbcoph0ul1qL2msr6sAYTdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:26:12.576058Z","bundle_sha256":"567d9f20af99c800c556ddcca092f322941e83218998fc925e14ad9e00447050"}}