{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZCESGMDW2UELAOK2G3THRGS7CZ","short_pith_number":"pith:ZCESGMDW","schema_version":"1.0","canonical_sha256":"c889233076d508b0395a36e6789a5f166bb20d76927c0e8345fee794b68cf1b7","source":{"kind":"arxiv","id":"2409.18707","version":4},"attestation_state":"computed","paper":{"title":"Discrete Policy: Learning Disentangled Action Space for Multi-Task Robotic Manipulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jian Tang, Jinming Li, Junjie Wen, Kun Wu, Ning Liu, Yichen Zhu, Zhiyuan Xu","submitted_at":"2024-09-27T12:50:52Z","abstract_excerpt":"Learning visuomotor policy for multi-task robotic manipulation has been a long-standing challenge for the robotics community. The difficulty lies in the diversity of action space: typically, a goal can be accomplished in multiple ways, resulting in a multimodal action distribution for a single task. The complexity of action distribution escalates as the number of tasks increases. In this work, we propose \\textbf{Discrete Policy}, a robot learning method for training universal agents capable of multi-task manipulation skills. Discrete Policy employs vector quantization to map action sequences i"},"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.18707","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-27T12:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"3d2ca5df0b30691b228b7a08a581a4de970a318614c18e2e9dc1ee9c889da4e1","abstract_canon_sha256":"d2aa7b46e63cd5f2ebd9e098551ac26f05901b4c520399ff93f283bb52095e96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:36:29.190381Z","signature_b64":"0TNAGLDTZT7Qpf5oY8UJz2C1s7FzUT/OcdpwF6NxSrYbJReDRO1hnRLV0AiRKO9cKyMXkFUdKOJHhvyIRtwJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c889233076d508b0395a36e6789a5f166bb20d76927c0e8345fee794b68cf1b7","last_reissued_at":"2026-07-05T10:36:29.189286Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:36:29.189286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Policy: Learning Disentangled Action Space for Multi-Task Robotic Manipulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jian Tang, Jinming Li, Junjie Wen, Kun Wu, Ning Liu, Yichen Zhu, Zhiyuan Xu","submitted_at":"2024-09-27T12:50:52Z","abstract_excerpt":"Learning visuomotor policy for multi-task robotic manipulation has been a long-standing challenge for the robotics community. The difficulty lies in the diversity of action space: typically, a goal can be accomplished in multiple ways, resulting in a multimodal action distribution for a single task. The complexity of action distribution escalates as the number of tasks increases. In this work, we propose \\textbf{Discrete Policy}, a robot learning method for training universal agents capable of multi-task manipulation skills. Discrete Policy employs vector quantization to map action sequences i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.18707","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.18707/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.18707","created_at":"2026-07-05T10:36:29.189413+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.18707v4","created_at":"2026-07-05T10:36:29.189413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.18707","created_at":"2026-07-05T10:36:29.189413+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCESGMDW2UEL","created_at":"2026-07-05T10:36:29.189413+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCESGMDW2UELAOK2","created_at":"2026-07-05T10:36:29.189413+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCESGMDW","created_at":"2026-07-05T10:36:29.189413+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.05855","citing_title":"DexVLA: Vision-Language Model with Plug-In Diffusion Expert for General Robot Control","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ","json":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ.json","graph_json":"https://pith.science/api/pith-number/ZCESGMDW2UELAOK2G3THRGS7CZ/graph.json","events_json":"https://pith.science/api/pith-number/ZCESGMDW2UELAOK2G3THRGS7CZ/events.json","paper":"https://pith.science/paper/ZCESGMDW"},"agent_actions":{"view_html":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ","download_json":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ.json","view_paper":"https://pith.science/paper/ZCESGMDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.18707&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCESGMDW2UELAOK2G3THRGS7CZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCESGMDW2UELAOK2G3THRGS7CZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZCESGMDW2UELAOK2G3THRGS7CZ/action/replication_record"}},"created_at":"2026-07-05T10:36:29.189413+00:00","updated_at":"2026-07-05T10:36:29.189413+00:00"}