{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:X4EABM22Q4VIEZ6E6CJ4RZ4LVA","short_pith_number":"pith:X4EABM22","schema_version":"1.0","canonical_sha256":"bf0800b35a872a8267c4f093c8e78ba8329e1162b777526ee1a832b70ecd50d6","source":{"kind":"arxiv","id":"1106.0242","version":1},"attestation_state":"computed","paper":{"title":"Nonapproximability Results for Partially Observable Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"C. Lusena, J. Goldsmith, M. Mundhenk","submitted_at":"2011-06-01T16:37:53Z","abstract_excerpt":"We show that for several variations of partially observable    Markov decision processes, polynomial-time algorithms for finding    control policies are unlikely to or simply don't have guarantees of    finding policies within a constant factor or a constant summand of    optimal.  Here \"unlikely\" means \"unless some complexity classes    collapse,\" where the collapses considered are P=NP, P=PSPACE, or    P=EXP.  Until or unless these collapses are shown to hold, any    control-policy designer must choose between such performance    guarantees and efficient computation."},"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":"1106.0242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"fef5bad683b3eb8e13e77b76fbcd73b1605142731367a969c7960824c0c2191c","abstract_canon_sha256":"99b2649cd9740ad9d04732dd64afa8f0255919d92f4b3893d37ce585ec8a0748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:51.772886Z","signature_b64":"NpDwDnBN6AjNByUuY+CB4PnnEBehx0MGIIf8yFybJyTd6zzQYX3t5CXw0p//r8g/MU7KfsNhLueIiVE7Ko5pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf0800b35a872a8267c4f093c8e78ba8329e1162b777526ee1a832b70ecd50d6","last_reissued_at":"2026-05-18T04:20:51.772341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:51.772341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonapproximability Results for Partially Observable Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"C. Lusena, J. Goldsmith, M. Mundhenk","submitted_at":"2011-06-01T16:37:53Z","abstract_excerpt":"We show that for several variations of partially observable    Markov decision processes, polynomial-time algorithms for finding    control policies are unlikely to or simply don't have guarantees of    finding policies within a constant factor or a constant summand of    optimal.  Here \"unlikely\" means \"unless some complexity classes    collapse,\" where the collapses considered are P=NP, P=PSPACE, or    P=EXP.  Until or unless these collapses are shown to hold, any    control-policy designer must choose between such performance    guarantees and efficient computation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0242","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":"1106.0242","created_at":"2026-05-18T04:20:51.772419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.0242v1","created_at":"2026-05-18T04:20:51.772419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0242","created_at":"2026-05-18T04:20:51.772419+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4EABM22Q4VI","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4EABM22Q4VIEZ6E","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4EABM22","created_at":"2026-05-18T12:26:44.992195+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/X4EABM22Q4VIEZ6E6CJ4RZ4LVA","json":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA.json","graph_json":"https://pith.science/api/pith-number/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/graph.json","events_json":"https://pith.science/api/pith-number/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/events.json","paper":"https://pith.science/paper/X4EABM22"},"agent_actions":{"view_html":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA","download_json":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA.json","view_paper":"https://pith.science/paper/X4EABM22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.0242&json=true","fetch_graph":"https://pith.science/api/pith-number/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/graph.json","fetch_events":"https://pith.science/api/pith-number/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/action/storage_attestation","attest_author":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/action/author_attestation","sign_citation":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/action/citation_signature","submit_replication":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/action/replication_record"}},"created_at":"2026-05-18T04:20:51.772419+00:00","updated_at":"2026-05-18T04:20:51.772419+00:00"}