{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WYAF3TRWUAJYDMUE34VE7H4EFD","short_pith_number":"pith:WYAF3TRW","schema_version":"1.0","canonical_sha256":"b6005dce36a01381b284df2a4f9f8428eb7d82f193f78f9cdcb5ff3e99b31ee6","source":{"kind":"arxiv","id":"2407.11788","version":2},"attestation_state":"computed","paper":{"title":"Learning feasible transitions for efficient contact planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ivan Laptev, Majid Khadiv, Rikhat Akizhanov, Victor Dh\\'edin","submitted_at":"2024-07-16T14:44:48Z","abstract_excerpt":"In this paper, we propose an efficient contact planner for quadrupedal robots to navigate in extremely constrained environments such as stepping stones. The main difficulty in this setting stems from the mixed nature of the problem, namely discrete search over the steppable patches and continuous trajectory optimization. To speed up the discrete search, we study the properties of the transitions from one contact mode to another. In particular, we propose to learn a dynamic feasibility classifier and a target adjustment network. The former predicts if a contact transition between two contact mo"},"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":"2407.11788","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-16T14:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"9753950bf718f032a1637572e73a4a4ce4e25fdc0e88a33074770a0ab0aa95ef","abstract_canon_sha256":"10eecabad1beef936539d6af103cd90ee960cbec528490fd0460ae1b6eaa10ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:13.169683Z","signature_b64":"kmF1p/pUUfPMGaTGXYu8aIbr2q0ybJgtak4qKkBPrwGgGo5Jnd72dAvqlDMyIWbCpMSQCWWfCTz11SwUCLnrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6005dce36a01381b284df2a4f9f8428eb7d82f193f78f9cdcb5ff3e99b31ee6","last_reissued_at":"2026-07-05T09:44:13.169183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:13.169183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning feasible transitions for efficient contact planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ivan Laptev, Majid Khadiv, Rikhat Akizhanov, Victor Dh\\'edin","submitted_at":"2024-07-16T14:44:48Z","abstract_excerpt":"In this paper, we propose an efficient contact planner for quadrupedal robots to navigate in extremely constrained environments such as stepping stones. The main difficulty in this setting stems from the mixed nature of the problem, namely discrete search over the steppable patches and continuous trajectory optimization. To speed up the discrete search, we study the properties of the transitions from one contact mode to another. In particular, we propose to learn a dynamic feasibility classifier and a target adjustment network. The former predicts if a contact transition between two contact mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11788","kind":"arxiv","version":2},"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/2407.11788/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":"2407.11788","created_at":"2026-07-05T09:44:13.169240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.11788v2","created_at":"2026-07-05T09:44:13.169240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11788","created_at":"2026-07-05T09:44:13.169240+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYAF3TRWUAJY","created_at":"2026-07-05T09:44:13.169240+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYAF3TRWUAJYDMUE","created_at":"2026-07-05T09:44:13.169240+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYAF3TRW","created_at":"2026-07-05T09:44:13.169240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.12928","citing_title":"Simultaneous Contact Sequence and Patch Planning for Dynamic Locomotion","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD","json":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD.json","graph_json":"https://pith.science/api/pith-number/WYAF3TRWUAJYDMUE34VE7H4EFD/graph.json","events_json":"https://pith.science/api/pith-number/WYAF3TRWUAJYDMUE34VE7H4EFD/events.json","paper":"https://pith.science/paper/WYAF3TRW"},"agent_actions":{"view_html":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD","download_json":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD.json","view_paper":"https://pith.science/paper/WYAF3TRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.11788&json=true","fetch_graph":"https://pith.science/api/pith-number/WYAF3TRWUAJYDMUE34VE7H4EFD/graph.json","fetch_events":"https://pith.science/api/pith-number/WYAF3TRWUAJYDMUE34VE7H4EFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/action/storage_attestation","attest_author":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/action/author_attestation","sign_citation":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/action/citation_signature","submit_replication":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/action/replication_record"}},"created_at":"2026-07-05T09:44:13.169240+00:00","updated_at":"2026-07-05T09:44:13.169240+00:00"}