{"as_of":"2026-08-09T20:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f2f9e2374127fbe6d7e6de6b885625abedeab10d4222748fa1d4c2b979126a7f","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":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":41,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T01:04:17.134582Z","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":13,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2412.09757","last_updated":"2025-09-15T13:08:33Z","snapshot_observed_at":"2026-07-06T20:06:17.706151Z","submitted_at":"2024-12-12T23:33:52Z","title":"Revisiting Gaussian genuine entanglement witnesses with modern software","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T06:57:43.897347Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2412.09757"},"observation_digest":"sha256:f3348b5625510fbfaa8f627735c65ef65cfc686338f96b67d95a3ab0ee2915a9","observation_id":"ecf5da86-dc3f-490c-9a4e-b7b7a0c04113","resolution":{"observed_at":"2026-05-23T07:02:41.984898Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:21:17.113114Z","title":null,"venue":null,"work_id":null,"year":2024},"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":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:21:17.113114Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2505.15775"},"observation_digest":"sha256:d511decc0bbee8a58d0c15826a2f18b45faa6bfd708fc4c52822b62e19b93e31","observation_id":"63a1a959-6c35-4710-bf15-727d52d09ee2","resolution":{"observed_at":"2026-08-07T15:21:17.113114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T13:12:56.938493Z","title":"Goulart and Yuwen Chen","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22578","last_updated":"2026-06-29T09:33:28Z","snapshot_observed_at":"2026-08-09T05:16:03.963482Z","submitted_at":"2025-05-28T16:53:48Z","title":"Favorability of Loss Landscape with Weight Decay Requires Both Large Overparametrization and Initialization","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T13:12:56.938493Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2505.22578"},"observation_digest":"sha256:1e51828faad4bdafd915a6bc3c0fa03ea46b01b44d2c26ce8ab0bc6c5d433769","observation_id":"febe0f18-62a5-4f05-a621-8c1522f71328","resolution":{"observed_at":"2026-08-07T13:12:56.938493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T13:05:06.419539Z","title":"Goulart and Yuwen Chen","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22825","last_updated":"2025-05-28T20:10:04Z","snapshot_observed_at":"2026-08-08T06:28:22.371765Z","submitted_at":"2025-05-28T20:10:04Z","title":"PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T13:05:06.419539Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2505.22825"},"observation_digest":"sha256:70331f70134a3075a3dc8181ad7f11606197d3f7aa37a0598e4769e8ca89768e","observation_id":"1ef761d9-c0c8-4fbd-8775-e286a50d5156","resolution":{"observed_at":"2026-08-07T13:05:06.419539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T13:10:09.347627Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives.arXiv preprint arXiv:2405.12762, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23081","last_updated":"2025-09-05T02:19:47Z","snapshot_observed_at":"2026-08-08T05:47:28.129882Z","submitted_at":"2025-05-29T04:35:21Z","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:09.347627Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2505.23081"},"observation_digest":"sha256:4ae711c596e10c34dbbcea95c8125f8af608dc6e8aaeec8949eaffe08656344d","observation_id":"d7242c41-90e9-4302-98c0-6a9148e4e5ac","resolution":{"observed_at":"2026-08-07T13:10:09.347627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T11:33:14.757407Z","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":64,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:14.757407Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2506.02174"},"observation_digest":"sha256:d9a38febb0b96fee2220214f36f50d5021b03a3f152c2e8665714468ab425166","observation_id":"f046edb1-e682-433d-aae9-68c84917b35b","resolution":{"observed_at":"2026-08-07T11:33:14.757407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T04:08:15.870318Z","title":"Goulart and Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11513","last_updated":"2025-06-21T14:49:44Z","snapshot_observed_at":"2026-08-07T04:02:11.493219Z","submitted_at":"2025-06-13T07:14:09Z","title":"Automatic Generation of Explicit Quadratic Programming Solvers","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T04:08:15.870318Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2506.11513"},"observation_digest":"sha256:fad1b77aef94a5347cd94f84a072d62bea0795ec9a2d5086bd8ea581e5027123","observation_id":"75e5e1c5-5fdd-46e1-b1f8-26048a4316f6","resolution":{"observed_at":"2026-08-07T04:08:15.870318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-06T21:28:52.303119Z","title":"Goulart and Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:52.303119Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:59a76422c14c98459d34d65e48cf1bb777c07d3b180acd8e0c40ebc54076c133","observation_id":"1b815ff9-7bfc-43e4-8da2-e43b4d33fddc","resolution":{"observed_at":"2026-08-06T21:28:52.303119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":{"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-06T18:04:48.618659Z","title":"Goulart and Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10603","last_updated":"2025-07-12T17:26:00Z","snapshot_observed_at":"2026-08-06T17:55:27.039913Z","submitted_at":"2025-07-12T17:26:00Z","title":"A Tax-Efficient Model Predictive Control Policy for Retirement Funding","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:04:48.618659Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2507.10603"},"observation_digest":"sha256:0538ee6411aba7477a8bc302ed47d57c42639fcc1798c88386fb3decb07743e4","observation_id":"45d365a5-ab12-4385-82ed-1d452f05cb4f","resolution":{"observed_at":"2026-08-06T18:04:48.618659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-05T14:09:54.560051Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21677","last_updated":"2026-06-18T08:30:02Z","snapshot_observed_at":"2026-08-07T11:56:58.528915Z","submitted_at":"2025-08-29T14:45:54Z","title":"Robust Convex Model Predictive Control with collision avoidance guarantees for robot manipulators","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T14:09:54.560051Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2508.21677"},"observation_digest":"sha256:cea66703a0a2595746460c89a9eedd44aa7046cd23102f4a6f8979f90492445b","observation_id":"1822d575-0471-4e63-a0e2-5d9040fc6684","resolution":{"observed_at":"2026-08-05T14:09:54.560051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2511.06156","last_updated":"2026-04-29T17:02:00Z","snapshot_observed_at":"2026-08-06T19:53:02.659166Z","submitted_at":"2025-11-08T22:25:41Z","title":"A Note on Optimal Product Pricing","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-17T23:17:33.522920Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2511.06156"},"observation_digest":"sha256:b9cdfd4c1a80585ffb97d141fd04fae655a2babceb5d254e86c5260dff58ce79","observation_id":"827ab9e9-13bc-47a1-82a1-3e6c42174983","resolution":{"observed_at":"2026-05-17T23:20:27.679682Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T21:31:26.184925Z","title":"Goulart and Yuwen Chen","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15615","last_updated":"2026-07-10T15:07:59Z","snapshot_observed_at":"2026-08-08T04:52:23.434806Z","submitted_at":"2025-11-19T17:02:30Z","title":"Near-optimal Delta-convex Estimation of Lipschitz Functions","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T21:31:26.184925Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2511.15615"},"observation_digest":"sha256:5ff623977dff899bf1b96e00cec55bace260f31aeffe3c780f70cc2ebc580063","observation_id":"9b7a37bf-8754-46ee-8807-344c5cc4e87f","resolution":{"observed_at":"2026-08-03T21:31:26.184925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2602.02394","last_updated":"2026-04-13T12:55:51Z","snapshot_observed_at":"2026-07-06T22:44:09.804048Z","submitted_at":"2026-02-02T17:56:01Z","title":"On the Practical Implementation of a Sequential Quadratic Programming Algorithm for Nonconvex Sum-of-squares Problems","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-16T08:12:27.427842Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2602.02394"},"observation_digest":"sha256:d27244246a1a027549a0ce8c01164cc8823eb3e1c9fc592626aceacf1f9b60f3","observation_id":"480555d2-9ce1-4485-87c4-6c3239c80c78","resolution":{"observed_at":"2026-05-16T08:12:35.410671Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2602.09368","last_updated":"2026-05-12T15:35:19Z","snapshot_observed_at":"2026-07-06T22:45:15.978102Z","submitted_at":"2026-02-10T03:19:42Z","title":"Certified Gradient-Based Contact-Rich Manipulation via Smoothing-Error Reachable Tubes","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-16T06:05:14.593870Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2602.09368"},"observation_digest":"sha256:88a11a3eb0306efdce8605bcc0310cc716ee02842816d4aee0dbc3477c86eb8d","observation_id":"c3589cca-89d7-4e53-989e-afb4d52632a2","resolution":{"observed_at":"2026-05-16T06:07:25.735541Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2602.21302","last_updated":"2026-05-13T21:03:58Z","snapshot_observed_at":"2026-08-05T16:44:28.350055Z","submitted_at":"2026-02-24T19:13:25Z","title":"Learning Dynamic Rope Manipulation Using Task-Level Iterative Learning Control","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-15T19:42:52.717638Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2602.21302"},"observation_digest":"sha256:4d78acd52394b989636e82306d6351135794b2d9b81e02df5137b0d289a06031","observation_id":"21641a1b-70c8-4eac-9a73-fb11bfccc8e8","resolution":{"observed_at":"2026-05-15T19:46:34.178144Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T18:16:00.915336Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.13832","last_updated":"2026-07-19T02:25:30Z","snapshot_observed_at":"2026-08-05T00:49:53.562445Z","submitted_at":"2026-03-14T08:32:13Z","title":"GraspADMM: Improving Dexterous Grasp Synthesis via ADMM Optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T18:16:00.915336Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2603.13832"},"observation_digest":"sha256:29dccc07201d99de792c0d02db0098d42d8ca3179e756949682547f440558613","observation_id":"58253217-38bf-4314-a08f-f18476f8cce8","resolution":{"observed_at":"2026-08-02T18:16:00.915336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.02531","last_updated":"2026-04-02T21:30:42Z","snapshot_observed_at":"2026-07-06T22:51:53.458444Z","submitted_at":"2026-04-02T21:30:42Z","title":"\\texttt{DR-DAQP}: An Hybrid Operator Splitting and Active-Set Solver for Affine Variational Inequalities","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-13T20:35:25.956764Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.02531"},"observation_digest":"sha256:831ef65ea8dbdad575c05b69309361aa61fd25fc2fd097e369e95c369a386222","observation_id":"8db78f12-e139-4de3-a2f7-8b971456501e","resolution":{"observed_at":"2026-05-13T20:38:14.659955Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.03791","last_updated":"2026-04-04T16:39:48Z","snapshot_observed_at":"2026-07-31T22:38:28.707829Z","submitted_at":"2026-04-04T16:39:48Z","title":"Acceleration of Moment Bound Optimization for Stochastic Chemical Reactions Using Reaction-wise Sparsity of Moment Equations","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-13T17:28:23.383981Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.03791"},"observation_digest":"sha256:a2108efdaefa0db1e14b88946ad046294c8d24e3f0d52623b6e8e62de7e4acb3","observation_id":"f45bdb62-c94d-4da8-8260-26b152be9bb6","resolution":{"observed_at":"2026-05-13T17:33:02.641725Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.04376","last_updated":"2026-05-21T01:45:04Z","snapshot_observed_at":"2026-07-06T22:53:24.585766Z","submitted_at":"2026-04-06T02:53:16Z","title":"Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T20:20:49.327348Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.04376"},"observation_digest":"sha256:0e6df574cee3f66c2b2fa83e15d564e1ea19650b2ac85c99e01c1ecfd3ee30bb","observation_id":"514cbcf4-4568-44bc-8bf2-82adf9811c06","resolution":{"observed_at":"2026-05-10T22:00:48.636107Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.04376","last_updated":"2026-05-21T01:45:04Z","snapshot_observed_at":"2026-07-06T22:53:24.585766Z","submitted_at":"2026-04-06T02:53:16Z","title":"Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T11:24:40.120367Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.04376"},"observation_digest":"sha256:011c634a3fef357a85dcf9d4265c99b7d1544b42ddd9ec390167774f6bb7751b","observation_id":"600cf5a2-a308-4188-9fff-b9221f1b8030","resolution":{"observed_at":"2026-05-22T11:24:49.135104Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-13T09:19:37.755340Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.05639","last_updated":"2026-05-25T17:21:41Z","snapshot_observed_at":"2026-07-13T09:19:36.252325Z","submitted_at":"2026-04-07T09:41:11Z","title":"Estimating Dynamic Marginal Policy Effects under Sequential Unconfoundedness","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-13T09:19:37.755340Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.05639"},"observation_digest":"sha256:899c72c72fe082bd872f7cb9f6764c33933462abb287824d90a609280ec2c093","observation_id":"492fc8b1-1f48-414b-b056-09e5b45b74fc","resolution":{"observed_at":"2026-07-13T09:19:37.755340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.05640","last_updated":"2026-04-07T09:41:58Z","snapshot_observed_at":"2026-07-06T22:54:16.913706Z","submitted_at":"2026-04-07T09:41:58Z","title":"Parametric Nonconvex Optimization via Convex Surrogates","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T19:09:47.137928Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.05640"},"observation_digest":"sha256:72e7c6e87b69b53a0b4161fb9ac709c8a1df7c50ea1d2d838a98033437e3d13e","observation_id":"f6b5ac8c-7725-46d5-9438-dee89afd385c","resolution":{"observed_at":"2026-05-10T23:25:51.990724Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.09074","last_updated":"2026-04-10T07:58:36Z","snapshot_observed_at":"2026-07-06T22:58:04.106299Z","submitted_at":"2026-04-10T07:58:36Z","title":"A Bayesian Perspective on the Data-Driven LQR","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:01.267807Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.09074"},"observation_digest":"sha256:723aa9b6319b13782d2ad2ee4b88f9acc950ae3aefb34e474e0c51d09e57c184","observation_id":"e1906ffd-1030-4849-ad59-de74de88a45d","resolution":{"observed_at":"2026-05-11T07:26:02.585998Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.13179","last_updated":"2026-04-14T18:01:48Z","snapshot_observed_at":"2026-07-06T23:01:14.824672Z","submitted_at":"2026-04-14T18:01:48Z","title":"HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T14:41:22.266535Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.13179"},"observation_digest":"sha256:be46f0c0ff4101464494f43c711cf8425b9d06c0255620dbcc9a60fff40d4c0a","observation_id":"4c89b729-9223-4a20-a413-0e8a558bbc26","resolution":{"observed_at":"2026-05-10T14:45:41.537444Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.23013","last_updated":"2026-04-24T21:02:17Z","snapshot_observed_at":"2026-07-06T23:09:19.041332Z","submitted_at":"2026-04-24T21:02:17Z","title":"Integrated Lander-Propulsion-GNC Framework for Autonomous Lunar Powered Descent","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-08T10:30:28.823342Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.23013"},"observation_digest":"sha256:c9b5a6d2d623eda74556cdbdedaf7abf890c6f8e4c5142401d5f44ab5b592dfc","observation_id":"969258f5-12de-44be-961a-3ebf8ca0159e","resolution":{"observed_at":"2026-05-11T20:01:10.746871Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.23833","last_updated":"2026-04-26T18:38:53Z","snapshot_observed_at":"2026-08-08T06:38:00.226258Z","submitted_at":"2026-04-26T18:38:53Z","title":"Beyond De Prado and Cotton: Hierarchical and Iterative Methods for General Mean-Variance Portfolios","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-08T04:59:37.230455Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.23833"},"observation_digest":"sha256:d48498762e114285f87e68e41168fe0e7d49ea10e3b60962e20aa85b32ac3b1f","observation_id":"ceb94321-5fdc-4262-b96a-05a53549aada","resolution":{"observed_at":"2026-05-11T21:36:14.421452Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2604.23951","last_updated":"2026-04-27T01:57:44Z","snapshot_observed_at":"2026-08-08T05:29:23.116456Z","submitted_at":"2026-04-27T01:57:44Z","title":"Presolving for GPU-Accelerated First-Order LP Solvers","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T03:00:30.766967Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2604.23951"},"observation_digest":"sha256:59d79e1daf507a33c35c3e23562c7a7ca9323675b124160a3ee4d19c433e7f98","observation_id":"23014fc5-daa8-4b09-a2f9-746fa0812843","resolution":{"observed_at":"2026-05-11T22:17:00.942384Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2605.07529","last_updated":"2026-06-09T15:20:20Z","snapshot_observed_at":"2026-08-02T10:33:53.839904Z","submitted_at":"2026-05-08T09:57:48Z","title":"Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-11T01:59:34.284357Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2605.07529"},"observation_digest":"sha256:b731d78c57ec34ba3133331696d04a8d32b71a95b8797b12cfd532fbcd992a71","observation_id":"701a2b85-e6a4-4213-a2b5-0662f564227e","resolution":{"observed_at":"2026-05-11T02:00:51.984021Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2605.07529","last_updated":"2026-06-09T15:20:20Z","snapshot_observed_at":"2026-08-02T10:33:53.839904Z","submitted_at":"2026-05-08T09:57:48Z","title":"Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-30T23:15:49.951550Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2605.07529"},"observation_digest":"sha256:92cbfd4bcd7bcb465fff18ac511b5132013aec9267b2fce6b5db3036cf5ed11e","observation_id":"651f4b83-d0c2-4140-b3a8-b16bd108b8af","resolution":{"observed_at":"2026-06-30T23:25:06.961723Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2605.19089","last_updated":"2026-05-18T20:26:19Z","snapshot_observed_at":"2026-07-06T23:29:52.061489Z","submitted_at":"2026-05-18T20:26:19Z","title":"Reachability-Augmented Dual Dynamic Programming for Optimal Path Parameterization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-20T08:32:54.889538Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2605.19089"},"observation_digest":"sha256:a577773f87c12e4ea15f9ea379d3ce2005d57488b465562cd547e6c9f1581ca2","observation_id":"af512ffe-b465-4003-9e23-673993ad6dbb","resolution":{"observed_at":"2026-05-20T08:33:08.846012Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2605.24803","last_updated":"2026-05-24T01:25:09Z","snapshot_observed_at":"2026-08-02T21:29:41.818246Z","submitted_at":"2026-05-24T01:25:09Z","title":"Active Learning for Stochastic Contextual Linear Bandits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T11:49:35.327709Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2605.24803"},"observation_digest":"sha256:3332fd117b8ea50916cd247f42d89fd7949e77a95a6354fcacd61bab69034230","observation_id":"2eda639d-6f0c-453d-8c1f-0f79d47eaf7c","resolution":{"observed_at":"2026-06-30T11:54:38.408760Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2605.28757","last_updated":"2026-05-27T17:18:11Z","snapshot_observed_at":"2026-08-07T17:57:05.629602Z","submitted_at":"2026-05-27T17:18:11Z","title":"Learning Approximate Solutions to Multiparametric Generalized Nash Equilibrium Problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T10:25:07.252952Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2605.28757"},"observation_digest":"sha256:f67cfc01af6705b8c25cc89836e3a6694141073899fc68a1211b8f13eac483f6","observation_id":"5db12833-8955-439b-b422-5bcad2fbd55d","resolution":{"observed_at":"2026-06-29T13:33:28.575159Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2605.31425","last_updated":"2026-05-29T15:22:38Z","snapshot_observed_at":"2026-08-06T04:53:49.268653Z","submitted_at":"2026-05-29T15:22:38Z","title":"Mixed-Precision GPU Acceleration for Large-Scale Minimum Enclosing Ball Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T21:38:08.313933Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2605.31425"},"observation_digest":"sha256:48dc4886d3eb3d3a3433c12a0f9d9eba6c76c211cd196583269c48eb80accaab","observation_id":"f96a566b-0daa-4286-aa49-1815ea1b0dd9","resolution":{"observed_at":"2026-07-01T20:06:12.029605Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2606.08993","last_updated":"2026-06-08T03:44:20Z","snapshot_observed_at":"2026-08-08T11:36:30.876552Z","submitted_at":"2026-06-08T03:44:20Z","title":"LEAF: A Learning-Enabled ADMM Framework for Accelerated Convex Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-27T17:36:33.188434Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2606.08993"},"observation_digest":"sha256:153ac7eedef92e7e9b3a889e71909de2200fa7ac4b9e1c7dfcbdd7b1caddd4b3","observation_id":"c201a1f6-629d-4502-8e41-93bd7b29d71e","resolution":{"observed_at":"2026-07-02T23:57:28.947704Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2606.23367","last_updated":"2026-06-22T14:03:54Z","snapshot_observed_at":"2026-07-06T23:58:07.236199Z","submitted_at":"2026-06-22T14:03:54Z","title":"Asymmetry PRISM: A CPU/GPU Portfolio Optimization Engine for Deadline-Bounded Institutional Rebalancing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T05:51:00.111239Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2606.23367"},"observation_digest":"sha256:309d98e73f7fa005fb7643d262af86b17e8b5f0097ad90b3b41993e415c79e27","observation_id":"a4478f1e-d0c8-4948-88bd-4ed9603f92f3","resolution":{"observed_at":"2026-07-04T12:49:52.927328Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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":"2405.12762","doi":"10.48550/arxiv.2405.12762","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2405.12762 (2 024)","venue":"arXiv (Cornell University)","work_id":"b2bca51b-bbff-42eb-a6a5-5899309daa90","year":2024},"citing_paper":{"arxiv_id":"2606.28617","last_updated":"2026-06-26T21:26:49Z","snapshot_observed_at":"2026-08-05T05:03:45.412187Z","submitted_at":"2026-06-26T21:26:49Z","title":"A Fast Convergent Algorithm for Solving Non-convex Partially-Decoupled Generalized Nash Equilibrium Problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-30T00:41:29.118401Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2606.28617"},"observation_digest":"sha256:b1c84dfe59a11f467be558779678e6c1f0fc9ea09310fb8068fb8c30c4a706be","observation_id":"8e94861e-8265-4af3-bce9-0170ab5e1647","resolution":{"observed_at":"2026-06-30T00:44:06.536592Z","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-08T15:08:25.244644+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:25.244644+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-01T18:33:31.186359Z","title":"2024 , journal=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17282","last_updated":"2026-07-19T15:00:49Z","snapshot_observed_at":"2026-08-06T23:33:31.571610Z","submitted_at":"2026-07-19T15:00:49Z","title":"An Iterative Geometric Approach to Optimizing Separating Hyperplanes","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T18:33:31.186359Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2607.17282"},"observation_digest":"sha256:0509a05ef76214829d991ce3a4a5ed0d31f2ca4a54b224ced9468e93a39394c7","observation_id":"bfd2d84a-9e52-4f97-befe-c6547fdd7397","resolution":{"observed_at":"2026-08-01T18:33:31.186359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T12:28:40.881891Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19546","last_updated":"2026-07-21T19:45:56Z","snapshot_observed_at":"2026-08-07T11:26:31.612859Z","submitted_at":"2026-07-21T19:45:56Z","title":"FullPASS: Geometry Optimization for Full-Duplex Pinching-Antenna Systems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T12:28:40.881891Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2607.19546"},"observation_digest":"sha256:e7812c7d11d24d897f27b0a83f741da30d3324bfcb70b0df80053e0b18f685cc","observation_id":"04c65e39-72e7-421e-b09b-52de07719676","resolution":{"observed_at":"2026-08-01T12:28:40.881891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07-31T10:25:01.504308Z","title":"and Chen, Yuwen , year = 2024, month = may, number =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28353","last_updated":"2026-07-30T15:22:31Z","snapshot_observed_at":"2026-08-09T18:53:02.257727Z","submitted_at":"2026-07-30T15:22:31Z","title":"Input-to-state Stable Approximate Nonlinear Model Predictive Control with Realtime Feasibility","version":1},"reference_index":188,"source":"arxiv_source","source_observed_at":"2026-07-31T10:25:01.504308Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2607.28353"},"observation_digest":"sha256:c04be0d290dd4b7891c2bf66bc2a0f4e826858b45ed6d64024f8b05ea3f1f223","observation_id":"34733945-f4f7-4660-8680-4dc5a5738abf","resolution":{"observed_at":"2026-07-31T10:25:01.504308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-08T01:04:17.134582Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objec- tives,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.03060","last_updated":"2026-08-04T03:22:15Z","snapshot_observed_at":"2026-08-09T10:36:03.650609Z","submitted_at":"2026-08-04T03:22:15Z","title":"Passively Safe Convex Guidance for Cislunar Rendezvous and Proximity Operations","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T01:04:17.134582Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2608.03060"},"observation_digest":"sha256:bd5998641dd4334ed23b6eafcd33b3371276a1f8b96f13e5554d44aef0c8959b","observation_id":"b7c3c183-9505-4ec7-973f-92bd40deadec","resolution":{"observed_at":"2026-08-08T01:04:17.134582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.12762/citation-record","integrity":"/paper/2405.12762/integrity","json":"/paper/2405.12762/citation-record.json","paper":"/paper/2405.12762"},"outbound":[],"paper":{"arxiv_id":"2405.12762","last_updated":"2024-05-21T13:15:19Z","latest_version":1,"primary_category":"math.OC","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"},"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 41 inbound Pith citation observations for arXiv:2405.12762."}