{"as_of":"2026-08-09T23:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2caf324adfe95cbdf2cb68658a47b2bf55582566ed2a120354c0c3b37b378e6d","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T00:25:45.473741Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.00840/citation-record","integrity":"/paper/2608.00840/integrity","json":"/paper/2608.00840/citation-record.json","paper":"/paper/2608.00840"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.288581Z","title":"Algorithmica , pages=","venue":null,"work_id":"f0f5f962-3ea6-49ee-97b9-49e326262212","year":2024},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.260990Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:2161c36b65106e33f7353dd4af0bbefcb999730508dc84e3d91897629985e0ad","observation_id":"11f70ac3-a676-4075-8519-9645191b2e04","resolution":{"observed_at":"2026-08-05T00:25:46.292130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.276535Z","title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"785718cd-5869-478f-a816-6e0fedce2ed7","year":2025},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.266479Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:730fd4033590bb01c8a4c01238da8fc533b1049096f19537d4fcf302f293749f","observation_id":"82ca4d40-2a65-4de4-abe5-f46713997869","resolution":{"observed_at":"2026-08-05T00:25:46.280586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.264620Z","title":"Comptes Rendus","venue":null,"work_id":"996e704b-7ce5-4bed-8ae8-8c3cbab0ed17","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.270296Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:7ddb9d3403ce22727453d461d48e649a81e2fc93b974c3f8d8e65d9677adfdb2","observation_id":"4a595553-e147-4c48-ba36-6d4704cd658a","resolution":{"observed_at":"2026-08-05T00:25:46.268417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.252738Z","title":"15th Innovations in Theoretical Computer Science Conference (ITCS 2024) , pages=","venue":null,"work_id":"84b60f76-425e-4915-a8fb-53239d2a1bbd","year":2024},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.273928Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:886b48e8478f27e6326b7191364a7e2abdf37e30317b28fd0d1689535e38c2f8","observation_id":"eb75acb2-3bfa-47ae-8472-68324a2385c7","resolution":{"observed_at":"2026-08-05T00:25:46.256618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.277637Z","title":"2018 , publisher=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.277637Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:5f70fd2e8ce0c5f22589d6fd0bbf01482bffda468ecd5e207e43890f210c274a","observation_id":"d36d7f8f-8807-4bc8-9272-39a9eb8fd152","resolution":{"observed_at":"2026-08-05T00:25:45.277637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.281347Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.281347Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:949662512c6aee941e29f2d159236a5ceb3f9c14a10aca6fb8978e5913d240c2","observation_id":"1ca61a54-a6d9-43cf-9727-afb1511a4d65","resolution":{"observed_at":"2026-08-05T00:25:45.281347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.285186Z","title":"Journal of the ACM , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.285186Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:f97db1a59b83680101bd0792ee55c38ac3d6e629ec165be4dfed85d9428ea139","observation_id":"801274cc-0443-497b-8d02-3930aa998481","resolution":{"observed_at":"2026-08-05T00:25:45.285186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.219137Z","title":"The asymptotic distribution law for the eigenvalues of linear partial differential equations (with applications to the theory of black body radiation) , volume =","venue":null,"work_id":"36108556-ee51-4eeb-b60e-f669e9cd2234","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.288892Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:e062ab340c365fea9b3404fbd949774866e6c8fc6b482632f674841bd25283ec","observation_id":"f117a34c-3199-4b1a-9a95-0e7e57a05e0b","resolution":{"observed_at":"2026-08-05T00:25:46.223015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.04909","last_updated":"2018-11-12T18:49:42Z","snapshot_observed_at":"2026-08-09T10:19:01.513330Z","submitted_at":"2018-11-12T18:49:42Z","title":"Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.04909","snapshot_observed_at":"2026-08-05T00:25:45.292291Z","title":"arXiv preprint arXiv:1811.04909 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.292291Z"},"links":{"cited_paper":"/paper/1811.04909","citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:be21be14cac29a51cb70a0cf5de1f0ca8a89f668dbaeb0859425d41e8980c013","observation_id":"eb3812c4-5d2d-4e99-9d21-cd457b0ed83e","resolution":{"observed_at":"2026-08-05T00:25:45.292291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.296229Z","title":"BIT Numerical Mathematics , volume=","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.296229Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:45c844fca86125b45d7646400d2608bfb53ec8d9f6306336c4b39e84d5498974","observation_id":"5a95b666-5926-4af1-85f9-a56ad53446fd","resolution":{"observed_at":"2026-08-05T00:25:45.296229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.200773Z","title":"The spectral norm error of the na","venue":null,"work_id":"5ca439dc-f8bd-40a6-8f45-56f6c2ffdcce","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.300115Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:0ad13f1c839b8fe6f06a680a56777724c70799020a74bebe2b4771deffcd4b66","observation_id":"5c9a52ac-b839-4066-89eb-dee1dff14c2f","resolution":{"observed_at":"2026-08-05T00:25:46.204264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.303658Z","title":"Using the Nystr","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.303658Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:ac0e6128b1a12bbf9b08bcfcdc03fc075f0ee5d10e458d01193a7b8cbd53f607","observation_id":"9628b1d2-78f6-4d54-98bd-679b959ef5f1","resolution":{"observed_at":"2026-08-05T00:25:45.303658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.180953Z","title":"A note on element-wise matrix sparsification via a matrix-valued","venue":null,"work_id":"4613b9fc-ab3c-4565-ad50-684265994c51","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.307579Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:a6f2311d569dcdaff95f9d6b5c9bc204a5a9d2d34f24d728490cbc981e49c2bb","observation_id":"efed6830-5cb6-4eaf-a10a-8250716f8689","resolution":{"observed_at":"2026-08-05T00:25:46.184471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.168852Z","title":"2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"bf053b35-6033-4b50-a389-44b1fc0d1b58","year":2024},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.310767Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:4aad39dcbfbc1bfe086b40ad79f3129c770e8e4b35a60bfd8dc0d51c4b70f5b1","observation_id":"4555c7d2-dc6a-4161-adc8-3af7f940dd20","resolution":{"observed_at":"2026-08-05T00:25:46.173333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.157474Z","title":"Proceedings of the forty-first annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"8b89378d-fd4d-4c1f-aa13-52ee77f9dcd4","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.314307Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:a06e050f34f2c2c31c92ad1c5c82b817d8304b17bdf06fa66d8abe1a2500442e","observation_id":"351afbb5-6588-4cf9-b2b2-269c8f7c9db7","resolution":{"observed_at":"2026-08-05T00:25:46.161038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.145898Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"cc34a403-1884-4e28-be3d-19a86949cb9c","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.317816Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:c8825526e79945c65e6b81b8863d7397f60dd18a1eec03bcc96e177f42aef8f2","observation_id":"f47c6b16-1297-4df7-b24b-62e9f6d47f6b","resolution":{"observed_at":"2026-08-05T00:25:46.150102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.134570Z","title":"Fast matrix multiplication is stable , year =","venue":null,"work_id":"985378de-9320-4870-a33b-abd5d39dc246","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.321110Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:77d5ed28fa96bdd9280f17ac048efc5e440a2c8f387ea592f11f91a75451e748","observation_id":"bf7158b1-5334-4467-b6d3-df440e006526","resolution":{"observed_at":"2026-08-05T00:25:46.138011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.122993Z","title":"A refined laser method and faster matrix multiplication , year =","venue":null,"work_id":"9e93c200-c7b1-42bc-82ed-3dad63813733","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.324453Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:329d2893aa9eb9e036b4dd3ac52a136ac4cd98eb94a6afbc987527d3a0a276c8","observation_id":"dcb976a3-80fb-4158-9c32-b0fd7890e79f","resolution":{"observed_at":"2026-08-05T00:25:46.126411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.111556Z","title":"Matrix computations , Year =","venue":null,"work_id":"914d4482-3a96-467b-9fde-bfff25d0b722","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.327893Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:d71fc6ca08289ff4815ed3257cedd63d690094cd12379d11df642ff56c6ffed2","observation_id":"99e8befc-62aa-48a9-9161-bccd896f3670","resolution":{"observed_at":"2026-08-05T00:25:46.115364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.099545Z","title":"Numerical methods for large eigenvalue problems:","venue":null,"work_id":"c974517a-6afa-4cf7-b695-05bae1945e06","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.331147Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:36e8388dfbcd6d740d6a9bd2607fdd5d5d4c61372619a6b63f33094e13e9a6ab","observation_id":"3cf0844c-6a77-4512-b635-a52e192e4d89","resolution":{"observed_at":"2026-08-05T00:25:46.103803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.088007Z","title":"The Thirty-ninth Annual Conference on Neural Information Processing Systems , year=","venue":null,"work_id":"e5bd4b4b-19bd-497b-92cf-0bc23e6a1496","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.334285Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:b1367b999cb64bdf764cf023396d74ce1f50b70bd1103428b188477c51d2af81","observation_id":"8ede2944-0625-4522-a43e-c29a65e3613a","resolution":{"observed_at":"2026-08-05T00:25:46.091699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.076571Z","title":"International Conference on Algorithmic Learning Theory , pages=","venue":null,"work_id":"e75625a8-8f35-4310-a60d-65dce0bec2aa","year":2023},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.337942Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:c19fc3e1c901a67a0161a80b86cb0d84995639119750c4580379d9aa2c77faf6","observation_id":"28269a23-410b-47cb-b250-279dc8066107","resolution":{"observed_at":"2026-08-05T00:25:46.080283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.341259Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.341259Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:6f930e31e44d4e811af383f032c3ce7827e69c3fcfaf821fb3b7422a3f75b0e9","observation_id":"fc9ae2e2-e950-4e8b-a31d-cb2c1a803782","resolution":{"observed_at":"2026-08-05T00:25:45.341259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.057355Z","title":"Testing matrix rank, optimally , year =","venue":null,"work_id":"ec6be308-6849-4813-b2cb-8312f72d25a2","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.344701Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:36e8cdaa194e323bd79b174eed48e6d9dc847a4c460a4dbea07be61cf30e4412","observation_id":"848b9ee9-2450-4c81-b985-8ac0225b1a59","resolution":{"observed_at":"2026-08-05T00:25:46.060812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.045367Z","title":"Testing positive semi-definiteness via random submatrices , year =","venue":null,"work_id":"c6519b4c-1a9d-417c-9e58-e7c894c2c8f1","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.348239Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:8923f380a2206c9a65daac393e219fe261f4cd80c4f675f0ded34aa600e6a373","observation_id":"f88a6e21-e762-4736-920c-6cfd9bb27924","resolution":{"observed_at":"2026-08-05T00:25:46.049545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.351854Z","title":"Proceedings of the 51st annual ACM SIGACT symposium on theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.351854Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:58578408fec51ebdd362189c7a56459140a9206ddc3f7553e0ab1c0c8b02b0ab","observation_id":"b78a39b5-3353-4212-a69c-91ddec147166","resolution":{"observed_at":"2026-08-05T00:25:45.351854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.024681Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"17663e1a-b33a-4360-a011-6dd0ccb911c2","year":2022},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.355199Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:44fe256dac6dfccbb72eafe0bc76424131c63827d0bbab0b64ed5517d812e4a5","observation_id":"34529096-349c-4c0a-b311-9f637603776a","resolution":{"observed_at":"2026-08-05T00:25:46.028833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.358673Z","title":"III , author=","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.358673Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:cc707269011940fc966789b02378bbb715985206638443d5f0e211f0e6fc7850","observation_id":"c62c2a55-e590-462a-83af-609732e864e8","resolution":{"observed_at":"2026-08-05T00:25:45.358673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:46.004892Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"831cdfe8-4f5f-4b82-a4e9-a5d1c0366a75","year":2013},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.362038Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:519e00ca26968e7a79c30051bba7e9608ceee51ad5dc913f97460d06c0d0d03e","observation_id":"4a352d7f-b3cd-466a-809b-5754a7a68769","resolution":{"observed_at":"2026-08-05T00:25:46.008510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.993383Z","title":"Communications on Pure and Applied Mathematics , volume=","venue":null,"work_id":"ddf78e9e-c4f3-4b52-ae1d-624c74842571","year":2025},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.365335Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:5acfafd3a640cd9157b4562c05867b2259b8ec4edc421b0941594537b9baef33","observation_id":"f718c765-2cb4-4644-9da9-ade6dba2da56","resolution":{"observed_at":"2026-08-05T00:25:45.997006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.981077Z","title":null,"venue":null,"work_id":"4074bd4c-e52e-4900-bebc-9e47a980db40","year":2004},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.368647Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:12959be01af88e5efe14d7448aa51557bd1835ec288068df0510159ca59b3392","observation_id":"6c4d9456-15ba-42a3-aea5-2aabaec470fb","resolution":{"observed_at":"2026-08-05T00:25:45.985122Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1104.1377","last_updated":"2011-04-07T16:55:23Z","snapshot_observed_at":"2026-07-06T02:25:59.890776Z","submitted_at":"2011-04-07T16:55:23Z","title":"Fast Local Computation Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1104.1377","snapshot_observed_at":"2026-08-05T00:25:45.372113Z","title":"arXiv preprint arXiv:1104.1377 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.372113Z"},"links":{"cited_paper":"/paper/1104.1377","citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:0964f56f25784bc0b3b4cb77110ef4176af3e1a4593b5fb5355051ab5c0bda87","observation_id":"7a7863b6-529b-4f9f-9d50-19fcded91a64","resolution":{"observed_at":"2026-08-05T00:25:45.372113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.968925Z","title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":"7f0585fd-09ed-43dd-ad39-e7a14cccbe14","year":2012},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.375779Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:68f3b57ed233e7b6636e7e4bfa2a8fed7e5860dadfd36b88a93fde511a3bf9c9","observation_id":"d378fced-0f74-49e8-9448-b7aa49cddc13","resolution":{"observed_at":"2026-08-05T00:25:45.972776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.845253Z","title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"64fae36c-7b5b-482b-9bc2-7f6c933e28b2","year":2017},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.379368Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:9a8c86e3f10177b6db06fa43b63dc469d5d1e1f5192661c3a87d6979469fceb6","observation_id":"069b9da6-6d68-45f0-87a3-dd90dee55b6c","resolution":{"observed_at":"2026-08-05T00:25:45.849606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.833098Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"ceab7673-a6e1-4afc-9542-85c12eabc4ee","year":2020},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.382522Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:f22a7bc2282fa4e8fdd75f423ce3472d75718938ee33452133910fd9148fbc27","observation_id":"5ec5cb03-8032-42bf-974b-711c93fc5d1b","resolution":{"observed_at":"2026-08-05T00:25:45.836976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.820534Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"2b19b391-f942-4208-9115-ea7d9df0eefd","year":2021},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.386259Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:8e4d649ddf9c7e4dc89fa8b143cceb1f70d1cdb27de55c92be4c55a1b0a00fe2","observation_id":"b1419c1f-952d-4690-8780-83ce4ce68e06","resolution":{"observed_at":"2026-08-05T00:25:45.825467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.809177Z","title":"Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=","venue":null,"work_id":"05ee7b2e-bb6f-4e2d-9f7f-fdb74d476425","year":2012},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.389566Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:3ea589e0e2e15e29a3105268144723be5d4b84f00a5bc301736c78332d4f9a14","observation_id":"37a4ce1f-1ee3-4efd-9d7d-003d2f70cdad","resolution":{"observed_at":"2026-08-05T00:25:45.812776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.797060Z","title":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"5f2c16a5-68dc-403b-86da-f6e192585ec7","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.392757Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:2872030aca2ced5dc89eebfc191af625f17daeb04dc81141ebb8a476f48ca16f","observation_id":"23b66b94-4511-4da7-b16a-40c81ef3a6c9","resolution":{"observed_at":"2026-08-05T00:25:45.800647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.396226Z","title":"Proceedings of the National Academy of Sciences , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.396226Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:bc130bd25722ea3241bd35076f581a21167056e3a609865f6c458ad742c8bf40","observation_id":"31128771-aa65-4002-8a0e-5ce74591ee63","resolution":{"observed_at":"2026-08-05T00:25:45.396226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.777747Z","title":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"6dda0aa8-6c0e-48a5-8afa-c67524a2ec07","year":2026},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.399590Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:95da36b6f1aa1786f1b5f44bc4829fa7be6de14b48c6b4e78f4f38f40f1e725b","observation_id":"2cccaf8b-0a25-470e-9526-9b594ddfad12","resolution":{"observed_at":"2026-08-05T00:25:45.781536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.766377Z","title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"51fc11f1-2eea-46c4-8934-615bcc8750a6","year":2024},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.403068Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:7ae0f0886ff3128a809ffa5ef10a5aaec98f4fa81c96a3579b91b2c724fb5a02","observation_id":"93b580cb-61ea-4ab6-933e-c772761a07bd","resolution":{"observed_at":"2026-08-05T00:25:45.770086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.754568Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"fdd3fb8c-0212-4bf7-b925-c838c392c850","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.406570Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:53499cf540519889ed90b1de7b52340e2d351568f5584a85de9e971f06457586","observation_id":"c41a4b5e-48c7-4f7e-8051-877ab2213893","resolution":{"observed_at":"2026-08-05T00:25:45.758146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.409837Z","title":"2017 , publisher=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.409837Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:ed77ca12a57a2b90967409d64146a2bc221a756f51cb6ecbcf4f15658efef983","observation_id":"d671d3d4-ec82-4ead-8abf-8984626ca9f5","resolution":{"observed_at":"2026-08-05T00:25:45.409837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.735392Z","title":", author=","venue":null,"work_id":"ab4565e7-83b6-41d1-b0af-0a2b84bf48c5","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.413143Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:717edaf7d50532acbcaf90a4de1fb9de8e568a3970e1f8c3ca15c2b1ee2e49b9","observation_id":"393b95dd-3c19-4c8e-a3e4-35ab862fe320","resolution":{"observed_at":"2026-08-05T00:25:45.739550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.416469Z","title":"Acta Numerica , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.416469Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:5f59edb5174f017634052839b55bd5d5e62214f3caa566485c593738c62b627c","observation_id":"c766723d-3b4e-4cb2-a0a4-0f142c41ed0c","resolution":{"observed_at":"2026-08-05T00:25:45.416469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.717144Z","title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":"a4ef9e59-d6f1-4785-8c8d-4c39b3bbf391","year":2017},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.419688Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:ac682190b0e4c20d1e7aa5540dc4bbdc116783649d33cee47977cfc04c0c843c","observation_id":"47618179-379b-43a0-9b88-64bff3be0aea","resolution":{"observed_at":"2026-08-05T00:25:45.720636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.422879Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.422879Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:30c944681d15ad5d29e380e6b248e6606b528477eb067463b1b89e9446ec6024","observation_id":"83b55206-2306-455d-999d-a5bef9dd44e3","resolution":{"observed_at":"2026-08-05T00:25:45.422879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.697228Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"cd79be6d-9cf6-4ae5-aec6-c0d2366527cc","year":2019},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.425969Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:5f7b2229a7c94d52ac23de3d5097340c7ad8984f9f45ca5a9db236ac7d11bf56","observation_id":"33e551e1-96d8-48b0-9946-abf372d91b9f","resolution":{"observed_at":"2026-08-05T00:25:45.700802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.686432Z","title":"ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=","venue":null,"work_id":"b0e555b2-15d7-4598-a014-741caca22cb8","year":2020},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.429592Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:cf542959a489cfe8d4a72c594ba0c524816918a8872af87870c6f16a5088fc70","observation_id":"7e04d3a2-3e37-4675-a190-7258a8b04b98","resolution":{"observed_at":"2026-08-05T00:25:45.689951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.675357Z","title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"af9bbfae-c2c8-48ec-a4e2-624857c6a218","year":2023},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.433235Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:f7bb2bb3d51a7d879b3172ff7525e72cca40a3460f2f9b96017658cf5bf44dc9","observation_id":"24e72202-454f-4062-be5e-ee4c3f0a9721","resolution":{"observed_at":"2026-08-05T00:25:45.678856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.663654Z","title":"Proceedings of the 24th acm sigkdd international conference on knowledge discovery & data mining , pages=","venue":null,"work_id":"64146031-e806-4b62-91e6-3a37d8274ec4","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.436568Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:08700cfdded0478bd4e257ac6f3681a946647b845be9fafc54cf35de483e5dd5","observation_id":"4d25e476-de38-4e12-9b1a-d5337b291c3e","resolution":{"observed_at":"2026-08-05T00:25:45.667442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.652542Z","title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"cd83e242-2938-48a0-91bd-0a4c962411bf","year":2025},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.439883Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:3ff775c5942c3fa8c9f7405a671a525573752fa016dfed13dc77c2a97c1890dd","observation_id":"b53fb82b-08ab-4787-a0f3-1e60d4dca0d2","resolution":{"observed_at":"2026-08-05T00:25:45.656126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.641296Z","title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":"05ece5ed-be2a-4871-bfa9-204fd982cf36","year":null},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.442908Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:b7755def1684fda2a9eb64e461603bd52f4118a397d5abcfe8fc3654d4476348","observation_id":"41c4d88b-0bb2-457a-a385-84f4a3ccdc3b","resolution":{"observed_at":"2026-08-05T00:25:45.644849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-05T00:25:45.446529Z","title":"arXiv preprint arXiv:2009.11392 , year=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.446529Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:d933a8cc60d6f939e1ea68dda8a982979e08a34d644402af98ede30583e3ecf2","observation_id":"5f5b2c94-e820-43f5-a8a6-433dd80fb7cd","resolution":{"observed_at":"2026-08-05T00:25:45.446529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.630192Z","title":"Machine learning , volume=","venue":null,"work_id":"99651014-74fc-42b9-afba-f06a2353db39","year":2004},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.450075Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:962d2743292a98fc5e360c0f0638eaffcdfa85013a4c89831929eb7da586b51a","observation_id":"48080a6c-7e7d-47cb-9b15-261c65ecdb50","resolution":{"observed_at":"2026-08-05T00:25:45.633581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.618068Z","title":"SIAM Journal on computing , volume=","venue":null,"work_id":"20f6080a-f8eb-4e20-906d-5ac2facb0d5a","year":2006},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.453222Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:948711997a14b37040c2f3dc5a3e6b40ed4b632e46e41ff8d556cfe5d9778510","observation_id":"d8b57804-7b0c-4c71-b6eb-c19d7b26bcaa","resolution":{"observed_at":"2026-08-05T00:25:45.622241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.604744Z","title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":"93eb10ef-2dde-4354-a235-fbac19f0e560","year":2025},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.456428Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:e1d79b3292c6dd4375aae06925e2bbcff9fe8d62804506fe947b411bcd04eaae","observation_id":"a2d0524e-47e2-402b-8dbc-2a356e2df105","resolution":{"observed_at":"2026-08-05T00:25:45.608580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.593053Z","title":"SIAM Journal on Matrix Analysis and Applications , volume=","venue":null,"work_id":"639d1f2b-092f-4bd7-84fc-95967d652445","year":2023},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.459709Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:4a7ce0e5d2e53d49ee7a0e8c423fbba9b8377615d569379ac5e5f02c5a3c7b0f","observation_id":"722b2dc7-642b-46ec-9b07-de350ef5355b","resolution":{"observed_at":"2026-08-05T00:25:45.596653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.581479Z","title":"SIAM Journal on Matrix Analysis and Applications , volume=","venue":null,"work_id":"7e555a29-bcb3-4bd2-8f3b-64c7ef64e3f3","year":2022},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.463719Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:5cd14a4108c36b2c2916f8473f98bb217f6fb10a05dc974574372f6f3bd232df","observation_id":"fb5d47ce-d57e-4853-9522-8083acf4ad8f","resolution":{"observed_at":"2026-08-05T00:25:45.584975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.569928Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"d5c0e0a4-e1ed-4e63-93e8-2e188662ca26","year":2019},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.466867Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:0b9b9a137b94126ba52bb303a1650f9ef00d8ba478ea1a9f2e55f5118808a105","observation_id":"526a961c-4770-4ba0-8691-4bf5e3c5319b","resolution":{"observed_at":"2026-08-05T00:25:45.573556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.08556","last_updated":"2026-07-09T14:47:06Z","snapshot_observed_at":"2026-08-07T01:01:24.441849Z","submitted_at":"2026-07-09T14:47:06Z","title":"Locally Approximating the Top Eigenvector of Bounded Entry Matrices","version":1},"cited_work":{"arxiv_id":"2607.08556","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.08556","snapshot_observed_at":"2026-08-05T00:25:45.506312Z","title":"Locally Approximating the Top Eigenvector of Bounded Entry Matrices","venue":"cs.DS","work_id":"cf12dd36-ccd0-43e9-858c-0d331f0cbc7e","year":2026},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.470076Z"},"links":{"cited_paper":"/paper/2607.08556","citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:550c36865bb91402aed64b12f99e0711f94c3b1810eeeb0d84e7f2f2e529706b","observation_id":"5fd9e12c-5305-40c0-a868-17596e98ca44","resolution":{"observed_at":"2026-08-05T00:25:45.512549Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:25:45.558681Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":"0fa523df-56b3-4395-aaae-5e97d4e3f644","year":1998},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.473741Z"},"links":{"citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:3098a22c20e78b7ae6cf3d4695cb7887d06a69ddddc71a3aa85f8e2c6a2d5454","observation_id":"07e73374-07e9-4793-916e-321bb3bf2a11","resolution":{"observed_at":"2026-08-05T00:25:45.562090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":45},"total_outbound_references":62},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2608.00840."}