{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JMFNPYOIWPTIZMBCDIAL5TXLJU","short_pith_number":"pith:JMFNPYOI","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"},"canonical_sha256":"4b0ad7e1c8b3e68cb0221a00beceeb4d0366578a7580af700a344ab5e3fb495e","source":{"kind":"arxiv","id":"1404.5643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5643","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5643v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5643","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"JMFNPYOIWPTI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JMFNPYOIWPTIZMBC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JMFNPYOI","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JMFNPYOIWPTIZMBCDIAL5TXLJU","target":"record","payload":{"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"},"canonical_sha256":"4b0ad7e1c8b3e68cb0221a00beceeb4d0366578a7580af700a344ab5e3fb495e","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"},"source_kind":"arxiv","source_id":"1404.5643","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-05-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yovxLqMxQjax1kCokeuBmFsu6sBfi2nYE+W9uDGMjeURxfPx9hp59RN7zx/bIcRwI9rltqCAeO+5r+rNXCGWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:16:39.550568Z"},"content_sha256":"7fc547e9775952b19e44238cc8ee8bb8a0441ad29461810bf54d877a9c2af0f1","schema_version":"1.0","event_id":"sha256:7fc547e9775952b19e44238cc8ee8bb8a0441ad29461810bf54d877a9c2af0f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JMFNPYOIWPTIZMBCDIAL5TXLJU","target":"graph","payload":{"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"},"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-05-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cOVCwSCvlr+OAHxPdCxQYxYomLrVoFBykUOzCeYGJLcm3zlTouMt4cSNqckFbdimPC/Drg2BCOxL7R+T+3uAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:16:39.551204Z"},"content_sha256":"4fc26329e437ef8d660933fcf4b5cea3a1db2b7ec493056d48e8380951e1302c","schema_version":"1.0","event_id":"sha256:4fc26329e437ef8d660933fcf4b5cea3a1db2b7ec493056d48e8380951e1302c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/bundle.json","state_url":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/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-08T14:16:39Z","links":{"resolver":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU","bundle":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/bundle.json","state":"https://pith.science/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMFNPYOIWPTIZMBCDIAL5TXLJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JMFNPYOIWPTIZMBCDIAL5TXLJU","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":"f1a67d1b4a3e6a1e587ee3a51f7542b58d06ef0a2f1b235c555973f797ae4824","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-22T20:46:32Z","title_canon_sha256":"5c87815c905c14d1765a9664e39ba79417f02af2432d0cdcc4525035ef9fcd01"},"schema_version":"1.0","source":{"id":"1404.5643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5643","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5643v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5643","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"JMFNPYOIWPTI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JMFNPYOIWPTIZMBC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JMFNPYOI","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:4fc26329e437ef8d660933fcf4b5cea3a1db2b7ec493056d48e8380951e1302c","target":"graph","created_at":"2026-05-18T02:53:28Z","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"},"paper":{"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 ","authors_text":"Subbarao Kambhampati, Yu Zhang","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-22T20:46:32Z","title":"A Formal Analysis of Required Cooperation in Multi-agent Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5643","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:7fc547e9775952b19e44238cc8ee8bb8a0441ad29461810bf54d877a9c2af0f1","target":"record","created_at":"2026-05-18T02:53:28Z","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":"f1a67d1b4a3e6a1e587ee3a51f7542b58d06ef0a2f1b235c555973f797ae4824","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-22T20:46:32Z","title_canon_sha256":"5c87815c905c14d1765a9664e39ba79417f02af2432d0cdcc4525035ef9fcd01"},"schema_version":"1.0","source":{"id":"1404.5643","kind":"arxiv","version":1}},"canonical_sha256":"4b0ad7e1c8b3e68cb0221a00beceeb4d0366578a7580af700a344ab5e3fb495e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b0ad7e1c8b3e68cb0221a00beceeb4d0366578a7580af700a344ab5e3fb495e","first_computed_at":"2026-05-18T02:53:28.296424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:28.296424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FIbSqQ0VYzD3UgG8xobSiEFjkqPVaqyVb8OYChJLj5LxRPTWZ9Ry715mjiuFGMCmnsakG7faiHzqkQ65yGg3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:28.297163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fc547e9775952b19e44238cc8ee8bb8a0441ad29461810bf54d877a9c2af0f1","sha256:4fc26329e437ef8d660933fcf4b5cea3a1db2b7ec493056d48e8380951e1302c"],"state_sha256":"7611ffb73a61f0241f58c241fbd6ed107edab2a11f11c1838955c0d6b8f7e9a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/ENl8n2JuQelaqY0YcygmD4ew8Bxi5dVEprN7bCAez8PUJGzCJakmCSGJfPW26eYhYB2TiMWjlXuUplKpBNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:16:39.554502Z","bundle_sha256":"db60453be4c577094d66b10d16a847b954a56ad214514f4d1976ffdb1724fc8a"}}