{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5B4I4IRUU7OHM2EPWDR4JE7RSL","short_pith_number":"pith:5B4I4IRU","canonical_record":{"source":{"id":"1207.4154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:42Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"d33276053113e5e63f79c5e092e89d490214eb49b74d5c4b91baecf8c50ab558","abstract_canon_sha256":"69085ca27c8cb6f25795ea0a76b3336f46a983b5bf9c38a6fb11245e134f8fdf"},"schema_version":"1.0"},"canonical_sha256":"e8788e2234a7dc76688fb0e3c493f192d474931cb85bbfe917d7ad546113a7b0","source":{"kind":"arxiv","id":"1207.4154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4154","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4154v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4154","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"5B4I4IRUU7OH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5B4I4IRUU7OHM2EP","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5B4I4IRU","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5B4I4IRUU7OHM2EPWDR4JE7RSL","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:42Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"d33276053113e5e63f79c5e092e89d490214eb49b74d5c4b91baecf8c50ab558","abstract_canon_sha256":"69085ca27c8cb6f25795ea0a76b3336f46a983b5bf9c38a6fb11245e134f8fdf"},"schema_version":"1.0"},"canonical_sha256":"e8788e2234a7dc76688fb0e3c493f192d474931cb85bbfe917d7ad546113a7b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.596269Z","signature_b64":"1Ashg3PWMes4AgbGXJ5FrRl6864n1Ty+ZU2cB/xUQ2rVXwT1CzNucKProrydKcQe0XDAMJNIDevDN3sQhGSVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8788e2234a7dc76688fb0e3c493f192d474931cb85bbfe917d7ad546113a7b0","last_reissued_at":"2026-05-18T03:50:47.595580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.595580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4154","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rh8qKH44nJO/Zbxy9ri5W+p7uf8bLLQTc5aTZNV3SSna41TyGBSre7y1f6J3wX6KcSFjMNF2oSMosZDuHmaqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:17:41.013855Z"},"content_sha256":"1ad999bdc431af17bb9075d0c6fc5a671bc93b6d95f7c8e747b9a54aa4d840ab","schema_version":"1.0","event_id":"sha256:1ad999bdc431af17bb9075d0c6fc5a671bc93b6d95f7c8e747b9a54aa4d840ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5B4I4IRUU7OHM2EPWDR4JE7RSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discretized Approximations for POMDP with Average Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.AI","authors_text":"Dimitri Bertsekas, Huizhen Yu","submitted_at":"2012-07-11T14:59:42Z","abstract_excerpt":"In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a finite number of belief points, and can be computed efficiently using value iteration algorithms for finite-state MDP. While for discounted problems several lower approximation schemes have been proposed earlier, ours seems the first of its kind for average cost problems. We focus primarily on the average cost case, and we show that the corresponding approximation can be computed efficiently using multi-chain algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4154","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPSmvf7PdiuMaq4f7TBEq4GXP5J4CUpzLt5N2YwrFgRNMp2c44UwtFysf1H/BanlVp3ieOlfH+kU6Nzw7rTYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:17:41.014646Z"},"content_sha256":"e88702f39b437e3832e7f20c3180a389f17ae2c1b74b07af9df2c3815bb5c7ef","schema_version":"1.0","event_id":"sha256:e88702f39b437e3832e7f20c3180a389f17ae2c1b74b07af9df2c3815bb5c7ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5B4I4IRUU7OHM2EPWDR4JE7RSL/bundle.json","state_url":"https://pith.science/pith/5B4I4IRUU7OHM2EPWDR4JE7RSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5B4I4IRUU7OHM2EPWDR4JE7RSL/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-03T23:17:41Z","links":{"resolver":"https://pith.science/pith/5B4I4IRUU7OHM2EPWDR4JE7RSL","bundle":"https://pith.science/pith/5B4I4IRUU7OHM2EPWDR4JE7RSL/bundle.json","state":"https://pith.science/pith/5B4I4IRUU7OHM2EPWDR4JE7RSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5B4I4IRUU7OHM2EPWDR4JE7RSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5B4I4IRUU7OHM2EPWDR4JE7RSL","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":"69085ca27c8cb6f25795ea0a76b3336f46a983b5bf9c38a6fb11245e134f8fdf","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:42Z","title_canon_sha256":"d33276053113e5e63f79c5e092e89d490214eb49b74d5c4b91baecf8c50ab558"},"schema_version":"1.0","source":{"id":"1207.4154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4154","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4154v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4154","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"5B4I4IRUU7OH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5B4I4IRUU7OHM2EP","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5B4I4IRU","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:e88702f39b437e3832e7f20c3180a389f17ae2c1b74b07af9df2c3815bb5c7ef","target":"graph","created_at":"2026-05-18T03:50:47Z","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":"In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a finite number of belief points, and can be computed efficiently using value iteration algorithms for finite-state MDP. While for discounted problems several lower approximation schemes have been proposed earlier, ours seems the first of its kind for average cost problems. We focus primarily on the average cost case, and we show that the corresponding approximation can be computed efficiently using multi-chain algorithms","authors_text":"Dimitri Bertsekas, Huizhen Yu","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:42Z","title":"Discretized Approximations for POMDP with Average Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4154","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:1ad999bdc431af17bb9075d0c6fc5a671bc93b6d95f7c8e747b9a54aa4d840ab","target":"record","created_at":"2026-05-18T03:50:47Z","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":"69085ca27c8cb6f25795ea0a76b3336f46a983b5bf9c38a6fb11245e134f8fdf","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:42Z","title_canon_sha256":"d33276053113e5e63f79c5e092e89d490214eb49b74d5c4b91baecf8c50ab558"},"schema_version":"1.0","source":{"id":"1207.4154","kind":"arxiv","version":1}},"canonical_sha256":"e8788e2234a7dc76688fb0e3c493f192d474931cb85bbfe917d7ad546113a7b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8788e2234a7dc76688fb0e3c493f192d474931cb85bbfe917d7ad546113a7b0","first_computed_at":"2026-05-18T03:50:47.595580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.595580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Ashg3PWMes4AgbGXJ5FrRl6864n1Ty+ZU2cB/xUQ2rVXwT1CzNucKProrydKcQe0XDAMJNIDevDN3sQhGSVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.596269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ad999bdc431af17bb9075d0c6fc5a671bc93b6d95f7c8e747b9a54aa4d840ab","sha256:e88702f39b437e3832e7f20c3180a389f17ae2c1b74b07af9df2c3815bb5c7ef"],"state_sha256":"43021f0a45f25b278e639df828c4f2237726238d3d696ffb868e3b2afea18905"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qRRQAeVghXFu92jLQdv4DRd9RPWLHgkjih+FkcP6nvS1+0AnDHabStwnXTRvCQcjzzE/ntVs+5D1RaFMJaMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:17:41.016753Z","bundle_sha256":"eac8ff3ae1f05bd7c657d4feb1dc9252b198dfd78bdd045b394aea8371d9f1c8"}}