{"as_of":"2026-08-09T08:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b239e86bd4ecb8c01d5179e124f196f86051ce469e318f658370f7b7a9e6e33c","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-05T14:36:48.793330Z","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-07-01T21:46:15.472467Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.19290","last_updated":"2025-07-25T14:04:20Z","snapshot_observed_at":"2026-08-06T21:45:12.587447Z","submitted_at":"2025-07-25T14:04:20Z","title":"Query Efficient Structured Matrix Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19290","snapshot_observed_at":"2026-08-05T14:36:48.793330Z","title":"A MSEL , P","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.793330Z"},"links":{"cited_paper":"/paper/2507.19290","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f2d4b813204cb492355aa3eba7d13a4eb67100293822da93cea3752d574328a5","observation_id":"c21c007a-deb1-4aa5-a1b7-5e55108a147a","resolution":{"observed_at":"2026-08-05T14:36:48.793330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19290","last_updated":"2025-07-25T14:04:20Z","snapshot_observed_at":"2026-08-06T21:45:12.587447Z","submitted_at":"2025-07-25T14:04:20Z","title":"Query Efficient Structured Matrix Learning","version":1},"cited_work":{"arxiv_id":"2507.19290","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19290","snapshot_observed_at":"2026-07-17T01:21:42.040668Z","title":"Amsel, P","venue":null,"work_id":"4d5ef208-6181-40b1-b1e8-9810d48ca7b9","year":2025},"citing_paper":{"arxiv_id":"2606.01335","last_updated":"2026-05-31T16:38:43Z","snapshot_observed_at":"2026-08-06T18:04:32.517217Z","submitted_at":"2026-05-31T16:38:43Z","title":"Transpose-free linear algebra","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T16:22:10.159728Z"},"links":{"cited_paper":"/paper/2507.19290","citing_paper":"/paper/2606.01335"},"observation_digest":"sha256:729099bcac3976af3086d650783a4f2139f8fc6ee26645b04bd49dad3698eb4f","observation_id":"ef079a26-9e3c-47c5-957f-09b100e4f88b","resolution":{"observed_at":"2026-07-17T01:21:42.040668Z","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":"2507.19290","last_updated":"2025-07-25T14:04:20Z","snapshot_observed_at":"2026-08-06T21:45:12.587447Z","submitted_at":"2025-07-25T14:04:20Z","title":"Query Efficient Structured Matrix Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19290","snapshot_observed_at":"2026-08-03T08:39:55.429483Z","title":"arXiv preprint arXiv:2507.19290 , 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":15,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.429483Z"},"links":{"cited_paper":"/paper/2507.19290","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:fda21fccef873d16be30b7b7abd7322af0bb2c32a67d01abe98fa099c0def95d","observation_id":"47aab406-f0df-4953-a5ed-285635e9db96","resolution":{"observed_at":"2026-08-03T08:39:55.429483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.19290/citation-record","integrity":"/paper/2507.19290/integrity","json":"/paper/2507.19290/citation-record.json","paper":"/paper/2507.19290"},"outbound":[],"paper":{"arxiv_id":"2507.19290","last_updated":"2025-07-25T14:04:20Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T21:45:12.587447Z","submitted_at":"2025-07-25T14:04:20Z","title":"Query Efficient Structured Matrix Learning"},"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:2507.19290."}