{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LE7CEBCJR4DASJI74EJEWFFQLO","short_pith_number":"pith:LE7CEBCJ","schema_version":"1.0","canonical_sha256":"593e2204498f0609251fe1124b14b05bb5426d83122905185aaf808a61cbd77d","source":{"kind":"arxiv","id":"2606.01533","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Computer Use","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.MA","authors_text":"Daniel Fried, Jing Yu Koh, Ruslan Salakhutdinov","submitted_at":"2026-06-01T01:29:36Z","abstract_excerpt":"Computer use agents (CUAs) today are primarily deployed as single serial agents. This setup is suboptimal for complex long-horizon tasks that benefit from task decomposition, parallel execution, and consistent re-planning based on new information. In this paper, we argue that we should instead move towards evaluating and building multi-agent computer use (MACU) systems. These systems, which emphasize planning and parallel execution, alleviate many of the shortcomings of single-agent CUAs. We propose a general multi-agent setup in which a manager model decomposes computer use tasks as a directe"},"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":"2606.01533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-06-01T01:29:36Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"21c56d0a0b95e64370c7244a14efae2a0d4e9ae8c6b4ff85f5b14298f4e06bda","abstract_canon_sha256":"327faca28b16816b05406ae2449e2c862671cf6787108c6e039ae51c7b0a63d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:35.759296Z","signature_b64":"y2TduXahG/p89tdN9XB8KuViYSSQX4oyLr7adA7bdLs9uA5jB5IOVHKUGFa3V2FrC8wdEAsFSGxrddMq1yp/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"593e2204498f0609251fe1124b14b05bb5426d83122905185aaf808a61cbd77d","last_reissued_at":"2026-06-02T02:04:35.758916Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:35.758916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Computer Use","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.MA","authors_text":"Daniel Fried, Jing Yu Koh, Ruslan Salakhutdinov","submitted_at":"2026-06-01T01:29:36Z","abstract_excerpt":"Computer use agents (CUAs) today are primarily deployed as single serial agents. This setup is suboptimal for complex long-horizon tasks that benefit from task decomposition, parallel execution, and consistent re-planning based on new information. In this paper, we argue that we should instead move towards evaluating and building multi-agent computer use (MACU) systems. These systems, which emphasize planning and parallel execution, alleviate many of the shortcomings of single-agent CUAs. We propose a general multi-agent setup in which a manager model decomposes computer use tasks as a directe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01533","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01533/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":"2606.01533","created_at":"2026-06-02T02:04:35.758978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01533v1","created_at":"2026-06-02T02:04:35.758978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01533","created_at":"2026-06-02T02:04:35.758978+00:00"},{"alias_kind":"pith_short_12","alias_value":"LE7CEBCJR4DA","created_at":"2026-06-02T02:04:35.758978+00:00"},{"alias_kind":"pith_short_16","alias_value":"LE7CEBCJR4DASJI7","created_at":"2026-06-02T02:04:35.758978+00:00"},{"alias_kind":"pith_short_8","alias_value":"LE7CEBCJ","created_at":"2026-06-02T02:04:35.758978+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/LE7CEBCJR4DASJI74EJEWFFQLO","json":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO.json","graph_json":"https://pith.science/api/pith-number/LE7CEBCJR4DASJI74EJEWFFQLO/graph.json","events_json":"https://pith.science/api/pith-number/LE7CEBCJR4DASJI74EJEWFFQLO/events.json","paper":"https://pith.science/paper/LE7CEBCJ"},"agent_actions":{"view_html":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO","download_json":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO.json","view_paper":"https://pith.science/paper/LE7CEBCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01533&json=true","fetch_graph":"https://pith.science/api/pith-number/LE7CEBCJR4DASJI74EJEWFFQLO/graph.json","fetch_events":"https://pith.science/api/pith-number/LE7CEBCJR4DASJI74EJEWFFQLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/action/storage_attestation","attest_author":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/action/author_attestation","sign_citation":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/action/citation_signature","submit_replication":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/action/replication_record"}},"created_at":"2026-06-02T02:04:35.758978+00:00","updated_at":"2026-06-02T02:04:35.758978+00:00"}