{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EHKS4C2OPLXJ4ZYTGWDVNJMDLM","short_pith_number":"pith:EHKS4C2O","schema_version":"1.0","canonical_sha256":"21d52e0b4e7aee9e6713358756a5835b05223d5af735be71a76e3c9e9ade9afa","source":{"kind":"arxiv","id":"2406.09953","version":4},"attestation_state":"computed","paper":{"title":"DAG-Plan: Generating Directed Acyclic Dependency Graphs for Dual-Arm Cooperative Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Chengkai Hou, Jinye Qu, Lingyue Guo, Mengkang Hu, Ping Luo, Shanghang Zhang, Shijia Peng, Yanfeng Lu, Yao Mu, Zeyu Gao","submitted_at":"2024-06-14T11:58:51Z","abstract_excerpt":"Dual-arm robots promise greater efficiency but require planning for complex tasks with nonlinear sub-task dependencies. Current methods using Large Language Models (LLMs) suffer from a fundamental trade-off: generating linear sequences is efficient but fails to model parallelism and adapt to changes, while iterative querying is adaptive but too slow and costly. To bridge this gap, we introduce DAG-Plan, a novel task planning framework that for the first time employs a Directed Acyclic Graph (DAG) as the central representation for dual-arm coordination. The key insight is that a DAG natively ca"},"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":"2406.09953","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-14T11:58:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9a517eb179ba2120f2661bbed52d3ce9707a1d7cb96812d3d99fc93113c0c32d","abstract_canon_sha256":"483f79cc05bb9d234c363a4b1c60127fb784075b22db7902e9bd5517dc969840"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:28.810454Z","signature_b64":"HK1JJclVsKpcRXjQ91yEhpPaICt7mEY2Kvpbhxyt/DDrS7NbRP443yAOyMo3wj0b6TRB0QOqKbWrJJpc7xsKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21d52e0b4e7aee9e6713358756a5835b05223d5af735be71a76e3c9e9ade9afa","last_reissued_at":"2026-06-02T01:03:28.809987Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:28.809987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DAG-Plan: Generating Directed Acyclic Dependency Graphs for Dual-Arm Cooperative Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Chengkai Hou, Jinye Qu, Lingyue Guo, Mengkang Hu, Ping Luo, Shanghang Zhang, Shijia Peng, Yanfeng Lu, Yao Mu, Zeyu Gao","submitted_at":"2024-06-14T11:58:51Z","abstract_excerpt":"Dual-arm robots promise greater efficiency but require planning for complex tasks with nonlinear sub-task dependencies. Current methods using Large Language Models (LLMs) suffer from a fundamental trade-off: generating linear sequences is efficient but fails to model parallelism and adapt to changes, while iterative querying is adaptive but too slow and costly. To bridge this gap, we introduce DAG-Plan, a novel task planning framework that for the first time employs a Directed Acyclic Graph (DAG) as the central representation for dual-arm coordination. The key insight is that a DAG natively ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09953","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/2406.09953/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":"2406.09953","created_at":"2026-06-02T01:03:28.810037+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.09953v4","created_at":"2026-06-02T01:03:28.810037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09953","created_at":"2026-06-02T01:03:28.810037+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHKS4C2OPLXJ","created_at":"2026-06-02T01:03:28.810037+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHKS4C2OPLXJ4ZYT","created_at":"2026-06-02T01:03:28.810037+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHKS4C2O","created_at":"2026-06-02T01:03:28.810037+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/EHKS4C2OPLXJ4ZYTGWDVNJMDLM","json":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM.json","graph_json":"https://pith.science/api/pith-number/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/graph.json","events_json":"https://pith.science/api/pith-number/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/events.json","paper":"https://pith.science/paper/EHKS4C2O"},"agent_actions":{"view_html":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM","download_json":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM.json","view_paper":"https://pith.science/paper/EHKS4C2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.09953&json=true","fetch_graph":"https://pith.science/api/pith-number/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/graph.json","fetch_events":"https://pith.science/api/pith-number/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/action/storage_attestation","attest_author":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/action/author_attestation","sign_citation":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/action/citation_signature","submit_replication":"https://pith.science/pith/EHKS4C2OPLXJ4ZYTGWDVNJMDLM/action/replication_record"}},"created_at":"2026-06-02T01:03:28.810037+00:00","updated_at":"2026-06-02T01:03:28.810037+00:00"}