{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X4EABM22Q4VIEZ6E6CJ4RZ4LVA","short_pith_number":"pith:X4EABM22","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"},"canonical_sha256":"bf0800b35a872a8267c4f093c8e78ba8329e1162b777526ee1a832b70ecd50d6","source":{"kind":"arxiv","id":"1106.0242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0242","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0242v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0242","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"X4EABM22Q4VI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X4EABM22Q4VIEZ6E","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X4EABM22","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X4EABM22Q4VIEZ6E6CJ4RZ4LVA","target":"record","payload":{"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"},"canonical_sha256":"bf0800b35a872a8267c4f093c8e78ba8329e1162b777526ee1a832b70ecd50d6","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"},"source_kind":"arxiv","source_id":"1106.0242","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-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hu5BO553LZ7U+Ad4mtsLt3xd0Vs1vu0VGcUwniWswt6ihQBr9deD9YmqswqVoSPuBUkZa+iOsGct+XO9n7uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:51:57.673990Z"},"content_sha256":"f238318c31bf04e5ee1f506f54ec9e60727e6e28f8eccd89f0f05ceb14329165","schema_version":"1.0","event_id":"sha256:f238318c31bf04e5ee1f506f54ec9e60727e6e28f8eccd89f0f05ceb14329165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X4EABM22Q4VIEZ6E6CJ4RZ4LVA","target":"graph","payload":{"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"},"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-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLEclr2oU3zYbM5P1jZp1w6s2z4Y+jwk+WNldfq2KOlabxdJNPkuULyhSLBtZt3hEdhmB5NHHWRnJoI0yx8tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:51:57.674339Z"},"content_sha256":"4cd819c8d2fc89383f9e6f9e1cdc9c72bc73978a6c87d72906cf6b68c074d22c","schema_version":"1.0","event_id":"sha256:4cd819c8d2fc89383f9e6f9e1cdc9c72bc73978a6c87d72906cf6b68c074d22c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/bundle.json","state_url":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/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-28T12:51:57Z","links":{"resolver":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA","bundle":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/bundle.json","state":"https://pith.science/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4EABM22Q4VIEZ6E6CJ4RZ4LVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X4EABM22Q4VIEZ6E6CJ4RZ4LVA","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":"99b2649cd9740ad9d04732dd64afa8f0255919d92f4b3893d37ce585ec8a0748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:37:53Z","title_canon_sha256":"fef5bad683b3eb8e13e77b76fbcd73b1605142731367a969c7960824c0c2191c"},"schema_version":"1.0","source":{"id":"1106.0242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0242","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0242v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0242","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"X4EABM22Q4VI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X4EABM22Q4VIEZ6E","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X4EABM22","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:4cd819c8d2fc89383f9e6f9e1cdc9c72bc73978a6c87d72906cf6b68c074d22c","target":"graph","created_at":"2026-05-18T04:20:51Z","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":"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.","authors_text":"C. Lusena, J. Goldsmith, M. Mundhenk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:37:53Z","title":"Nonapproximability Results for Partially Observable Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0242","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:f238318c31bf04e5ee1f506f54ec9e60727e6e28f8eccd89f0f05ceb14329165","target":"record","created_at":"2026-05-18T04:20:51Z","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":"99b2649cd9740ad9d04732dd64afa8f0255919d92f4b3893d37ce585ec8a0748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:37:53Z","title_canon_sha256":"fef5bad683b3eb8e13e77b76fbcd73b1605142731367a969c7960824c0c2191c"},"schema_version":"1.0","source":{"id":"1106.0242","kind":"arxiv","version":1}},"canonical_sha256":"bf0800b35a872a8267c4f093c8e78ba8329e1162b777526ee1a832b70ecd50d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf0800b35a872a8267c4f093c8e78ba8329e1162b777526ee1a832b70ecd50d6","first_computed_at":"2026-05-18T04:20:51.772341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:51.772341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NpDwDnBN6AjNByUuY+CB4PnnEBehx0MGIIf8yFybJyTd6zzQYX3t5CXw0p//r8g/MU7KfsNhLueIiVE7Ko5pDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:51.772886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f238318c31bf04e5ee1f506f54ec9e60727e6e28f8eccd89f0f05ceb14329165","sha256:4cd819c8d2fc89383f9e6f9e1cdc9c72bc73978a6c87d72906cf6b68c074d22c"],"state_sha256":"691f4a6326ea938bc36717ae0d0a6004a29ca05e8e5a671ec54702bb08ae0f62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nvf+JzEaIJ5AEjgtODxNy16DWyoXVSNbWkr3Lb9oPFRIdhnJF+fYJMm+u4eapjzD5F2prNE/9DntYb3TWvc1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:51:57.676466Z","bundle_sha256":"14b2dff1c7c2a67b17849bc82180f08a35fdf699a0fc48f1f8d9dea3b49f7902"}}