{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VOVLCPNMY65EIILVQ6DPFLH6VL","short_pith_number":"pith:VOVLCPNM","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"},"canonical_sha256":"abaab13dacc7ba4421758786f2acfeaac92c94cca3be7d532054f910189b5446","source":{"kind":"arxiv","id":"2607.08556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08556","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08556v1","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08556","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"VOVLCPNMY65E","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_16","alias_value":"VOVLCPNMY65EIILV","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_8","alias_value":"VOVLCPNM","created_at":"2026-07-10T01:19:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VOVLCPNMY65EIILVQ6DPFLH6VL","target":"record","payload":{"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"},"canonical_sha256":"abaab13dacc7ba4421758786f2acfeaac92c94cca3be7d532054f910189b5446","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"},"source_kind":"arxiv","source_id":"2607.08556","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-07-10T01:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmKkGwhuuXRcSUPiCSpur8Y+83sR1kcj185bKiIXZWWH2gYxXcZ3XOfHqvefb72rXxQrkxMoRctIjR1vZkZADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:24:08.608080Z"},"content_sha256":"20981023f9870e239175e71acab4ecc3445fc3ab7b56e449a25b9e65c74197eb","schema_version":"1.0","event_id":"sha256:20981023f9870e239175e71acab4ecc3445fc3ab7b56e449a25b9e65c74197eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VOVLCPNMY65EIILVQ6DPFLH6VL","target":"graph","payload":{"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"},"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-07-10T01:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCIcZU7EHsh7emaOpj96P2XTOpxtvHS7Cbd88HHXep1zrKu7KTFgRVjv0lnL/grVJYPfU4yL76GmBwaXvoEtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:24:08.608572Z"},"content_sha256":"26eb4236db93268d55c84a0b534416dc8cf61467e75eeb727cbcf45a0930924e","schema_version":"1.0","event_id":"sha256:26eb4236db93268d55c84a0b534416dc8cf61467e75eeb727cbcf45a0930924e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/bundle.json","state_url":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/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-08-05T10:24:08Z","links":{"resolver":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL","bundle":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/bundle.json","state":"https://pith.science/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOVLCPNMY65EIILVQ6DPFLH6VL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VOVLCPNMY65EIILVQ6DPFLH6VL","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":"e8d567ee20371e4f692a11c986af6fc6d9277074c94ee252cf2021512e793db3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:47:06Z","title_canon_sha256":"bbc036f889f356b594f004547af51d575761e6916764e147ec88edc475460df1"},"schema_version":"1.0","source":{"id":"2607.08556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08556","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08556v1","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08556","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"VOVLCPNMY65E","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_16","alias_value":"VOVLCPNMY65EIILV","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_8","alias_value":"VOVLCPNM","created_at":"2026-07-10T01:19:53Z"}],"graph_snapshots":[{"event_id":"sha256:26eb4236db93268d55c84a0b534416dc8cf61467e75eeb727cbcf45a0930924e","target":"graph","created_at":"2026-07-10T01:19:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.08556/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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_","authors_text":"Erik Waingarten, Nicolas Menand","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:47:06Z","title":"Locally Approximating the Top Eigenvector of Bounded Entry Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08556","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:20981023f9870e239175e71acab4ecc3445fc3ab7b56e449a25b9e65c74197eb","target":"record","created_at":"2026-07-10T01:19:53Z","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":"e8d567ee20371e4f692a11c986af6fc6d9277074c94ee252cf2021512e793db3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:47:06Z","title_canon_sha256":"bbc036f889f356b594f004547af51d575761e6916764e147ec88edc475460df1"},"schema_version":"1.0","source":{"id":"2607.08556","kind":"arxiv","version":1}},"canonical_sha256":"abaab13dacc7ba4421758786f2acfeaac92c94cca3be7d532054f910189b5446","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abaab13dacc7ba4421758786f2acfeaac92c94cca3be7d532054f910189b5446","first_computed_at":"2026-07-10T01:19:53.530709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T01:19:53.530709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nhBKPM6UPhHTEGs3x+3Dp8T0SSqB3B7iXD/FGaKqxAS/ig7ai/lSGGlDJr4a06h6KQYWI5blFsqMuUZb63tqBw==","signature_status":"signed_v1","signed_at":"2026-07-10T01:19:53.531109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20981023f9870e239175e71acab4ecc3445fc3ab7b56e449a25b9e65c74197eb","sha256:26eb4236db93268d55c84a0b534416dc8cf61467e75eeb727cbcf45a0930924e"],"state_sha256":"1e74d6329bf3b7292bb8614ecaf201f0a5a160e66f37f05ca68fdf04e886ffbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"916ZWERnQUgiYu3hrMV+dIE3lvX2xHE+r35N5nfD8Mo29Oa1ICFYzG6woxyAAffuV7/t+3WoCWJJR38bb09xDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:24:08.612142Z","bundle_sha256":"27ec586b06a4dc8eb876e8e102e68923690a254d1e03e82d893549831713fd8a"}}