{"as_of":"2026-08-10T09:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aab1b1261920bbccb1bbc8b59bc244c5871cf975344d3c42436c3201a554941f","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-10T06:31:04.303077+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-09T02:43:52.647254Z","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:ae41fdbd23c25fa87126a32e613b45cac657cdd86798761664ca4b9c8b210661","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T02:43:52.647254Z","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:63c444daaf1f704381e64a347a93473bc4bd0f7c73c17c405ee6ac2a03c19348","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-09T02:43:52.647254Z","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:c7f506bef2cc7461df58788e964035fbb95e06a1bb247e1646f00fde9ffe988f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T02:44:01.583787Z","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-09T02:43:52.647254Z","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:bb20dfdc0398c99ed04355c4277e01c7218d1e96887a3974b6ac3ca901dfbb79","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T02:43:52.647254Z","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:f7497dcd9205971641f482612fe552d1c1ded9f3d4971e687239df7f175deb6a","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-09T02:43:52.647254Z","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:2f189ba13886c468582d61777997211eac5881aea2d16f36b2ed341592a27352","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-09T02:43:52.647254Z","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:44f392408c5beb9661c6d4245ecaa63bbf926ffdfcdcb6675cdbaf7ddf1e9160","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-09T02:43:52.647254Z","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:eff67350a61f17f7cc29d17d9bf4de2e3d8f5811270dcca02fbd535d22406bcd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T02:43:52.647254Z","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:1c2712d92e7576ee83070bb7a1f45091dbcfe86e20f40144fc56ee643a217d0d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T04:53:35.370988Z","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-09T02:43:52.647254Z","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:f5f03f88dc33c629f407151e5e9318f2fa096ef0a48e49bca9040c47b625cc1f","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-09T02:43:52.647254Z","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:0bb0fa38a6a6e16267131509ca9ec8233632b5b2643d9f9ee0f541f0ddd062f9","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-09T20:08:04.802916Z","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-09T02:43:52.647254Z","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:f6d26bd98db3237a3323108fc9d252ce032f4ce080428e24eb8c6446540cf2e6","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-09T02:43:52.647254Z","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:f1ab2c1e57520b2539fdcfbaa42653cdb6b43936643247728808b9612a1eeff3","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-09T02:43:52.647254Z","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:53fd75512cd25f2732cd5982038198a1846b777629324fd06f1b8b3f7675015a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T02:43:52.647254Z","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:d8f8b57b870b423c81f1e6db4eef27a9980a3f09aaa37ba19d5582eaecb95cbc","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-09T02:43:52.647254Z","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:e1ebddb8055748676ada45e6a53be9d4575d333d0f954ac469a55f266c3ca62e","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-09T02:43:52.647254Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2506.17650."}