{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WYAF3TRWUAJYDMUE34VE7H4EFD","short_pith_number":"pith:WYAF3TRW","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"},"canonical_sha256":"b6005dce36a01381b284df2a4f9f8428eb7d82f193f78f9cdcb5ff3e99b31ee6","source":{"kind":"arxiv","id":"2407.11788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.11788","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"2407.11788v2","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11788","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"WYAF3TRWUAJY","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"pith_short_16","alias_value":"WYAF3TRWUAJYDMUE","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"pith_short_8","alias_value":"WYAF3TRW","created_at":"2026-07-05T09:44:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WYAF3TRWUAJYDMUE34VE7H4EFD","target":"record","payload":{"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"},"canonical_sha256":"b6005dce36a01381b284df2a4f9f8428eb7d82f193f78f9cdcb5ff3e99b31ee6","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"},"source_kind":"arxiv","source_id":"2407.11788","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsXFwMUYvoR68FwxL92yJj+j7WKSbk34QufkSfAsHPUMKxbtZRyshtjyWXmC8JThYKUkvAbyGxpY3jlkMSjxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:46:09.481322Z"},"content_sha256":"57ed5c0c1776c8f77112d8acba3ad4668d06ce9e48b1a79d9d0edc1bcdfbe0df","schema_version":"1.0","event_id":"sha256:57ed5c0c1776c8f77112d8acba3ad4668d06ce9e48b1a79d9d0edc1bcdfbe0df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WYAF3TRWUAJYDMUE34VE7H4EFD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBBQ34zxmxf3JrXwq0KLHqHHqOQJiw0wXUTw8O7UNBM/2EcldaZU4NlXg3ZJUm0L4nHQlYdJ0oc8gimpSGeuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:46:09.481924Z"},"content_sha256":"daf09fb89c3796e5bce84c7b170dc94ec4b4d5b56bd9707cc21ef4b9b6e37fec","schema_version":"1.0","event_id":"sha256:daf09fb89c3796e5bce84c7b170dc94ec4b4d5b56bd9707cc21ef4b9b6e37fec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/bundle.json","state_url":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T22:46:09Z","links":{"resolver":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD","bundle":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/bundle.json","state":"https://pith.science/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYAF3TRWUAJYDMUE34VE7H4EFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WYAF3TRWUAJYDMUE34VE7H4EFD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"10eecabad1beef936539d6af103cd90ee960cbec528490fd0460ae1b6eaa10ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-16T14:44:48Z","title_canon_sha256":"9753950bf718f032a1637572e73a4a4ce4e25fdc0e88a33074770a0ab0aa95ef"},"schema_version":"1.0","source":{"id":"2407.11788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.11788","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"2407.11788v2","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11788","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"WYAF3TRWUAJY","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"pith_short_16","alias_value":"WYAF3TRWUAJYDMUE","created_at":"2026-07-05T09:44:13Z"},{"alias_kind":"pith_short_8","alias_value":"WYAF3TRW","created_at":"2026-07-05T09:44:13Z"}],"graph_snapshots":[{"event_id":"sha256:daf09fb89c3796e5bce84c7b170dc94ec4b4d5b56bd9707cc21ef4b9b6e37fec","target":"graph","created_at":"2026-07-05T09:44:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.11788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ivan Laptev, Majid Khadiv, Rikhat Akizhanov, Victor Dh\\'edin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-16T14:44:48Z","title":"Learning feasible transitions for efficient contact planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11788","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57ed5c0c1776c8f77112d8acba3ad4668d06ce9e48b1a79d9d0edc1bcdfbe0df","target":"record","created_at":"2026-07-05T09:44:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"10eecabad1beef936539d6af103cd90ee960cbec528490fd0460ae1b6eaa10ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-16T14:44:48Z","title_canon_sha256":"9753950bf718f032a1637572e73a4a4ce4e25fdc0e88a33074770a0ab0aa95ef"},"schema_version":"1.0","source":{"id":"2407.11788","kind":"arxiv","version":2}},"canonical_sha256":"b6005dce36a01381b284df2a4f9f8428eb7d82f193f78f9cdcb5ff3e99b31ee6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6005dce36a01381b284df2a4f9f8428eb7d82f193f78f9cdcb5ff3e99b31ee6","first_computed_at":"2026-07-05T09:44:13.169183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:44:13.169183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kmF1p/pUUfPMGaTGXYu8aIbr2q0ybJgtak4qKkBPrwGgGo5Jnd72dAvqlDMyIWbCpMSQCWWfCTz11SwUCLnrBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:44:13.169683Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.11788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57ed5c0c1776c8f77112d8acba3ad4668d06ce9e48b1a79d9d0edc1bcdfbe0df","sha256:daf09fb89c3796e5bce84c7b170dc94ec4b4d5b56bd9707cc21ef4b9b6e37fec"],"state_sha256":"a8b25fae55a2bf714e8ad0a9bfe10c711ee95fab5cbe2477ea658005ff8e1b0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TuDTlUYu7j/tcfbFwzNOd1HPcUPJu+fuzIjU5F3QZpFz3zMxn5hmJkwCFMN+VyvNFlUWjd8ZKQKcUYVwPWy/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T22:46:09.487524Z","bundle_sha256":"4f8f7b0d35214832b02061774e5cdca44ed086b15424e9b8d262eb4d1d747b3c"}}