{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UUCPM7KHX546VMF22JQR7MZXUK","short_pith_number":"pith:UUCPM7KH","schema_version":"1.0","canonical_sha256":"a504f67d47bf79eab0bad2611fb337a2931b21be63cfa06606faef08b72765c8","source":{"kind":"arxiv","id":"2409.14562","version":4},"attestation_state":"computed","paper":{"title":"DROP: Dexterous Reorientation via Online Planning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aaron D. Ames, Albert H. Li, Preston Culbertson, Vince Kurtz","submitted_at":"2024-09-22T19:00:53Z","abstract_excerpt":"Achieving human-like dexterity is a longstanding challenge in robotics, in part due to the complexity of planning and control for contact-rich systems. In reinforcement learning (RL), one popular approach has been to use massively-parallelized, domain-randomized simulations to learn a policy offline over a vast array of contact conditions, allowing robust sim-to-real transfer. Inspired by recent advances in real-time parallel simulation, this work considers instead the viability of online planning methods for contact-rich manipulation by studying the well-known in-hand cube reorientation task."},"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":"2409.14562","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-22T19:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"31cf2c49a6dc9abad7c49aa7554978f304ab0a3fe23de16598d642ee48fdb95f","abstract_canon_sha256":"98a92ef155d03953c33318f34cbb8e52835f23b87a20469f467a2614a9993824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:24:54.692162Z","signature_b64":"rowgq6j0HubCUhujBiB6l4vTMk5IH9HrF/2PajNUg1Jx5oonWSfOrJ/qYxguQ/TWLWnsKQ3ziuHpbqOmZW7CAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a504f67d47bf79eab0bad2611fb337a2931b21be63cfa06606faef08b72765c8","last_reissued_at":"2026-07-05T10:24:54.691653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:24:54.691653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DROP: Dexterous Reorientation via Online Planning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aaron D. Ames, Albert H. Li, Preston Culbertson, Vince Kurtz","submitted_at":"2024-09-22T19:00:53Z","abstract_excerpt":"Achieving human-like dexterity is a longstanding challenge in robotics, in part due to the complexity of planning and control for contact-rich systems. In reinforcement learning (RL), one popular approach has been to use massively-parallelized, domain-randomized simulations to learn a policy offline over a vast array of contact conditions, allowing robust sim-to-real transfer. Inspired by recent advances in real-time parallel simulation, this work considers instead the viability of online planning methods for contact-rich manipulation by studying the well-known in-hand cube reorientation task."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14562","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.14562/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.14562","created_at":"2026-07-05T10:24:54.691714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.14562v4","created_at":"2026-07-05T10:24:54.691714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14562","created_at":"2026-07-05T10:24:54.691714+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUCPM7KHX546","created_at":"2026-07-05T10:24:54.691714+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUCPM7KHX546VMF2","created_at":"2026-07-05T10:24:54.691714+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUCPM7KH","created_at":"2026-07-05T10:24:54.691714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.13350","citing_title":"Approximating Global Contact-Implicit MPC via Sampling and Local Complementarity","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":134,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08508","citing_title":"Sumo: Dynamic and Generalizable Whole-Body Loco-Manipulation","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK","json":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK.json","graph_json":"https://pith.science/api/pith-number/UUCPM7KHX546VMF22JQR7MZXUK/graph.json","events_json":"https://pith.science/api/pith-number/UUCPM7KHX546VMF22JQR7MZXUK/events.json","paper":"https://pith.science/paper/UUCPM7KH"},"agent_actions":{"view_html":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK","download_json":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK.json","view_paper":"https://pith.science/paper/UUCPM7KH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.14562&json=true","fetch_graph":"https://pith.science/api/pith-number/UUCPM7KHX546VMF22JQR7MZXUK/graph.json","fetch_events":"https://pith.science/api/pith-number/UUCPM7KHX546VMF22JQR7MZXUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK/action/storage_attestation","attest_author":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK/action/author_attestation","sign_citation":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK/action/citation_signature","submit_replication":"https://pith.science/pith/UUCPM7KHX546VMF22JQR7MZXUK/action/replication_record"}},"created_at":"2026-07-05T10:24:54.691714+00:00","updated_at":"2026-07-05T10:24:54.691714+00:00"}