{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:RBHJHDRRCMDNQNDPAUD2R56WIH","short_pith_number":"pith:RBHJHDRR","canonical_record":{"source":{"id":"2111.12679","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-11-24T18:26:13Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"4fd8bc0d8c6ecd1f1268f3b87f5b6db9f4e1ff392e9f1160d2b4f2af28ccc3fa","abstract_canon_sha256":"0cc1bd60c1469a4998916673bbbaee3fa1eeb6d262030cc35c3266c81ed0acf2"},"schema_version":"1.0"},"canonical_sha256":"884e938e311306d8346f0507a8f7d641e8eaba170bbfa4c2f7ce4870a89d818d","source":{"kind":"arxiv","id":"2111.12679","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12679","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12679v3","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12679","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"RBHJHDRRCMDN","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"pith_short_16","alias_value":"RBHJHDRRCMDNQNDP","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"pith_short_8","alias_value":"RBHJHDRR","created_at":"2026-07-05T04:34:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:RBHJHDRRCMDNQNDPAUD2R56WIH","target":"record","payload":{"canonical_record":{"source":{"id":"2111.12679","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-11-24T18:26:13Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"4fd8bc0d8c6ecd1f1268f3b87f5b6db9f4e1ff392e9f1160d2b4f2af28ccc3fa","abstract_canon_sha256":"0cc1bd60c1469a4998916673bbbaee3fa1eeb6d262030cc35c3266c81ed0acf2"},"schema_version":"1.0"},"canonical_sha256":"884e938e311306d8346f0507a8f7d641e8eaba170bbfa4c2f7ce4870a89d818d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:36.426340Z","signature_b64":"8r+w5XvCGqUO9GsUB7SOlsOU/yjEylQP0mq6x13HD/jbkiDCJHfOTCtyPonHsru64V5Sjb8vSvGq+sZhvgzCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"884e938e311306d8346f0507a8f7d641e8eaba170bbfa4c2f7ce4870a89d818d","last_reissued_at":"2026-07-05T04:34:36.425851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:36.425851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.12679","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-07-05T04:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkW2ZvG3znyWjw2CGqaD7IZyZAVa3v2bGsYY/ml51Jari3S2Jl3g+g1hLAOsMW6/ftbhrVthckDhU/1CZIW+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:07:19.493143Z"},"content_sha256":"c9d29ea8b5117019d4d747addba7a6faa3e73f9a463dd882b1d21979406cdacf","schema_version":"1.0","event_id":"sha256:c9d29ea8b5117019d4d747addba7a6faa3e73f9a463dd882b1d21979406cdacf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:RBHJHDRRCMDNQNDPAUD2R56WIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the (In)Tractability of Reinforcement Learning for LTL Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Cambridge Yang, Michael Carbin, Michael Littman","submitted_at":"2021-11-24T18:26:13Z","abstract_excerpt":"In recent years, researchers have made significant progress in devising reinforcement-learning algorithms for optimizing linear temporal logic (LTL) objectives and LTL-like objectives. Despite these advancements, there are fundamental limitations to how well this problem can be solved. Previous studies have alluded to this fact but have not examined it in depth. In this paper, we address the tractability of reinforcement learning for general LTL objectives from a theoretical perspective. We formalize the problem under the probably approximately correct learning in Markov decision processes (PA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12679","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.12679/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXpnlZtuKr+GL11kMgTC5MKejrqQzCTRCsvAOrMXYrqYpchF1wJCXkkH/pBn9GZK3H6W72Jr+F7wleuZBfJKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:07:19.493540Z"},"content_sha256":"2ad4d4df183edea11a1ddf2ddae1cf0fdbaabc70ba2b80d35cada4a433fb2a42","schema_version":"1.0","event_id":"sha256:2ad4d4df183edea11a1ddf2ddae1cf0fdbaabc70ba2b80d35cada4a433fb2a42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBHJHDRRCMDNQNDPAUD2R56WIH/bundle.json","state_url":"https://pith.science/pith/RBHJHDRRCMDNQNDPAUD2R56WIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBHJHDRRCMDNQNDPAUD2R56WIH/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-07-07T07:07:19Z","links":{"resolver":"https://pith.science/pith/RBHJHDRRCMDNQNDPAUD2R56WIH","bundle":"https://pith.science/pith/RBHJHDRRCMDNQNDPAUD2R56WIH/bundle.json","state":"https://pith.science/pith/RBHJHDRRCMDNQNDPAUD2R56WIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBHJHDRRCMDNQNDPAUD2R56WIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:RBHJHDRRCMDNQNDPAUD2R56WIH","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":"0cc1bd60c1469a4998916673bbbaee3fa1eeb6d262030cc35c3266c81ed0acf2","cross_cats_sorted":["cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-11-24T18:26:13Z","title_canon_sha256":"4fd8bc0d8c6ecd1f1268f3b87f5b6db9f4e1ff392e9f1160d2b4f2af28ccc3fa"},"schema_version":"1.0","source":{"id":"2111.12679","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12679","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12679v3","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12679","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"RBHJHDRRCMDN","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"pith_short_16","alias_value":"RBHJHDRRCMDNQNDP","created_at":"2026-07-05T04:34:36Z"},{"alias_kind":"pith_short_8","alias_value":"RBHJHDRR","created_at":"2026-07-05T04:34:36Z"}],"graph_snapshots":[{"event_id":"sha256:2ad4d4df183edea11a1ddf2ddae1cf0fdbaabc70ba2b80d35cada4a433fb2a42","target":"graph","created_at":"2026-07-05T04:34:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.12679/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, researchers have made significant progress in devising reinforcement-learning algorithms for optimizing linear temporal logic (LTL) objectives and LTL-like objectives. Despite these advancements, there are fundamental limitations to how well this problem can be solved. Previous studies have alluded to this fact but have not examined it in depth. In this paper, we address the tractability of reinforcement learning for general LTL objectives from a theoretical perspective. We formalize the problem under the probably approximately correct learning in Markov decision processes (PA","authors_text":"Cambridge Yang, Michael Carbin, Michael Littman","cross_cats":["cs.FL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-11-24T18:26:13Z","title":"On the (In)Tractability of Reinforcement Learning for LTL Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12679","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:c9d29ea8b5117019d4d747addba7a6faa3e73f9a463dd882b1d21979406cdacf","target":"record","created_at":"2026-07-05T04:34:36Z","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":"0cc1bd60c1469a4998916673bbbaee3fa1eeb6d262030cc35c3266c81ed0acf2","cross_cats_sorted":["cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-11-24T18:26:13Z","title_canon_sha256":"4fd8bc0d8c6ecd1f1268f3b87f5b6db9f4e1ff392e9f1160d2b4f2af28ccc3fa"},"schema_version":"1.0","source":{"id":"2111.12679","kind":"arxiv","version":3}},"canonical_sha256":"884e938e311306d8346f0507a8f7d641e8eaba170bbfa4c2f7ce4870a89d818d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"884e938e311306d8346f0507a8f7d641e8eaba170bbfa4c2f7ce4870a89d818d","first_computed_at":"2026-07-05T04:34:36.425851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:36.425851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8r+w5XvCGqUO9GsUB7SOlsOU/yjEylQP0mq6x13HD/jbkiDCJHfOTCtyPonHsru64V5Sjb8vSvGq+sZhvgzCCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:36.426340Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.12679","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d29ea8b5117019d4d747addba7a6faa3e73f9a463dd882b1d21979406cdacf","sha256:2ad4d4df183edea11a1ddf2ddae1cf0fdbaabc70ba2b80d35cada4a433fb2a42"],"state_sha256":"916a284d98fce8b4352b3dd6b17a355d48b4ea0285e1572a01b7ed7baadccf53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRJfD4dSZbbK5Uf22duwU7+LAIPB36/Tl1rATgk3TJ5TeuQLLwfILpXB28q11uJe+nyHVCBbPJwjhGcbiAFkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:07:19.495485Z","bundle_sha256":"81735d57b844e8d53a2a0b7d6c1fba0b966155034e927513d3f331c163bf81c8"}}