{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:427L2VGLX7XSTCPMMC5WSBMEOS","short_pith_number":"pith:427L2VGL","schema_version":"1.0","canonical_sha256":"e6bebd54cbbfef2989ec60bb69058474b97a7d4e41e4060c9ce15fd904af9376","source":{"kind":"arxiv","id":"1703.02905","version":2},"attestation_state":"computed","paper":{"title":"Learning a Unified Control Policy for Safe Falling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"C Karen Liu, Sehoon Ha, Visak CV Kumar","submitted_at":"2017-03-08T16:38:21Z","abstract_excerpt":"Being able to fall safely is a necessary motor skill for humanoids performing highly dynamic tasks, such as running and jumping. We propose a new method to learn a policy that minimizes the maximal impulse during the fall. The optimization solves for both a discrete contact planning problem and a continuous optimal control problem. Once trained, the policy can compute the optimal next contacting body part (e.g. left foot, right foot, or hands), contact location and timing, and the required joint actuation. We represent the policy as a mixture of actor-critic neural network, which consists of n"},"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":"1703.02905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-08T16:38:21Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"2d31793b986cf28a532db05ca1b111a5bf1cfa14e09fbcea97d7de1032cd30df","abstract_canon_sha256":"8d0f2dbdf14fffa811fd7f2c31db82936bca86f5e642ba7f3a43e17cc2ef7935"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.968467Z","signature_b64":"ifllfIKfCTcv7VRDeXXOJvUmKha6qQKwskm1WhYj4dqTJBDHY7ABBjdKTd5/7x2WiN7ra8UKG2Hbw7NvjfT3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6bebd54cbbfef2989ec60bb69058474b97a7d4e41e4060c9ce15fd904af9376","last_reissued_at":"2026-05-18T00:46:03.968088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.968088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning a Unified Control Policy for Safe Falling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"C Karen Liu, Sehoon Ha, Visak CV Kumar","submitted_at":"2017-03-08T16:38:21Z","abstract_excerpt":"Being able to fall safely is a necessary motor skill for humanoids performing highly dynamic tasks, such as running and jumping. We propose a new method to learn a policy that minimizes the maximal impulse during the fall. The optimization solves for both a discrete contact planning problem and a continuous optimal control problem. Once trained, the policy can compute the optimal next contacting body part (e.g. left foot, right foot, or hands), contact location and timing, and the required joint actuation. We represent the policy as a mixture of actor-critic neural network, which consists of n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02905","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":""},"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":"1703.02905","created_at":"2026-05-18T00:46:03.968142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02905v2","created_at":"2026-05-18T00:46:03.968142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02905","created_at":"2026-05-18T00:46:03.968142+00:00"},{"alias_kind":"pith_short_12","alias_value":"427L2VGLX7XS","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"427L2VGLX7XSTCPM","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"427L2VGL","created_at":"2026-05-18T12:30:58.224056+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/427L2VGLX7XSTCPMMC5WSBMEOS","json":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS.json","graph_json":"https://pith.science/api/pith-number/427L2VGLX7XSTCPMMC5WSBMEOS/graph.json","events_json":"https://pith.science/api/pith-number/427L2VGLX7XSTCPMMC5WSBMEOS/events.json","paper":"https://pith.science/paper/427L2VGL"},"agent_actions":{"view_html":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS","download_json":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS.json","view_paper":"https://pith.science/paper/427L2VGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02905&json=true","fetch_graph":"https://pith.science/api/pith-number/427L2VGLX7XSTCPMMC5WSBMEOS/graph.json","fetch_events":"https://pith.science/api/pith-number/427L2VGLX7XSTCPMMC5WSBMEOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS/action/storage_attestation","attest_author":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS/action/author_attestation","sign_citation":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS/action/citation_signature","submit_replication":"https://pith.science/pith/427L2VGLX7XSTCPMMC5WSBMEOS/action/replication_record"}},"created_at":"2026-05-18T00:46:03.968142+00:00","updated_at":"2026-05-18T00:46:03.968142+00:00"}