{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UVVNU2ZXDDYE43LRAL7D37V5PV","short_pith_number":"pith:UVVNU2ZX","canonical_record":{"source":{"id":"1605.08754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T03:53:00Z","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"title_canon_sha256":"8417b9cd9d12c90efb0006a7d3147315077a6ce2aa0c861bd0816712ef0f71ec","abstract_canon_sha256":"c4a16c35490bea80d69cc670d4ae97ddeb61d998b3161a173f96113b1f2352b2"},"schema_version":"1.0"},"canonical_sha256":"a56ada6b3718f04e6d7102fe3dfebd7d631ecfff4255028d40a3000a65d78955","source":{"kind":"arxiv","id":"1605.08754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08754","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08754v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08754","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"UVVNU2ZXDDYE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UVVNU2ZXDDYE43LR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UVVNU2ZX","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UVVNU2ZXDDYE43LRAL7D37V5PV","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T03:53:00Z","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"title_canon_sha256":"8417b9cd9d12c90efb0006a7d3147315077a6ce2aa0c861bd0816712ef0f71ec","abstract_canon_sha256":"c4a16c35490bea80d69cc670d4ae97ddeb61d998b3161a173f96113b1f2352b2"},"schema_version":"1.0"},"canonical_sha256":"a56ada6b3718f04e6d7102fe3dfebd7d631ecfff4255028d40a3000a65d78955","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.156202Z","signature_b64":"G/uWhXVUuWqDvjC0SaIC//NyhTydTeKe7m9XUQJ8JBm5X4HYQ3qtIrLvtFjMEuRCL3WshnuTmcKWmiWExgJrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a56ada6b3718f04e6d7102fe3dfebd7d631ecfff4255028d40a3000a65d78955","last_reissued_at":"2026-05-18T01:13:29.155435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.155435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08754","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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vn6E1W115bw82V9xGCib3fz1LQ7u7Rx53m85Cg9k6f2GP6XjX5lXf1nf2DiYMm+kNDa9krpsTSd6ayiM/xSPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:03.505561Z"},"content_sha256":"da9d791bd3e5a6ddca7f8a53582b5f115b9b489cdf75555df9f2846d754d838b","schema_version":"1.0","event_id":"sha256:da9d791bd3e5a6ddca7f8a53582b5f115b9b489cdf75555df9f2846d754d838b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UVVNU2ZXDDYE43LRAL7D37V5PV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Eigenvector Computation via Shift-and-Invert Preconditioning","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, Dan Garber, Elad Hazan, Praneeth Netrapalli, Sham M. Kakade","submitted_at":"2016-05-26T03:53:00Z","abstract_excerpt":"We give faster algorithms and improved sample complexities for estimating the top eigenvector of a matrix $\\Sigma$ -- i.e. computing a unit vector $x$ such that $x^T \\Sigma x \\ge (1-\\epsilon)\\lambda_1(\\Sigma)$:\n  Offline Eigenvector Estimation: Given an explicit $A \\in \\mathbb{R}^{n \\times d}$ with $\\Sigma = A^TA$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O([nnz(A) + \\frac{d*sr(A)}{gap^2} ]* \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d*sr(A))^{1/4}}{\\sqrt{gap}} ] * \\log 1/\\epsilon )$. Here $nnz(A)$ is the number of nonzeros in $A$, $sr(A)$ is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08754","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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCQExqoaaY5d/VdMwxg5xEL8hdHwrID7L6U7jrRnM+5lNm5mcOQzh1Qx1bl389uGru43MVyAylSxw1mTs4+/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:03.506190Z"},"content_sha256":"fda4b5521e58e9c86c8d6956d9988aaf7a625b7749dbafa84dd9fffc2ffb609e","schema_version":"1.0","event_id":"sha256:fda4b5521e58e9c86c8d6956d9988aaf7a625b7749dbafa84dd9fffc2ffb609e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/bundle.json","state_url":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/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-25T22:30:03Z","links":{"resolver":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV","bundle":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/bundle.json","state":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UVVNU2ZXDDYE43LRAL7D37V5PV","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":"c4a16c35490bea80d69cc670d4ae97ddeb61d998b3161a173f96113b1f2352b2","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T03:53:00Z","title_canon_sha256":"8417b9cd9d12c90efb0006a7d3147315077a6ce2aa0c861bd0816712ef0f71ec"},"schema_version":"1.0","source":{"id":"1605.08754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08754","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08754v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08754","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"UVVNU2ZXDDYE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UVVNU2ZXDDYE43LR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UVVNU2ZX","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:fda4b5521e58e9c86c8d6956d9988aaf7a625b7749dbafa84dd9fffc2ffb609e","target":"graph","created_at":"2026-05-18T01:13:29Z","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 give faster algorithms and improved sample complexities for estimating the top eigenvector of a matrix $\\Sigma$ -- i.e. computing a unit vector $x$ such that $x^T \\Sigma x \\ge (1-\\epsilon)\\lambda_1(\\Sigma)$:\n  Offline Eigenvector Estimation: Given an explicit $A \\in \\mathbb{R}^{n \\times d}$ with $\\Sigma = A^TA$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O([nnz(A) + \\frac{d*sr(A)}{gap^2} ]* \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d*sr(A))^{1/4}}{\\sqrt{gap}} ] * \\log 1/\\epsilon )$. Here $nnz(A)$ is the number of nonzeros in $A$, $sr(A)$ is ","authors_text":"Aaron Sidford, Cameron Musco, Chi Jin, Dan Garber, Elad Hazan, 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":"2016-05-26T03:53:00Z","title":"Faster Eigenvector Computation via Shift-and-Invert Preconditioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08754","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:da9d791bd3e5a6ddca7f8a53582b5f115b9b489cdf75555df9f2846d754d838b","target":"record","created_at":"2026-05-18T01:13:29Z","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":"c4a16c35490bea80d69cc670d4ae97ddeb61d998b3161a173f96113b1f2352b2","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T03:53:00Z","title_canon_sha256":"8417b9cd9d12c90efb0006a7d3147315077a6ce2aa0c861bd0816712ef0f71ec"},"schema_version":"1.0","source":{"id":"1605.08754","kind":"arxiv","version":1}},"canonical_sha256":"a56ada6b3718f04e6d7102fe3dfebd7d631ecfff4255028d40a3000a65d78955","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a56ada6b3718f04e6d7102fe3dfebd7d631ecfff4255028d40a3000a65d78955","first_computed_at":"2026-05-18T01:13:29.155435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.155435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G/uWhXVUuWqDvjC0SaIC//NyhTydTeKe7m9XUQJ8JBm5X4HYQ3qtIrLvtFjMEuRCL3WshnuTmcKWmiWExgJrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.156202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da9d791bd3e5a6ddca7f8a53582b5f115b9b489cdf75555df9f2846d754d838b","sha256:fda4b5521e58e9c86c8d6956d9988aaf7a625b7749dbafa84dd9fffc2ffb609e"],"state_sha256":"357111f4d6736bd021e14c6d537511bbb3e381762c03bb09a9e7a4dbd5848a7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0H1UJkIh9uM+1AG/9K7QncuQODMAJqNWvy9En5fNoRtVjIzDfbgN0AvNARuCgAPvRHSan/gtTM4TT5zs4VrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:30:03.510387Z","bundle_sha256":"e28931f2cfa758b5d2aa41e8ecbedf947dd2aea7d972f371fdaf3716780cf557"}}