{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EHWKBDFW5UOU6Q4MBRVC7RH7DB","short_pith_number":"pith:EHWKBDFW","canonical_record":{"source":{"id":"1608.03845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-08-12T16:47:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7b66c3382246e430dd023148aa6ca0505f6755403e10466fda239f7e3e5f69a8","abstract_canon_sha256":"7fcbc9a63054f1fe1e272d764f2ea4331f57396e64350245776abb2826887759"},"schema_version":"1.0"},"canonical_sha256":"21eca08cb6ed1d4f438c0c6a2fc4ff18653cb2e873a8f7f00854520211bd81fb","source":{"kind":"arxiv","id":"1608.03845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03845","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03845v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03845","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"EHWKBDFW5UOU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHWKBDFW5UOU6Q4M","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHWKBDFW","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EHWKBDFW5UOU6Q4MBRVC7RH7DB","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-08-12T16:47:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7b66c3382246e430dd023148aa6ca0505f6755403e10466fda239f7e3e5f69a8","abstract_canon_sha256":"7fcbc9a63054f1fe1e272d764f2ea4331f57396e64350245776abb2826887759"},"schema_version":"1.0"},"canonical_sha256":"21eca08cb6ed1d4f438c0c6a2fc4ff18653cb2e873a8f7f00854520211bd81fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.200175Z","signature_b64":"+Uu0acLQjLt8ux9dGH9z8cOwDi/lr08+ec+W+sT+FbHgYE/Y9Eaq3+1FJ5lK+rpvgDUfBKDBtTtvYd6vhNWcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21eca08cb6ed1d4f438c0c6a2fc4ff18653cb2e873a8f7f00854520211bd81fb","last_reissued_at":"2026-05-18T01:09:11.199533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.199533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03845","source_version":1,"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-05-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNvykds0xtGMPWpLAHjNyc3Mr1IDBD5zxOnyF1EE/JOneLCMm2PIPzNabAGTcyr6bMZIrTeZWbjJnd9mAUS5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:27:54.133236Z"},"content_sha256":"f63b7ec1fb2c6f207f4ec0258cecd2f66c7fc6c83d4b8418d59dd23d09430b08","schema_version":"1.0","event_id":"sha256:f63b7ec1fb2c6f207f4ec0258cecd2f66c7fc6c83d4b8418d59dd23d09430b08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EHWKBDFW5UOU6Q4MBRVC7RH7DB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Traversing Environments Using Possibility Graphs for Humanoid Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Aaron D. Ames, C. Karen Liu, Michael X. Grey","submitted_at":"2016-08-12T16:47:01Z","abstract_excerpt":"Locomotion for legged robots poses considerable challenges when confronted by obstacles and adverse environments. Footstep planners are typically only designed for one mode of locomotion, but traversing unfavorable environments may require several forms of locomotion to be sequenced together, such as walking, crawling, and jumping. Multi-modal motion planners can be used to address some of these problems, but existing implementations tend to be time-consuming and are limited to quasi-static actions. This paper presents a motion planning method to traverse complex environments using multiple ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03845","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":""},"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-05-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAk359TfCVP0QpO+nGgyCeVq+a3/xiKwNVqyYTcCZLm9C0TtCEDeJNN/17bTqcPPFkjVH47qriokqpje/TIRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:27:54.133600Z"},"content_sha256":"64a32c5e20212f96e7eb9fb10339a6d1c7f89ae4ae23f5a8b7aeb00310056d39","schema_version":"1.0","event_id":"sha256:64a32c5e20212f96e7eb9fb10339a6d1c7f89ae4ae23f5a8b7aeb00310056d39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHWKBDFW5UOU6Q4MBRVC7RH7DB/bundle.json","state_url":"https://pith.science/pith/EHWKBDFW5UOU6Q4MBRVC7RH7DB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHWKBDFW5UOU6Q4MBRVC7RH7DB/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-06-10T20:27:54Z","links":{"resolver":"https://pith.science/pith/EHWKBDFW5UOU6Q4MBRVC7RH7DB","bundle":"https://pith.science/pith/EHWKBDFW5UOU6Q4MBRVC7RH7DB/bundle.json","state":"https://pith.science/pith/EHWKBDFW5UOU6Q4MBRVC7RH7DB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHWKBDFW5UOU6Q4MBRVC7RH7DB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EHWKBDFW5UOU6Q4MBRVC7RH7DB","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":"7fcbc9a63054f1fe1e272d764f2ea4331f57396e64350245776abb2826887759","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-08-12T16:47:01Z","title_canon_sha256":"7b66c3382246e430dd023148aa6ca0505f6755403e10466fda239f7e3e5f69a8"},"schema_version":"1.0","source":{"id":"1608.03845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03845","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03845v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03845","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"EHWKBDFW5UOU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHWKBDFW5UOU6Q4M","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHWKBDFW","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:64a32c5e20212f96e7eb9fb10339a6d1c7f89ae4ae23f5a8b7aeb00310056d39","target":"graph","created_at":"2026-05-18T01:09:11Z","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"},"paper":{"abstract_excerpt":"Locomotion for legged robots poses considerable challenges when confronted by obstacles and adverse environments. Footstep planners are typically only designed for one mode of locomotion, but traversing unfavorable environments may require several forms of locomotion to be sequenced together, such as walking, crawling, and jumping. Multi-modal motion planners can be used to address some of these problems, but existing implementations tend to be time-consuming and are limited to quasi-static actions. This paper presents a motion planning method to traverse complex environments using multiple ca","authors_text":"Aaron D. Ames, C. Karen Liu, Michael X. Grey","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-08-12T16:47:01Z","title":"Traversing Environments Using Possibility Graphs for Humanoid Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03845","kind":"arxiv","version":1},"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:f63b7ec1fb2c6f207f4ec0258cecd2f66c7fc6c83d4b8418d59dd23d09430b08","target":"record","created_at":"2026-05-18T01:09:11Z","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":"7fcbc9a63054f1fe1e272d764f2ea4331f57396e64350245776abb2826887759","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-08-12T16:47:01Z","title_canon_sha256":"7b66c3382246e430dd023148aa6ca0505f6755403e10466fda239f7e3e5f69a8"},"schema_version":"1.0","source":{"id":"1608.03845","kind":"arxiv","version":1}},"canonical_sha256":"21eca08cb6ed1d4f438c0c6a2fc4ff18653cb2e873a8f7f00854520211bd81fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21eca08cb6ed1d4f438c0c6a2fc4ff18653cb2e873a8f7f00854520211bd81fb","first_computed_at":"2026-05-18T01:09:11.199533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.199533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Uu0acLQjLt8ux9dGH9z8cOwDi/lr08+ec+W+sT+FbHgYE/Y9Eaq3+1FJ5lK+rpvgDUfBKDBtTtvYd6vhNWcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.200175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f63b7ec1fb2c6f207f4ec0258cecd2f66c7fc6c83d4b8418d59dd23d09430b08","sha256:64a32c5e20212f96e7eb9fb10339a6d1c7f89ae4ae23f5a8b7aeb00310056d39"],"state_sha256":"5c72dc243096e0ae6953b1f7263429cd195e76712e269db6792c36c41050744b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0HLuz2pbtpCPZajKG/W9DyKvhw0Sk2V7DIelC5fgwz2g+cxPEUu+A0KK8+06eBdoxQwIy+nU3dWCx8jP+JjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:27:54.135558Z","bundle_sha256":"04a79da13ec47f83c2339a19d2a9658db6793a2e90db4a6d7c1396ee42985a21"}}