{"as_of":"2026-08-18T22:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c503f2e64acc23f7e13fe2a47ddf67ea0c33b7e7d55e9710176f9fa3061844a2","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:35:38.962875Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2412.11963/citation-record","integrity":"/paper/2412.11963/integrity","json":"/paper/2412.11963/citation-record.json","paper":"/paper/2412.11963"},"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-11T14:35:39.443201Z","title":"First efficient convergence for streaming k- PCA : a global, gap-free, and near-optimal rate","venue":null,"work_id":"c9759a2e-eae7-46e6-b911-51ec1a364040","year":2017},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.838859Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:108eb2720402184f4bf1b4ace986eff418f8db00a41c2560cf10222dc8d054e8","observation_id":"a0142de1-5143-4849-9609-6dac30f44ae6","resolution":{"observed_at":"2026-08-11T14:35:39.448774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.426505Z","title":"( N oisy) gap cycle counting strikes back: Random order streaming lower bounds for connected components and beyond","venue":null,"work_id":"d964d939-36da-4941-9116-5b4e40695072","year":2023},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.844541Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:766e63b72e5845dafe97375826b0f8ff539aca8ce36f4ddc14400322d42d5fa7","observation_id":"1dec1475-4727-49e4-bbb1-5cf18b0069ec","resolution":{"observed_at":"2026-08-11T14:35:39.431906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.410610Z","title":"An improved gap-dependency analysis of the noisy power method","venue":null,"work_id":"3aa29b05-16d8-413b-acad-5ba843f32762","year":2016},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.852889Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:7e8c7be20382a7793710084520ad773d6110f7846d02c2d5ddd2ac336ec66113","observation_id":"58e98685-70e5-41b3-b625-93e749c1b826","resolution":{"observed_at":"2026-08-11T14:35:39.415875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.394124Z","title":"Optimal principal component analysis in distributed and streaming models","venue":null,"work_id":"23fcbc99-50d9-4ca2-816c-0d997c8bf810","year":2016},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.858212Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:45bc9f020ff7b3c513869f63f43f919094cb3161a583bb09abd5e936c0b03092","observation_id":"a6cc97e4-b074-477a-bc20-f5f697310731","resolution":{"observed_at":"2026-08-11T14:35:39.399259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.375489Z","title":"Robust lower bounds for communication and stream computation","venue":null,"work_id":"88be35a8-8c40-47ac-ac1e-ba258632d0fc","year":2008},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.864049Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:f98a86dfb3a6774049b7965448b182fc4ddb945dd83f2d933772f2fa09590c49","observation_id":"1b26019c-af2e-4e0a-ad03-5fbb4f47bb97","resolution":{"observed_at":"2026-08-11T14:35:39.381203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.356507Z","title":"Low-rank approximation and regression in input sparsity time","venue":null,"work_id":"e3515d67-5cd2-492a-b96d-55686c558581","year":2017},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.869075Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:55d22f3be461c78223bca3ae93426874a29483eee726f309071e2de4f3a8ecee","observation_id":"96607945-6599-4530-93e6-bf03e6a85784","resolution":{"observed_at":"2026-08-11T14:35:39.363279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.336026Z","title":"Frequent directions: Simple and deterministic matrix sketching","venue":null,"work_id":"a6fdad76-43be-4b52-8b90-9ec45711287b","year":2016},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.874788Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:0d1446f1c0562ddab6b779da50672580cc64c3f2e0d99afffa42ee510c5ace66","observation_id":"4e488520-477c-4174-9e45-19fccbbac60d","resolution":{"observed_at":"2026-08-11T14:35:39.341597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.319201Z","title":"Subspace iteration randomization and singular value problems","venue":null,"work_id":"7ce54ad3-9db2-4ab3-89e8-fbe5886bc426","year":2015},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.879694Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:54992c3a1a3b7e52cb8f4e9786d091805d8fa3e3a6cc6a37674891f3716691a3","observation_id":"4422c1f7-7916-4c2e-819e-a1e5c0ce7f4e","resolution":{"observed_at":"2026-08-11T14:35:39.324227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.298407Z","title":"Stream order and order statistics: Quantile estimation in random-order streams","venue":null,"work_id":"cb17abd8-8c76-4ede-a8cb-a549ba652f27","year":2009},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.884492Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:69aa7297ea4b5dba2eba120f0895e0fd173ccf3bdd097d09192a37a738bafb22","observation_id":"988dbb98-2399-47db-a52b-b216e274c605","resolution":{"observed_at":"2026-08-11T14:35:39.304305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0508122","last_updated":"2005-08-29T22:42:42Z","snapshot_observed_at":"2026-07-07T03:07:00.807066Z","submitted_at":"2005-08-27T23:10:52Z","title":"Streaming and Sublinear Approximation of Entropy and Information Distances","version":2},"cited_work":{"arxiv_id":"cs/0508122","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0508122","snapshot_observed_at":"2026-08-11T14:35:39.083615Z","title":"Streaming and Sublinear Approximation of Entropy and Information Distances","venue":"cs.DS","work_id":"1a75310d-e66e-455b-b672-bf1448ae14ef","year":2005},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.889405Z"},"links":{"cited_paper":"/paper/cs/0508122","citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:acf280a1cb89072c614dd3c4879afb63601ca6ae0d935d68ef78602f4908ea1c","observation_id":"d8cddbfc-7578-42a4-a56e-0715de950a43","resolution":{"observed_at":"2026-08-11T14:35:39.088953Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.12159","last_updated":"2020-02-25T23:54:44Z","snapshot_observed_at":"2026-08-18T21:13:34.939715Z","submitted_at":"2020-02-25T23:54:44Z","title":"Random-Order Models","version":1},"cited_work":{"arxiv_id":"2002.12159","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.12159","snapshot_observed_at":"2026-08-11T14:35:39.054354Z","title":"Random-Order Models","venue":"cs.DS","work_id":"2bae6a40-a0a6-46aa-9cb7-c4ab5db79c70","year":2020},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.894843Z"},"links":{"cited_paper":"/paper/2002.12159","citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:192421fb5aa9b33c1e8f9ff43accead387bbcc27bc81adeaff9175364d705f3d","observation_id":"ac56d397-aafe-4691-9c69-be9b5071895f","resolution":{"observed_at":"2026-08-11T14:35:39.063648Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.277178Z","title":"The noisy power method: A meta algorithm with applications","venue":null,"work_id":"95d422e3-066d-4179-8758-556da56fe4e2","year":2014},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.900207Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:a1b945f3e6811bef1beeab5d4137d8a4770e57d2d3c5ed03db84f2063aae6f86","observation_id":"ef9241e3-8a78-4de8-9768-a255aa452a0e","resolution":{"observed_at":"2026-08-11T14:35:39.285462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.260379Z","title":"Streaming k- PCA : Efficient guarantees for oja’s algorithm, beyond rank-one updates","venue":null,"work_id":"41128be3-a201-4227-bc62-82245856bce1","year":2021},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.905467Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:0cbd8651e2eb3e7464a07148a6c976242cd4f4d28c38043860ccfb9c80eb706b","observation_id":"27cb3abf-4cf5-4688-a836-a9a91cfa64c4","resolution":{"observed_at":"2026-08-11T14:35:39.265647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.242230Z","title":"Streaming pca: Matching matrix bernstein and near-optimal finite sample guarantees for O ja’s algorithm","venue":null,"work_id":"fe409784-30d0-4187-bdf8-b0befed559e6","year":2016},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.910286Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:4607429ef74bec901f8086954c50a22fd2609e01a0527f0df10c579416f25471","observation_id":"8febd9d5-c765-463c-be60-76e1d47d6125","resolution":{"observed_at":"2026-08-11T14:35:39.248387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.225839Z","title":"Streaming pca for markovian data","venue":null,"work_id":"ebca23ac-81d4-425d-8100-c3f9a3871968","year":2023},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.915222Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:bd8bdd498302ac0a50d6f4f4b0d7a8c5e82c6d540238464428353b8b405a1c18","observation_id":"31ed9ac1-2b00-475a-ad5a-4630571bb4c5","resolution":{"observed_at":"2026-08-11T14:35:39.230929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1008.0587","last_updated":"2010-08-03T16:28:10Z","snapshot_observed_at":"2026-08-18T08:15:30.082444Z","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","version":1},"cited_work":{"arxiv_id":"1008.0587","doi":null,"metadata_source":"pith","pith_arxiv_id":"1008.0587","snapshot_observed_at":"2026-08-11T14:35:39.027987Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","venue":"cs.DS","work_id":"029b7fc2-bcd7-46fd-8b25-2419ac007747","year":2010},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.920338Z"},"links":{"cited_paper":"/paper/1008.0587","citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:0d711361981ce902dd3696b8d32a3570267fb6778f752793f9d2811fe3750fa3","observation_id":"f3417fad-e4d9-4836-9893-d81a8854eb5a","resolution":{"observed_at":"2026-08-11T14:35:39.034181Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.206824Z","title":"Memory-limited, streaming PCA","venue":null,"work_id":"a5134586-719c-45e0-80ab-ab8ab377e98b","year":2013},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.925631Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:809c93f079afef80ba86dabd95650d9abe8e2f103c146a0e9d852d7a8390ab42","observation_id":"abcb5e93-eff0-4785-bcf5-94cc650d0b03","resolution":{"observed_at":"2026-08-11T14:35:39.212241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:38.930342Z","title":"Selection and sorting with limited storage","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.930342Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:f8d20d22494a6e671192e4851643b33896cf6cc0a1d8b8d380e7292d33e0ed82","observation_id":"905fda52-9933-4c37-86b7-c8603b88a5d3","resolution":{"observed_at":"2026-08-11T14:35:38.930342Z","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-11T14:35:39.178494Z","title":"Randomized block krylov methods for stronger and faster approximate singular value decomposition","venue":null,"work_id":"242b6d05-351f-4b12-9dca-97357d4203d9","year":2015},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.935082Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:5ed721fe6eebd7964ba2c7f908614f1b793394b11c5f7b4e149386db4fd9fba3","observation_id":"c0a6129a-dfc0-4221-8869-1d691c5b405b","resolution":{"observed_at":"2026-08-11T14:35:39.183929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.162187Z","title":"Stability of the lanczos method for matrix function approximation","venue":null,"work_id":"67402f3c-ce7b-42fb-ab21-5357faa3033d","year":2018},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.940155Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:3e7532180d60799093c0736dcabbffe84926422082ebcb8cb100d6ce141f34f1","observation_id":"55d8a394-a66d-450c-b75f-76d7d93e2716","resolution":{"observed_at":"2026-08-11T14:35:39.167547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:38.945118Z","title":"Simplified neuron model as a principal component analyzer","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.945118Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:207ab9dda2116f674e9e7fbf9a635f3f704e58b58aaa135aa48adab763ac4528","observation_id":"f0954e09-0e39-4894-8bd2-32a65e872b9d","resolution":{"observed_at":"2026-08-11T14:35:38.945118Z","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-11T14:35:39.134235Z","title":"Spectral guarantees for adversarial streaming PCA","venue":null,"work_id":"95dbc016-f506-416e-89f9-790cd8d669a8","year":2024},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.949704Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:f11d42c03666bee346924111b79be4f21023f3f966188f4b69bb69fd87594ae2","observation_id":"58e4abb7-ef92-4e83-a4ce-fb07dc8de794","resolution":{"observed_at":"2026-08-11T14:35:39.139366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.116540Z","title":"An introduction to matrix concentration inequalities","venue":null,"work_id":"e9aeba9d-882d-4c6f-86e5-4cbbae8893cf","year":2015},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.953981Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:92d3db0010944d2f631f68406e9d958031aaafa63f12cf6e09a5d47a37e0abc3","observation_id":"0ecadb7c-7abc-4bf6-8981-390260ebeae1","resolution":{"observed_at":"2026-08-11T14:35:39.122546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.01429","last_updated":"2018-04-18T02:00:21Z","snapshot_observed_at":"2026-08-14T22:02:56.636237Z","submitted_at":"2016-04-05T21:12:01Z","title":"The Price of Differential Privacy for Low-Rank Factorization","version":5},"cited_work":{"arxiv_id":"1604.01429","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.01429","snapshot_observed_at":"2026-08-11T14:35:39.000649Z","title":"The Price of Differential Privacy for Low-Rank Factorization","venue":"cs.DS","work_id":"49676260-7031-4a28-a51f-5b9cac4275c2","year":2016},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.958417Z"},"links":{"cited_paper":"/paper/1604.01429","citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:94bf5759b49bee2438fc32aec573b1ff5393569dea2f812ddef422a4baf15189","observation_id":"3dd2b3f3-62a5-428e-b847-cf99b4cde80d","resolution":{"observed_at":"2026-08-11T14:35:39.008141Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:35:39.100244Z","title":"Some inequalities for singular values of matrix products","venue":null,"work_id":"ac227b95-4219-4f49-9d43-2570bd6d1fc3","year":1997},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.962875Z"},"links":{"citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:ee376de733aa5c1f467d8c541ba8295cec5c68ceee77c5124f08a8e7474b7508","observation_id":"7abcb252-abdb-4261-be64-05e022e9e81f","resolution":{"observed_at":"2026-08-11T14:35:39.105801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":19},"total_outbound_references":25},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2412.11963."}