{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FUAVAZWTVKZRCTPHCTGFTRQNY7","short_pith_number":"pith:FUAVAZWT","schema_version":"1.0","canonical_sha256":"2d015066d3aab3114de714cc59c60dc7db50e49bf1dc7bdaf82d45cc90afa391","source":{"kind":"arxiv","id":"1905.08926","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Reinforcement Learning for Quadruped Locomotion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Atil Iscen, Deepali Jain, Ken Caluwaerts","submitted_at":"2019-05-22T02:28:39Z","abstract_excerpt":"Legged locomotion is a challenging task for learning algorithms, especially when the task requires a diverse set of primitive behaviors. To solve these problems, we introduce a hierarchical framework to automatically decompose complex locomotion tasks. A high-level policy issues commands in a latent space and also selects for how long the low-level policy will execute the latent command. Concurrently, the low-level policy uses the latent command and only the robot's on-board sensors to control the robot's actuators. Our approach allows the high-level policy to run at a lower frequency than the"},"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":"1905.08926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-22T02:28:39Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"93a57cdeba7bf25b9b4b24e4887242cb33c47fa883bd02ce5dfbd5a8173fc6ec","abstract_canon_sha256":"c72f7fe541a5bcfb1f0b9d4cd1ffa5598573bcb226353cb2ae8ab5c320228f77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:24.841658Z","signature_b64":"tppHtaHMDr5Hc4HIzpTe6cKX9SxwN9GFVGTfVEJns0SPyPux+hq7Wm4PwDqX822D3kLPARxAYFdIsyqDgrORAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d015066d3aab3114de714cc59c60dc7db50e49bf1dc7bdaf82d45cc90afa391","last_reissued_at":"2026-05-17T23:45:24.841286Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:24.841286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Reinforcement Learning for Quadruped Locomotion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Atil Iscen, Deepali Jain, Ken Caluwaerts","submitted_at":"2019-05-22T02:28:39Z","abstract_excerpt":"Legged locomotion is a challenging task for learning algorithms, especially when the task requires a diverse set of primitive behaviors. To solve these problems, we introduce a hierarchical framework to automatically decompose complex locomotion tasks. A high-level policy issues commands in a latent space and also selects for how long the low-level policy will execute the latent command. Concurrently, the low-level policy uses the latent command and only the robot's on-board sensors to control the robot's actuators. Our approach allows the high-level policy to run at a lower frequency than the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08926","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":"1905.08926","created_at":"2026-05-17T23:45:24.841346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08926v1","created_at":"2026-05-17T23:45:24.841346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08926","created_at":"2026-05-17T23:45:24.841346+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUAVAZWTVKZR","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUAVAZWTVKZRCTPH","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUAVAZWT","created_at":"2026-05-18T12:33:15.570797+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/FUAVAZWTVKZRCTPHCTGFTRQNY7","json":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7.json","graph_json":"https://pith.science/api/pith-number/FUAVAZWTVKZRCTPHCTGFTRQNY7/graph.json","events_json":"https://pith.science/api/pith-number/FUAVAZWTVKZRCTPHCTGFTRQNY7/events.json","paper":"https://pith.science/paper/FUAVAZWT"},"agent_actions":{"view_html":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7","download_json":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7.json","view_paper":"https://pith.science/paper/FUAVAZWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08926&json=true","fetch_graph":"https://pith.science/api/pith-number/FUAVAZWTVKZRCTPHCTGFTRQNY7/graph.json","fetch_events":"https://pith.science/api/pith-number/FUAVAZWTVKZRCTPHCTGFTRQNY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7/action/storage_attestation","attest_author":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7/action/author_attestation","sign_citation":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7/action/citation_signature","submit_replication":"https://pith.science/pith/FUAVAZWTVKZRCTPHCTGFTRQNY7/action/replication_record"}},"created_at":"2026-05-17T23:45:24.841346+00:00","updated_at":"2026-05-17T23:45:24.841346+00:00"}