{"as_of":"2026-08-08T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:778f61be55b6701f49af5b1df1a0ed848f0af9ea5794c7ef0035f8e46f8c431d","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:22:14.187714Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T20:33:25.911916Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2311.07710","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.07710","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2311.07710","venue":null,"work_id":"9faa4284-6e1f-4dcc-b14d-11a5ad041243","year":2023},"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":39,"source":"pdf_text","source_observed_at":"2026-05-23T20:29:07.895240Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2410.04043"},"observation_digest":"sha256:f2f1650dcf5135c350e7de7d8347108fa053ed2e2d3eae0c8836c402105404e0","observation_id":"24fd44d2-e174-40fb-9644-172ea9b02681","resolution":{"observed_at":"2026-05-23T20:33:25.914900Z","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":"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-07T21:22:14.187714Z","title":"and Yang, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-07T21:12:17.963828Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.187714Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:ed53fa946d8d28a8667614b58246f055f0ed96ac380e0f061b92d87df3e4bb65","observation_id":"d7a23477-f1d7-453f-b751-86af8d0fc6d0","resolution":{"observed_at":"2026-08-07T21:22:14.187714Z","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-07T15:21:19.661823Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15775","last_updated":"2025-05-21T17:27:04Z","snapshot_observed_at":"2026-08-07T15:09:42.579569Z","submitted_at":"2025-05-21T17:27:04Z","title":"New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T15:21:19.661823Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2505.15775"},"observation_digest":"sha256:bfcedaf72ffe3e59c3367c95468318ba0927143c6363d012341e9489b9bf737c","observation_id":"48f80138-9102-4729-aad0-b47861d8d3ba","resolution":{"observed_at":"2026-08-07T15:21:19.661823Z","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-07T11:33:18.245907Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02174","last_updated":"2025-06-02T19:00:36Z","snapshot_observed_at":"2026-08-08T07:35:38.452258Z","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":98,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:18.245907Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2506.02174"},"observation_digest":"sha256:23f0bb930a656f4eacac6a62248f66db687e3b136a6e83edc954f2b9e302d7ad","observation_id":"0de896e9-52df-4393-ad92-20e232c87b2f","resolution":{"observed_at":"2026-08-07T11:33:18.245907Z","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-07T06:06:00.833369Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06012","last_updated":"2025-08-28T01:50:11Z","snapshot_observed_at":"2026-08-07T05:59:44.311428Z","submitted_at":"2025-06-06T11:57:30Z","title":"Enhanced Trust Region Sequential Convex Optimization for Multi-Drone Thermal Screening Trajectory Planning in Urban Environments","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T06:06:00.833369Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2506.06012"},"observation_digest":"sha256:5ca2582e386a77d7b4e58cb621f2ee758183a7883400505fb73e4c65e5c80b2b","observation_id":"c83b99fc-b613-429f-aade-e9f36baa6a4a","resolution":{"observed_at":"2026-08-07T06:06:00.833369Z","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-07T06:11:02.140189Z","title":"arXiv preprint arXiv:2311.07710 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06258","last_updated":"2025-06-06T17:37:35Z","snapshot_observed_at":"2026-08-08T09:43:09.475297Z","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":30,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:02.140189Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2506.06258"},"observation_digest":"sha256:cc6ee7b0e1527b2aff9f6727c12eb0b8494a89a428a100a234ea3373e5889a28","observation_id":"a13e69cb-d13c-49f5-84c0-aa66d1554661","resolution":{"observed_at":"2026-08-07T06:11:02.140189Z","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":"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-06T14:48:14.975901Z","title":"A practical and optimal first-order method for large-scale convex quadratic programming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18114","last_updated":"2025-08-05T14:45:20Z","snapshot_observed_at":"2026-08-06T14:36:16.476152Z","submitted_at":"2025-07-24T05:55:28Z","title":"Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T14:48:14.975901Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2507.18114"},"observation_digest":"sha256:9c1eb0dce0d7c837d9a2f3e05b86a4bd4483b8b6ffe2c4ad8b2a8135d6714400","observation_id":"5dfe0599-cfd1-4755-9ed4-4adc3fa2f5fa","resolution":{"observed_at":"2026-08-06T14:48:14.975901Z","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":"2311.07710","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.07710","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2311.07710","venue":null,"work_id":"9faa4284-6e1f-4dcc-b14d-11a5ad041243","year":2023},"citing_paper":{"arxiv_id":"2605.22188","last_updated":"2026-05-21T08:56:15Z","snapshot_observed_at":"2026-07-06T23:32:35.159280Z","submitted_at":"2026-05-21T08:56:15Z","title":"From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-22T07:39:49.501156Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2605.22188"},"observation_digest":"sha256:5c8f75f545c4683e307c358f1c0184e21100ec18c966586aede196652eb43bdd","observation_id":"de2fdf11-866c-4fd0-8e2e-de57105d1f98","resolution":{"observed_at":"2026-05-22T07:41:14.774335Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2311.07710/citation-record","integrity":"/paper/2311.07710/integrity","json":"/paper/2311.07710/citation-record.json","paper":"/paper/2311.07710"},"outbound":[],"paper":{"arxiv_id":"2311.07710","last_updated":"2025-07-14T18:29:02Z","latest_version":4,"primary_category":"math.OC","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"},"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-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 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2311.07710."}