{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:43EPHGGKT2VFG5Y7RBGCJIEV5J","short_pith_number":"pith:43EPHGGK","canonical_record":{"source":{"id":"1811.08880","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-21T18:52:42Z","cross_cats_sorted":[],"title_canon_sha256":"8e52d4434533f0150a1f7bbf46db5dfd68e1774c49c41616937c3bd77a19ef32","abstract_canon_sha256":"f4768baffbe0f7b748dac891cce99c61a00767903cadc1ac30284946a94eedd5"},"schema_version":"1.0"},"canonical_sha256":"e6c8f398ca9eaa53771f884c24a095ea56267ca6f9b0fabe0733ab4001f3d4a8","source":{"kind":"arxiv","id":"1811.08880","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08880","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08880v3","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08880","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"43EPHGGKT2VF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"43EPHGGKT2VFG5Y7","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"43EPHGGK","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:43EPHGGKT2VFG5Y7RBGCJIEV5J","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08880","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-21T18:52:42Z","cross_cats_sorted":[],"title_canon_sha256":"8e52d4434533f0150a1f7bbf46db5dfd68e1774c49c41616937c3bd77a19ef32","abstract_canon_sha256":"f4768baffbe0f7b748dac891cce99c61a00767903cadc1ac30284946a94eedd5"},"schema_version":"1.0"},"canonical_sha256":"e6c8f398ca9eaa53771f884c24a095ea56267ca6f9b0fabe0733ab4001f3d4a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:33.594721Z","signature_b64":"t3dNBZ2LsOSqjSdR8AhzBAJg0XidIOnAwU1Ir/tMXl2L0W0i8V/2iHmOttfHvNyYisBocM7UDKZ7G0ckwhGhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6c8f398ca9eaa53771f884c24a095ea56267ca6f9b0fabe0733ab4001f3d4a8","last_reissued_at":"2026-05-17T23:50:33.594275Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:33.594275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08880","source_version":3,"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-17T23:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1pTkWeinKwiWoK6BRFiFSbSkX1ayEDHQOj8brY/RnUmT7m69QVmsKN0werc0uD/iPr4KlM7etdgyFO1NjF8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:38:26.671758Z"},"content_sha256":"e64a750508271ef3c2d92022812c08616c651fb85a37eba6db1a08c04bcbdcd0","schema_version":"1.0","event_id":"sha256:e64a750508271ef3c2d92022812c08616c651fb85a37eba6db1a08c04bcbdcd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:43EPHGGKT2VFG5Y7RBGCJIEV5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Programming for Decision Processes with Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Axel Parmentier, Victor Cohen","submitted_at":"2018-11-21T18:52:42Z","abstract_excerpt":"Markov Decision Processes (MDPs) are stochastic optimization problems that model situations where a decision maker controls a system based on its state. Partially observed Markov decision processes (POMDPs) are generalizations of MDPs where the decision maker has only partial information on the state of the system. Decomposable POMDPs are specific cases of POMDPs that enable one to model systems with several components. Such problems naturally model a wide range of applications such as predictive maintenance. Finding an optimal policy for a POMDP is PSPACE-hard and practically challenging. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08880","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":""},"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-17T23:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJvl6kwE+OmDnWCcIyalUn9OQI4hLj2A2qx9jKCH/nlFYS6rF31sqsnUAkNXiyE2ED1MqGPABwEQGOyWCwtSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:38:26.672265Z"},"content_sha256":"25b938c6c82590dda5f77b4a8eedbbaeb3ee0b7974cd439c15213021b0e4e2d5","schema_version":"1.0","event_id":"sha256:25b938c6c82590dda5f77b4a8eedbbaeb3ee0b7974cd439c15213021b0e4e2d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43EPHGGKT2VFG5Y7RBGCJIEV5J/bundle.json","state_url":"https://pith.science/pith/43EPHGGKT2VFG5Y7RBGCJIEV5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43EPHGGKT2VFG5Y7RBGCJIEV5J/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-05-23T15:38:26Z","links":{"resolver":"https://pith.science/pith/43EPHGGKT2VFG5Y7RBGCJIEV5J","bundle":"https://pith.science/pith/43EPHGGKT2VFG5Y7RBGCJIEV5J/bundle.json","state":"https://pith.science/pith/43EPHGGKT2VFG5Y7RBGCJIEV5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43EPHGGKT2VFG5Y7RBGCJIEV5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:43EPHGGKT2VFG5Y7RBGCJIEV5J","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":"f4768baffbe0f7b748dac891cce99c61a00767903cadc1ac30284946a94eedd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-21T18:52:42Z","title_canon_sha256":"8e52d4434533f0150a1f7bbf46db5dfd68e1774c49c41616937c3bd77a19ef32"},"schema_version":"1.0","source":{"id":"1811.08880","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08880","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08880v3","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08880","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"43EPHGGKT2VF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"43EPHGGKT2VFG5Y7","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"43EPHGGK","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:25b938c6c82590dda5f77b4a8eedbbaeb3ee0b7974cd439c15213021b0e4e2d5","target":"graph","created_at":"2026-05-17T23:50:33Z","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":"Markov Decision Processes (MDPs) are stochastic optimization problems that model situations where a decision maker controls a system based on its state. Partially observed Markov decision processes (POMDPs) are generalizations of MDPs where the decision maker has only partial information on the state of the system. Decomposable POMDPs are specific cases of POMDPs that enable one to model systems with several components. Such problems naturally model a wide range of applications such as predictive maintenance. Finding an optimal policy for a POMDP is PSPACE-hard and practically challenging. We ","authors_text":"Axel Parmentier, Victor Cohen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-21T18:52:42Z","title":"Linear Programming for Decision Processes with Partial Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08880","kind":"arxiv","version":3},"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:e64a750508271ef3c2d92022812c08616c651fb85a37eba6db1a08c04bcbdcd0","target":"record","created_at":"2026-05-17T23:50:33Z","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":"f4768baffbe0f7b748dac891cce99c61a00767903cadc1ac30284946a94eedd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-21T18:52:42Z","title_canon_sha256":"8e52d4434533f0150a1f7bbf46db5dfd68e1774c49c41616937c3bd77a19ef32"},"schema_version":"1.0","source":{"id":"1811.08880","kind":"arxiv","version":3}},"canonical_sha256":"e6c8f398ca9eaa53771f884c24a095ea56267ca6f9b0fabe0733ab4001f3d4a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6c8f398ca9eaa53771f884c24a095ea56267ca6f9b0fabe0733ab4001f3d4a8","first_computed_at":"2026-05-17T23:50:33.594275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:33.594275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t3dNBZ2LsOSqjSdR8AhzBAJg0XidIOnAwU1Ir/tMXl2L0W0i8V/2iHmOttfHvNyYisBocM7UDKZ7G0ckwhGhCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:33.594721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08880","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e64a750508271ef3c2d92022812c08616c651fb85a37eba6db1a08c04bcbdcd0","sha256:25b938c6c82590dda5f77b4a8eedbbaeb3ee0b7974cd439c15213021b0e4e2d5"],"state_sha256":"a8c923acc1bbe2bc26b4c99e1554f78de766ae6ee5aaa7827895630518d6e110"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvepx5WcP7J63rcseSwbuNLD81qLzhPxNdVGK/f20aK3gxAfpQOt0tk7YgvvVzkxC/sBqxun4qJVw0H4ZVE5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T15:38:26.675899Z","bundle_sha256":"27a051f9b4edc1d2d1d374a2a31d896e2d283145e2b5480e19670ac6057fe4bd"}}