{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JUJXUAA3VDNJ2ISCQHYGMG5HJJ","short_pith_number":"pith:JUJXUAA3","schema_version":"1.0","canonical_sha256":"4d137a001ba8da9d224281f0661ba74a48f2bf013bd01feec45b1be0ffe3e2fb","source":{"kind":"arxiv","id":"2509.01855","version":1},"attestation_state":"computed","paper":{"title":"A Million-Point Fast Trajectory Optimization Solver","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MS","cs.NA","cs.SY","eess.SY","math.OC"],"primary_cat":"math.NA","authors_text":"A. Javeed, D. P. Kouri, D. Ridzal, I. M. Ross, J. D. Steinman","submitted_at":"2025-09-02T00:47:59Z","abstract_excerpt":"One might argue that solving a trajectory optimization problem over a million grid points is preposterous. How about solving such a problem at an incredibly fast computational time? On a small form-factor processor? Algorithmic details that make possible this trifecta of breakthroughs are presented in this paper. The computational mathematics that deliver these advancements are: (i) a Birkhoff-theoretic discretization of optimal control problems, (ii) matrix-free linear algebra leveraging Krylov-subspace methods, and (iii) a near-perfect Birkhoff preconditioner that helps achieve $\\mathcal{O}("},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.01855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-02T00:47:59Z","cross_cats_sorted":["cs.MS","cs.NA","cs.SY","eess.SY","math.OC"],"title_canon_sha256":"813f7c18921d7c2c437d08d4e12318c077a71118b65cb29018890810faf99397","abstract_canon_sha256":"940aa956a574b53d706a27b24869be4b4ac000e07fc7c4658151ace9c928d925"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:10.013846Z","signature_b64":"3apGPglJeF1CRh4WVuE+dU4rfJfp+zsQ8fnt5eN3D/1G8YK7l0gRSDa5SmkWjiJx9HGps3FLyAaJUPK1lszPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d137a001ba8da9d224281f0661ba74a48f2bf013bd01feec45b1be0ffe3e2fb","last_reissued_at":"2026-07-05T12:03:10.013305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:10.013305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Million-Point Fast Trajectory Optimization Solver","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MS","cs.NA","cs.SY","eess.SY","math.OC"],"primary_cat":"math.NA","authors_text":"A. Javeed, D. P. Kouri, D. Ridzal, I. M. Ross, J. D. Steinman","submitted_at":"2025-09-02T00:47:59Z","abstract_excerpt":"One might argue that solving a trajectory optimization problem over a million grid points is preposterous. How about solving such a problem at an incredibly fast computational time? On a small form-factor processor? Algorithmic details that make possible this trifecta of breakthroughs are presented in this paper. The computational mathematics that deliver these advancements are: (i) a Birkhoff-theoretic discretization of optimal control problems, (ii) matrix-free linear algebra leveraging Krylov-subspace methods, and (iii) a near-perfect Birkhoff preconditioner that helps achieve $\\mathcal{O}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01855","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.01855/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.01855","created_at":"2026-07-05T12:03:10.013381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.01855v1","created_at":"2026-07-05T12:03:10.013381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01855","created_at":"2026-07-05T12:03:10.013381+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUJXUAA3VDNJ","created_at":"2026-07-05T12:03:10.013381+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUJXUAA3VDNJ2ISC","created_at":"2026-07-05T12:03:10.013381+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUJXUAA3","created_at":"2026-07-05T12:03:10.013381+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07815","citing_title":"Universal Birkhoff Method for Computing Extremals in the Elliptic Restricted Three-Body Problem","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ","json":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ.json","graph_json":"https://pith.science/api/pith-number/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/graph.json","events_json":"https://pith.science/api/pith-number/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/events.json","paper":"https://pith.science/paper/JUJXUAA3"},"agent_actions":{"view_html":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ","download_json":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ.json","view_paper":"https://pith.science/paper/JUJXUAA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.01855&json=true","fetch_graph":"https://pith.science/api/pith-number/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/action/storage_attestation","attest_author":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/action/author_attestation","sign_citation":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/action/citation_signature","submit_replication":"https://pith.science/pith/JUJXUAA3VDNJ2ISCQHYGMG5HJJ/action/replication_record"}},"created_at":"2026-07-05T12:03:10.013381+00:00","updated_at":"2026-07-05T12:03:10.013381+00:00"}