{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SOOCUQCLMQUYSHCTFBWWW32RKK","short_pith_number":"pith:SOOCUQCL","schema_version":"1.0","canonical_sha256":"939c2a404b6429891c53286d6b6f51528b4242e09970d300a6bbf5bc3f6325a8","source":{"kind":"arxiv","id":"1702.00425","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.00425","created_at":"2026-05-18T00:51:33.572008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00425v1","created_at":"2026-05-18T00:51:33.572008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00425","created_at":"2026-05-18T00:51:33.572008+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOOCUQCLMQUY","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOOCUQCLMQUYSHCT","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOOCUQCL","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK","json":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK.json","graph_json":"https://pith.science/api/pith-number/SOOCUQCLMQUYSHCTFBWWW32RKK/graph.json","events_json":"https://pith.science/api/pith-number/SOOCUQCLMQUYSHCTFBWWW32RKK/events.json","paper":"https://pith.science/paper/SOOCUQCL"},"agent_actions":{"view_html":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK","download_json":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK.json","view_paper":"https://pith.science/paper/SOOCUQCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00425&json=true","fetch_graph":"https://pith.science/api/pith-number/SOOCUQCLMQUYSHCTFBWWW32RKK/graph.json","fetch_events":"https://pith.science/api/pith-number/SOOCUQCLMQUYSHCTFBWWW32RKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/action/storage_attestation","attest_author":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/action/author_attestation","sign_citation":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/action/citation_signature","submit_replication":"https://pith.science/pith/SOOCUQCLMQUYSHCTFBWWW32RKK/action/replication_record"}},"created_at":"2026-05-18T00:51:33.572008+00:00","updated_at":"2026-05-18T00:51:33.572008+00:00"}