{"as_of":"2026-08-19T16:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c16ddd55008abf22ca8c7aee0328695a710b7d027bde1ef4802a9715146aae98","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:11:39.579473Z","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-02T00:56:24.195438Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","snapshot_observed_at":"2026-08-19T08:49:20.444823Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07470","snapshot_observed_at":"2026-08-11T14:11:27.073634Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.073634Z"},"links":{"cited_paper":"/paper/2004.07470","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9221abdf47b49e1ba794b9aef0e911dca05cfe8c8be2cec17357ed92fa3c9cdd","observation_id":"0d15e73a-ef83-44b4-9916-904cb421e935","resolution":{"observed_at":"2026-08-11T14:11:27.073634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","snapshot_observed_at":"2026-08-19T08:49:20.444823Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07470","snapshot_observed_at":"2026-08-11T14:11:39.579473Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12444","last_updated":"2025-03-21T15:52:39Z","snapshot_observed_at":"2026-08-16T12:25:35.685966Z","submitted_at":"2024-12-17T01:12:35Z","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","version":3},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:39.579473Z"},"links":{"cited_paper":"/paper/2004.07470","citing_paper":"/paper/2412.12444"},"observation_digest":"sha256:dae0cd449cb66f92725e06d2c1920186e7945bd44e118622fab338f4ee2a6620","observation_id":"b303bb9d-f292-400b-a2ce-d3ca060688ba","resolution":{"observed_at":"2026-08-11T14:11:39.579473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","snapshot_observed_at":"2026-08-19T08:49:20.444823Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07470","snapshot_observed_at":"2026-08-06T19:57:38.522784Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.522784Z"},"links":{"cited_paper":"/paper/2004.07470","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:334bf80f0d88aa120c4408826b550f590bc7ff89ca53ba276c6b551c3fa05e19","observation_id":"32424d26-0a4a-4623-9aca-1f855878f47f","resolution":{"observed_at":"2026-08-06T19:57:38.522784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","snapshot_observed_at":"2026-08-19T08:49:20.444823Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs","version":1},"cited_work":{"arxiv_id":"2004.07470","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.07470","snapshot_observed_at":"2026-07-02T00:56:24.195438Z","title":"Faster Dynamic Matrix Inverse for Faster","venue":null,"work_id":"08b25d31-dfe9-4ad9-a203-2538c5951483","year":2004},"citing_paper":{"arxiv_id":"2604.24488","last_updated":"2026-04-27T13:55:49Z","snapshot_observed_at":"2026-08-11T13:43:44.980197Z","submitted_at":"2026-04-27T13:55:49Z","title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T01:30:53.740345Z"},"links":{"cited_paper":"/paper/2004.07470","citing_paper":"/paper/2604.24488"},"observation_digest":"sha256:5083d1fc028387a5d2cef7bf40d4ba0312a5b974966be0e6b6a21272a0375a4e","observation_id":"63bf1326-bbef-4876-8d91-a0620e4ed172","resolution":{"observed_at":"2026-05-11T23:06:21.989400Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","snapshot_observed_at":"2026-08-19T08:49:20.444823Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs","version":1},"cited_work":{"arxiv_id":"2004.07470","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.07470","snapshot_observed_at":"2026-07-02T00:56:24.195438Z","title":"Faster Dynamic Matrix Inverse for Faster","venue":null,"work_id":"08b25d31-dfe9-4ad9-a203-2538c5951483","year":2004},"citing_paper":{"arxiv_id":"2607.00315","last_updated":"2026-07-01T01:31:02Z","snapshot_observed_at":"2026-08-19T08:03:17.034249Z","submitted_at":"2026-07-01T01:31:02Z","title":"Feasibilism, Explication, and the Cobham-Edmonds Thesis","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-02T00:47:09.701964Z"},"links":{"cited_paper":"/paper/2004.07470","citing_paper":"/paper/2607.00315"},"observation_digest":"sha256:a3a67ba6ac161a26336d071669378e957b59c963dafe9c49249c853138efa664","observation_id":"e2ee8645-b381-44d8-ae6b-45d38fcda5e4","resolution":{"observed_at":"2026-07-02T00:56:24.197825Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.07470/citation-record","integrity":"/paper/2004.07470/integrity","json":"/paper/2004.07470/citation-record.json","paper":"/paper/2004.07470"},"outbound":[],"paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T08:49:20.444823Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2004.07470."}