{"as_of":"2026-08-09T07:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f352c13102ca1ece13596c3b711ac092898c5cea0df522e35ff0275d2836b11","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:46:28.676790Z","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-03T12:38:07.288793Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.08033","last_updated":"2020-08-31T18:42:17Z","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.08033","snapshot_observed_at":"2026-08-08T15:46:28.676790Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.06399","last_updated":"2025-07-16T08:03:27Z","snapshot_observed_at":"2026-08-08T19:21:29.015201Z","submitted_at":"2025-02-10T12:37:10Z","title":"A Linearly Convergent Algorithm for Computing the Petz-Augustin Mean","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T15:46:28.676790Z"},"links":{"cited_paper":"/paper/1910.08033","citing_paper":"/paper/2502.06399"},"observation_digest":"sha256:f94d86aef05c00bfa8bb33f3938820e2ef2b08bbaca7b590b033a0a33b89049b","observation_id":"f1a0c0cd-ab6d-42fe-a221-612f58c76cec","resolution":{"observed_at":"2026-08-08T15:46:28.676790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.08033","last_updated":"2020-08-31T18:42:17Z","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.08033","snapshot_observed_at":"2026-08-06T23:04:03.571051Z","title":"Solving linear programs with sqrt (rank) linear system solves","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-09T03:17:28.758976Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.571051Z"},"links":{"cited_paper":"/paper/1910.08033","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:3e56d699e3a187f8738eda1c1a762c9cffe0cb609911a6e4f83386d29b8f1072","observation_id":"ed08bff2-2413-4ddc-a482-7b456f9d553a","resolution":{"observed_at":"2026-08-06T23:04:03.571051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.08033","last_updated":"2020-08-31T18:42:17Z","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","version":2},"cited_work":{"arxiv_id":"1910.08033","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.08033","snapshot_observed_at":"2026-07-03T12:38:07.288793Z","title":null,"venue":null,"work_id":"7fcf2285-e184-4e68-9897-c7824027da7e","year":1910},"citing_paper":{"arxiv_id":"2604.24488","last_updated":"2026-04-27T13:55:49Z","snapshot_observed_at":"2026-08-02T23:34:26.828090Z","submitted_at":"2026-04-27T13:55:49Z","title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T01:30:53.740345Z"},"links":{"cited_paper":"/paper/1910.08033","citing_paper":"/paper/2604.24488"},"observation_digest":"sha256:bf04d5afecf68321bce3a59beb0d6b9daa97363f257d7549cb4eb0d8feafc1a3","observation_id":"a6d0ca84-b692-47a1-b96a-a18b5ab2692c","resolution":{"observed_at":"2026-05-11T23:06:22.039180Z","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":"1910.08033","last_updated":"2020-08-31T18:42:17Z","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","version":2},"cited_work":{"arxiv_id":"1910.08033","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.08033","snapshot_observed_at":"2026-07-03T12:38:07.288793Z","title":null,"venue":null,"work_id":"7fcf2285-e184-4e68-9897-c7824027da7e","year":1910},"citing_paper":{"arxiv_id":"2606.11820","last_updated":"2026-06-10T08:54:38Z","snapshot_observed_at":"2026-08-08T19:07:38.290046Z","submitted_at":"2026-06-10T08:54:38Z","title":"On finding exact solutions of linear programs in the oracle model","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T08:56:03.977243Z"},"links":{"cited_paper":"/paper/1910.08033","citing_paper":"/paper/2606.11820"},"observation_digest":"sha256:44ad4446ce80c739c0442ab879f9b49bdba1bd71055c69d729612fbc72c78ad9","observation_id":"2df542fb-03dd-43f8-b5d2-507f6dfa5239","resolution":{"observed_at":"2026-07-03T12:38:07.290642Z","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":"1910.08033","last_updated":"2020-08-31T18:42:17Z","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","version":2},"cited_work":{"arxiv_id":"1910.08033","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.08033","snapshot_observed_at":"2026-07-03T12:38:07.288793Z","title":null,"venue":null,"work_id":"7fcf2285-e184-4e68-9897-c7824027da7e","year":1910},"citing_paper":{"arxiv_id":"2607.00252","last_updated":"2026-06-30T23:01:08Z","snapshot_observed_at":"2026-07-07T00:05:54.401681Z","submitted_at":"2026-06-30T23:01:08Z","title":"Distributionally Robust Linear Regression With Block Lewis Weights","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-02T19:29:59.464383Z"},"links":{"cited_paper":"/paper/1910.08033","citing_paper":"/paper/2607.00252"},"observation_digest":"sha256:022241226811f01ab43e664c4bb08b7348c92f861d2ba98c58271358f374cf46","observation_id":"6e057104-1b8f-4b76-9f44-1a2af9ed7035","resolution":{"observed_at":"2026-07-02T19:37:18.497301Z","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":"1910.08033","last_updated":"2020-08-31T18:42:17Z","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.08033","snapshot_observed_at":"2026-08-02T03:26:29.355166Z","title":"arXiv preprint arXiv:1910.08033 , title =","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2607.13943","last_updated":"2026-07-15T15:29:25Z","snapshot_observed_at":"2026-08-02T03:26:25.411632Z","submitted_at":"2026-07-15T15:29:25Z","title":"Beyond the $d^{2.5}$-mixing bound for Dikin walks on polytopes","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T03:26:29.355166Z"},"links":{"cited_paper":"/paper/1910.08033","citing_paper":"/paper/2607.13943"},"observation_digest":"sha256:76a4cd473faa597e41400f94ea860e4e3646a3958f4b704d9a7142ef246e0029","observation_id":"6dac4c29-7aec-41aa-8bd7-3af110e85d38","resolution":{"observed_at":"2026-08-02T03:26:29.355166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1910.08033/citation-record","integrity":"/paper/1910.08033/integrity","json":"/paper/1910.08033/citation-record.json","paper":"/paper/1910.08033"},"outbound":[],"paper":{"arxiv_id":"1910.08033","last_updated":"2020-08-31T18:42:17Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves"},"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 6 inbound Pith citation observations for arXiv:1910.08033."}