{"as_of":"2026-08-08T21:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2194cf61323ae222561ee43192d2c29d5d896c5c0576f20f1f2b85755f41f0a0","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:37:47.316397Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T06:27:25.912336Z","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-07-09T06:36:02.177255Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"cited_work":{"arxiv_id":"2507.02470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.02470","snapshot_observed_at":"2026-07-09T06:36:02.177255Z","title":"Hpr-qp: A dual halpern peaceman-rachford method for solving large-scale convex composite quadratic programming","venue":"math.OC","work_id":"9532a53a-87d8-4530-a015-8346200909eb","year":2025},"citing_paper":{"arxiv_id":"2605.11526","last_updated":"2026-05-12T04:51:55Z","snapshot_observed_at":"2026-07-06T23:23:21.034839Z","submitted_at":"2026-05-12T04:51:55Z","title":"Efficient and provably convergent end-to-end training of deep neural networks with linear constraints","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-13T01:52:50.645939Z"},"links":{"cited_paper":"/paper/2507.02470","citing_paper":"/paper/2605.11526"},"observation_digest":"sha256:db4382cdfb692c715812cea30ed3032628929704435e3237e304e9371a8fd2ba","observation_id":"011aeaee-b565-401c-8e1c-1e3b136d1a4a","resolution":{"observed_at":"2026-05-13T01:57:05.998065Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"cited_work":{"arxiv_id":"2507.02470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.02470","snapshot_observed_at":"2026-07-09T06:36:02.177255Z","title":"Hpr-qp: A dual halpern peaceman-rachford method for solving large-scale convex composite quadratic programming","venue":"math.OC","work_id":"9532a53a-87d8-4530-a015-8346200909eb","year":2025},"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":10,"source":"pdf_text","source_observed_at":"2026-05-20T09:44:32.144900Z"},"links":{"cited_paper":"/paper/2507.02470","citing_paper":"/paper/2605.17883"},"observation_digest":"sha256:513a1b3129fcec47c5e6031e79e4f42d85eb43dfffe02ad80a33f58235e4ad59","observation_id":"bb06c00a-110c-4f9e-a878-5229a9377c61","resolution":{"observed_at":"2026-05-20T09:48:11.680765Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"cited_work":{"arxiv_id":"2507.02470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.02470","snapshot_observed_at":"2026-07-09T06:36:02.177255Z","title":"Hpr-qp: A dual halpern peaceman-rachford method for solving large-scale convex composite quadratic programming","venue":"math.OC","work_id":"9532a53a-87d8-4530-a015-8346200909eb","year":2025},"citing_paper":{"arxiv_id":"2605.29291","last_updated":"2026-05-28T03:14:28Z","snapshot_observed_at":"2026-08-08T15:39:33.775164Z","submitted_at":"2026-05-28T03:14:28Z","title":"Restarted Accelerated Primal-Dual Algorithms with Adaptive Stepsizes for Nonlinear Conic Constrained Convex Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T06:27:23.567128Z"},"links":{"cited_paper":"/paper/2507.02470","citing_paper":"/paper/2605.29291"},"observation_digest":"sha256:6fe7bf2c224565f261baf66cfad06202187295c56b8a6e111a3054639523f535","observation_id":"7ea8b81f-d82f-44ad-902d-8efdb58d0a4f","resolution":{"observed_at":"2026-06-29T14:33:31.649193Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"cited_work":{"arxiv_id":"2507.02470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.02470","snapshot_observed_at":"2026-07-09T06:36:02.177255Z","title":"Hpr-qp: A dual halpern peaceman-rachford method for solving large-scale convex composite quadratic programming","venue":"math.OC","work_id":"9532a53a-87d8-4530-a015-8346200909eb","year":2025},"citing_paper":{"arxiv_id":"2607.07585","last_updated":"2026-07-08T16:07:24Z","snapshot_observed_at":"2026-08-06T10:22:38.165296Z","submitted_at":"2026-07-08T16:07:24Z","title":"Convergence Analysis of the Restarted Moving-Anchored Extra-Gradient Method in the Absence of Local Lipschitz Continuity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T06:27:25.912336Z"},"links":{"cited_paper":"/paper/2507.02470","citing_paper":"/paper/2607.07585"},"observation_digest":"sha256:eb50fae734625fe24a6af71fad9155528dbf7c79f44f94436ddec9cbe7fb536b","observation_id":"985599ed-4a00-423b-a655-db2f234b183d","resolution":{"observed_at":"2026-07-09T06:36:02.180408Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2507.02470/citation-record","integrity":"/paper/2507.02470/integrity","json":"/paper/2507.02470/citation-record.json","paper":"/paper/2507.02470"},"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-06T20:37:53.856175Z","title":null,"venue":null,"work_id":"3e58ace0-6ff5-464c-9522-c35326670e64","year":2001},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.295620Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:2b7c9f457a6a71cc1d621119881c90d8a41a63127a0e8e3adec228dd99e11492","observation_id":"d3150947-c430-4923-ba2f-eded73e08d50","resolution":{"observed_at":"2026-08-06T20:37:53.903753Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:53.662736Z","title":"Applegate, M","venue":null,"work_id":"b6d4fb09-eca1-4a12-ad81-8d158f1a44d0","year":2021},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.334165Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:11d90c0f5408309f43d99f054f76d47f972b049a65b89ceba9f8d95d4d344ae3","observation_id":"f4840046-d6b7-49a4-9195-2d294ac53cfc","resolution":{"observed_at":"2026-08-06T20:37:53.758434Z","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-06T20:37:53.526222Z","title":"Applegate, O","venue":null,"work_id":"e23d099f-ab76-4bdf-a2ac-15d26abc6713","year":2023},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.376177Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:c0cf5cb05942ebc85401d41646bce46aba2f694fcf97cb7e2842c98677521a00","observation_id":"9400bb4b-4881-4908-90f1-03343fd701a9","resolution":{"observed_at":"2026-08-06T20:37:53.558927Z","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-06T20:37:53.364131Z","title":"Bezanson, A","venue":null,"work_id":"147362e6-4339-496d-8e51-abb0c91ebf46","year":2017},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.426100Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:94f8d20a14fd62a968dfe63a6a1bf307c3f9c491e90d88f6e7e534590ae1c4ef","observation_id":"215810e9-fcd1-450c-b43d-35479dbe50a6","resolution":{"observed_at":"2026-08-06T20:37:53.411018Z","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-06T20:37:53.211740Z","title":"Bredies, E","venue":null,"work_id":"ac9f4eef-fd8d-4bb0-8501-1a0c14f83334","year":2022},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.497933Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:5aaf7eb31062bc3315e8be7364d0e178038bfad46f5167a5d4a4c47db0658a78","observation_id":"0f49d70c-b82b-4781-89a7-8e35e631c400","resolution":{"observed_at":"2026-08-06T20:37:53.272487Z","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-06T20:37:52.981741Z","title":null,"venue":null,"work_id":"fdb87458-0455-469c-8b60-c8e654d2bb7c","year":1997},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.577331Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:ea60c51b81fa7c428626af4fab1067c45e9465bbc1a1c2b399b31fccafcd0a92","observation_id":"66b2dced-28c6-49ef-9039-c3c7cd13e556","resolution":{"observed_at":"2026-08-06T20:37:53.081323Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:52.821039Z","title":"Chang and C.-J","venue":null,"work_id":"5c7641af-7134-4a09-9d7f-065315b3e622","year":2011},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.648896Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:e5f1dc42a3f91055e59dbb07aaa9678d229e0b0101b595893570f43cc19a87a1","observation_id":"36d665dd-a8c5-4308-87f3-0957d8f8895c","resolution":{"observed_at":"2026-08-06T20:37:52.903156Z","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":"2408.12179","last_updated":"2025-03-15T14:17:39Z","snapshot_observed_at":"2026-07-06T19:04:26.917233Z","submitted_at":"2024-08-22T07:51:55Z","title":"HPR-LP: An implementation of an HPR method for solving linear programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12179","snapshot_observed_at":"2026-08-06T20:37:43.746644Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.746644Z"},"links":{"cited_paper":"/paper/2408.12179","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:7176b94ea4fcecbb4591eeef3882cbfeafbd024d847e3b396a8116dbb6421957","observation_id":"b0123407-f956-46e9-8224-75c1c4371e06","resolution":{"observed_at":"2026-08-06T20:37:43.746644Z","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-06T20:37:52.695571Z","title":null,"venue":null,"work_id":"27daf468-e877-4a8b-89bc-3c2bd70ddcad","year":2014},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.804151Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:1e1ad9b8693dd0b379c4407a171b326b39d4acdc377e955be730e9a25b397bad","observation_id":"65dd1daf-dc4a-4fcf-9be6-e338ea520245","resolution":{"observed_at":"2026-08-06T20:37:52.756295Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:43.922347Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.922347Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:9b92b494ae0d08d15867535f24db12e67ee0714013f100587f80df043738628a","observation_id":"82dc7f97-f592-4b3b-9135-553d293ce04e","resolution":{"observed_at":"2026-08-06T20:37:43.922347Z","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-06T20:37:52.530923Z","title":null,"venue":null,"work_id":"dfe72b95-50e4-4fbb-b7dd-504aa7312524","year":2024},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.925652Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:c63164ad11ed390ec7f128ca53e64adbf6301a002cf463f63c88355b9e2b6d11","observation_id":"c4e231cb-5fa3-457a-a653-e938ef3e7c1d","resolution":{"observed_at":"2026-08-06T20:37:52.577995Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:52.336245Z","title":null,"venue":null,"work_id":"547c09a4-b2f6-4a5e-a5a9-0249aa2d011f","year":1960},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:43.960253Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:3392b77c07a8046648b19fd103606482b7a141925aab3c9c1f9787cca830857e","observation_id":"aca1da64-2165-434e-a3d9-3d7e2d7ed2a9","resolution":{"observed_at":"2026-08-06T20:37:52.420183Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:52.225431Z","title":"Eckstein and D","venue":null,"work_id":"09781721-6234-454f-bdd0-24803b3dceab","year":1992},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.058927Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:ce7e73bfb3bedda44fbb25e44c3e817580b5d79f80fa648394505971a4f5ae7c","observation_id":"ffc12ea7-858f-4ffc-93ca-ae0703b97f1e","resolution":{"observed_at":"2026-08-06T20:37:52.295958Z","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-06T20:37:52.078905Z","title":null,"venue":null,"work_id":"73554bfe-9ff2-418c-92fd-bda13ef7d37c","year":2004},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.196125Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:ff068b1ef4095948fe140925c7c0cb8aa7402618b89d6028b7e2ad0063cb462f","observation_id":"7a31c4b8-9a50-410b-8b8f-9a15e440dab7","resolution":{"observed_at":"2026-08-06T20:37:52.143459Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:51.878425Z","title":null,"venue":null,"work_id":"563217d3-eaba-48c4-a80a-06110d764bb2","year":2013},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.320591Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:f38f0decf9b14fbe7f4f40a43239c60b3e6e518e0ff66b8eb112d2b53368658c","observation_id":"46afe69c-4f17-422b-9ad9-929e3b1c4aee","resolution":{"observed_at":"2026-08-06T20:37:51.989804Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2405.12762","last_updated":"2024-05-21T13:15:19Z","snapshot_observed_at":"2026-08-08T05:36:37.901792Z","submitted_at":"2024-05-21T13:15:19Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-06T20:37:44.417550Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.417550Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:214b26b5538dbbef0705dfdba8905d682302a9842ce4773efe46285ebddb0c82","observation_id":"71321bf0-fc6d-4c51-9461-c8a71e3104ee","resolution":{"observed_at":"2026-08-06T20:37:44.417550Z","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-06T20:37:44.519956Z","title":"Gurobi Optimizer Reference Manual, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.519956Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:eaab05df599e8eaaac0f1243ffcc138112b04b67a6d76f8b277a2e1cbd5cdd77","observation_id":"5f472bdc-5870-4e2c-a4e4-cd6d1d690212","resolution":{"observed_at":"2026-08-06T20:37:44.519956Z","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-06T20:37:51.654881Z","title":null,"venue":null,"work_id":"bdcc5d8b-defe-4cda-b858-6a70e1eb2629","year":1967},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.603210Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:046ce30a7859b9c2b0e732320f697144628b19b89d7ae8fd5af12a7dcb0b29a8","observation_id":"51add4b8-ca16-4eea-bce3-c73d9d9a8b02","resolution":{"observed_at":"2026-08-06T20:37:51.802126Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:51.475490Z","title":null,"venue":null,"work_id":"11ef1113-f158-447b-917f-41e4d2661711","year":2018},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.677626Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:a6d0a122139334cd05b92792f0d7c2781824aa60cbae62d1f7efd174a788182a","observation_id":"ed8221e1-0674-44fd-bceb-f4d025f2f9c6","resolution":{"observed_at":"2026-08-06T20:37:51.534429Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2405.16160","last_updated":"2024-10-05T18:27:53Z","snapshot_observed_at":"2026-07-06T18:19:47.765281Z","submitted_at":"2024-05-25T09:59:39Z","title":"Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16160","snapshot_observed_at":"2026-08-06T20:37:44.769937Z","title":"Huang, W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.769937Z"},"links":{"cited_paper":"/paper/2405.16160","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:3d5a3982fdcb49f12cc22dbaf111f0b12cc58a2d3c5f03bb6647bd6540773417","observation_id":"cc906d11-6f11-48df-8921-aece3117eae4","resolution":{"observed_at":"2026-08-06T20:37:44.769937Z","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-06T20:37:51.339583Z","title":"IBM ILOG CPLEX Optimization Studio CPLEX User’s Manual, 1987","venue":null,"work_id":"e88db605-4e54-41df-81e9-f4cbaeac4cef","year":1987},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.882828Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:46b08590f0051d1f67fdbd09b3b1ab4b90b848e562441d0db39cb22a71f81cfe","observation_id":"f981c956-68a2-4d39-9c6b-bdd9cccb0cc2","resolution":{"observed_at":"2026-08-06T20:37:51.401033Z","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-06T20:37:51.227432Z","title":null,"venue":null,"work_id":"43a62fb0-32ad-4b88-8b2b-cced2101b17e","year":2015},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:44.962808Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:e0d1bb98856f8193a60202b49001e527cd389b329b5ef929d30004c089838b38","observation_id":"be93a3e1-be53-4469-88e4-0789190660d1","resolution":{"observed_at":"2026-08-06T20:37:51.294796Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:51.086390Z","title":null,"venue":null,"work_id":"6475075c-0f08-4158-9b52-3132fa8d19aa","year":2016},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.067511Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:f2c9446df67431910b8038f9146349a7adbe588c51885a40b8bec826becf71a5","observation_id":"55f4ca7c-fdfc-4dee-831f-c249574bb051","resolution":{"observed_at":"2026-08-06T20:37:51.140207Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:50.941021Z","title":null,"venue":null,"work_id":"9af40ab7-9391-4ffe-b31f-91f0321ad19f","year":2018},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.123482Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:7835e910db05a589ca512ae46bc0539519ec47ec516bdad06f104bf1d872587f","observation_id":"a8f11064-0f4c-4e28-84fa-d10253078a3d","resolution":{"observed_at":"2026-08-06T20:37:51.014897Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:50.781169Z","title":null,"venue":null,"work_id":"d727a40e-e2da-4700-a618-ed5396b1ca40","year":2018},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.182505Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:fe450e508fa56caf9d3d01b4ddacb2b46833696edcbe93f27a5c2ea5890ca5e5","observation_id":"5422ccf7-bc3a-4e56-923b-c025d9c37d73","resolution":{"observed_at":"2026-08-06T20:37:50.844690Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:50.614721Z","title":null,"venue":null,"work_id":"75228418-8b19-4777-8ce2-d15ab3532184","year":2019},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.307759Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:00da55594db93494d083cfbfca57fc6c1b687fc1d37c521ff01007752a2c7dc9","observation_id":"41231703-5866-4d8f-b316-b52cb686db96","resolution":{"observed_at":"2026-08-06T20:37:50.687656Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:50.382388Z","title":"Liang, X","venue":null,"work_id":"f87d22cd-cd23-4757-ac2f-c45494c6df0d","year":2022},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.472014Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:4151aa900061a2e5e6d5a2941e5b1c05d7c8386d623f947497313f575efc6af7","observation_id":"9ad7680e-05db-4926-bfd9-ac2a752dd3a7","resolution":{"observed_at":"2026-08-06T20:37:50.478143Z","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-06T20:37:50.205648Z","title":null,"venue":null,"work_id":"c7f99be0-d35a-43aa-a01c-43d1df1cdf34","year":2021},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.611161Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:fd202c05accd981eade5aae833fd822bfb5f18560cdbf6f1dce915dc3aa1cc34","observation_id":"f09f3f70-c357-4830-9f4e-eef9673f9b24","resolution":{"observed_at":"2026-08-06T20:37:50.276506Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:50.059953Z","title":null,"venue":null,"work_id":"bbd78360-b0ab-4d14-89fb-6f45675c6292","year":2021},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.665109Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:ac7bacda8165197aa2ff421e738a2c5337677e11b05143752439a13af781a674","observation_id":"8ceba79e-08c0-4ffa-b3e6-579448d9c20f","resolution":{"observed_at":"2026-08-06T20:37:50.120728Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:45.767869Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.767869Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:9b7523f3488780e7ffc89c24b4b900c50d37316bd336eb61ebea31e4777eb582","observation_id":"eac6f4e0-5180-4f2a-8599-7c002e784bf7","resolution":{"observed_at":"2026-08-06T20:37:45.767869Z","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-06T20:37:49.860200Z","title":"Lions and B","venue":null,"work_id":"f53c2b6c-c001-4e5a-a002-d49f56244b1f","year":1979},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:45.911525Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:872a4e37d5a45869a3a6aa1fe80657591876a11508207e22d0b86d4979786e84","observation_id":"3379bfea-0bf8-4a44-8fc0-0b8f5ffb6842","resolution":{"observed_at":"2026-08-06T20:37:49.955996Z","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-06T20:37:46.006408Z","title":"Lu and J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.006408Z"},"links":{"cited_paper":"/paper/2311.12180","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:f29d71e8726252263a7268ead5d020a734aa73f06def514a9fb85a9ad5a4a5fd","observation_id":"929b07f8-8071-42d3-9346-4cb5a606c823","resolution":{"observed_at":"2026-08-06T20:37:46.006408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07710","last_updated":"2025-07-14T18:29:02Z","snapshot_observed_at":"2026-07-06T16:47:01.374736Z","submitted_at":"2023-11-13T19:50:03Z","title":"A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07710","snapshot_observed_at":"2026-08-06T20:37:46.062128Z","title":"Lu and J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.062128Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:09f9d0caefbce7a68ed44e27127788e73653be67f2ad93992852c3d66b17e964","observation_id":"84f98005-3d53-46a3-b949-0ac8b4c65ad9","resolution":{"observed_at":"2026-08-06T20:37:46.062128Z","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-06T20:37:46.118810Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.118810Z"},"links":{"cited_paper":"/paper/2312.14832","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:fc5e0b86c2b6e3a4afe1e1ee5c916d80759435685a75aa9433466c0717669ea6","observation_id":"a31504db-a6d5-46e7-baa1-f7b9288cad4f","resolution":{"observed_at":"2026-08-06T20:37:46.118810Z","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-06T20:37:49.586121Z","title":"Maros and C","venue":null,"work_id":"4bb7cf48-769e-4e34-9505-1a64d3904d1c","year":1999},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.175805Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:7787dacaa8baff72f569f28e024ac3e5084b3dcb1d709ffda854d96abf8da41c","observation_id":"553ae1df-0173-4e05-a01d-95e012cefc72","resolution":{"observed_at":"2026-08-06T20:37:49.688307Z","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-06T20:37:49.418678Z","title":"O’Donoghue","venue":null,"work_id":"14249380-7715-4d94-adc0-8e6271f09da3","year":1999},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.243173Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:5780b3fb81c6a174fc5dcb5031b0d2497d235bc8d4336029b75c9f27247dac74","observation_id":"c3f68427-60f3-4364-877f-f26d4be45e78","resolution":{"observed_at":"2026-08-06T20:37:49.492933Z","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-06T20:37:49.243330Z","title":"O’donoghue, E","venue":null,"work_id":"0b942506-c92d-478b-b69a-653146097498","year":2016},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.356115Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:040fcadd5e9eda1433d0a0b962a99fc5e326ce0d168f5ccebfe3de5408bb63d5","observation_id":"dbccf4fb-2f22-4783-ba25-aa4fcb4c16f1","resolution":{"observed_at":"2026-08-06T20:37:49.349840Z","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-06T20:37:48.971356Z","title":"Pock and A","venue":null,"work_id":"802e5312-53d1-4977-8c94-e41081ce6011","year":2011},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.521110Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:6b6fc88d30a4bcb4134dc5f2aedfecf0ae0109cfc8234e33941ad022034f30e6","observation_id":"c7129068-d7f8-4b24-a14c-294388a687d3","resolution":{"observed_at":"2026-08-06T20:37:49.111034Z","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-06T20:37:46.685149Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.685149Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:22905e6862c73036c30f7b9091e8be4980bfe6d6f302defe51652abc2d3e5379","observation_id":"59844ba4-9c9c-4430-9b03-056bccef5412","resolution":{"observed_at":"2026-08-06T20:37:46.685149Z","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-06T20:37:48.735937Z","title":null,"venue":null,"work_id":"ad75d4eb-8954-47f1-9d97-72f69bc83116","year":2001},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.796544Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:c6f3b29bc5a7ffc6fa53b46a03d7a5127b086899dfa4ecfb8fc45c75afd77c89","observation_id":"3f7725fd-bd5e-4a8d-8f6b-85fffffa337d","resolution":{"observed_at":"2026-08-06T20:37:48.827911Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:48.547492Z","title":"Sabach and S","venue":null,"work_id":"61076618-f96c-4a8e-b378-2270c5c7e3d0","year":2017},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.842253Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:2922c8f80d152876d53d921442b57e7944cc5154114747b8bf476f48986ee449","observation_id":"c45a71c2-6c1f-4cc7-b7f5-ef4ab57fea70","resolution":{"observed_at":"2026-08-06T20:37:48.626304Z","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-06T20:37:48.383952Z","title":"Stellato, G","venue":null,"work_id":"903a8ce3-5e54-4dad-aef1-03d688d844e3","year":2020},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:46.932696Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:7a5b16f5e3db84caab1e7889b656abed78e473b35864fe42948e04033349361c","observation_id":"75f88ef7-ef5d-42a6-9fdb-f6ab81d27633","resolution":{"observed_at":"2026-08-06T20:37:48.465441Z","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-06T20:37:48.202397Z","title":null,"venue":null,"work_id":"7bdca9e5-12be-4b4d-9a9a-dd4bb1d60f09","year":2025},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:47.065716Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:0cf373aa4e4934c68bf19ccc584f5c0162591a8c7297fb50146ca8f0e4e855a6","observation_id":"6d361eec-a13e-48db-8326-0edda9f1209b","resolution":{"observed_at":"2026-08-06T20:37:48.276974Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:47.963046Z","title":null,"venue":null,"work_id":"fa4e7dc1-b5ad-444a-bf31-e2aaf19f2a5c","year":1961},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:47.143731Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:38b39ff5cfcf01ee3c76ea3c24251e8c5cd0ddc71bc699522b6fd48e462489e4","observation_id":"e4b2f455-028c-4f35-a11e-7f99e4a71a49","resolution":{"observed_at":"2026-08-06T20:37:48.088333Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:47.750831Z","title":null,"venue":null,"work_id":"9974770a-38f6-4f4d-a78f-232ec82ad98f","year":2025},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:47.194116Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:dbcddd9a6bc565df49e3a2cff19f9c7d1061edc5b57b1867a677ac5839930831","observation_id":"d7a46c1f-873a-4db9-9378-fe4f73d83076","resolution":{"observed_at":"2026-08-06T20:37:47.865610Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T20:37:47.633509Z","title":"Zhang, Z","venue":null,"work_id":"fe990828-4658-418a-978c-68044f1ca987","year":2025},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:47.258824Z"},"links":{"citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:a79a882baca5292e3331ac01b420c0a25fd101588ca3872684a3c2a65343c572","observation_id":"e28d8a00-bebe-48eb-b830-277fef5fc96b","resolution":{"observed_at":"2026-08-06T20:37:47.681626Z","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":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-06T07:22:29.133722Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14881","snapshot_observed_at":"2026-08-06T20:37:47.316397Z","title":"Zhang, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:47.316397Z"},"links":{"cited_paper":"/paper/2211.14881","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:d7928ea8d41d71a119352e4323fd8fc6d37966f42870fe7714a8c65a1158421b","observation_id":"e46aaaa6-65f9-4eb9-a612-7c9b06254c70","resolution":{"observed_at":"2026-08-06T20:37:47.316397Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T18:15:52.592360Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":47},"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 47 of 47 outbound references and 4 inbound Pith citation observations for arXiv:2507.02470."}