{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LE7CEBCJR4DASJI74EJEWFFQLO","short_pith_number":"pith:LE7CEBCJ","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"},"canonical_sha256":"593e2204498f0609251fe1124b14b05bb5426d83122905185aaf808a61cbd77d","source":{"kind":"arxiv","id":"2606.01533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01533","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01533v1","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01533","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"LE7CEBCJR4DA","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"LE7CEBCJR4DASJI7","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"LE7CEBCJ","created_at":"2026-06-02T02:04:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LE7CEBCJR4DASJI74EJEWFFQLO","target":"record","payload":{"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"},"canonical_sha256":"593e2204498f0609251fe1124b14b05bb5426d83122905185aaf808a61cbd77d","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"},"source_kind":"arxiv","source_id":"2606.01533","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2X26KVZ85H8p7gylDM7yNZ0WLh+hIxsGUryg6WFaozkcZq7f6s3a94KxXAtL9ErsYs4CBAxqy3dPr2n9ioenCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:39:13.988112Z"},"content_sha256":"889daefaf3638196a0deace5608e6caf4a870b70877c4fdfcf1ed2ed79e59786","schema_version":"1.0","event_id":"sha256:889daefaf3638196a0deace5608e6caf4a870b70877c4fdfcf1ed2ed79e59786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LE7CEBCJR4DASJI74EJEWFFQLO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVdDcRskOJRfRbcGdnoBYPFBD+uOBTwde7ElX7iyYGVOs8JF6u7KwqjYv0hUml24Cx1FX5JORm6zyFGTvpMmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:39:13.988501Z"},"content_sha256":"566c414398f624c59bbafd68d87ce05770abbc453db78e6ec5bcc49f586c2c1b","schema_version":"1.0","event_id":"sha256:566c414398f624c59bbafd68d87ce05770abbc453db78e6ec5bcc49f586c2c1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/bundle.json","state_url":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LE7CEBCJR4DASJI74EJEWFFQLO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T01:39:13Z","links":{"resolver":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO","bundle":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/bundle.json","state":"https://pith.science/pith/LE7CEBCJR4DASJI74EJEWFFQLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LE7CEBCJR4DASJI74EJEWFFQLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LE7CEBCJR4DASJI74EJEWFFQLO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"327faca28b16816b05406ae2449e2c862671cf6787108c6e039ae51c7b0a63d9","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-06-01T01:29:36Z","title_canon_sha256":"21c56d0a0b95e64370c7244a14efae2a0d4e9ae8c6b4ff85f5b14298f4e06bda"},"schema_version":"1.0","source":{"id":"2606.01533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01533","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01533v1","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01533","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"LE7CEBCJR4DA","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"LE7CEBCJR4DASJI7","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"LE7CEBCJ","created_at":"2026-06-02T02:04:35Z"}],"graph_snapshots":[{"event_id":"sha256:566c414398f624c59bbafd68d87ce05770abbc453db78e6ec5bcc49f586c2c1b","target":"graph","created_at":"2026-06-02T02:04:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.01533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Daniel Fried, Jing Yu Koh, Ruslan Salakhutdinov","cross_cats":["cs.CL","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-06-01T01:29:36Z","title":"Multi-Agent Computer Use"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01533","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:889daefaf3638196a0deace5608e6caf4a870b70877c4fdfcf1ed2ed79e59786","target":"record","created_at":"2026-06-02T02:04:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"327faca28b16816b05406ae2449e2c862671cf6787108c6e039ae51c7b0a63d9","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-06-01T01:29:36Z","title_canon_sha256":"21c56d0a0b95e64370c7244a14efae2a0d4e9ae8c6b4ff85f5b14298f4e06bda"},"schema_version":"1.0","source":{"id":"2606.01533","kind":"arxiv","version":1}},"canonical_sha256":"593e2204498f0609251fe1124b14b05bb5426d83122905185aaf808a61cbd77d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"593e2204498f0609251fe1124b14b05bb5426d83122905185aaf808a61cbd77d","first_computed_at":"2026-06-02T02:04:35.758916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:35.758916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2TduXahG/p89tdN9XB8KuViYSSQX4oyLr7adA7bdLs9uA5jB5IOVHKUGFa3V2FrC8wdEAsFSGxrddMq1yp/CA==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:35.759296Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:889daefaf3638196a0deace5608e6caf4a870b70877c4fdfcf1ed2ed79e59786","sha256:566c414398f624c59bbafd68d87ce05770abbc453db78e6ec5bcc49f586c2c1b"],"state_sha256":"51a22804d40603d11db44b12760260678a2dd6af11efa60163a0ae78d272017e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gccYY/N6hXXjc4WlzU9iMoIBl1OpNyNSBlh9U+2dFR0/6WtkkRMeXWYDnLfM/ZMEnXMBhoy1/2Xe4pkNVonCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:39:13.990546Z","bundle_sha256":"bc88d5757197f13afe3a8bb0dac14da15ce6048435e525ebb5197b8b1825e161"}}