{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SOOCUQCLMQUYSHCTFBWWW32RKK","short_pith_number":"pith:SOOCUQCL","canonical_record":{"source":{"id":"1702.00425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-02-01T19:27:11Z","cross_cats_sorted":[],"title_canon_sha256":"100be00d7b2210ac5dd0fc7b03096b0fe274f6e833122f56db9f705f3fe3f0dd","abstract_canon_sha256":"d6493831ae41b7849831d702574dd8042d751a151a6ba3aef05887db4ed0d5ab"},"schema_version":"1.0"},"canonical_sha256":"939c2a404b6429891c53286d6b6f51528b4242e09970d300a6bbf5bc3f6325a8","source":{"kind":"arxiv","id":"1702.00425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00425","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00425v1","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00425","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"SOOCUQCLMQUY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOOCUQCLMQUYSHCT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOOCUQCL","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SOOCUQCLMQUYSHCTFBWWW32RKK","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-02-01T19:27:11Z","cross_cats_sorted":[],"title_canon_sha256":"100be00d7b2210ac5dd0fc7b03096b0fe274f6e833122f56db9f705f3fe3f0dd","abstract_canon_sha256":"d6493831ae41b7849831d702574dd8042d751a151a6ba3aef05887db4ed0d5ab"},"schema_version":"1.0"},"canonical_sha256":"939c2a404b6429891c53286d6b6f51528b4242e09970d300a6bbf5bc3f6325a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:33.572366Z","signature_b64":"OVOzm3knqRNtMGavvMj3t0uwmy/0JzYwtwzKIP76Dq9/9D3SWaT1Q7TdWp6LX8tBJ5sm0XUDHONMTTx60i8ADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"939c2a404b6429891c53286d6b6f51528b4242e09970d300a6bbf5bc3f6325a8","last_reissued_at":"2026-05-18T00:51:33.571950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:33.571950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00425","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:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYbaiLHCMgw8qpo4sNP/nOmHEgzJDYItv1BGS2o1Xa27CLaoOfDF3VJjkqOKJ40VoHGmlT2q2SCy2ugkoVoHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:01:55.834213Z"},"content_sha256":"6378cedf91458375fad17a86af4e532c267f529f7bd2df8e4c8ec30253f37653","schema_version":"1.0","event_id":"sha256:6378cedf91458375fad17a86af4e532c267f529f7bd2df8e4c8ec30253f37653"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SOOCUQCLMQUYSHCTFBWWW32RKK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Completeness of Randomized Possibility Graphs Applied to Bipedal Walking in Semi-unstructured Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aaron D. Ames, C. Karen Liu, Michael X. Grey","submitted_at":"2017-02-01T19:27:11Z","abstract_excerpt":"We present a theoretical analysis of a recent whole body motion planning method, the Randomized Possibility Graph, which uses a high-level decomposition of the feasibility constraint manifold in order to rapidly find routes that may lead to a solution. These routes are then examined by lower-level planners to determine feasibility. In this paper, we show that this approach is probabilistically complete for bipedal robots performing quasi-static walking in \"semi-unstructured\" environments. Furthermore, we show that the decomposition into higher and lower level planners allows for a considerably"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00425","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:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm4O3KCRsP66Gvop46xsnNTXpGf4Qs/8HBoKxfP9qGaopwjOZTWjNMNndnSAmfHKFhBvWURaPnkN/mEeHJrlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:01:55.834810Z"},"content_sha256":"c6a520d27564c5c03af235d8b303d68471649194827f129cd790c9d080130f12","schema_version":"1.0","event_id":"sha256:c6a520d27564c5c03af235d8b303d68471649194827f129cd790c9d080130f12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/bundle.json","state_url":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/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-11T02:01:55Z","links":{"resolver":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK","bundle":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/bundle.json","state":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SOOCUQCLMQUYSHCTFBWWW32RKK","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":"d6493831ae41b7849831d702574dd8042d751a151a6ba3aef05887db4ed0d5ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-02-01T19:27:11Z","title_canon_sha256":"100be00d7b2210ac5dd0fc7b03096b0fe274f6e833122f56db9f705f3fe3f0dd"},"schema_version":"1.0","source":{"id":"1702.00425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00425","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00425v1","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00425","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"SOOCUQCLMQUY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOOCUQCLMQUYSHCT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOOCUQCL","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:c6a520d27564c5c03af235d8b303d68471649194827f129cd790c9d080130f12","target":"graph","created_at":"2026-05-18T00:51:33Z","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":"We present a theoretical analysis of a recent whole body motion planning method, the Randomized Possibility Graph, which uses a high-level decomposition of the feasibility constraint manifold in order to rapidly find routes that may lead to a solution. These routes are then examined by lower-level planners to determine feasibility. In this paper, we show that this approach is probabilistically complete for bipedal robots performing quasi-static walking in \"semi-unstructured\" environments. Furthermore, we show that the decomposition into higher and lower level planners allows for a considerably","authors_text":"Aaron D. Ames, C. Karen Liu, Michael X. Grey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-02-01T19:27:11Z","title":"Probabilistic Completeness of Randomized Possibility Graphs Applied to Bipedal Walking in Semi-unstructured Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00425","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:6378cedf91458375fad17a86af4e532c267f529f7bd2df8e4c8ec30253f37653","target":"record","created_at":"2026-05-18T00:51:33Z","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":"d6493831ae41b7849831d702574dd8042d751a151a6ba3aef05887db4ed0d5ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-02-01T19:27:11Z","title_canon_sha256":"100be00d7b2210ac5dd0fc7b03096b0fe274f6e833122f56db9f705f3fe3f0dd"},"schema_version":"1.0","source":{"id":"1702.00425","kind":"arxiv","version":1}},"canonical_sha256":"939c2a404b6429891c53286d6b6f51528b4242e09970d300a6bbf5bc3f6325a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"939c2a404b6429891c53286d6b6f51528b4242e09970d300a6bbf5bc3f6325a8","first_computed_at":"2026-05-18T00:51:33.571950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:33.571950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OVOzm3knqRNtMGavvMj3t0uwmy/0JzYwtwzKIP76Dq9/9D3SWaT1Q7TdWp6LX8tBJ5sm0XUDHONMTTx60i8ADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:33.572366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6378cedf91458375fad17a86af4e532c267f529f7bd2df8e4c8ec30253f37653","sha256:c6a520d27564c5c03af235d8b303d68471649194827f129cd790c9d080130f12"],"state_sha256":"1ab7e4ec68b7eb03ab5554fdf3ebf0295d3a3322837a9d5d8dc381988df78933"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"orxxQdtnCgHfrrvl9LbEOHceQr8Gqhwra2LzFbrhoyoDoH0RjhjUTPDBI0hBexgPWaLEPnok4gV/sYDfv1z0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:01:55.837860Z","bundle_sha256":"9d9e6b314e27a949fc256800c67a145999d46b2042054d96e60d9bdb07ba51cb"}}