{"as_of":"2026-08-15T14:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1fbdcdb7666771897a404065cd93cf9ffad501dd2d8a4948d22ed168af739045","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-15T06:32:42.880941+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-11T12:46:25.054430Z","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-06T22:03:14.717822Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.01698","last_updated":"2024-08-07T22:31:10Z","snapshot_observed_at":"2026-08-12T23:31:00.456251Z","submitted_at":"2024-07-01T18:10:19Z","title":"Column and row subset selection using nuclear scores: algorithms and theory for Nystr\\\"{o}m approximation, CUR decomposition, and graph Laplacian reduction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01698","snapshot_observed_at":"2026-08-11T12:46:25.054430Z","title":"Fornace and M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13992","last_updated":"2025-06-19T16:14:31Z","snapshot_observed_at":"2026-08-15T12:40:40.786632Z","submitted_at":"2024-12-18T16:11:22Z","title":"Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T12:46:25.054430Z"},"links":{"cited_paper":"/paper/2407.01698","citing_paper":"/paper/2412.13992"},"observation_digest":"sha256:689e64829fb92166e76ad00992cdcce70e14bf1449d04af10a96a43d09b6b313","observation_id":"a3db56b4-cd1e-4a7c-b0fd-e46a53104e9b","resolution":{"observed_at":"2026-08-11T12:46:25.054430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01698","last_updated":"2024-08-07T22:31:10Z","snapshot_observed_at":"2026-08-12T23:31:00.456251Z","submitted_at":"2024-07-01T18:10:19Z","title":"Column and row subset selection using nuclear scores: algorithms and theory for Nystr\\\"{o}m approximation, CUR decomposition, and graph Laplacian reduction","version":2},"cited_work":{"arxiv_id":"2407.01698","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.01698","snapshot_observed_at":"2026-08-06T22:03:14.717822Z","title":"Column and row subset selection using nuclear scores: algorithms and theory for Nystr\\\"{o}m approximation, CUR decomposition, and graph Laplacian reduction","venue":"math.NA","work_id":"5c9e380b-6852-4d0e-aa6a-113e4871f15b","year":2024},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.391535Z"},"links":{"cited_paper":"/paper/2407.01698","citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:d28e6d2c689c802b2460809d202ada13837541ebb70c729f1049c2a241409934","observation_id":"6e04c5b3-f2a4-488d-8217-e63d5b0f9f1b","resolution":{"observed_at":"2026-08-06T22:03:14.783224Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01698","last_updated":"2024-08-07T22:31:10Z","snapshot_observed_at":"2026-08-12T23:31:00.456251Z","submitted_at":"2024-07-01T18:10:19Z","title":"Column and row subset selection using nuclear scores: algorithms and theory for Nystr\\\"{o}m approximation, CUR decomposition, and graph Laplacian reduction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01698","snapshot_observed_at":"2026-08-01T13:00:03.093425Z","title":"Fornace and M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19282","last_updated":"2026-07-21T16:53:51Z","snapshot_observed_at":"2026-08-15T09:25:47.819489Z","submitted_at":"2026-07-21T16:53:51Z","title":"Nystr\\\"om Error Beyond $M$-Matrices: A Minimal Diagonally Dominant Obstruction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T13:00:03.093425Z"},"links":{"cited_paper":"/paper/2407.01698","citing_paper":"/paper/2607.19282"},"observation_digest":"sha256:421e0e14969ac657403db86269de7cf32a70ae235084eb29bff4180e110b0389","observation_id":"406a664b-e619-40ab-ae18-51f650125828","resolution":{"observed_at":"2026-08-01T13:00:03.093425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.01698/citation-record","integrity":"/paper/2407.01698/integrity","json":"/paper/2407.01698/citation-record.json","paper":"/paper/2407.01698"},"outbound":[],"paper":{"arxiv_id":"2407.01698","last_updated":"2024-08-07T22:31:10Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-12T23:31:00.456251Z","submitted_at":"2024-07-01T18:10:19Z","title":"Column and row subset selection using nuclear scores: algorithms and theory for Nystr\\\"{o}m approximation, CUR decomposition, and graph Laplacian reduction"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.01698."}