{"as_of":"2026-08-09T09:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4b529df4f8eef0082148675fa1690cdbcf1e30019c6ca891a74bc7583ca1c6d","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:33:18.319231Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"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":"2407.16144","doi":"10.48550/arxiv.2407.16144","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Restarted Halpern PDHG for linear programming","venue":"arXiv (Cornell University)","work_id":"9652e7ff-86ee-4efa-a075-622c3a0d2b95","year":2024},"citing_paper":{"arxiv_id":"2409.14715","last_updated":"2025-08-04T10:27:57Z","snapshot_observed_at":"2026-08-05T09:10:17.127239Z","submitted_at":"2024-09-23T05:22:51Z","title":"A New Crossover Algorithm for LP Inspired by the Spiral Dynamic of PDHG","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-23T20:55:06.408496Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2409.14715"},"observation_digest":"sha256:9d90bf65f7d82c91ea3af069bed94e878344a2980c57f9af201f60a43b8cd0ca","observation_id":"a95c30db-da83-4fef-8f4e-c86a4619edce","resolution":{"observed_at":"2026-05-23T20:55:49.045620Z","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":"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":"2407.16144","doi":"10.48550/arxiv.2407.16144","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Restarted Halpern PDHG for linear programming","venue":"arXiv (Cornell University)","work_id":"9652e7ff-86ee-4efa-a075-622c3a0d2b95","year":2024},"citing_paper":{"arxiv_id":"2410.04043","last_updated":"2026-07-03T21:50:23Z","snapshot_observed_at":"2026-07-09T23:17:08.669004Z","submitted_at":"2024-10-05T05:35:09Z","title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T20:29:07.895240Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2410.04043"},"observation_digest":"sha256:0edb8c72a5edc027a1c01ff543b92c23760689ed176a33b28e32cb1487d8e616","observation_id":"f3aebd51-4bdd-4799-9b19-0a54470453a7","resolution":{"observed_at":"2026-05-23T20:33:25.933184Z","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":"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-07T11:33:18.319231Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02174","last_updated":"2025-06-02T19:00:36Z","snapshot_observed_at":"2026-08-08T20:28:23.094815Z","submitted_at":"2025-06-02T19:00:36Z","title":"An Overview of GPU-based First-Order Methods for Linear Programming and Extensions","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:18.319231Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2506.02174"},"observation_digest":"sha256:40e94a16de3023a99c2d1361b0775d71012f0603e191221bbcc55700ab838622","observation_id":"24445c04-b38d-437d-b0e7-0ad3359d1cfb","resolution":{"observed_at":"2026-08-07T11:33:18.319231Z","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-07T06:11:02.331216Z","title":"arXiv preprint arXiv:2407.16144 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06258","last_updated":"2025-06-06T17:37:35Z","snapshot_observed_at":"2026-08-09T04:30:56.028978Z","submitted_at":"2025-06-06T17:37:35Z","title":"PDHCG: A Scalable First-Order Method for Large-Scale Competitive Market Equilibrium Computation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:02.331216Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2506.06258"},"observation_digest":"sha256:e1abc40a7ea8611f271e366f8f5160b473d6c333e9eec46c4b90c6025db9575f","observation_id":"099313ee-fc7a-40c9-bc78-e55b5b6fff95","resolution":{"observed_at":"2026-08-07T06:11:02.331216Z","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-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:8cbc94237238c5912c76b412fd70306e4fee7f986d72c70e6fb6c0b3aad6adbd","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":"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":"2407.16144","doi":"10.48550/arxiv.2407.16144","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Restarted Halpern PDHG for linear programming","venue":"arXiv (Cornell University)","work_id":"9652e7ff-86ee-4efa-a075-622c3a0d2b95","year":2024},"citing_paper":{"arxiv_id":"2604.27518","last_updated":"2026-04-30T07:22:04Z","snapshot_observed_at":"2026-07-06T23:12:57.730833Z","submitted_at":"2026-04-30T07:22:04Z","title":"lpviz: Interactive Linear Programming Visualization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T09:21:30.803464Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2604.27518"},"observation_digest":"sha256:74db228a563b93e053af3b217669a5833357ce5f23345c825ca9f93d5583488a","observation_id":"12468fc4-441f-42f7-82c7-9502320a8979","resolution":{"observed_at":"2026-05-09T04:20:17.109489Z","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":"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":"2407.16144","doi":"10.48550/arxiv.2407.16144","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Restarted Halpern PDHG for linear programming","venue":"arXiv (Cornell University)","work_id":"9652e7ff-86ee-4efa-a075-622c3a0d2b95","year":2024},"citing_paper":{"arxiv_id":"2605.05086","last_updated":"2026-05-06T16:22:33Z","snapshot_observed_at":"2026-08-03T07:06:22.485891Z","submitted_at":"2026-05-06T16:22:33Z","title":"CHAP: A Hybrid GPU-CPU Heuristic for MIP","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-08T17:08:48.180919Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2605.05086"},"observation_digest":"sha256:cbb1dbd534ab565b10883f0a86359d8adc4efedaabe4be65b8c05ed800784c9f","observation_id":"c3ed3fa5-e8a4-41a8-bcee-da871972e3ff","resolution":{"observed_at":"2026-05-08T17:13:37.655161Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"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":"2407.16144","doi":"10.48550/arxiv.2407.16144","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Restarted Halpern PDHG for linear programming","venue":"arXiv (Cornell University)","work_id":"9652e7ff-86ee-4efa-a075-622c3a0d2b95","year":2024},"citing_paper":{"arxiv_id":"2605.17883","last_updated":"2026-05-18T05:43:50Z","snapshot_observed_at":"2026-08-02T07:04:38.434409Z","submitted_at":"2026-05-18T05:43:50Z","title":"On the convergence of doubly stochastic Primal-Dual Hybrid Gradient Method","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T09:44:32.144900Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2605.17883"},"observation_digest":"sha256:6c22c37ad1664c40fd466aeb3248876edfd3fcd638ac0995d868f956f63fc422","observation_id":"ad08f71c-e6e1-43e8-a398-74d85469305d","resolution":{"observed_at":"2026-05-20T09:48:11.713893Z","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":"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":"2407.16144","doi":"10.48550/arxiv.2407.16144","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Restarted Halpern PDHG for linear programming","venue":"arXiv (Cornell University)","work_id":"9652e7ff-86ee-4efa-a075-622c3a0d2b95","year":2024},"citing_paper":{"arxiv_id":"2606.08638","last_updated":"2026-06-07T14:01:42Z","snapshot_observed_at":"2026-08-07T15:34:38.264017Z","submitted_at":"2026-06-07T14:01:42Z","title":"Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T17:57:37.460869Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2606.08638"},"observation_digest":"sha256:e9a3867815e69e30f1e8ae111a0120f66db9d8fd079134518ae03f98cdac5b21","observation_id":"cf46c0da-56e8-4061-9923-5f05cd3c90d3","resolution":{"observed_at":"2026-07-02T23:47:27.497036Z","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":"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":"2407.16144","doi":"10.48550/arxiv.2407.16144","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Restarted Halpern PDHG for linear programming","venue":"arXiv (Cornell University)","work_id":"9652e7ff-86ee-4efa-a075-622c3a0d2b95","year":2024},"citing_paper":{"arxiv_id":"2606.22392","last_updated":"2026-06-21T08:39:56Z","snapshot_observed_at":"2026-08-02T18:06:43.843251Z","submitted_at":"2026-06-21T08:39:56Z","title":"Convergence Rates of Tseng's Splitting Method and Its Acceleration Schemes for Monotone Inclusion Problem with a Sum of H\\\"older Continuous Operators","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T10:24:43.195716Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2606.22392"},"observation_digest":"sha256:14f68a70d1e7686ef8c5b283f60f403fb4922aa845ea1c0777984db5be132c04","observation_id":"a815f266-e4fa-4b84-a043-4b6ba615b4f3","resolution":{"observed_at":"2026-07-04T09:09:43.624386Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2407.16144/citation-record","integrity":"/paper/2407.16144/integrity","json":"/paper/2407.16144/citation-record.json","paper":"/paper/2407.16144"},"outbound":[],"paper":{"arxiv_id":"2407.16144","last_updated":"2024-09-09T21:15:27Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T02:54:40.183477Z","submitted_at":"2024-07-23T03:06:56Z","title":"Restarted Halpern PDHG for Linear Programming"},"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 10 inbound Pith citation observations for arXiv:2407.16144."}