{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QJAD5ZGLOSNQC5S6MIWSHPEJMW","short_pith_number":"pith:QJAD5ZGL","canonical_record":{"source":{"id":"1206.5295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"2e239520fe023b6d0ca89ea96ee70b743def3b82628e26c3a0787b5db3edfdd7","abstract_canon_sha256":"69fcb0653557415ba298c41b6bbf325082c756b75195f5cda80aed8ee0787792"},"schema_version":"1.0"},"canonical_sha256":"82403ee4cb749b01765e622d23bc89659555945244ab9161dbd466512683d8ae","source":{"kind":"arxiv","id":"1206.5295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5295","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5295v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5295","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"QJAD5ZGLOSNQ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QJAD5ZGLOSNQC5S6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QJAD5ZGL","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QJAD5ZGLOSNQC5S6MIWSHPEJMW","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"2e239520fe023b6d0ca89ea96ee70b743def3b82628e26c3a0787b5db3edfdd7","abstract_canon_sha256":"69fcb0653557415ba298c41b6bbf325082c756b75195f5cda80aed8ee0787792"},"schema_version":"1.0"},"canonical_sha256":"82403ee4cb749b01765e622d23bc89659555945244ab9161dbd466512683d8ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.472268Z","signature_b64":"aqZUolc6mxahoK96FChmwRfMUj25MkOLYj94/6O0NKMKnCwSWJewcY/CpHLO5Cf0+biX0m+g3HSltIIMk8IgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82403ee4cb749b01765e622d23bc89659555945244ab9161dbd466512683d8ae","last_reissued_at":"2026-05-18T03:52:40.471727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.471727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5295","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-18T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdTqOi2TcHmSbJ3qECBLvP0Sl7c4V6c+am7fah4XszQhsbMl/Yj04GBopDuKmQ+SFFuVgKcP+t5ESHCofDt/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:11:56.566513Z"},"content_sha256":"bbc0658c78c481369fea3c4bedc2edab533b6d9a618a68fa281643b08bb73741","schema_version":"1.0","event_id":"sha256:bbc0658c78c481369fea3c4bedc2edab533b6d9a618a68fa281643b08bb73741"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QJAD5ZGLOSNQC5S6MIWSHPEJMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shlomo Zilberstein, Sven Seuken","submitted_at":"2012-06-20T15:19:47Z","abstract_excerpt":"Memory-Bounded Dynamic Programming (MBDP) has proved extremely effective in solving decentralized POMDPs with large horizons. We generalize the algorithm and improve its scalability by reducing the complexity with respect to the number of observations from exponential to polynomial. We derive error bounds on solution quality with respect to this new approximation and analyze the convergence behavior. To evaluate the effectiveness of the improvements, we introduce a new, larger benchmark problem. Experimental results show that despite the high complexity of decentralized POMDPs, scalable soluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5295","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-18T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8a58qNkxkXVPhUpBH7QbWRGHDBgwu/Sf6Eb957wwBvDGxcytuCL+9Di4iTHRLMJZsLfOSbvM+6asBxeZeorAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:11:56.567116Z"},"content_sha256":"314ca598a897a271171f6ca11798dc34b8b65767d733215c6ac5ebe1cbb54397","schema_version":"1.0","event_id":"sha256:314ca598a897a271171f6ca11798dc34b8b65767d733215c6ac5ebe1cbb54397"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJAD5ZGLOSNQC5S6MIWSHPEJMW/bundle.json","state_url":"https://pith.science/pith/QJAD5ZGLOSNQC5S6MIWSHPEJMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJAD5ZGLOSNQC5S6MIWSHPEJMW/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-03T15:11:56Z","links":{"resolver":"https://pith.science/pith/QJAD5ZGLOSNQC5S6MIWSHPEJMW","bundle":"https://pith.science/pith/QJAD5ZGLOSNQC5S6MIWSHPEJMW/bundle.json","state":"https://pith.science/pith/QJAD5ZGLOSNQC5S6MIWSHPEJMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJAD5ZGLOSNQC5S6MIWSHPEJMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QJAD5ZGLOSNQC5S6MIWSHPEJMW","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":"69fcb0653557415ba298c41b6bbf325082c756b75195f5cda80aed8ee0787792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:19:47Z","title_canon_sha256":"2e239520fe023b6d0ca89ea96ee70b743def3b82628e26c3a0787b5db3edfdd7"},"schema_version":"1.0","source":{"id":"1206.5295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5295","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5295v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5295","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"QJAD5ZGLOSNQ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QJAD5ZGLOSNQC5S6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QJAD5ZGL","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:314ca598a897a271171f6ca11798dc34b8b65767d733215c6ac5ebe1cbb54397","target":"graph","created_at":"2026-05-18T03:52:40Z","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":"Memory-Bounded Dynamic Programming (MBDP) has proved extremely effective in solving decentralized POMDPs with large horizons. We generalize the algorithm and improve its scalability by reducing the complexity with respect to the number of observations from exponential to polynomial. We derive error bounds on solution quality with respect to this new approximation and analyze the convergence behavior. To evaluate the effectiveness of the improvements, we introduce a new, larger benchmark problem. Experimental results show that despite the high complexity of decentralized POMDPs, scalable soluti","authors_text":"Shlomo Zilberstein, Sven Seuken","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:19:47Z","title":"Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5295","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:bbc0658c78c481369fea3c4bedc2edab533b6d9a618a68fa281643b08bb73741","target":"record","created_at":"2026-05-18T03:52:40Z","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":"69fcb0653557415ba298c41b6bbf325082c756b75195f5cda80aed8ee0787792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:19:47Z","title_canon_sha256":"2e239520fe023b6d0ca89ea96ee70b743def3b82628e26c3a0787b5db3edfdd7"},"schema_version":"1.0","source":{"id":"1206.5295","kind":"arxiv","version":1}},"canonical_sha256":"82403ee4cb749b01765e622d23bc89659555945244ab9161dbd466512683d8ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82403ee4cb749b01765e622d23bc89659555945244ab9161dbd466512683d8ae","first_computed_at":"2026-05-18T03:52:40.471727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:40.471727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aqZUolc6mxahoK96FChmwRfMUj25MkOLYj94/6O0NKMKnCwSWJewcY/CpHLO5Cf0+biX0m+g3HSltIIMk8IgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:40.472268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbc0658c78c481369fea3c4bedc2edab533b6d9a618a68fa281643b08bb73741","sha256:314ca598a897a271171f6ca11798dc34b8b65767d733215c6ac5ebe1cbb54397"],"state_sha256":"5debfc39f18ec2ca980926988197d201ec1e46ed498d21473be234cc4d04859c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XY1UMSoviG3fQcDiTro7cAxpq/ngX0B/gonMdDMcyN2wj62PUuoIeDbKfLrSY5IKqxWYk5LLxTtPW10vDVZKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:11:56.569518Z","bundle_sha256":"f1e4565b384ceedb3e2a70329e7a57cee0b7a1519ba072828b187c682791a8b0"}}