{"as_of":"2026-08-09T08:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c281cc872505512933e79a3f71ca74ad876238d4245281f414b92f9749cb9eb","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:03:32.691486Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T16:56:06.755843Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.10684","last_updated":"2022-01-26T00:05:12Z","snapshot_observed_at":"2026-07-06T12:31:16.768817Z","submitted_at":"2022-01-26T00:05:12Z","title":"Stochastic diagonal estimation: probabilistic bounds and an improved algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10684","snapshot_observed_at":"2026-08-07T15:03:32.691486Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16937","last_updated":"2025-09-06T14:27:10Z","snapshot_observed_at":"2026-08-07T14:50:27.040751Z","submitted_at":"2025-05-22T17:27:40Z","title":"Quasi-optimal hierarchically semi-separable matrix approximation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:32.691486Z"},"links":{"cited_paper":"/paper/2201.10684","citing_paper":"/paper/2505.16937"},"observation_digest":"sha256:ce278163cb36fa0f6cac9da060b033ff2bcaab8705caff22a625d7f82a6e8196","observation_id":"9e66bc93-2c50-4d0d-8e98-e79eed7bbcac","resolution":{"observed_at":"2026-08-07T15:03:32.691486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10684","last_updated":"2022-01-26T00:05:12Z","snapshot_observed_at":"2026-07-06T12:31:16.768817Z","submitted_at":"2022-01-26T00:05:12Z","title":"Stochastic diagonal estimation: probabilistic bounds and an improved algorithm","version":1},"cited_work":{"arxiv_id":"2201.10684","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.10684","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Baston and Yuji Nakatsukasa","venue":null,"work_id":"c2636b7b-3de2-4fa6-9419-a7bde949aa70","year":2022},"citing_paper":{"arxiv_id":"2605.01627","last_updated":"2026-05-07T16:51:21Z","snapshot_observed_at":"2026-07-06T23:14:47.444386Z","submitted_at":"2026-05-02T22:35:02Z","title":"Importance-Guided Basis Selection for Low-Rank Decomposition of Large Language Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-09T14:30:07.619159Z"},"links":{"cited_paper":"/paper/2201.10684","citing_paper":"/paper/2605.01627"},"observation_digest":"sha256:3d5db4c1e9c3c46fc85292a43a454890780bd4a7fbe31f3e0918a269fd1f1c99","observation_id":"968c9ff0-59b7-4ef3-bf29-a83b463f5106","resolution":{"observed_at":"2026-05-11T16:56:06.758119Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2201.10684","last_updated":"2022-01-26T00:05:12Z","snapshot_observed_at":"2026-07-06T12:31:16.768817Z","submitted_at":"2022-01-26T00:05:12Z","title":"Stochastic diagonal estimation: probabilistic bounds and an improved algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10684","snapshot_observed_at":"2026-08-03T08:39:57.570885Z","title":"arXiv preprint arXiv:2201.10684 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.570885Z"},"links":{"cited_paper":"/paper/2201.10684","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:a516443104a6c558dc9518d54b91c41ad29b597161d8c1ed533f6a1840a53d95","observation_id":"d5827c93-75fa-46e6-813d-18b24afcf159","resolution":{"observed_at":"2026-08-03T08:39:57.570885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2201.10684/citation-record","integrity":"/paper/2201.10684/integrity","json":"/paper/2201.10684/citation-record.json","paper":"/paper/2201.10684"},"outbound":[],"paper":{"arxiv_id":"2201.10684","last_updated":"2022-01-26T00:05:12Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T12:31:16.768817Z","submitted_at":"2022-01-26T00:05:12Z","title":"Stochastic diagonal estimation: probabilistic bounds and an improved algorithm"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2201.10684."}