{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TQR4HGXPATQBWRLLL4XFYSRXSJ","short_pith_number":"pith:TQR4HGXP","schema_version":"1.0","canonical_sha256":"9c23c39aef04e01b456b5f2e5c4a37927a4fccc31fbabe84efacb85593e21012","source":{"kind":"arxiv","id":"1111.0065","version":1},"attestation_state":"computed","paper":{"title":"Communication-Based Decomposition Mechanisms for Decentralized MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Claudia V. Goldman, Shlomo Zilberstein","submitted_at":"2011-10-31T22:22:03Z","abstract_excerpt":"Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing, multi-robot coordination and information gathering scenarios can be formalized using this framework. However, finding the optimal solution in the general case is hard, limiting the applicability of recently developed algorithms. This paper provides a practical approach for solving decentralized control problems when communication among the decision makers is possible, but costly. We develop the notion of communicatio"},"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":"1111.0065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"82ba2a7b40150da1fa0f6b40c95dddaead8d177257f88d05bdf576a1c05eab5b","abstract_canon_sha256":"be7c31b8280c73e5de161d0c69bce3a69f2947ecb666d1e35c0b809bbc2fd722"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.504027Z","signature_b64":"4sSJvKxwnVJgYnIKJdiH90OuOjdH8Vf8PePqaq1h1kJPEqugFTxsy4yuv8IKseYJW/D6Gts5ooxKqPcM0Qt7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c23c39aef04e01b456b5f2e5c4a37927a4fccc31fbabe84efacb85593e21012","last_reissued_at":"2026-05-18T04:09:46.503569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.503569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Based Decomposition Mechanisms for Decentralized MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Claudia V. Goldman, Shlomo Zilberstein","submitted_at":"2011-10-31T22:22:03Z","abstract_excerpt":"Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing, multi-robot coordination and information gathering scenarios can be formalized using this framework. However, finding the optimal solution in the general case is hard, limiting the applicability of recently developed algorithms. This paper provides a practical approach for solving decentralized control problems when communication among the decision makers is possible, but costly. We develop the notion of communicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0065","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":"1111.0065","created_at":"2026-05-18T04:09:46.503641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0065v1","created_at":"2026-05-18T04:09:46.503641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0065","created_at":"2026-05-18T04:09:46.503641+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQR4HGXPATQB","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQR4HGXPATQBWRLL","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQR4HGXP","created_at":"2026-05-18T12:26:42.757692+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/TQR4HGXPATQBWRLLL4XFYSRXSJ","json":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ.json","graph_json":"https://pith.science/api/pith-number/TQR4HGXPATQBWRLLL4XFYSRXSJ/graph.json","events_json":"https://pith.science/api/pith-number/TQR4HGXPATQBWRLLL4XFYSRXSJ/events.json","paper":"https://pith.science/paper/TQR4HGXP"},"agent_actions":{"view_html":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ","download_json":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ.json","view_paper":"https://pith.science/paper/TQR4HGXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0065&json=true","fetch_graph":"https://pith.science/api/pith-number/TQR4HGXPATQBWRLLL4XFYSRXSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TQR4HGXPATQBWRLLL4XFYSRXSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ/action/storage_attestation","attest_author":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ/action/author_attestation","sign_citation":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ/action/citation_signature","submit_replication":"https://pith.science/pith/TQR4HGXPATQBWRLLL4XFYSRXSJ/action/replication_record"}},"created_at":"2026-05-18T04:09:46.503641+00:00","updated_at":"2026-05-18T04:09:46.503641+00:00"}