{"as_of":"2026-08-16T10:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:226af549e364cf1855f29dd070134172424a8499a8bcd31652255244e86ceadc","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:10:34.188014Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2506.22701/citation-record","integrity":"/paper/2506.22701/integrity","json":"/paper/2506.22701/citation-record.json","paper":"/paper/2506.22701"},"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-06T22:10:35.222973Z","title":"Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix","venue":null,"work_id":"4e6e77a1-d248-4605-bfdc-4e257931a681","year":2011},"citing_paper":{"arxiv_id":"2506.22701","last_updated":"2025-06-28T00:41:39Z","snapshot_observed_at":"2026-08-15T06:31:17.222790Z","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:10:33.786462Z"},"links":{"citing_paper":"/paper/2506.22701"},"observation_digest":"sha256:0a9578bc92e023cb1e49220ef3e89e7e65efab213593e6fb31a6edae939f85da","observation_id":"bfb57722-d46d-4232-9bf5-c0a7bf34ea25","resolution":{"observed_at":"2026-08-06T22:10:35.308294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T22:10:34.442434Z","title":"Spectral sparsification of graphs","venue":null,"work_id":"434a0809-c020-49ff-a077-073036b36c10","year":2011},"citing_paper":{"arxiv_id":"2506.22701","last_updated":"2025-06-28T00:41:39Z","snapshot_observed_at":"2026-08-15T06:31:17.222790Z","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods","version":1},"reference_index":193,"source":"pdf_text","source_observed_at":"2026-08-06T22:10:34.188014Z"},"links":{"citing_paper":"/paper/2506.22701"},"observation_digest":"sha256:aa3ced6206378733d2293e21cf428ee7846e822072ce5a5dfa817139584f0c55","observation_id":"2402d058-5267-4b4f-89b7-4d9f44279f47","resolution":{"observed_at":"2026-08-06T22:10:34.538332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T22:10:35.030305Z","title":"Query lower bounds for log-concave sampling","venue":null,"work_id":"271f44f8-4a91-495e-8cd5-e25ed32cf473","year":2024},"citing_paper":{"arxiv_id":"2506.22701","last_updated":"2025-06-28T00:41:39Z","snapshot_observed_at":"2026-08-15T06:31:17.222790Z","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods","version":1},"reference_index":647,"source":"pdf_text","source_observed_at":"2026-08-06T22:10:33.840860Z"},"links":{"citing_paper":"/paper/2506.22701"},"observation_digest":"sha256:b9b47275f56f9bdde8532d40b55f7d781b33889ac154fbca74bef8054a37deb8","observation_id":"08b7aea8-4ae1-4c25-9374-b33f1119b7c3","resolution":{"observed_at":"2026-08-06T22:10:35.115532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T22:10:34.796654Z","title":"The block Lanczos method for computing eigenval- ues","venue":null,"work_id":"cb54704e-c07b-4390-bfd5-5704a3dadd11","year":1989},"citing_paper":{"arxiv_id":"2506.22701","last_updated":"2025-06-28T00:41:39Z","snapshot_observed_at":"2026-08-15T06:31:17.222790Z","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-06T22:10:33.906283Z"},"links":{"citing_paper":"/paper/2506.22701"},"observation_digest":"sha256:b78395ab988f6a35739a938a387989b2d47b76df51891ee2faadae4432f51808","observation_id":"707ea5c9-9fc4-4d10-ac3b-fa544fadd2f8","resolution":{"observed_at":"2026-08-06T22:10:34.889360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T22:10:34.619817Z","title":"Hutch++: Optimal stochastic trace estimation","venue":null,"work_id":"7b3a1b36-0abf-46d9-a97d-7166c3c9a02b","year":2021},"citing_paper":{"arxiv_id":"2506.22701","last_updated":"2025-06-28T00:41:39Z","snapshot_observed_at":"2026-08-15T06:31:17.222790Z","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-06T22:10:34.000046Z"},"links":{"citing_paper":"/paper/2506.22701"},"observation_digest":"sha256:1f17f9f13a5dee8bde72389520f5c34b51885ff6cf73159abeb1f3da9cc90904","observation_id":"300d2c8b-c5d0-4ac6-8bdd-780af53084da","resolution":{"observed_at":"2026-08-06T22:10:34.712390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01083","last_updated":"2019-08-02T22:42:47Z","snapshot_observed_at":"2026-08-14T15:22:04.696007Z","submitted_at":"2019-08-02T22:42:47Z","title":"Iterative methods for linear systems of equations: A brief historical journey","version":1},"cited_work":{"arxiv_id":"1908.01083","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.01083","snapshot_observed_at":"2026-08-06T22:10:34.284804Z","title":"Iterative methods for linear systems of equations: A brief historical journey","venue":"math.HO","work_id":"3674c619-5a50-46b7-bda4-686374e55949","year":2019},"citing_paper":{"arxiv_id":"2506.22701","last_updated":"2025-06-28T00:41:39Z","snapshot_observed_at":"2026-08-15T06:31:17.222790Z","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T22:10:34.066479Z"},"links":{"cited_paper":"/paper/1908.01083","citing_paper":"/paper/2506.22701"},"observation_digest":"sha256:594c082821f3ee8115b66b1c1a56df81a0c530020351549ff5f28e7b22262e61","observation_id":"8d798adf-05bc-4763-ae3b-8f5adbd34276","resolution":{"observed_at":"2026-08-06T22:10:34.361225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.22701","last_updated":"2025-06-28T00:41:39Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-15T06:31:17.222790Z","submitted_at":"2025-06-28T00:41:39Z","title":"Lower bounds for trace estimation via Block Krylov and other methods"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":6},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2506.22701."}