{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IIM2ACRBKLZUN7CGV5IAUXYSAW","short_pith_number":"pith:IIM2ACRB","canonical_record":{"source":{"id":"1908.02357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T20:38:58Z","cross_cats_sorted":["cs.AI","cs.MA","math.OC"],"title_canon_sha256":"743ecf8cfd1d5ccab481a38eda5c623bbdddd73b3c75efb16952ae02652c4763","abstract_canon_sha256":"9254e0d9de007b97e419565f67998d7d0c42ded4508cdbc7edd8921e602cc04f"},"schema_version":"1.0"},"canonical_sha256":"4219a00a2152f346fc46af500a5f1205bf2d49bedb3cd686052f1b53a80ec64b","source":{"kind":"arxiv","id":"1908.02357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02357","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02357v1","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02357","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"IIM2ACRBKLZU","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"pith_short_16","alias_value":"IIM2ACRBKLZUN7CG","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"pith_short_8","alias_value":"IIM2ACRB","created_at":"2026-07-04T23:52:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IIM2ACRBKLZUN7CGV5IAUXYSAW","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T20:38:58Z","cross_cats_sorted":["cs.AI","cs.MA","math.OC"],"title_canon_sha256":"743ecf8cfd1d5ccab481a38eda5c623bbdddd73b3c75efb16952ae02652c4763","abstract_canon_sha256":"9254e0d9de007b97e419565f67998d7d0c42ded4508cdbc7edd8921e602cc04f"},"schema_version":"1.0"},"canonical_sha256":"4219a00a2152f346fc46af500a5f1205bf2d49bedb3cd686052f1b53a80ec64b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:07.948217Z","signature_b64":"fIPWD6V7oRfx4h/yWXfs8osRhddSa0dsdpEspUZxFbaZIhn1/3nfkWv1zjjIqkGGp54bP3Ggb/Mt0rhgpSBaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4219a00a2152f346fc46af500a5f1205bf2d49bedb3cd686052f1b53a80ec64b","last_reissued_at":"2026-07-04T23:52:07.947685Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:07.947685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02357","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-07-04T23:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBUNF/U0NI/GhqeAVtkSyvmg14+OHD9sNCY2xtx36FaMHPjvRHBFvZ5qqkr1CzEjks/XWew41kWK3/0tuXAeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:54:39.664977Z"},"content_sha256":"842f89b5be26ad23efb8063dda9dbc9ecdd2031857690f68034fdf85b6416fe2","schema_version":"1.0","event_id":"sha256:842f89b5be26ad23efb8063dda9dbc9ecdd2031857690f68034fdf85b6416fe2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IIM2ACRBKLZUN7CGV5IAUXYSAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Planning for Decentralized Stochastic Control with Partial History Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","math.OC"],"primary_cat":"cs.LG","authors_text":"Erik Miehling, Kaiqing Zhang, Tamer Ba\\c{s}ar","submitted_at":"2019-08-06T20:38:58Z","abstract_excerpt":"In decentralized stochastic control, standard approaches for sequential decision-making, e.g. dynamic programming, quickly become intractable due to the need to maintain a complex information state. Computational challenges are further compounded if agents do not possess complete model knowledge. In this paper, we take advantage of the fact that in many problems agents share some common information, or history, termed partial history sharing. Under this information structure the policy search space is greatly reduced. We propose a provably convergent, online tree-search based algorithm that do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02357","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02357/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"},"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-07-04T23:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMiBMrsYDXA9w2zsfl/MbBqrpXsqFUQpToFq4EIszVcF5YJzGzxjx2ZUodX+33LPhDaUzqdtONWhUCp7LiW9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:54:39.665514Z"},"content_sha256":"51b83a4cd3b16772e3d3316cd3ccb19343536b5d5d31de2bc3021628e617ebc0","schema_version":"1.0","event_id":"sha256:51b83a4cd3b16772e3d3316cd3ccb19343536b5d5d31de2bc3021628e617ebc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIM2ACRBKLZUN7CGV5IAUXYSAW/bundle.json","state_url":"https://pith.science/pith/IIM2ACRBKLZUN7CGV5IAUXYSAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIM2ACRBKLZUN7CGV5IAUXYSAW/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-08-16T09:54:39Z","links":{"resolver":"https://pith.science/pith/IIM2ACRBKLZUN7CGV5IAUXYSAW","bundle":"https://pith.science/pith/IIM2ACRBKLZUN7CGV5IAUXYSAW/bundle.json","state":"https://pith.science/pith/IIM2ACRBKLZUN7CGV5IAUXYSAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIM2ACRBKLZUN7CGV5IAUXYSAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IIM2ACRBKLZUN7CGV5IAUXYSAW","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":"9254e0d9de007b97e419565f67998d7d0c42ded4508cdbc7edd8921e602cc04f","cross_cats_sorted":["cs.AI","cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T20:38:58Z","title_canon_sha256":"743ecf8cfd1d5ccab481a38eda5c623bbdddd73b3c75efb16952ae02652c4763"},"schema_version":"1.0","source":{"id":"1908.02357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02357","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02357v1","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02357","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"IIM2ACRBKLZU","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"pith_short_16","alias_value":"IIM2ACRBKLZUN7CG","created_at":"2026-07-04T23:52:07Z"},{"alias_kind":"pith_short_8","alias_value":"IIM2ACRB","created_at":"2026-07-04T23:52:07Z"}],"graph_snapshots":[{"event_id":"sha256:51b83a4cd3b16772e3d3316cd3ccb19343536b5d5d31de2bc3021628e617ebc0","target":"graph","created_at":"2026-07-04T23:52:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02357/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In decentralized stochastic control, standard approaches for sequential decision-making, e.g. dynamic programming, quickly become intractable due to the need to maintain a complex information state. Computational challenges are further compounded if agents do not possess complete model knowledge. In this paper, we take advantage of the fact that in many problems agents share some common information, or history, termed partial history sharing. Under this information structure the policy search space is greatly reduced. We propose a provably convergent, online tree-search based algorithm that do","authors_text":"Erik Miehling, Kaiqing Zhang, Tamer Ba\\c{s}ar","cross_cats":["cs.AI","cs.MA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T20:38:58Z","title":"Online Planning for Decentralized Stochastic Control with Partial History Sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02357","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:842f89b5be26ad23efb8063dda9dbc9ecdd2031857690f68034fdf85b6416fe2","target":"record","created_at":"2026-07-04T23:52:07Z","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":"9254e0d9de007b97e419565f67998d7d0c42ded4508cdbc7edd8921e602cc04f","cross_cats_sorted":["cs.AI","cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T20:38:58Z","title_canon_sha256":"743ecf8cfd1d5ccab481a38eda5c623bbdddd73b3c75efb16952ae02652c4763"},"schema_version":"1.0","source":{"id":"1908.02357","kind":"arxiv","version":1}},"canonical_sha256":"4219a00a2152f346fc46af500a5f1205bf2d49bedb3cd686052f1b53a80ec64b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4219a00a2152f346fc46af500a5f1205bf2d49bedb3cd686052f1b53a80ec64b","first_computed_at":"2026-07-04T23:52:07.947685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:07.947685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fIPWD6V7oRfx4h/yWXfs8osRhddSa0dsdpEspUZxFbaZIhn1/3nfkWv1zjjIqkGGp54bP3Ggb/Mt0rhgpSBaBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:07.948217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:842f89b5be26ad23efb8063dda9dbc9ecdd2031857690f68034fdf85b6416fe2","sha256:51b83a4cd3b16772e3d3316cd3ccb19343536b5d5d31de2bc3021628e617ebc0"],"state_sha256":"149cc6ea9dd0b5ec35e7f96c82d345151fb034b95739aa9a50088e6503046924"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOTWRN0JluXtOhvNc5Sn0MXHv5MT+vO0VgPrxMm4KrPUfWRThifN7q0zGuG2fsgwFbaHmFbjHbbwpozs41sABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:54:39.671802Z","bundle_sha256":"53f72fb2a8f7c440591e5e34d6a351fe5d3dd34c784d81225a8f4aab253fd03e"}}