{"as_of":"2026-08-08T13:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b5b78cebe79c8d3e95c3b5b36b20344ed3aa02108ba42bafc745690b5c30205","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:35:25.287314Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.17650/citation-record","integrity":"/paper/2506.17650/integrity","json":"/paper/2506.17650/citation-record.json","paper":"/paper/2506.17650"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:26.448073Z","title":"Practical large-scale linear programming using primal-dual hybrid gradient","venue":null,"work_id":"407c4d95-9ace-486c-9e9c-8193f8a2e56b","year":2021},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:23.424744Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:eec9472c9717f8b2c99b09115c3afdd6f1eff6b2f5473459e15befd6f723e370","observation_id":"c7080f9f-2ccb-46a7-bbc9-5cb8f47715f8","resolution":{"observed_at":"2026-08-06T23:35:26.517269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:23.515677Z","title":"Pdlp: A practical first-order method for large-scale linear programming","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:23.515677Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:92ee1a464a0a677693f64bc7cfc5a9a7e7394dde1756bec8779c2f432efafe69","observation_id":"996ea964-7e4c-4a5b-acf3-4c03f1f408cd","resolution":{"observed_at":"2026-08-06T23:35:23.515677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:26.284741Z","title":"Online learning rate adaptation with hypergradient descent","venue":null,"work_id":"4ad24102-7dc6-42ac-bdc1-d6a24fac7df2","year":2018},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:23.584738Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:1df8def581b7e2d33221593b49ffefd3fc0fd71cee8f64f304ec15f33ddf49aa","observation_id":"edcbd31f-f900-4d1e-a71c-500580544cb5","resolution":{"observed_at":"2026-08-06T23:35:26.345291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11229","last_updated":"2025-03-16T21:17:53Z","snapshot_observed_at":"2026-08-07T18:14:26.210171Z","submitted_at":"2025-02-16T18:49:02Z","title":"Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent","version":2},"cited_work":{"arxiv_id":"2502.11229","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.11229","snapshot_observed_at":"2026-08-06T23:35:25.563784Z","title":"Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent","venue":"math.OC","work_id":"bc5124a5-e670-47f4-a3e6-4eb64ff8b2dd","year":2025},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:23.707323Z"},"links":{"cited_paper":"/paper/2502.11229","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:c19fb1514f9a6648ceb33e3ebf0f0b2f5aea68008c6e0ac38968322fc4ff342d","observation_id":"0c6a470f-6ee9-4c1c-9f02-6655826c5fc1","resolution":{"observed_at":"2026-08-06T23:35:25.620841Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:23.867683Z","title":"Adaptive subgradient methods for online learning and stochastic optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:23.867683Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:9938d5cee9ae780eacf5bf4500075dfe8cc3e21725070a4ceb612425d95e7857","observation_id":"71721720-53cd-47c3-94e6-1918a2aa43a4","resolution":{"observed_at":"2026-08-06T23:35:23.867683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01803","last_updated":"2024-11-05T21:16:44Z","snapshot_observed_at":"2026-08-01T02:48:11.871788Z","submitted_at":"2024-11-04T05:04:18Z","title":"Gradient Methods with Online Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01803","snapshot_observed_at":"2026-08-06T23:35:24.034634Z","title":"Gradient methods with online scaling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.034634Z"},"links":{"cited_paper":"/paper/2411.01803","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:0f0c67025a04b74ef9627cb0087d19360b4f6aad677c33577c8fc8e5b1b03ee5","observation_id":"e8c89bf7-c7bd-4509-83aa-2b04b4e347c3","resolution":{"observed_at":"2026-08-06T23:35:24.034634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23081","last_updated":"2025-09-05T02:19:47Z","snapshot_observed_at":"2026-08-08T05:47:28.129882Z","submitted_at":"2025-05-29T04:35:21Z","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23081","snapshot_observed_at":"2026-08-06T23:35:24.103094Z","title":"Gradient methods with online scaling part i","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.103094Z"},"links":{"cited_paper":"/paper/2505.23081","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:562f8598a6a1b77e0185a78055e48448a3ae6e693a869c46d5ce179390a77187","observation_id":"ff55bcce-22c1-47d3-8546-124f443adfee","resolution":{"observed_at":"2026-08-06T23:35:24.103094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:26.132537Z","title":"Electronic mail distribution of linear programming test problems","venue":null,"work_id":"5528f6e9-a359-4501-89ec-e8086076f035","year":1985},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.246543Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:3a3edb7f81c7596bcc39b05941fe376dfe78c1f1698cef8cbe3e367ef24f000c","observation_id":"4586050a-fe11-46c1-a52f-6eb41a0c0a16","resolution":{"observed_at":"2026-08-06T23:35:26.200414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:25.984103Z","title":"Miplib 2017: data- driven compilation of the 6th mixed-integer programming library","venue":null,"work_id":"9ad03615-32a6-4d2b-8b22-0748e8a5d206","year":2017},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.412181Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:3ef435eb1e943dc93999d0c308adfe745884a9905dc4ee7a600da31c9ca25bdd","observation_id":"959c05ba-7eb2-4b5b-a3e2-f83f501b6df5","resolution":{"observed_at":"2026-08-06T23:35:26.061374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12180","last_updated":"2024-06-07T16:51:52Z","snapshot_observed_at":"2026-08-04T22:51:37.414194Z","submitted_at":"2023-11-20T20:50:49Z","title":"cuPDLP.jl: A GPU Implementation of Restarted Primal-Dual Hybrid Gradient for Linear Programming in Julia","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12180","snapshot_observed_at":"2026-08-06T23:35:24.525220Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.525220Z"},"links":{"cited_paper":"/paper/2311.12180","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:720b5d2a5635e87b568936b7d61a9566f20ff9d53dbe86dec0eae57b56a592ae","observation_id":"d989ddf6-5215-4cc7-943c-6c4ec6a9795a","resolution":{"observed_at":"2026-08-06T23:35:24.525220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:24.635426Z","title":"On the geometry and refined rate of primal–dual hybrid gradient for linear programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.635426Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:2869bb6b9ba82402c3aa091e803a98d272a4c9d8efd3091127cd8ad407b055ce","observation_id":"f1d4e34f-0a47-42eb-8705-6596e0232c8a","resolution":{"observed_at":"2026-08-06T23:35:24.635426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16144","last_updated":"2024-09-09T21:15:27Z","snapshot_observed_at":"2026-08-05T02:54:40.183477Z","submitted_at":"2024-07-23T03:06:56Z","title":"Restarted Halpern PDHG for Linear Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-06T23:35:24.778419Z","title":"Restarted halpern pdhg for linear programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.778419Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:b4fe8631bf15db0fc26bf54d4fab07a72d2ab9d06f64340c4429f7fbc9e91451","observation_id":"71fc8e91-0bfb-4570-bb7d-92bbdf9a03a4","resolution":{"observed_at":"2026-08-06T23:35:24.778419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14832","last_updated":"2024-01-07T06:52:56Z","snapshot_observed_at":"2026-08-06T20:32:08.575521Z","submitted_at":"2023-12-22T17:07:50Z","title":"cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14832","snapshot_observed_at":"2026-08-06T23:35:24.925432Z","title":"cupdlp-c: A strengthened implementation of cupdlp for linear programming by c language","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.925432Z"},"links":{"cited_paper":"/paper/2312.14832","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:207c72e22fcf8c26e4c4b1efb51df701b1ac444b9e88565efe4e745d95de397f","observation_id":"0e93a74b-aef9-4656-8be6-9e5b42b006e4","resolution":{"observed_at":"2026-08-06T23:35:24.925432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:25.857720Z","title":"Diagonal preconditioning for first order primal-dual algorithms in convex optimization","venue":null,"work_id":"05c90530-4b84-46fa-af0a-69e0fd63facc","year":2011},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:25.040826Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:e4bd127260a5a99b10217ca6bc238af3fdd8c850acabb533f3494e1f7d8d7c2c","observation_id":"a2ca0d1d-3142-4559-8b04-58a9d56efd94","resolution":{"observed_at":"2026-08-06T23:35:25.905844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:35:25.171789Z","title":"A scaling algorithm to equilibrate both rows and columns norms in matrices","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:25.171789Z"},"links":{"citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:4debf07c3fa4d35bbc6a1b063316d7f1f716ae8ebc4b2a235a1a3d8c4ce18752","observation_id":"8f023b63-40a7-4357-985c-37943538a790","resolution":{"observed_at":"2026-08-06T23:35:25.171789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01942","last_updated":"2024-07-15T17:51:31Z","snapshot_observed_at":"2026-07-06T18:24:52.604412Z","submitted_at":"2024-06-04T03:50:12Z","title":"The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01942","snapshot_observed_at":"2026-08-06T23:35:25.287314Z","title":"The role of level-set geometry on the performance of pdhg for conic linear optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:25.287314Z"},"links":{"cited_paper":"/paper/2406.01942","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:9143b02581de7f2f66493ce4018937af974ad839366ec77afa65527921fffc04","observation_id":"fb1783d8-cbad-4504-8b96-3c20d5626163","resolution":{"observed_at":"2026-08-06T23:35:25.287314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T18:15:50.465521Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":16},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2506.17650."}