{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MUW4RJLCDHXYHDGARLDAIJNIUD","short_pith_number":"pith:MUW4RJLC","schema_version":"1.0","canonical_sha256":"652dc8a56219ef838cc08ac60425a8a0ea2f469d8d2f77819ee786f19ed752b3","source":{"kind":"arxiv","id":"1911.12825","version":3},"attestation_state":"computed","paper":{"title":"Option-Critic in Cooperative Multi-agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.AI","authors_text":"Andrei Lupu, Doina Precup, Jhelum Chakravorty, Julien Roy, Maxime Chevalier-Boisvert, Nadeem Ward, Sumana Basu","submitted_at":"2019-11-28T18:38:19Z","abstract_excerpt":"In this paper, we investigate learning temporal abstractions in cooperative multi-agent systems, using the options framework (Sutton et al, 1999). First, we address the planning problem for the decentralized POMDP represented by the multi-agent system, by introducing a \\emph{common information approach}. We use the notion of \\emph{common beliefs} and broadcasting to solve an equivalent centralized POMDP problem. Then, we propose the Distributed Option Critic (DOC) algorithm, which uses centralized option evaluation and decentralized intra-option improvement. We theoretically analyze the asympt"},"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":"1911.12825","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-11-28T18:38:19Z","cross_cats_sorted":["cs.MA","cs.SY","eess.SY","math.OC"],"title_canon_sha256":"03c040fe22443dfeb4d51cb88ad92b5e6a2b8a68232aca1c0a91c8a375e24a37","abstract_canon_sha256":"8cdcd09064667d7e89dd03f36ba470112fbe7edd3a39de2cf710a60ed83eb3ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:25.481962Z","signature_b64":"TdvO4GKeis17XQdLAPvXQ9fADFxGu2rBGn6hy+LwKKa/xXWR2jZ77bj9p036ZZTGUrV8hd0aGSrOpCaJrunACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"652dc8a56219ef838cc08ac60425a8a0ea2f469d8d2f77819ee786f19ed752b3","last_reissued_at":"2026-07-05T00:49:25.481498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:25.481498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Option-Critic in Cooperative Multi-agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.AI","authors_text":"Andrei Lupu, Doina Precup, Jhelum Chakravorty, Julien Roy, Maxime Chevalier-Boisvert, Nadeem Ward, Sumana Basu","submitted_at":"2019-11-28T18:38:19Z","abstract_excerpt":"In this paper, we investigate learning temporal abstractions in cooperative multi-agent systems, using the options framework (Sutton et al, 1999). First, we address the planning problem for the decentralized POMDP represented by the multi-agent system, by introducing a \\emph{common information approach}. We use the notion of \\emph{common beliefs} and broadcasting to solve an equivalent centralized POMDP problem. Then, we propose the Distributed Option Critic (DOC) algorithm, which uses centralized option evaluation and decentralized intra-option improvement. We theoretically analyze the asympt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12825","kind":"arxiv","version":3},"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/1911.12825/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":"1911.12825","created_at":"2026-07-05T00:49:25.481567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.12825v3","created_at":"2026-07-05T00:49:25.481567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12825","created_at":"2026-07-05T00:49:25.481567+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUW4RJLCDHXY","created_at":"2026-07-05T00:49:25.481567+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUW4RJLCDHXYHDGA","created_at":"2026-07-05T00:49:25.481567+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUW4RJLC","created_at":"2026-07-05T00:49:25.481567+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12655","citing_title":"Robust Instruction Compliance in Cooperative Multi-Agent Reinforcement Learning","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD","json":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD.json","graph_json":"https://pith.science/api/pith-number/MUW4RJLCDHXYHDGARLDAIJNIUD/graph.json","events_json":"https://pith.science/api/pith-number/MUW4RJLCDHXYHDGARLDAIJNIUD/events.json","paper":"https://pith.science/paper/MUW4RJLC"},"agent_actions":{"view_html":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD","download_json":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD.json","view_paper":"https://pith.science/paper/MUW4RJLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.12825&json=true","fetch_graph":"https://pith.science/api/pith-number/MUW4RJLCDHXYHDGARLDAIJNIUD/graph.json","fetch_events":"https://pith.science/api/pith-number/MUW4RJLCDHXYHDGARLDAIJNIUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD/action/storage_attestation","attest_author":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD/action/author_attestation","sign_citation":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD/action/citation_signature","submit_replication":"https://pith.science/pith/MUW4RJLCDHXYHDGARLDAIJNIUD/action/replication_record"}},"created_at":"2026-07-05T00:49:25.481567+00:00","updated_at":"2026-07-05T00:49:25.481567+00:00"}