{"as_of":"2026-08-23T09:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06f5456a973a947f387a1a17fd3f693809fcb393ed892fe8e9f56f2b816b78b7","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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-11T20:13:03.707616Z","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-11T20:13:03.919535Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.04686","last_updated":"2024-10-24T16:35:05Z","snapshot_observed_at":"2026-08-23T04:16:35.358024Z","submitted_at":"2024-07-05T17:49:15Z","title":"Near-optimal hierarchical matrix approximation from matrix-vector products","version":2},"cited_work":{"arxiv_id":"2407.04686","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.04686","snapshot_observed_at":"2026-08-11T20:13:03.919535Z","title":"Near-optimal hierarchical matrix approximation from matrix-vector products","venue":"cs.DS","work_id":"29f95b06-6568-4127-98b8-4ef7958b42f7","year":2024},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.707616Z"},"links":{"cited_paper":"/paper/2407.04686","citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:ed9685fcd288ea5f1ebdb823655daa77d16f4bb06527eaab5a230cd10c2d239f","observation_id":"162eb7b6-c57e-4ef7-b514-893c6fb369d9","resolution":{"observed_at":"2026-08-11T20:13:03.924943Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.04686/citation-record","integrity":"/paper/2407.04686/integrity","json":"/paper/2407.04686/citation-record.json","paper":"/paper/2407.04686"},"outbound":[],"paper":{"arxiv_id":"2407.04686","last_updated":"2024-10-24T16:35:05Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-23T04:16:35.358024Z","submitted_at":"2024-07-05T17:49:15Z","title":"Near-optimal hierarchical matrix approximation from matrix-vector products"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2407.04686."}