{"as_of":"2026-08-10T04:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da6342b4aa4f0e886927889711252637ed25b18102a4c5cce0a099d772fab742","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T05:25:53.609177Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T00:25:45.470076Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T00:25:45.506312Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2607.08556/citation-record","integrity":"/paper/2607.08556/integrity","json":"/paper/2607.08556/citation-record.json","paper":"/paper/2607.08556"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:26:48.423296Z","title":null,"venue":null,"work_id":"e9f12b72-9b60-4ad6-8857-97d9b143c538","year":2013},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:f2b43988c0917dc8f96d903653290abafa8d7228e480dc52968268b6c3b57c69","observation_id":"c239dc8e-c473-4daf-8c79-586d7bc07dd4","resolution":{"observed_at":"2026-07-10T05:26:48.424600Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:26:48.430076Z","title":"Space-efficient local computation algo- rithms","venue":null,"work_id":"f39bdc76-0372-40c8-b094-12c1b9624e43","year":2012},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:4fabb1f260cf456e609df094a492bbcd501986a5087a6ad0bed7774c728ea8be","observation_id":"762eb55c-4a87-4331-8019-433b61821c96","resolution":{"observed_at":"2026-07-10T05:26:48.431326Z","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-07-10T05:26:48.429622Z","title":"Efficient density evaluation for smooth kernels","venue":null,"work_id":"4ec24f5b-d272-404b-a31d-21b07ef54c73","year":2018},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:efa2140f02fefdc1177087b5f63afed470b74ab4ea5427a6c8e9e249fcbec9f2","observation_id":"6468885a-2d29-4956-a7b8-e8cbc84655c8","resolution":{"observed_at":"2026-07-10T05:26:48.430976Z","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-07-10T05:26:48.437475Z","title":"Testing positive semi-definiteness via random submatrices","venue":null,"work_id":"3d610bb5-5e2e-419f-ba33-30b322c3c64f","year":2020},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:090d74baf378d871bc60160fbd21c5a1d03d19e443793264b1f2195c5c415048","observation_id":"39949268-81d5-4cff-bb45-11fda53ae9ff","resolution":{"observed_at":"2026-07-10T05:26:48.439096Z","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-07-10T05:26:48.431705Z","title":"Woodruff, and Hongyang Zhang","venue":null,"work_id":"760953ef-895d-41c5-86ed-832431f70655","year":2019},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:f059cc818c48ca4f4a26caf481cb7baf93c6374b50cbfb81f58ac5fedfe86664","observation_id":"ff4592d1-e553-4dd8-8000-185599792c4a","resolution":{"observed_at":"2026-07-10T05:26:48.433117Z","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-07-10T05:26:48.421269Z","title":"Local computation algorithms for maximum matching: New lower bounds","venue":null,"work_id":"29bc22a9-1424-4b7c-8b69-9a3cbfded42e","year":2023},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:0ea4a25e98efdcbf4d980bacbfce589b69dd5381100f0adc20115ccf5300525f","observation_id":"f4b1191c-874f-4184-8f95-0c1ad124014d","resolution":{"observed_at":"2026-07-10T05:26:48.422692Z","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-07-10T05:26:48.439304Z","title":"Sublinear time low-rank approximation of distance matrices","venue":null,"work_id":"7d9b1e4b-adf2-4eee-a991-5c12a06bb920","year":2018},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:3687eb6104bb245ea8179a09c849038dffab4abd20811c6b6ea50c65bbe81164","observation_id":"f14b5ffe-1325-4709-990a-36022d4a7ba3","resolution":{"observed_at":"2026-07-10T05:26:48.440866Z","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-07-10T05:26:48.414816Z","title":"Kernel density estima- tion through density constrained near neighbor search","venue":null,"work_id":"1c181aef-d784-4126-a1f5-79da23726b16","year":2020},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:71328bb1e5c2592e4a70926f83a40528c76f248e4bb4f6eb13ce948f8e3a68a2","observation_id":"eaa49041-7044-4101-ae4d-420cf95475ca","resolution":{"observed_at":"2026-07-10T05:26:48.416274Z","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-07-10T05:26:48.437135Z","title":"A quasi-monte carlo data structure for smooth kernel evaluations","venue":null,"work_id":"bfd04bb1-fe2d-49e5-93c0-73ec2ee00e13","year":2024},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:3eac9a2a981298af06b1bd439e21c838d3b4e024391dee3b8c9daeaa02b5f04a","observation_id":"367d4efd-19d8-416e-ba7f-10df8fc2f4ef","resolution":{"observed_at":"2026-07-10T05:26:48.438706Z","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-07-10T05:26:48.425203Z","title":"Hashing-based-estimators for kernel density in high dimen- sions","venue":null,"work_id":"1602217c-6072-4a17-9972-6b1ebb440b58","year":2017},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:d23c7ed56a621e28d25460be5769129b99aba58fafc1ef6c19d881fcdf9e9b2b","observation_id":"0030a971-3fa4-483f-96ca-601940329973","resolution":{"observed_at":"2026-07-10T05:26:48.426752Z","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-07-10T05:26:48.427412Z","title":"Local computation of maximal independent set","venue":null,"work_id":"d68f69b3-c393-4478-a01c-08dff2b49eeb","year":2022},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:faaec724cd7c102e247637907619ede9aefa223f0616a6c938c185623b7eeb76","observation_id":"ddb84cc5-5935-4d60-8a8e-8ee1e4e51453","resolution":{"observed_at":"2026-07-10T05:26:48.428899Z","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-07-10T05:26:48.412482Z","title":"III: Linear Algebra","venue":null,"work_id":"bfd60510-902b-452d-bf8c-2e79d3c5fcb4","year":2026},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:8487a49c8a155c9033989151bafa824b024a7e18734be52d8985f45096b6bdc5","observation_id":"554193d4-9f27-4675-87ea-8c026661fd89","resolution":{"observed_at":"2026-07-10T05:26:48.414026Z","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-07-10T05:26:48.434948Z","title":"Recursive sampling for the nystr¨ om method","venue":null,"work_id":"0a493439-de8f-4388-8092-3f2300ab4846","year":2017},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:636b4ffaf8a5e9f6a802467c6f231a15eac5b479242474346ba6b551cbfcc9f1","observation_id":"c2a96f31-aa93-4df3-94a8-d759b49656d4","resolution":{"observed_at":"2026-07-10T05:26:48.436528Z","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-07-10T05:26:48.441448Z","title":"Fast local computation algorithms","venue":null,"work_id":"eaf69dce-f4a0-4018-a0b3-321d3f668bf4","year":2011},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:6ae23961bd9e2a17631c23b163c40ac3a324c9b799073338e80abc5ff2b689e1","observation_id":"abc3fdfe-7ee8-42a1-9aed-358b5f3c1d49","resolution":{"observed_at":"2026-07-10T05:26:48.442720Z","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-07-10T05:26:48.434496Z","title":"Woodruff","venue":null,"work_id":"868d5e5a-001f-43c3-9076-d612767936e7","year":2023},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:58c78340b4335860c595691767598693f8840a7c6879e28258b1dae9038fd62f","observation_id":"b48ddc65-64c4-4d12-acba-b8d1b0b814b4","resolution":{"observed_at":"2026-07-10T05:26:48.436756Z","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-07-10T05:26:48.417073Z","title":"Woodruff","venue":null,"work_id":"ef7fa3a2-86cf-4072-a28c-ad94b9313833","year":2025},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T05:25:53.609177Z"},"links":{"citing_paper":"/paper/2607.08556"},"observation_digest":"sha256:2c74678800c24fcb68ece79b13f48fe5076c6713c193ff9a19095e512ac608e6","observation_id":"19a81753-ea09-4281-8032-06791cd4fa91","resolution":{"observed_at":"2026-07-10T05:26:48.418373Z","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":"2607.08556","last_updated":"2026-07-09T14:47:06Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":16},"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 10 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 1 inbound Pith citation observation for arXiv:2607.08556."}