{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JMFNPYOIWPTIZMBCDIAL5TXLJU","short_pith_number":"pith:JMFNPYOI","schema_version":"1.0","canonical_sha256":"4b0ad7e1c8b3e68cb0221a00beceeb4d0366578a7580af700a344ab5e3fb495e","source":{"kind":"arxiv","id":"1404.5643","version":1},"attestation_state":"computed","paper":{"title":"A Formal Analysis of Required Cooperation in Multi-agent Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Subbarao Kambhampati, Yu Zhang","submitted_at":"2014-04-22T20:46:32Z","abstract_excerpt":"Research on multi-agent planning has been popular in recent years. While previous research has been motivated by the understanding that, through cooperation, multi-agent systems can achieve tasks that are unachievable by single-agent systems, there are no formal characterizations of situations where cooperation is required to achieve a goal, thus warranting the application of multi-agent systems. In this paper, we provide such a formal discussion from the planning aspect. We first show that determining whether there is required cooperation (RC) is intractable is general. Then, by dividing the "},"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":"1404.5643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-22T20:46:32Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"5c87815c905c14d1765a9664e39ba79417f02af2432d0cdcc4525035ef9fcd01","abstract_canon_sha256":"f1a67d1b4a3e6a1e587ee3a51f7542b58d06ef0a2f1b235c555973f797ae4824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.297163Z","signature_b64":"FIbSqQ0VYzD3UgG8xobSiEFjkqPVaqyVb8OYChJLj5LxRPTWZ9Ry715mjiuFGMCmnsakG7faiHzqkQ65yGg3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b0ad7e1c8b3e68cb0221a00beceeb4d0366578a7580af700a344ab5e3fb495e","last_reissued_at":"2026-05-18T02:53:28.296424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.296424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Formal Analysis of Required Cooperation in Multi-agent Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Subbarao Kambhampati, Yu Zhang","submitted_at":"2014-04-22T20:46:32Z","abstract_excerpt":"Research on multi-agent planning has been popular in recent years. While previous research has been motivated by the understanding that, through cooperation, multi-agent systems can achieve tasks that are unachievable by single-agent systems, there are no formal characterizations of situations where cooperation is required to achieve a goal, thus warranting the application of multi-agent systems. In this paper, we provide such a formal discussion from the planning aspect. We first show that determining whether there is required cooperation (RC) is intractable is general. Then, by dividing the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5643","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":""},"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":"1404.5643","created_at":"2026-05-18T02:53:28.296552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5643v1","created_at":"2026-05-18T02:53:28.296552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5643","created_at":"2026-05-18T02:53:28.296552+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMFNPYOIWPTI","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMFNPYOIWPTIZMBC","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMFNPYOI","created_at":"2026-05-18T12:28:33.132498+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/JMFNPYOIWPTIZMBCDIAL5TXLJU","json":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU.json","graph_json":"https://pith.science/api/pith-number/JMFNPYOIWPTIZMBCDIAL5TXLJU/graph.json","events_json":"https://pith.science/api/pith-number/JMFNPYOIWPTIZMBCDIAL5TXLJU/events.json","paper":"https://pith.science/paper/JMFNPYOI"},"agent_actions":{"view_html":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU","download_json":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU.json","view_paper":"https://pith.science/paper/JMFNPYOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5643&json=true","fetch_graph":"https://pith.science/api/pith-number/JMFNPYOIWPTIZMBCDIAL5TXLJU/graph.json","fetch_events":"https://pith.science/api/pith-number/JMFNPYOIWPTIZMBCDIAL5TXLJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/action/storage_attestation","attest_author":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/action/author_attestation","sign_citation":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/action/citation_signature","submit_replication":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/action/replication_record"}},"created_at":"2026-05-18T02:53:28.296552+00:00","updated_at":"2026-05-18T02:53:28.296552+00:00"}