{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZXO3GN7R2DJ4EQE5ONOWV3YS56","short_pith_number":"pith:ZXO3GN7R","schema_version":"1.0","canonical_sha256":"cdddb337f1d0d3c2409d735d6aef12ef9a488fb1603844b676ead86e043b6f69","source":{"kind":"arxiv","id":"2605.19089","version":1},"attestation_state":"computed","paper":{"title":"Reachability-Augmented Dual Dynamic Programming for Optimal Path Parameterization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Chuxiong Hu, Jizhou Yan, Yunan Wang, Zeyang Li","submitted_at":"2026-05-18T20:26:19Z","abstract_excerpt":"Optimal path parameterization (OPP) is a fundamental problem for planning trajectories along a prescribed geometric path under kinodynamic constraints and task-dependent objectives. While TOPP minimizes traversal time, its saturating states and controls may induce vibration and tracking errors, which can be mitigated by introducing smoothness objectives. However, a key capability gap remains in OPP: feasibility guarantees, general-objective optimality certificates, and computational efficiency are difficult to achieve simultaneously in a unified framework, especially for third-order OPP (OPP3)"},"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":"2605.19089","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-18T20:26:19Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"0720a980033bb7e116263e8a331679f680a67f8c5857b56ab0faa56bd3f3fa04","abstract_canon_sha256":"6956f04d32ee10637e2c48cc02589a0f46c53f7d5b9eaccd22f694a2198a34c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:26.746467Z","signature_b64":"8Y0pIuhqrTCgjB1afyNZc37jFVD29tHAloU85cZdKbCt6xyaAqPgKQjZtrNsBDPst6niz2MEnEMOItPlpX7TBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdddb337f1d0d3c2409d735d6aef12ef9a488fb1603844b676ead86e043b6f69","last_reissued_at":"2026-05-20T01:05:26.745901Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:26.745901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability-Augmented Dual Dynamic Programming for Optimal Path Parameterization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Chuxiong Hu, Jizhou Yan, Yunan Wang, Zeyang Li","submitted_at":"2026-05-18T20:26:19Z","abstract_excerpt":"Optimal path parameterization (OPP) is a fundamental problem for planning trajectories along a prescribed geometric path under kinodynamic constraints and task-dependent objectives. While TOPP minimizes traversal time, its saturating states and controls may induce vibration and tracking errors, which can be mitigated by introducing smoothness objectives. However, a key capability gap remains in OPP: feasibility guarantees, general-objective optimality certificates, and computational efficiency are difficult to achieve simultaneously in a unified framework, especially for third-order OPP (OPP3)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19089","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/2605.19089/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":"2605.19089","created_at":"2026-05-20T01:05:26.745993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19089v1","created_at":"2026-05-20T01:05:26.745993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19089","created_at":"2026-05-20T01:05:26.745993+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXO3GN7R2DJ4","created_at":"2026-05-20T01:05:26.745993+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXO3GN7R2DJ4EQE5","created_at":"2026-05-20T01:05:26.745993+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXO3GN7R","created_at":"2026-05-20T01:05:26.745993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56","json":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56.json","graph_json":"https://pith.science/api/pith-number/ZXO3GN7R2DJ4EQE5ONOWV3YS56/graph.json","events_json":"https://pith.science/api/pith-number/ZXO3GN7R2DJ4EQE5ONOWV3YS56/events.json","paper":"https://pith.science/paper/ZXO3GN7R"},"agent_actions":{"view_html":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56","download_json":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56.json","view_paper":"https://pith.science/paper/ZXO3GN7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19089&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXO3GN7R2DJ4EQE5ONOWV3YS56/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXO3GN7R2DJ4EQE5ONOWV3YS56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56/action/storage_attestation","attest_author":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56/action/author_attestation","sign_citation":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56/action/citation_signature","submit_replication":"https://pith.science/pith/ZXO3GN7R2DJ4EQE5ONOWV3YS56/action/replication_record"}},"created_at":"2026-05-20T01:05:26.745993+00:00","updated_at":"2026-05-20T01:05:26.745993+00:00"}