{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GHSYK4GSFWX54EQMZAF2ZYUJHR","short_pith_number":"pith:GHSYK4GS","schema_version":"1.0","canonical_sha256":"31e58570d22dafde120cc80bace2893c476e955a786b9d0044a4a6dffc38c380","source":{"kind":"arxiv","id":"1711.09057","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Multi-Agent Planning: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Alejandro Torre\\~no, Anton\\'in Komenda, Eva Onaindia, Michal \\v{S}tolba","submitted_at":"2017-11-24T17:43:14Z","abstract_excerpt":"Cooperative multi-agent planning (MAP) is a relatively recent research field that combines technologies, algorithms and techniques developed by the Artificial Intelligence Planning and Multi-Agent Systems communities. While planning has been generally treated as a single-agent task, MAP generalizes this concept by considering multiple intelligent agents that work cooperatively to develop a course of action that satisfies the goals of the group.\n  This paper reviews the most relevant approaches to MAP, putting the focus on the solvers that took part in the 2015 Competition of Distributed and Mu"},"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":"1711.09057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-24T17:43:14Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"dee8282027e9235aa122f29f614aaad20c9679fd6ff87435f62cf81f2158f141","abstract_canon_sha256":"cfe88de68741dc2af9df806d75f5caaae405860400eb3f914a903104a61eeb77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:41.363939Z","signature_b64":"K4KDbsw7YoNLKtdsy/MQpumeKo2/GGo0lU0Ylr6n/62pI26hRG7SrcmbrKUYfSF4/U12tNPhvnzKwYpmMv8FAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31e58570d22dafde120cc80bace2893c476e955a786b9d0044a4a6dffc38c380","last_reissued_at":"2026-05-18T00:29:41.363263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:41.363263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Multi-Agent Planning: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Alejandro Torre\\~no, Anton\\'in Komenda, Eva Onaindia, Michal \\v{S}tolba","submitted_at":"2017-11-24T17:43:14Z","abstract_excerpt":"Cooperative multi-agent planning (MAP) is a relatively recent research field that combines technologies, algorithms and techniques developed by the Artificial Intelligence Planning and Multi-Agent Systems communities. While planning has been generally treated as a single-agent task, MAP generalizes this concept by considering multiple intelligent agents that work cooperatively to develop a course of action that satisfies the goals of the group.\n  This paper reviews the most relevant approaches to MAP, putting the focus on the solvers that took part in the 2015 Competition of Distributed and Mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09057","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":"1711.09057","created_at":"2026-05-18T00:29:41.363414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09057v1","created_at":"2026-05-18T00:29:41.363414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09057","created_at":"2026-05-18T00:29:41.363414+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHSYK4GSFWX5","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHSYK4GSFWX54EQM","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHSYK4GS","created_at":"2026-05-18T12:31:18.294218+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/GHSYK4GSFWX54EQMZAF2ZYUJHR","json":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR.json","graph_json":"https://pith.science/api/pith-number/GHSYK4GSFWX54EQMZAF2ZYUJHR/graph.json","events_json":"https://pith.science/api/pith-number/GHSYK4GSFWX54EQMZAF2ZYUJHR/events.json","paper":"https://pith.science/paper/GHSYK4GS"},"agent_actions":{"view_html":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR","download_json":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR.json","view_paper":"https://pith.science/paper/GHSYK4GS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09057&json=true","fetch_graph":"https://pith.science/api/pith-number/GHSYK4GSFWX54EQMZAF2ZYUJHR/graph.json","fetch_events":"https://pith.science/api/pith-number/GHSYK4GSFWX54EQMZAF2ZYUJHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR/action/storage_attestation","attest_author":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR/action/author_attestation","sign_citation":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR/action/citation_signature","submit_replication":"https://pith.science/pith/GHSYK4GSFWX54EQMZAF2ZYUJHR/action/replication_record"}},"created_at":"2026-05-18T00:29:41.363414+00:00","updated_at":"2026-05-18T00:29:41.363414+00:00"}