{"as_of":"2026-08-19T10:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b43b30e38653dd8998568a1523dde18a882750b0d2dde15a738122b06273501e","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:29:45.675556Z","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-06T19:57:43.856348Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.05719","last_updated":"2021-08-22T01:26:24Z","snapshot_observed_at":"2026-08-19T04:24:37.090910Z","submitted_at":"2021-01-14T16:50:13Z","title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05719","snapshot_observed_at":"2026-08-08T20:29:45.675556Z","title":"Minimum cost flows, MDPs, and l1 -regression in nearly linear time for dense instances,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-17T17:40:47.015933Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":142,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:45.675556Z"},"links":{"cited_paper":"/paper/2101.05719","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:45caecee9f3237e85c702683c9fc163673f676acaf661a09c48064b79ac2f1ae","observation_id":"f104f167-496b-4591-872e-7c7fc2cae858","resolution":{"observed_at":"2026-08-08T20:29:45.675556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05719","last_updated":"2021-08-22T01:26:24Z","snapshot_observed_at":"2026-08-19T04:24:37.090910Z","submitted_at":"2021-01-14T16:50:13Z","title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances","version":2},"cited_work":{"arxiv_id":"2101.05719","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.05719","snapshot_observed_at":"2026-08-06T19:57:43.856348Z","title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances","venue":"cs.DS","work_id":"81d8f1d5-58c6-421d-bba0-3bf873ca0fe2","year":2021},"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":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.762790Z"},"links":{"cited_paper":"/paper/2101.05719","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:adbb96a27ea175cd1a408e482a88392ee1560ebeb256541c80b3823d1abd7846","observation_id":"0696eb8a-29dd-4ab3-8adb-5a626ee15282","resolution":{"observed_at":"2026-08-06T19:57:43.914073Z","resolver_source":"local_arxiv","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/2101.05719/citation-record","integrity":"/paper/2101.05719/integrity","json":"/paper/2101.05719/citation-record.json","paper":"/paper/2101.05719"},"outbound":[],"paper":{"arxiv_id":"2101.05719","last_updated":"2021-08-22T01:26:24Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T04:24:37.090910Z","submitted_at":"2021-01-14T16:50:13Z","title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances"},"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 2 inbound Pith citation observations for arXiv:2101.05719."}