{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OW3YGJAYZH6KD2RGQQ65Y2VR2Z","short_pith_number":"pith:OW3YGJAY","schema_version":"1.0","canonical_sha256":"75b7832418c9fca1ea26843ddc6ab1d66b1f9fe055bddd46a3afaff88e515096","source":{"kind":"arxiv","id":"2508.12928","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Contact Sequence and Patch Planning for Dynamic Locomotion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Haizhou Zhao, Majid Khadiv, Victor Dh\\'edin","submitted_at":"2025-08-18T13:53:38Z","abstract_excerpt":"Legged robots have the potential to traverse highly constrained environments with agile maneuvers. However, planning such motions requires solving a highly challenging optimization problem with a mixture of continuous and discrete decision variables. In this paper, we present a full pipeline based on Monte-Carlo tree search (MCTS) and whole-body trajectory optimization (TO) to perform simultaneous contact sequence and patch selection on highly challenging environments. Through extensive simulation experiments, we show that our framework can quickly find a diverse set of dynamically consistent "},"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":"2508.12928","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-18T13:53:38Z","cross_cats_sorted":[],"title_canon_sha256":"1f67f08c0ef4ba2be734b88d82e655d1e57688121e01be88e25ed9853dc83919","abstract_canon_sha256":"a8f5a4b84da21774f1613b080c8b658787e13342175619cada3cecbdcfaa6369"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:29.360956Z","signature_b64":"+7FEKmP7ylUxIy2Y3mhGCEg02K7+2EsRw9nRQV2vI+xU4SkDoqaT+ZWwVIR5ckRiu5rs8mNGvKE9uW85p3prDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b7832418c9fca1ea26843ddc6ab1d66b1f9fe055bddd46a3afaff88e515096","last_reissued_at":"2026-07-05T11:55:29.360455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:29.360455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Contact Sequence and Patch Planning for Dynamic Locomotion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Haizhou Zhao, Majid Khadiv, Victor Dh\\'edin","submitted_at":"2025-08-18T13:53:38Z","abstract_excerpt":"Legged robots have the potential to traverse highly constrained environments with agile maneuvers. However, planning such motions requires solving a highly challenging optimization problem with a mixture of continuous and discrete decision variables. In this paper, we present a full pipeline based on Monte-Carlo tree search (MCTS) and whole-body trajectory optimization (TO) to perform simultaneous contact sequence and patch selection on highly challenging environments. Through extensive simulation experiments, we show that our framework can quickly find a diverse set of dynamically consistent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12928","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/2508.12928/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":"2508.12928","created_at":"2026-07-05T11:55:29.360512+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12928v1","created_at":"2026-07-05T11:55:29.360512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12928","created_at":"2026-07-05T11:55:29.360512+00:00"},{"alias_kind":"pith_short_12","alias_value":"OW3YGJAYZH6K","created_at":"2026-07-05T11:55:29.360512+00:00"},{"alias_kind":"pith_short_16","alias_value":"OW3YGJAYZH6KD2RG","created_at":"2026-07-05T11:55:29.360512+00:00"},{"alias_kind":"pith_short_8","alias_value":"OW3YGJAY","created_at":"2026-07-05T11:55:29.360512+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/OW3YGJAYZH6KD2RGQQ65Y2VR2Z","json":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z.json","graph_json":"https://pith.science/api/pith-number/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/graph.json","events_json":"https://pith.science/api/pith-number/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/events.json","paper":"https://pith.science/paper/OW3YGJAY"},"agent_actions":{"view_html":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z","download_json":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z.json","view_paper":"https://pith.science/paper/OW3YGJAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12928&json=true","fetch_graph":"https://pith.science/api/pith-number/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/action/storage_attestation","attest_author":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/action/author_attestation","sign_citation":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/action/citation_signature","submit_replication":"https://pith.science/pith/OW3YGJAYZH6KD2RGQQ65Y2VR2Z/action/replication_record"}},"created_at":"2026-07-05T11:55:29.360512+00:00","updated_at":"2026-07-05T11:55:29.360512+00:00"}