{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VCU5RA65Q3XMELWGJFQG4ZSFQM","short_pith_number":"pith:VCU5RA65","schema_version":"1.0","canonical_sha256":"a8a9d883dd86eec22ec649606e664583361e12ab2780f3214584970d4e3300df","source":{"kind":"arxiv","id":"2409.00303","version":3},"attestation_state":"computed","paper":{"title":"Rapid and Robust Trajectory Optimization for Humanoids","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bohao Zhang, Ram Vasudevan","submitted_at":"2024-08-31T00:00:39Z","abstract_excerpt":"Performing trajectory design for humanoid robots with high degrees of freedom is computationally challenging. The trajectory design process also often involves carefully selecting various hyperparameters and requires a good initial guess which can further complicate the development process. This work introduces a generalized gait optimization framework that directly generates smooth and physically feasible trajectories. The proposed method demonstrates faster and more robust convergence than existing techniques and explicitly incorporates closed-loop kinematic constraints that appear in many m"},"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":"2409.00303","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2024-08-31T00:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"00ceacebc14d03fca615c40e89cfc918fb783b44c8648e8d4728f30cd5118c55","abstract_canon_sha256":"1dfce29eaed30ca724ef871e09a4f99ce34d51f4ebbdced1d4317a688cd44311"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:04.993861Z","signature_b64":"rpcKxOIXk3eUJfJTR+IK1RbHioD+R3TO/nzgG65Ur8wgpqek7gBwRPI46eXoLuVzJravQw4LQ8ZJvljl2nstDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a9d883dd86eec22ec649606e664583361e12ab2780f3214584970d4e3300df","last_reissued_at":"2026-07-05T09:50:04.993392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:04.993392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rapid and Robust Trajectory Optimization for Humanoids","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bohao Zhang, Ram Vasudevan","submitted_at":"2024-08-31T00:00:39Z","abstract_excerpt":"Performing trajectory design for humanoid robots with high degrees of freedom is computationally challenging. The trajectory design process also often involves carefully selecting various hyperparameters and requires a good initial guess which can further complicate the development process. This work introduces a generalized gait optimization framework that directly generates smooth and physically feasible trajectories. The proposed method demonstrates faster and more robust convergence than existing techniques and explicitly incorporates closed-loop kinematic constraints that appear in many m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00303","kind":"arxiv","version":3},"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/2409.00303/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":"2409.00303","created_at":"2026-07-05T09:50:04.993453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.00303v3","created_at":"2026-07-05T09:50:04.993453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00303","created_at":"2026-07-05T09:50:04.993453+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCU5RA65Q3XM","created_at":"2026-07-05T09:50:04.993453+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCU5RA65Q3XMELWG","created_at":"2026-07-05T09:50:04.993453+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCU5RA65","created_at":"2026-07-05T09:50:04.993453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.01589","citing_title":"Phasing Through the Flames: Rapid Motion Planning with the AGHF PDE for Arbitrary Objective Functions and Constraints","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM","json":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM.json","graph_json":"https://pith.science/api/pith-number/VCU5RA65Q3XMELWGJFQG4ZSFQM/graph.json","events_json":"https://pith.science/api/pith-number/VCU5RA65Q3XMELWGJFQG4ZSFQM/events.json","paper":"https://pith.science/paper/VCU5RA65"},"agent_actions":{"view_html":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM","download_json":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM.json","view_paper":"https://pith.science/paper/VCU5RA65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.00303&json=true","fetch_graph":"https://pith.science/api/pith-number/VCU5RA65Q3XMELWGJFQG4ZSFQM/graph.json","fetch_events":"https://pith.science/api/pith-number/VCU5RA65Q3XMELWGJFQG4ZSFQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM/action/storage_attestation","attest_author":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM/action/author_attestation","sign_citation":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM/action/citation_signature","submit_replication":"https://pith.science/pith/VCU5RA65Q3XMELWGJFQG4ZSFQM/action/replication_record"}},"created_at":"2026-07-05T09:50:04.993453+00:00","updated_at":"2026-07-05T09:50:04.993453+00:00"}