{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BXKHCKAM3UHMWLLFHWZNCO5YRF","short_pith_number":"pith:BXKHCKAM","schema_version":"1.0","canonical_sha256":"0dd471280cdd0ecb2d653db2d13bb889451341ae816b8f229a82b33a3fb054dc","source":{"kind":"arxiv","id":"1408.2058","version":1},"attestation_state":"computed","paper":{"title":"POMDPs under Probabilistic Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Krishnendu Chatterjee, Martin Chmelik","submitted_at":"2014-08-09T05:57:38Z","abstract_excerpt":"We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated to every transition, and the payoff of an infinite path is the long-run average of the rewards. We consider two types of path constraints: (i) quantitative constraint defines the set of paths where the payoff is at least a given threshold lambda_1 in (0,1]; and (ii) qualitative constraint which is a special case of quantitative constraint with lambda_1=1. We consider the computation of the almost-sure winning set, where the controller needs to "},"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":"1408.2058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-09T05:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"a802048c3b4aca3e2b850367ea84a6cc5428c67c2aabc260c5d6fcc67bc6bbc6","abstract_canon_sha256":"ff0577c1a9962bf310846006b1244060bfba86aee82dff3045541286e62be264"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.479778Z","signature_b64":"ft1L83WYUfRtOqCmGR+/dNjVwGUbUucukY2M27vuHsaYGkiWt6yc9CfwNvLRta7s7tZ1ZPxIPIVXoG/NPi2oDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dd471280cdd0ecb2d653db2d13bb889451341ae816b8f229a82b33a3fb054dc","last_reissued_at":"2026-05-18T02:45:30.479248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.479248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"POMDPs under Probabilistic Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Krishnendu Chatterjee, Martin Chmelik","submitted_at":"2014-08-09T05:57:38Z","abstract_excerpt":"We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated to every transition, and the payoff of an infinite path is the long-run average of the rewards. We consider two types of path constraints: (i) quantitative constraint defines the set of paths where the payoff is at least a given threshold lambda_1 in (0,1]; and (ii) qualitative constraint which is a special case of quantitative constraint with lambda_1=1. We consider the computation of the almost-sure winning set, where the controller needs to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2058","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":"1408.2058","created_at":"2026-05-18T02:45:30.479326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2058v1","created_at":"2026-05-18T02:45:30.479326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2058","created_at":"2026-05-18T02:45:30.479326+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXKHCKAM3UHM","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXKHCKAM3UHMWLLF","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXKHCKAM","created_at":"2026-05-18T12:28:22.404517+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/BXKHCKAM3UHMWLLFHWZNCO5YRF","json":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF.json","graph_json":"https://pith.science/api/pith-number/BXKHCKAM3UHMWLLFHWZNCO5YRF/graph.json","events_json":"https://pith.science/api/pith-number/BXKHCKAM3UHMWLLFHWZNCO5YRF/events.json","paper":"https://pith.science/paper/BXKHCKAM"},"agent_actions":{"view_html":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF","download_json":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF.json","view_paper":"https://pith.science/paper/BXKHCKAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2058&json=true","fetch_graph":"https://pith.science/api/pith-number/BXKHCKAM3UHMWLLFHWZNCO5YRF/graph.json","fetch_events":"https://pith.science/api/pith-number/BXKHCKAM3UHMWLLFHWZNCO5YRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF/action/storage_attestation","attest_author":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF/action/author_attestation","sign_citation":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF/action/citation_signature","submit_replication":"https://pith.science/pith/BXKHCKAM3UHMWLLFHWZNCO5YRF/action/replication_record"}},"created_at":"2026-05-18T02:45:30.479326+00:00","updated_at":"2026-05-18T02:45:30.479326+00:00"}