{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MO5LQSKG3FTMHVY45I3UDGJUX4","short_pith_number":"pith:MO5LQSKG","canonical_record":{"source":{"id":"1801.10225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-30T21:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"d977d7e2b8531964d75c26014f7740638db1146019cc55d31e573e26a52d38d5","abstract_canon_sha256":"de6c9e9155973f385581e7429e3ba7726bc6754f0ce825aa2707f63fc6035aee"},"schema_version":"1.0"},"canonical_sha256":"63bab84946d966c3d71cea37419934bf12ac7fa1f802877e5b89707e59d3b6ce","source":{"kind":"arxiv","id":"1801.10225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10225","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10225v1","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10225","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"MO5LQSKG3FTM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MO5LQSKG3FTMHVY4","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MO5LQSKG","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MO5LQSKG3FTMHVY45I3UDGJUX4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.10225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-30T21:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"d977d7e2b8531964d75c26014f7740638db1146019cc55d31e573e26a52d38d5","abstract_canon_sha256":"de6c9e9155973f385581e7429e3ba7726bc6754f0ce825aa2707f63fc6035aee"},"schema_version":"1.0"},"canonical_sha256":"63bab84946d966c3d71cea37419934bf12ac7fa1f802877e5b89707e59d3b6ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:41.399400Z","signature_b64":"5L4rrVefO2PnHjYsYP3OTMKU5xzUBQL6l6J9UVxW+4hKQVpR43KQjOCqXLp3hD4rraXgU6N+Lo750cBk6fxnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63bab84946d966c3d71cea37419934bf12ac7fa1f802877e5b89707e59d3b6ce","last_reissued_at":"2026-05-18T00:24:41.398727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:41.398727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.10225","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-18T00:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goU4s4ErfadTteNJD48hQ3dznoV4LgqlltDGCy6zEctPLJgKAUuLP2Oe+uYriVi6Jo62C5zMl1pPCk2ojsxwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:02:56.728607Z"},"content_sha256":"ea2a51c14216a48b218a319ca73e9c18763b35b1eed2d17ae54c18c35b02b055","schema_version":"1.0","event_id":"sha256:ea2a51c14216a48b218a319ca73e9c18763b35b1eed2d17ae54c18c35b02b055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MO5LQSKG3FTMHVY45I3UDGJUX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Single-Planner Approach to Multi-Modal Humanoid Mobility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andrew Dornbush, Fahad Islam, Karthik Vijayakumar, Maxim Likhachev, Sameer Bardapurkar","submitted_at":"2018-01-30T21:02:47Z","abstract_excerpt":"In this work, we present an approach to planning for humanoid mobility. Humanoid mobility is a challenging problem, as the configuration space for a humanoid robot is intractably large, especially if the robot is capable of performing many types of locomotion. For example, a humanoid robot may be able to perform such tasks as bipedal walking, crawling, and climbing. Our approach is to plan for all these tasks within a single search process. This allows the search to reason about all the capabilities of the robot at any point, and to derive the complete solution such that the plan is guaranteed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10225","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-18T00:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bo7unkegKvJV/TOFJWYTKEdGMNTkdwWkwpFdRFrLO2P9/trmBN3eLL61SaaEvs3R19vKxg2sM1FDHPTrLBNGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:02:56.729147Z"},"content_sha256":"7cf32f68c62e67d8575d1f58032454c0dd3f85b03616f418579a4f6842b89570","schema_version":"1.0","event_id":"sha256:7cf32f68c62e67d8575d1f58032454c0dd3f85b03616f418579a4f6842b89570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MO5LQSKG3FTMHVY45I3UDGJUX4/bundle.json","state_url":"https://pith.science/pith/MO5LQSKG3FTMHVY45I3UDGJUX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MO5LQSKG3FTMHVY45I3UDGJUX4/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-09T16:02:56Z","links":{"resolver":"https://pith.science/pith/MO5LQSKG3FTMHVY45I3UDGJUX4","bundle":"https://pith.science/pith/MO5LQSKG3FTMHVY45I3UDGJUX4/bundle.json","state":"https://pith.science/pith/MO5LQSKG3FTMHVY45I3UDGJUX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MO5LQSKG3FTMHVY45I3UDGJUX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MO5LQSKG3FTMHVY45I3UDGJUX4","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":"de6c9e9155973f385581e7429e3ba7726bc6754f0ce825aa2707f63fc6035aee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-30T21:02:47Z","title_canon_sha256":"d977d7e2b8531964d75c26014f7740638db1146019cc55d31e573e26a52d38d5"},"schema_version":"1.0","source":{"id":"1801.10225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10225","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10225v1","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10225","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"MO5LQSKG3FTM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MO5LQSKG3FTMHVY4","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MO5LQSKG","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:7cf32f68c62e67d8575d1f58032454c0dd3f85b03616f418579a4f6842b89570","target":"graph","created_at":"2026-05-18T00:24:41Z","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":"In this work, we present an approach to planning for humanoid mobility. Humanoid mobility is a challenging problem, as the configuration space for a humanoid robot is intractably large, especially if the robot is capable of performing many types of locomotion. For example, a humanoid robot may be able to perform such tasks as bipedal walking, crawling, and climbing. Our approach is to plan for all these tasks within a single search process. This allows the search to reason about all the capabilities of the robot at any point, and to derive the complete solution such that the plan is guaranteed","authors_text":"Andrew Dornbush, Fahad Islam, Karthik Vijayakumar, Maxim Likhachev, Sameer Bardapurkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-30T21:02:47Z","title":"A Single-Planner Approach to Multi-Modal Humanoid Mobility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10225","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:ea2a51c14216a48b218a319ca73e9c18763b35b1eed2d17ae54c18c35b02b055","target":"record","created_at":"2026-05-18T00:24:41Z","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":"de6c9e9155973f385581e7429e3ba7726bc6754f0ce825aa2707f63fc6035aee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-01-30T21:02:47Z","title_canon_sha256":"d977d7e2b8531964d75c26014f7740638db1146019cc55d31e573e26a52d38d5"},"schema_version":"1.0","source":{"id":"1801.10225","kind":"arxiv","version":1}},"canonical_sha256":"63bab84946d966c3d71cea37419934bf12ac7fa1f802877e5b89707e59d3b6ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63bab84946d966c3d71cea37419934bf12ac7fa1f802877e5b89707e59d3b6ce","first_computed_at":"2026-05-18T00:24:41.398727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:41.398727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5L4rrVefO2PnHjYsYP3OTMKU5xzUBQL6l6J9UVxW+4hKQVpR43KQjOCqXLp3hD4rraXgU6N+Lo750cBk6fxnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:41.399400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea2a51c14216a48b218a319ca73e9c18763b35b1eed2d17ae54c18c35b02b055","sha256:7cf32f68c62e67d8575d1f58032454c0dd3f85b03616f418579a4f6842b89570"],"state_sha256":"fe65ed4cc4c41832049a0067f6fb9cdb0a0bf1e15a2d34ecb64af16121ddcad9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GhytkSrSp2RGFkTXcuPH9vy5ZCiTmD8VB2mygSdp7iLN2VirQkvu/Q+Q0KWG4Mq8DSUMpsjmb8Ldf4bOjo5ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:02:56.732910Z","bundle_sha256":"247372a8c485ea5cf0735d6a2d3576a331ad8f2f81f135361c8fb9ba09a8aa25"}}