{"as_of":"2026-08-13T01:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:914b718210020dc94cffb61aea6964bc8dfe2ac93b6b45227b5e010b9e70fded","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-10T15:24:01.401003Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.14191/citation-record","integrity":"/paper/2501.14191/integrity","json":"/paper/2501.14191/citation-record.json","paper":"/paper/2501.14191"},"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-10T15:24:01.984207Z","title":"The CVXOPT linear and quadratic cone program solvers,","venue":null,"work_id":"a9136a92-1bb8-49d2-8f85-5b986d4d078d","year":2010},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.227349Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:d6a27eb279fb8529daade17a7017560a13ce7cc1913a6c807a8342f2b366c28d","observation_id":"93a81d2c-a725-4809-bbef-5c44ea863e15","resolution":{"observed_at":"2026-08-10T15:24:01.987683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.975099Z","title":null,"venue":null,"work_id":"9722160f-788a-40f5-85ea-45d7cc4bafe0","year":2017},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.231784Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:8d73a28f88987111b4cd67294c0736195747ab2aedf0d9abccd5dea55de6633f","observation_id":"01dd5b4c-3875-4ed3-a843-a6fbf13423d8","resolution":{"observed_at":"2026-08-10T15:24:01.978481Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.964871Z","title":"Projecting onto the intersection of a cone and a sphere,","venue":null,"work_id":"d04938bd-99b3-4ae6-a4dd-dfa1e67f3f4a","year":2018},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.235610Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:93845155e1f086ef963f86dc959881f9d4391f2b430deb0650c874488dd7718d","observation_id":"b683666e-9c39-4983-b808-11067ca15167","resolution":{"observed_at":"2026-08-10T15:24:01.968690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.952487Z","title":"Customized real-time first-order methods for onboard dual quaternion-based 6-DoF powered-descent guidance,","venue":null,"work_id":"a861fc57-fadd-4093-add5-273af91829a2","year":2023},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.239787Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:d4585f6c7cb5d8568d0520f4d88ec74755f1ebade0c0cc1e4ce124ed963b8e5a","observation_id":"bafe4736-0ed1-4e47-9b9a-900e0e0d109d","resolution":{"observed_at":"2026-08-10T15:24:01.956439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.938786Z","title":"Proportional-integral projected gradient method for model predictive control,","venue":null,"work_id":"f2181c5a-f1ec-45f0-8274-cd5ca62b86c2","year":2021},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.243684Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:16fbe7614d2c5c30e44e162b0d85a1d266c7f6d555075b96d83b3590f8970491","observation_id":"54ee1446-beeb-42f8-a606-d8ec11feca88","resolution":{"observed_at":"2026-08-10T15:24:01.942981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.927057Z","title":"Real-time sequential conic optimization for multi-phase rocket landing guidance,","venue":null,"work_id":"7792a83d-c53b-4aaa-aa2b-8ddb5608217f","year":2023},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.247496Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:4f93bfe6de9a19e867b8daf36a6f4c74c6271319b5741eb68498cc6687f7e7cb","observation_id":"b6a4719c-2f5f-440a-af9c-a0e94ee2f8c6","resolution":{"observed_at":"2026-08-10T15:24:01.931320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.916381Z","title":"A customized first-order solver for real-time powered- descent guidance,","venue":null,"work_id":"c188fa6e-0ce7-45ba-a016-964633cc6c6d","year":2022},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.251417Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:e8d14815a52f4f77a6cf4a944f7184f2b3345a18b3ee41bfa09e5c22451eb1c3","observation_id":"53b05325-d8e4-4b1f-add5-78d526da5e50","resolution":{"observed_at":"2026-08-10T15:24:01.920144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.905222Z","title":"Convex programming approach to powered descent guidance for Mars landing,","venue":null,"work_id":"da4df703-0ab3-4c27-9527-42fabfcb1702","year":2007},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.254852Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:f24a644c1715a6786895dfa969f3952b4d84e31499dbd54fa5be16e0d832b52b","observation_id":"0123c85e-afb1-4642-bd27-c0e6ac907865","resolution":{"observed_at":"2026-08-10T15:24:01.909542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.893222Z","title":"Fast model predictive control using online optimization,","venue":null,"work_id":"6235f747-d231-4297-8ba2-90abc7787258","year":2010},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.258258Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:6792bc85133dadaa3a8b7576d2e91316be438e23a6e855678196d226c50109f6","observation_id":"e469a5bb-33ff-41bb-9b0d-d36e54430a37","resolution":{"observed_at":"2026-08-10T15:24:01.897536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.881354Z","title":"Trajectory generation for aircraft avoidance maneuvers using online optimization,","venue":null,"work_id":"4c578061-c610-4b59-82f1-ffacb18c5fe3","year":2011},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.261471Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:118c53a1a44b3b2c2990237fc0104097623bcd082d6dd0be2a872cf69072125b","observation_id":"4ae7aaa1-e295-46ed-85ff-29a00a5b86b0","resolution":{"observed_at":"2026-08-10T15:24:01.885019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.868239Z","title":"Synthesis and stabilization of complex behaviors through online trajectory optimization,","venue":null,"work_id":"361f1be8-e19d-4b52-b6a5-1e322e4ed000","year":2012},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.264888Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:d30dbd8afe577cb0e9a6308460ca87e517d862aca00e0de2964e2be3c2a4d24b","observation_id":"bb70fd72-44fb-43a1-aedd-291e9b9031a7","resolution":{"observed_at":"2026-08-10T15:24:01.873879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.852432Z","title":"Real time trajectory optimization for nonlin- ear robotic systems: Relaxation and convexification,","venue":null,"work_id":"bd94af12-6002-43df-a1c7-00a05034dbf6","year":2017},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.268567Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:a5e001ae6ae1c7988e53bcc2226defb492994af82ea29ffc8e73b242ce9bd346","observation_id":"8e759cec-a107-4cda-bc9a-3ab52fbbfeeb","resolution":{"observed_at":"2026-08-10T15:24:01.859697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.832003Z","title":"Successive convexifi- cation for real-time six-degree-of-freedom powered descent guidance with state-triggered constraints,","venue":null,"work_id":"e59d2fe2-f1ab-454c-b9d7-f4b16382d400","year":2020},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.272109Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:84935a678164124d5d2ac63ba6fd201a52ac4f79e7e257427587e4b1eb4396cb","observation_id":"6d6aba05-4902-4ea7-9a38-8db99c41447c","resolution":{"observed_at":"2026-08-10T15:24:01.842816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.819554Z","title":"Dual quaternion-based powered descent guidance with state-triggered constraints,","venue":null,"work_id":"a274f9e3-f02a-4304-b6f2-df25ab85063a","year":2020},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.275669Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:7564d6d78ddc280bbd66969c799bd2c4cccc3b171d886cf4e08d24077f240825","observation_id":"c0537e1f-a5e3-4a9a-b41b-560ada9c6c10","resolution":{"observed_at":"2026-08-10T15:24:01.823374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.809218Z","title":"Real- time quadrotor trajectory optimization with time-triggered corridor con- straints,","venue":null,"work_id":"d9eaab03-0a50-4153-aeb7-4f790d7f5888","year":2023},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.279240Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:8e2bc1a1972eab56ee20aebe55540468fcfafaa6d6d49e48316d0197483ac8fd","observation_id":"9af8e910-608e-4c61-b281-254ddb002e41","resolution":{"observed_at":"2026-08-10T15:24:01.812447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16826","last_updated":"2024-04-25T17:59:47Z","snapshot_observed_at":"2026-08-13T00:22:02.625758Z","submitted_at":"2024-04-25T17:59:47Z","title":"Successive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16826","snapshot_observed_at":"2026-08-10T15:24:01.282823Z","title":"Successive convexification for trajectory optimization with continuous- time constraint satisfaction,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.282823Z"},"links":{"cited_paper":"/paper/2404.16826","citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:75ccd7056d4b1a3c737385a927b9c803c3b09dfa0a89b74baf7663399b4f5d4d","observation_id":"8fa61e15-cd33-4922-94ba-6042df330a03","resolution":{"observed_at":"2026-08-10T15:24:01.282823Z","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-10T15:24:01.799158Z","title":"A first-order primal-dual algorithm for convex problems with applications to imaging,","venue":null,"work_id":"cfcff264-0150-4277-9580-75aefbfb1839","year":2010},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.287892Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:ec9b5424074735878579ba425c3f989748614fc3f6aac8ab3f7e4133fba1e365","observation_id":"d8a5d49a-07ca-4a3b-8ec2-ede99354f575","resolution":{"observed_at":"2026-08-10T15:24:01.802504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.786658Z","title":"Beck, First-Order Methods In Optimization","venue":null,"work_id":"e1191945-c926-4759-9d14-e0f68428e1e7","year":2019},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.291621Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:6051565b23e2e8802ce25a8743da852d5135079ad16671b8b8c83e3d6898a979","observation_id":"fb8ff8ce-dc15-4708-88d3-d485e1383648","resolution":{"observed_at":"2026-08-10T15:24:01.791478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.775344Z","title":"Conic optimization via operator splitting and homogeneous self-dual embedding,","venue":null,"work_id":"1a119fae-fb8a-4c4e-b471-2663e92c2cdb","year":2016},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.295431Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:e73427dd033f8019c7c8ebe893318ba769a7a7357826dc6d772297f7c99b5868","observation_id":"3788044b-d11e-4f6f-8cd2-dbf4021b0b9a","resolution":{"observed_at":"2026-08-10T15:24:01.779353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.764279Z","title":"OSQP: an operator splitting solver for quadratic programs,","venue":null,"work_id":"9f499ad2-26aa-478f-ac6b-d5d10cd90703","year":2020},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.299253Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:86c093be5ced925b0b16e5cec33334267203f34c3809cb0eb29c95bda72129a0","observation_id":"4f2d1c0d-b58a-482c-b6a3-af450d08ad81","resolution":{"observed_at":"2026-08-10T15:24:01.768067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.752719Z","title":"Proportional–integral projected gradient method for conic optimization,","venue":null,"work_id":"45a1868c-3459-4027-bf64-73e44f25e268","year":2022},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.303308Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:77801149977415dfc1900200ce61af22b4d2b75ed6e7a563bb97ffaa46ae85b0","observation_id":"a9f04aa2-667c-4e03-861a-fae0db495c45","resolution":{"observed_at":"2026-08-10T15:24:01.756354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.742373Z","title":"Extrapolated proportional-integral projected gradient method for conic optimization,","venue":null,"work_id":"b2a21ce4-38c0-435d-9216-b0f06a1f4aee","year":2023},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.307249Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:aa3abadb892958ba85358d47e14f3bf6996c27cdca9c41addd1836f68f7a53d0","observation_id":"af01a447-5a4e-40d7-831d-ce71042ae5f7","resolution":{"observed_at":"2026-08-10T15:24:01.746012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.730708Z","title":"Preconditioning in fast dual gradient meth- ods,","venue":null,"work_id":"6f3364af-b595-4ba7-a540-feb0aee9b35d","year":2014},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.311551Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:292e1d75a53be5378b22d7849086153fa419aefe01fb21586285ae18154c8755","observation_id":"b157ca5a-21da-405f-8cc1-bb601b3a62ae","resolution":{"observed_at":"2026-08-10T15:24:01.735227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.719817Z","title":"Preconditioning,","venue":null,"work_id":"6a69bf9b-f7d2-49fb-983e-d24df3787f74","year":2015},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.315205Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:4ca4fb1701e6e167a31d3c1d0c478df674b09abcce31124e113f56381373feeb","observation_id":"99cdd1a1-93e6-404d-8cd2-f702852c8fd0","resolution":{"observed_at":"2026-08-10T15:24:01.723435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.707352Z","title":"Preconditioning techniques for large linear systems: A survey,","venue":null,"work_id":"8fff67aa-2d22-469b-acf2-3ade091c4645","year":2002},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.319335Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:06fceb13035fd1b54d8dd07633ef29105fb70cd49ceef89cf38abe4f7afda9d0","observation_id":"a3fce185-0485-45cd-be88-96f20b94cb73","resolution":{"observed_at":"2026-08-10T15:24:01.711386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.694217Z","title":"Diagonal preconditioning for first order primal-dual algorithms in convex optimization,","venue":null,"work_id":"c9f6337f-8a3e-46e9-9eda-e3f5c4226bdc","year":2011},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.322952Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:722e4144300200ddb799141948a83f5b2ec89aa9f45827bb7618ab621ef2eb6f","observation_id":"1ca3f220-47eb-45f4-b4fc-74bdbc34e9e7","resolution":{"observed_at":"2026-08-10T15:24:01.698863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.680116Z","title":"Diagonal scaling in Douglas-Rachford splitting and ADMM,","venue":null,"work_id":"24f1455e-d16f-4359-878a-39f4abfffd8e","year":2014},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.326392Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:998f3a609ad5baf2d0833a2fb780ed9007e9aaea1fe6d08665364c9ae865529b","observation_id":"5bb3482d-cbdf-49ac-8fd0-58b0a6c3d356","resolution":{"observed_at":"2026-08-10T15:24:01.684092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.667870Z","title":"Metric selection in fast dual for- ward–backward splitting,","venue":null,"work_id":"4fea11be-7f2c-4614-9cd6-bb64c9683142","year":2015},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.331164Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:323b5aa2437044e7bb76caadbf0e9455e70f073a5f4876953e399f0a58e0ebcf","observation_id":"c077f488-0cbe-4581-b935-17c9695e44a1","resolution":{"observed_at":"2026-08-10T15:24:01.672451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.655945Z","title":null,"venue":null,"work_id":"42ee7487-6368-438b-a2d8-d0a0ac61f467","year":1994},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.335795Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:99b444e0f59f4291b2c4e77e25a816466ee4c820c1e657d2665e5aa3d5f2fa04","observation_id":"f7b6d8c9-a59e-4623-9e9a-876ffda8ae16","resolution":{"observed_at":"2026-08-10T15:24:01.659712Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.644089Z","title":"Concerning nonnegative matrices and doubly stochastic matrices,","venue":null,"work_id":"3506a872-5c08-40d9-8622-853b802e80d7","year":1967},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.339678Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:7e2b44cfa1bbb430ea2446da513994bb9378204520317817156571864dc41b49","observation_id":"51ecee1c-41c1-4a0c-b1fb-cfd973beae32","resolution":{"observed_at":"2026-08-10T15:24:01.648141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.343114Z","title":"A scaling algorithm to equilibrate both rows and columns norms in matrices,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.343114Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:7ba372ec6c270c4d0d4b8354d8cf3a0487b1636b0990801378d6aca0d72812e9","observation_id":"7078756b-aad7-4388-ab54-ae480f2b7cd2","resolution":{"observed_at":"2026-08-10T15:24:01.343114Z","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-10T15:24:01.625715Z","title":"Constraint preconditioning and parameter selection for a first-order primal-dual method applied to model predictive control,","venue":null,"work_id":"3e34bd92-24ad-4f55-9d87-d6780cd84c1f","year":2024},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.346762Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:afff400ff17932ecc91ef8ab5f857d2b924182d90865808abd1add46260f22b5","observation_id":"92a9e9d5-732d-4063-bb48-208acca4523d","resolution":{"observed_at":"2026-08-10T15:24:01.629693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.614721Z","title":null,"venue":null,"work_id":"e1989c5f-45fe-431d-a748-54e3a4e36e40","year":1988},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.350518Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:1e24fa8602b0ca5eb09e03a816a8ddf5f2faa52a753441633c4eb7e27b5f1242","observation_id":"6bce8944-256e-4931-9826-025a41059664","resolution":{"observed_at":"2026-08-10T15:24:01.618384Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.353934Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.353934Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:e8f0dd80a0fd314e4af91ed72518d421cca87b0b7df15151c3980374038383aa","observation_id":"b8a590c0-198e-4a47-97d0-be6eaa3779c8","resolution":{"observed_at":"2026-08-10T15:24:01.353934Z","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-10T15:24:01.598027Z","title":"Proportional-integral projected gradient method for infeasibility detection in conic optimization,","venue":null,"work_id":"5894e44b-7ee9-478d-b87e-47c3b86d1846","year":2021},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.357652Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:54e9a0d28a54cde992c907308e0aa1f040a04180055380108aa242bbcc3f6b85","observation_id":"cb106f5e-902a-4703-a36b-4ad7e683c606","resolution":{"observed_at":"2026-08-10T15:24:01.601334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.586878Z","title":"Verifi- cation & validation of optimisation-based control systems: methods and outcomes of vv4rtos,","venue":null,"work_id":"ab00f1e9-dcaa-465e-9ce0-b85d16f9b2fa","year":2023},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.361589Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:f708492e36768f25e4854664e7ca10323249020bdc56c271ffbbb395061f7043","observation_id":"fb1761d4-4a3d-4edb-b975-1bfd52db4869","resolution":{"observed_at":"2026-08-10T15:24:01.591011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.574763Z","title":"Fast Monte Carlo analysis for 6-DoF powered-descent guidance via GPU- accelerated sequential convex programming,","venue":null,"work_id":"6de8c60d-744b-4bb4-bda1-a26f5b1c030f","year":2024},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.365266Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:4b5fb440673e99962d716175e27dda117ea5f8eca85a3cf1a26324669132ae3a","observation_id":"89aff363-35bc-4879-994f-953b9b04afba","resolution":{"observed_at":"2026-08-10T15:24:01.578356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04561","last_updated":"2024-02-07T03:42:09Z","snapshot_observed_at":"2026-08-12T23:02:54.719805Z","submitted_at":"2024-02-07T03:42:09Z","title":"Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method","version":1},"cited_work":{"arxiv_id":"2402.04561","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.04561","snapshot_observed_at":"2026-08-10T15:24:01.466616Z","title":"Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method","venue":"math.OC","work_id":"0d263c59-1714-4bb3-affd-71a83187866b","year":2024},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.368944Z"},"links":{"cited_paper":"/paper/2402.04561","citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:f068913d2208b3eabd84e3b2101ba73f1b77855cadd7314f4f429340fdf7d59f","observation_id":"a3f404b0-e640-40cb-a95e-dc230b8bddaf","resolution":{"observed_at":"2026-08-10T15:24:01.471029Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14885","last_updated":"2024-06-19T09:17:05Z","snapshot_observed_at":"2026-08-02T13:14:12.300436Z","submitted_at":"2024-01-26T14:12:35Z","title":"Neuromorphic quadratic programming for efficient and scalable model predictive control","version":3},"cited_work":{"arxiv_id":"2401.14885","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.14885","snapshot_observed_at":"2026-08-10T15:24:01.449156Z","title":"Neuromorphic quadratic programming for efficient and scalable model predictive control","venue":"cs.NE","work_id":"276f2528-2524-477f-bd80-9e8b2e14dbc2","year":2024},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.372927Z"},"links":{"cited_paper":"/paper/2401.14885","citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:ac41ba96aea3cc719e6a19f2d425691c103d78bfde3597390a8efc9be851cb8b","observation_id":"b6b3629b-60bd-42cf-8e7e-c022db6c2db7","resolution":{"observed_at":"2026-08-10T15:24:01.453663Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.563689Z","title":"Hardware in the loop performance of terrestrial powered descent dual quaternion guidance with a custom first-order solver,","venue":null,"work_id":"2c416f2a-a9fe-4643-a008-17b86bca86b4","year":2025},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.377087Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:5c857a4fa02e24a258d03a5df53b162a7519ee8ddb9b3f92e923e8d23154d324","observation_id":"09cc049a-7e49-46a9-97c2-3d916fe282d7","resolution":{"observed_at":"2026-08-10T15:24:01.567539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.551950Z","title":"Advances in trajectory optimization for space vehicle control,","venue":null,"work_id":"765485d3-40c2-456b-97ad-0351ad6a33a1","year":2021},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.380697Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:6c3af1ee2a0202547fd712d2d50fcbfa198d94394c37af7ffda9ab6afd343c41","observation_id":"185f0c76-840e-4296-ac8d-cbe1f588c258","resolution":{"observed_at":"2026-08-10T15:24:01.556160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.538353Z","title":"Convex optimization for trajectory generation: A tutorial on generating dynamically feasible trajectories reliably and efficiently,","venue":null,"work_id":"b969949b-b03f-44c1-ae86-0a633e5e1ec8","year":2022},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.384148Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:fde49e977cf5a6278e38a15cdf29b87dc4243f1b640bb4563edd231bbbcad21d","observation_id":"aca6a2ef-3d00-4da7-9331-b2076e43ff96","resolution":{"observed_at":"2026-08-10T15:24:01.542951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.525446Z","title":"High-Accuracy 3-DoF Hypersonic Reentry Guidance via Sequential Convex Programming,","venue":null,"work_id":"0fd37dbd-16bc-43cc-b7af-35d906a39993","year":2023},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.387717Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:55a827d5fed9ec84388bc85471c7d5be6fc3d7c44618632177cb672a0f835367","observation_id":"208c99d5-b128-4180-898b-f3dd700e411b","resolution":{"observed_at":"2026-08-10T15:24:01.529316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.513725Z","title":"Suc- cessive convexification for nonlinear model predictive control with continuous-time constraint satisfaction,","venue":null,"work_id":"6831995c-555b-4115-b082-2498e63b9d67","year":2024},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.391194Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:5e7c69a6baef28560ab1555372860294d41e2fa398b1e19ccc39e638d2347aad","observation_id":"234b1a16-bad0-4a63-a724-cdecf8235895","resolution":{"observed_at":"2026-08-10T15:24:01.517601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16680","last_updated":"2025-06-10T21:10:06Z","snapshot_observed_at":"2026-08-12T23:57:39.615255Z","submitted_at":"2024-05-26T20:14:37Z","title":"Six-Degree-of-Freedom Aircraft Landing Trajectory Planning with Runway Alignment","version":2},"cited_work":{"arxiv_id":"2405.16680","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.16680","snapshot_observed_at":"2026-08-10T15:24:01.431843Z","title":"Six-Degree-of-Freedom Aircraft Landing Trajectory Planning with Runway Alignment","venue":"math.OC","work_id":"d69b8c39-e155-4f6c-99d6-dcc479409982","year":2024},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.394251Z"},"links":{"cited_paper":"/paper/2405.16680","citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:a56b2ae3baadb2402e4dc49dd8870239d48cb7f42f7de1501c1b5b8a8aadc855","observation_id":"f14545ac-684e-4fc5-bf2d-f2da2cb90404","resolution":{"observed_at":"2026-08-10T15:24:01.437564Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.502493Z","title":"Projections onto convex cones in Hilbert space,","venue":null,"work_id":"7f84bfc0-203c-414b-a188-fd9a6e437d13","year":1991},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.397598Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:832e6f94daadb210857545b7ad789778561ce1ce4d06ee7717e3dc91b51a2f00","observation_id":"8c968de7-81f0-4848-94ed-3fc21e3b59f4","resolution":{"observed_at":"2026-08-10T15:24:01.506414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T15:24:01.490892Z","title":null,"venue":null,"work_id":"940c8b4b-9470-4770-9a75-d2f8316a5bea","year":1997},"citing_paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T15:24:01.401003Z"},"links":{"citing_paper":"/paper/2501.14191"},"observation_digest":"sha256:0709b0973e3a8399bfc532a3d188cc36928869017e6b081146f628e148930a2a","observation_id":"52059b0c-1954-4093-85e0-75967e2d2b35","resolution":{"observed_at":"2026-08-10T15:24:01.494836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.14191","last_updated":"2025-04-27T07:26:02Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T12:11:14.075757Z","submitted_at":"2025-01-24T02:54:06Z","title":"Optimal Preconditioning for Online Quadratic Cone Programming"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":3,"verified_fuzzy":37},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2501.14191."}