{"as_of":"2026-08-17T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5df842fe29ac8ab7db871a1f7749dec3614f6b5906b857c61e169237a9ae0402","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T12:14:56.662487Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:19:11.636968Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T04:19:12.396488Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"cited_work":{"arxiv_id":"2509.01855","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.01855","snapshot_observed_at":"2026-08-11T04:19:12.396488Z","title":"A Million-Point Fast Trajectory Optimization Solver","venue":"math.NA","work_id":"b976a36a-c528-4b10-8e70-5aeeb64e000f","year":2025},"citing_paper":{"arxiv_id":"2608.07815","last_updated":"2026-08-07T23:27:50Z","snapshot_observed_at":"2026-08-16T00:22:06.722259Z","submitted_at":"2026-08-07T23:27:50Z","title":"Universal Birkhoff Method for Computing Extremals in the Elliptic Restricted Three-Body Problem","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T04:19:11.636968Z"},"links":{"cited_paper":"/paper/2509.01855","citing_paper":"/paper/2608.07815"},"observation_digest":"sha256:f5ff3853243ac49ed165b63aa0b68bf3179977f98d175d678406f3819bb864b1","observation_id":"c535fa58-b1cf-405d-b39c-2db548b38b68","resolution":{"observed_at":"2026-08-11T04:19:12.401401Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.01855/citation-record","integrity":"/paper/2509.01855/integrity","json":"/paper/2509.01855/citation-record.json","paper":"/paper/2509.01855"},"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-05T12:15:01.278805Z","title":"The Million Point Computational Optimal Con trol Challenge,","venue":null,"work_id":"68eae31b-71c4-4bfb-9d84-3527e41329c6","year":2017},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.112374Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:17727f6381fde7f67d5bc1d5d2d33623db9c8187abf24871d2a8f06cc08e796f","observation_id":"fafdb54b-297f-4805-881b-f6b843bf06ba","resolution":{"observed_at":"2026-08-05T12:15:01.287801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ifacol.2016.10.208","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A Nonsmooth Calc ulus for Solving Some Graph- Theoretic Control Problems,","venue":"IFAC-PapersOnLine","work_id":"84f4c917-45b7-4e6e-b271-241ca2d7caf7","year":2016},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.129562Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:330db2fba2a021dc8e5f75f9672e2634ee8cbc0cf7905e7faeaabf50b4406903","observation_id":"ecbef4c3-ed71-4174-bb15-b42f20b4eb63","resolution":{"observed_at":"2026-08-05T12:14:57.740183Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.03186","last_updated":"2020-05-07T00:44:27Z","snapshot_observed_at":"2026-08-13T13:16:16.402339Z","submitted_at":"2020-05-07T00:44:27Z","title":"An Optimal Control Theory for the Traveling Salesman Problem and Its Variants","version":1},"cited_work":{"arxiv_id":"2005.03186","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.03186","snapshot_observed_at":"2026-08-05T12:14:58.054663Z","title":"An Optimal Control Theory for the Traveling Salesman Problem and Its Variants","venue":"math.OC","work_id":"be839eb2-d83d-4494-88b8-b4af0420a48a","year":2020},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.143013Z"},"links":{"cited_paper":"/paper/2005.03186","citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:3e93ab21e9ac2630c6bcd49184cd298e2108dd801a7aeb2dc6b3515179ee3ee8","observation_id":"28868d3b-53e8-439e-9ea5-7b05f1429a32","resolution":{"observed_at":"2026-08-05T12:14:58.075731Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:15:01.226105Z","title":"Arora and B","venue":null,"work_id":"3aae70c1-c8e5-46b9-bfa1-ccfea9a0110a","year":null},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.152689Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:8335efd265ba69a04499c4b6d847cd6fcbda7cae0e6b5f55be78302cc617a5eb","observation_id":"a2f6e850-312b-4efe-97ef-ff60cd1e69e3","resolution":{"observed_at":"2026-08-05T12:15:01.235489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/6.2002-4727","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A Perspective on Methods for Tra jectory Optimization,","venue":"AIAA/AAS Astrodynamics Specialist Conference and Exhibit","work_id":"db66cfea-c2f9-4ba3-a260-b74d21383eee","year":2002},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.159046Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:ce39425c5e98749df865af9d6366d1f66ef7ec5a6db3a92690e2cb692605d409","observation_id":"bf0eebf9-fcb2-4aa9-819b-fc7ba097d8dd","resolution":{"observed_at":"2026-08-05T12:14:57.692531Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10957-011-9918-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A Survey of Methods Available for the Numer ical Optimization of Continuous Dy- namic Systems,","venue":"Journal of Optimization Theory and Applications","work_id":"994cc1ad-bb6a-4774-b257-34b500be5985","year":2012},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.171201Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:a939d195919c972b72efe9469bd1d33fe80a1a6d369d5f49b1abcdf7d34a3092","observation_id":"3903ad10-ad2e-4020-a374-197cefea0607","resolution":{"observed_at":"2026-08-05T12:14:57.660958Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:12.48281+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:12.48281+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:56.185746Z","title":"AnAlgorithmic Guide for Finite-Dimensional Optimal Control Problems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.185746Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:e56c92368f49b1586eb8e1671a0957b7670d1d2606918fe8a17565cacacbc1ca","observation_id":"1148fe42-4d75-4071-bd43-3735bf8273ea","resolution":{"observed_at":"2026-08-05T12:14:56.185746Z","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":"10.2514/1.g007737","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A Universal Birkhoff Theory for Fast Traject ory Optimization,","venue":"Journal of Guidance Control and Dynamics","work_id":"ee36a671-8bf8-42b7-b138-8e368c91bea4","year":2024},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.206658Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:c00351cc63dc9f2132a9a887fb78240119f971540429484d5cdf4aa29d4336b9","observation_id":"fe988b0b-7028-4e67-b971-09efbd15a267","resolution":{"observed_at":"2026-08-05T12:14:57.570902Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:13.307066+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:13.307066+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:15:01.127571Z","title":null,"venue":null,"work_id":"0b0b1b98-7f7e-4180-9915-7fcc7f239cee","year":2014},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.217834Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:eae4d4cee4af56d7bbe6982d4ecb032dad0d3b56097e5d45008e7243a2a464aa","observation_id":"d94bf359-34b0-4d37-9cc9-cad9bc01020d","resolution":{"observed_at":"2026-08-05T12:15:01.189680Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:15:00.931719Z","title":null,"venue":null,"work_id":"7747e7ae-6a0a-49dc-abf9-72f9484f16b4","year":2015},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.227318Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:e58cb21519c190780bb90aec0c723788af47a6d8e8a7999dfc006713fed2878b","observation_id":"c2127c3a-84c9-482a-abc7-e2d730bc6c46","resolution":{"observed_at":"2026-08-05T12:15:00.983829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1196/annals","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T12:14:57.518178Z","title":"A Roadmap for Optimal Control: The Right Way to Commute,","venue":null,"work_id":"1d46aff2-562e-4159-ad13-ea12a62f5ce5","year":2005},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.236793Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:784eddd4020e2221698f445668683f65cda51f82a040e2ae270f8f9d98aeb2c0","observation_id":"f061194c-0827-4713-9a18-db3e7b437162","resolution":{"observed_at":"2026-08-05T12:14:57.528734Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:15:00.756170Z","title":"SNOPT: An SQP Al gorithm for Large-Scale Constrained Optimization,","venue":null,"work_id":"790d5df0-a5e9-461d-83d9-b9c91085fc0c","year":2002},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.250555Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:67de0757ac4d7ef56026c3067660ba6e665a26a81f7774d83c82357199943979","observation_id":"dc8be739-d9c5-48fc-b432-ec84b902a02e","resolution":{"observed_at":"2026-08-05T12:15:00.831893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:15:00.557011Z","title":"On the implementation ofan interior-point filter line-search algorithm for large-scale nonlinear programming,","venue":null,"work_id":"5a637920-3c2c-455d-8ca2-facd37c3d7bb","year":2006},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.262607Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:b13d11136dbb5b6d814e3e1426fcbf4c344b0f62f13511df51a34594693597c1","observation_id":"629e4d7f-a23c-4dae-8a6f-c98af29d9af8","resolution":{"observed_at":"2026-08-05T12:15:00.630862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:15:00.444067Z","title":"A Matrix-Free Trust- Region SQP Method for Equality Constrained Optimization,","venue":null,"work_id":"f539eca0-f67c-4034-9147-b886d8d8fc84","year":2014},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.277710Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:2bebd76d5f8e16a654f06c8ce239627f5b334202dfe778b1ab0f6aa068cd02fa","observation_id":"639556a8-baca-4a22-a762-e33af9cd31ff","resolution":{"observed_at":"2026-08-05T12:15:00.487955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/1.g008778","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Hessians in Birkhoff-Theoretic Trajector y Optimizaiton,","venue":"Journal of Guidance Control and Dynamics","work_id":"77e00148-3f05-4111-881a-6f52160f4cb6","year":2025},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.284658Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:cd6d6cd336e1f658c543ab1a4287e42a009bf5d3a65492ba73c7e9798a4861fc","observation_id":"ccc9f56f-9f8e-4cad-968d-48105287524e","resolution":{"observed_at":"2026-08-05T12:14:57.490938Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:13.354349+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:13.354349+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:56.304006Z","title":"A Review of Pseudospectral O ptimal Control: From Theory to Flight,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.304006Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:fc80106aa925aa3f38793e76bf16f14983710845ea2cc98b9135277d8b3db982","observation_id":"47fb05f9-4b63-48fd-95c5-ad76786f5543","resolution":{"observed_at":"2026-08-05T12:14:56.304006Z","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-05T12:15:00.284529Z","title":"Boyd, Chebyshev and F ourier Spectral Methods, Dover Publications, Inc., Minola, New Y ork, 2001","venue":null,"work_id":"42fd3bd5-6f64-4834-a251-83598cf88f16","year":2001},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.312857Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:119b7ee1e6cd1a8022d26f3d20b37960c3c15b4e22b5b2cfa3b3fa63460b04a1","observation_id":"a46c964e-0aa6-4c53-a78e-9177b1cc1ea3","resolution":{"observed_at":"2026-08-05T12:15:00.359595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:15:00.134491Z","title":null,"venue":null,"work_id":"b6896c0e-7c49-4091-8c60-cce35c4f0a24","year":2000},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.327755Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:5974b878e7c1f466b388f9b9ea5353fc38618de4bef109e9e720636ecc7ec449","observation_id":"14d4dfa1-a072-416e-8994-f34cc8983a27","resolution":{"observed_at":"2026-08-05T12:15:00.213300Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:56.336858Z","title":"Direct Trajectory Optimizati on by a Chebyshev Pseudospectral Method,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.336858Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:227ce034bda446a8a69d13f01a141ffcb44c2d54970d84d4984530bc0dfb17bd","observation_id":"3e7f705e-e207-4b7f-9578-6c1ccfe76490","resolution":{"observed_at":"2026-08-05T12:14:56.336858Z","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":"10.2514/1.45154","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Costate Computation b y a Chebyshev Pseudospectral Method,","venue":"Journal of Guidance Control and Dynamics","work_id":"97913dba-a151-4a9a-9de4-5db8ec24b231","year":2010},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.350664Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:0fbd2a104b5d25c54bd24fda72af1850e96e88481756bfe2fe3584b2292ba732","observation_id":"86bd7aee-955e-492e-a9a7-20e53178248f","resolution":{"observed_at":"2026-08-05T12:14:57.378396Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:13.859676+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:13.859676+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/1.g003904","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Fas t Mesh Refinement in Pseudospectral Optimal Control,","venue":"Journal of Guidance Control and Dynamics","work_id":"b09079ac-8472-412f-af4e-c1dd6d05a8fc","year":2018},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.363588Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:29bc55a9f319b545e70bba4700dc0943dbf6837638020ed0df94fc44e06df419","observation_id":"b61e2be4-de80-4195-8d23-c77446969af7","resolution":{"observed_at":"2026-08-05T12:14:57.342123Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:13.899165+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:13.899165+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/1.g007738","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Implementations of the Univ ersal Birkhoff Theory for Fast Trajectory Optimization,","venue":"Journal of Guidance Control and Dynamics","work_id":"ba5c60f2-4388-4ada-bba7-f1ae1814f723","year":2024},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.370317Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:56efb9e0f6140360ad3c1c05cb3b7860bd9d7dc7a66ce26a976740c050fc21e3","observation_id":"14edb330-6e28-4239-b00e-41cd9a2e487c","resolution":{"observed_at":"2026-08-05T12:14:57.064385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:14.080315+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:14.080315+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/1.3426","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Pseudospectral Knotting Meth ods for Solving Optimal Control Problems,","venue":"Journal of Guidance Control and Dynamics","work_id":"6dbe0097-0ea2-45cf-b005-4b15a27ce2d7","year":2004},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.378648Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:cb7f02eac7ae96ce881753535258989ec127fdbca2e911614ca74a618237d36a","observation_id":"37144f7e-171b-4166-bd00-422bda31f9b5","resolution":{"observed_at":"2026-08-05T12:14:57.020374Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:13.568809+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:13.568809+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:59.951408Z","title":"Autonomous Pseudospectral Knot ting Methods for Space Mission Optimiza- tion,","venue":null,"work_id":"b44b1852-bc93-4535-b5a2-2715b025cd25","year":2006},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.386680Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:9f3887f0dfec44074c0285623540f529702f71435b96855dba4861c8cad4f287","observation_id":"a90103e1-a59c-4219-9786-264c34209f22","resolution":{"observed_at":"2026-08-05T12:15:00.037877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/1.32908","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Spectral Algorithm fo r Pseudospectral Methods in Optimal Con- trol,","venue":"Journal of Guidance Control and Dynamics","work_id":"68db9279-ad83-4326-baa0-97b3cedac91e","year":2008},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.396557Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:e84f9a1494f17df771027008058a98a47edf141886eb33f5c6a3919cb5d32b50","observation_id":"71d5bc98-bb56-417a-b65e-e464d4f39aac","resolution":{"observed_at":"2026-08-05T12:14:56.966569Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-14T21:08:13.398383+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T21:08:13.398383+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:59.808188Z","title":"hp-Adaptive Discontinuous Galerkin Finite Element Methods for First-Order Hyperbolic Problems,","venue":null,"work_id":"cd287a9b-581c-437c-97c6-bab0274fd03c","year":2001},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.424165Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:69bcf61d0415ef391f8f5712d3790d785c72a345af80e5eb4499be67a031a91b","observation_id":"28178565-4d2f-41c8-9d83-1af0d2221615","resolution":{"observed_at":"2026-08-05T12:14:59.897697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:59.651408Z","title":"Spec- tral/hp Element Methods: Recent Developments, Applicatio ns, and Perspectives,","venue":null,"work_id":"961f74f1-27d0-4af8-9f13-7adc81e1d405","year":2018},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.431153Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:f07a9050ac7e129669926aabb387cd9445f521fddb013f88e8d23f9eff5b5a63","observation_id":"c10fe6e2-2573-4332-a9ee-7384349c8a93","resolution":{"observed_at":"2026-08-05T12:14:59.723645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:59.525979Z","title":"Pseudospectral Optimal Control and its Convergence Theorems,","venue":null,"work_id":"4354fb05-5ba2-45bf-aa32-d43befb8374b","year":2008},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.442097Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:aaecc500070867efa59349b81dcfb1b1b3d8eed1db2f5632ed18ca35c9755a03","observation_id":"930355ec-03c6-4c8e-a318-e946c6effe1c","resolution":{"observed_at":"2026-08-05T12:14:59.572463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11768-010-9104-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Rate of Convergence for a Legendre Pseudospec tral Optimal Control of Feedback Lin- earizable Systems,","venue":"Journal of Control Theory and Applications","work_id":"e7e20b45-634a-4b3f-855c-bf077311eb76","year":2010},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.468723Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:21f94f35916187a9c1e202956bcfa19ae136342f4e9ca060eb896e2096204108","observation_id":"c31a94e6-df85-4fba-bbf0-eae0359fc8b5","resolution":{"observed_at":"2026-08-05T12:14:56.881749Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:56.481652Z","title":"Solving Sparse Linear System s Faster than Matrix Multiplication,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.481652Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:6c2f2a81a67288f2c4434c1ed58731c5abc52d2a6969361c6361b2c22312b38d","observation_id":"fc4f0431-a9d5-4b8f-bdd0-57a45ee94034","resolution":{"observed_at":"2026-08-05T12:14:56.481652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T12:14:56.492354Z","title":"Solve for x: Technical Pespective,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.492354Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:c6bc7e4d0558f61adf198026c150171286cf412e0798b72964c58dfcfdac9039","observation_id":"bbcc6c41-d5ac-4a3d-af58-6cd8e28d02ae","resolution":{"observed_at":"2026-08-05T12:14:56.492354Z","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-05T12:14:59.328576Z","title":null,"venue":null,"work_id":"046bb7cd-3525-43ab-898a-30737dae4674","year":1997},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.506731Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:e11320033232ef96228fb2ad93667dc295746fb24d54898d02fd9556a5f48aad","observation_id":"0f381741-3d60-4ba1-85db-567d39090767","resolution":{"observed_at":"2026-08-05T12:14:59.428254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:59.162569Z","title":"Golub and C","venue":null,"work_id":"e79af0db-8b11-4350-8a53-12952d5e93b8","year":2013},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.513007Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:5bcbe281cf88d0abf109d4794b76d4b1cb6411ce1029276e3b44919bb8c082b7","observation_id":"908f292c-1379-4017-9284-34ccd6fc9f2f","resolution":{"observed_at":"2026-08-05T12:14:59.243330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:59.075360Z","title":null,"venue":null,"work_id":"0d9fc5e3-3a5a-44d7-9426-3eab90b22cb0","year":2003},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.521381Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:a6e4b46728151333c9443cf3d8e2d6f1f0900e133b094598f41bdbdaeca7eb56","observation_id":"5263085e-c6b3-44a1-89b5-d6dac076903d","resolution":{"observed_at":"2026-08-05T12:14:59.120527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:58.891141Z","title":null,"venue":null,"work_id":"c792f73e-36ce-451f-b40f-26293a7f08dc","year":1999},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.534548Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:e779f1bda6aeb16454e3b3c27c21dceed760567dc062b783ba56df71b0517ffd","observation_id":"7e5d54aa-b82e-4f9b-81c3-eb8b390f0595","resolution":{"observed_at":"2026-08-05T12:14:58.971256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:58.720812Z","title":"gmres: Solve System of Linear Equa tions – Generalized Minimimum Residual Method,","venue":null,"work_id":"20f527e5-8411-4c15-973d-0ce3a3beceac","year":2024},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.547407Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:f9181747a968df34e3d93b01b0cfd39cfbdd729057c32b4cc7ed3eeccf55c238","observation_id":"b16ae869-41f9-4cff-a517-caec51fd5d54","resolution":{"observed_at":"2026-08-05T12:14:58.795401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.12810","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T12:14:57.970011Z","title":"A Universal Bir khoff Pseudospectral Method for Solv- ing Boundary V alue Problems,","venue":null,"work_id":"8455fa9e-7bfa-4b08-9fd8-82ba3d2f3d0c","year":2023},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.570701Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:8a54a897a848866b33f36a04c5f9d2d868007c6db705d17c8cac0e7366c7075d","observation_id":"a3f2a2b0-0983-46a1-88d2-bc6e7ee1e4e9","resolution":{"observed_at":"2026-08-05T12:14:57.988574Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:58.530077Z","title":"Clarke, Functional Analysis, Calculus of V ariations and Optimal Co ntrol, Springer-V erlag, London, 2013","venue":null,"work_id":"25981492-e656-46f3-b6d5-afbd203c7a3c","year":2013},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.584070Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:478014f0c689443d8f7e078ccc27fd8e2bc50c21e27c0a4ae46a5a670d70ad2c","observation_id":"a33175d6-78ab-4600-8ca6-1d451a4f6a6f","resolution":{"observed_at":"2026-08-05T12:14:58.618849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:58.333711Z","title":null,"venue":null,"work_id":"847a2196-1bbc-4991-a56a-f471cf7e35a3","year":2000},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.590910Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:4e6495874ab1f42c3bebdb1feb24b923fa6e96531da020dfacd8fe88defebb1e","observation_id":"67bfa5be-c5fb-444e-8985-9d8b5550e6a6","resolution":{"observed_at":"2026-08-05T12:14:58.432587Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13112","last_updated":"2020-06-14T21:50:16Z","snapshot_observed_at":"2026-08-12T08:43:40.345541Z","submitted_at":"2020-04-27T19:25:06Z","title":"Enhancements to the DIDO Optimal Control Toolbox","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13112","snapshot_observed_at":"2026-08-05T12:14:56.602921Z","title":"Enhancements to the DIDO Optimal Control To olbox,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.602921Z"},"links":{"cited_paper":"/paper/2004.13112","citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:b58f988734854c42582b0d0588548bb3cc40aeebb98e20da4f6f44a5545c3081","observation_id":"0476691b-daa8-4210-a5d7-67dd4ed43b88","resolution":{"observed_at":"2026-08-05T12:14:56.602921Z","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-05T12:14:58.202159Z","title":null,"venue":null,"work_id":"de0f4d1a-51cf-4abc-9b74-7b8ac311916a","year":2024},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.643048Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:0485a4a7652cdeb082f6efac38dcb23133f3b4c1e1d9121832c0e39b5f0adf30","observation_id":"5b37611f-649b-4474-8f8a-1de938fbdf66","resolution":{"observed_at":"2026-08-05T12:14:58.250821Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T12:14:58.124819Z","title":"Algorithm 832: UMFP ACK V4.3—An Unsymmetric-Pattern Multifrontal Method,","venue":null,"work_id":"e792a743-3212-4a69-a0b4-bc424a1efd16","year":2004},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.662487Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:98925aac88755decb14330ecf7153cea97069623bdd95c18aac3d9478c8deb80","observation_id":"d8cac0b3-ff76-47bb-b2ce-8f64a68f7376","resolution":{"observed_at":"2026-08-05T12:14:58.155280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-74358-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"a9fae1ea-115b-46ba-8c47-38ee0ac4923f","year":null},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":126,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.448825Z"},"links":{"citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:1ea7cac59ee47e0b8c4a553fb5ad938fe2838932227dcb2a25a93b1a45dba00f","observation_id":"2538ba58-aaeb-4e1e-83c9-d2611741812b","resolution":{"observed_at":"2026-08-05T12:14:56.922432Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13112","last_updated":"2020-06-14T21:50:16Z","snapshot_observed_at":"2026-08-12T08:43:40.345541Z","submitted_at":"2020-04-27T19:25:06Z","title":"Enhancements to the DIDO Optimal Control Toolbox","version":2},"cited_work":{"arxiv_id":"2004.13112","doi":"10.48550/arxiv.2004.13112","metadata_source":"pith","pith_arxiv_id":"2004.13112","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Enhancements to the DIDO Optimal Control Toolbox","venue":"math.OC","work_id":"806eed55-6b77-429d-8725-f835279ea4ff","year":2020},"citing_paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T12:14:56.629611Z"},"links":{"cited_paper":"/paper/2004.13112","citing_paper":"/paper/2509.01855"},"observation_digest":"sha256:f73466cfff99d254cdbbe213cf7a963e02ee3b69317bb80843da15b89509a718","observation_id":"dcfe14ff-d505-485b-bbff-35230f7b7fc6","resolution":{"observed_at":"2026-08-05T12:14:56.772356Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.01855","last_updated":"2025-09-02T00:47:59Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-12T06:41:44.427904Z","submitted_at":"2025-09-02T00:47:59Z","title":"A Million-Point Fast Trajectory Optimization Solver"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":14,"verified_exact":14,"verified_fuzzy":14},"total_outbound_references":44},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 1 inbound Pith citation observation for arXiv:2509.01855."}