{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VOVLCPNMY65EIILVQ6DPFLH6VL","short_pith_number":"pith:VOVLCPNM","schema_version":"1.0","canonical_sha256":"abaab13dacc7ba4421758786f2acfeaac92c94cca3be7d532054f910189b5446","source":{"kind":"arxiv","id":"2607.08556","version":1},"attestation_state":"computed","paper":{"title":"Locally Approximating the Top Eigenvector of Bounded Entry Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Waingarten, Nicolas Menand","submitted_at":"2026-07-09T14:47:06Z","abstract_excerpt":"We provide a local computation algorithm to approximate the top eigenvector $x \\in \\mathbb{R}^n$ of a symmetric matrix $A \\in \\mathbb{R}^{n \\times n}$ with entries between $-1$ and $1$, building on the work of Swartworth and Woodruff [SODA 25] who show how to approximate the eigenvalues up to additive-$\\varepsilon n$ error using $\\tilde{O}(1/\\varepsilon^4)$ queries.\n  Our local computation algorithm has a preprocessing complexity of $\\tilde{O}(1/\\varepsilon^4)$ and per-coordinate query complexity of $\\tilde{O}(1/\\varepsilon^2)$ for an additive-$\\varepsilon n$ approximation whenever {$|\\lambda_"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.08556","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:47:06Z","cross_cats_sorted":[],"title_canon_sha256":"bbc036f889f356b594f004547af51d575761e6916764e147ec88edc475460df1","abstract_canon_sha256":"e8d567ee20371e4f692a11c986af6fc6d9277074c94ee252cf2021512e793db3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:53.531109Z","signature_b64":"nhBKPM6UPhHTEGs3x+3Dp8T0SSqB3B7iXD/FGaKqxAS/ig7ai/lSGGlDJr4a06h6KQYWI5blFsqMuUZb63tqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abaab13dacc7ba4421758786f2acfeaac92c94cca3be7d532054f910189b5446","last_reissued_at":"2026-07-10T01:19:53.530709Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:53.530709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Approximating the Top Eigenvector of Bounded Entry Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Waingarten, Nicolas Menand","submitted_at":"2026-07-09T14:47:06Z","abstract_excerpt":"We provide a local computation algorithm to approximate the top eigenvector $x \\in \\mathbb{R}^n$ of a symmetric matrix $A \\in \\mathbb{R}^{n \\times n}$ with entries between $-1$ and $1$, building on the work of Swartworth and Woodruff [SODA 25] who show how to approximate the eigenvalues up to additive-$\\varepsilon n$ error using $\\tilde{O}(1/\\varepsilon^4)$ queries.\n  Our local computation algorithm has a preprocessing complexity of $\\tilde{O}(1/\\varepsilon^4)$ and per-coordinate query complexity of $\\tilde{O}(1/\\varepsilon^2)$ for an additive-$\\varepsilon n$ approximation whenever {$|\\lambda_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08556","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.08556/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.08556","created_at":"2026-07-10T01:19:53.530766+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08556v1","created_at":"2026-07-10T01:19:53.530766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08556","created_at":"2026-07-10T01:19:53.530766+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOVLCPNMY65E","created_at":"2026-07-10T01:19:53.530766+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOVLCPNMY65EIILV","created_at":"2026-07-10T01:19:53.530766+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOVLCPNM","created_at":"2026-07-10T01:19:53.530766+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00840","citing_title":"Sublinear Time Eigenvector Approximation via Column Sampling","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL","json":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL.json","graph_json":"https://pith.science/api/pith-number/VOVLCPNMY65EIILVQ6DPFLH6VL/graph.json","events_json":"https://pith.science/api/pith-number/VOVLCPNMY65EIILVQ6DPFLH6VL/events.json","paper":"https://pith.science/paper/VOVLCPNM"},"agent_actions":{"view_html":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL","download_json":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL.json","view_paper":"https://pith.science/paper/VOVLCPNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08556&json=true","fetch_graph":"https://pith.science/api/pith-number/VOVLCPNMY65EIILVQ6DPFLH6VL/graph.json","fetch_events":"https://pith.science/api/pith-number/VOVLCPNMY65EIILVQ6DPFLH6VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/action/storage_attestation","attest_author":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/action/author_attestation","sign_citation":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/action/citation_signature","submit_replication":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/action/replication_record"}},"created_at":"2026-07-10T01:19:53.530766+00:00","updated_at":"2026-07-10T01:19:53.530766+00:00"}