{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:U7H6I425DUO3PPG4SAYMSHZPLX","short_pith_number":"pith:U7H6I425","canonical_record":{"source":{"id":"2302.12940","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-25T00:19:49Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"362c2f925472275ebef00a0a294ece5fa8397de6e93cbaa661fe2cb560f345be","abstract_canon_sha256":"59def31355d611b5c67252c9c5bda856ca98d2648114e23f69fe08891c6f864b"},"schema_version":"1.0"},"canonical_sha256":"a7cfe4735d1d1db7bcdc9030c91f2f5dd311bc381edd32eff3f23497412b3043","source":{"kind":"arxiv","id":"2302.12940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12940","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12940v1","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12940","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"U7H6I425DUO3","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"U7H6I425DUO3PPG4","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"U7H6I425","created_at":"2026-07-05T05:45:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:U7H6I425DUO3PPG4SAYMSHZPLX","target":"record","payload":{"canonical_record":{"source":{"id":"2302.12940","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-25T00:19:49Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"362c2f925472275ebef00a0a294ece5fa8397de6e93cbaa661fe2cb560f345be","abstract_canon_sha256":"59def31355d611b5c67252c9c5bda856ca98d2648114e23f69fe08891c6f864b"},"schema_version":"1.0"},"canonical_sha256":"a7cfe4735d1d1db7bcdc9030c91f2f5dd311bc381edd32eff3f23497412b3043","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:41.068188Z","signature_b64":"Nw1ZlF+UofujQUH71vwlbWa6xFqapC6+9YfbqUX5T+vBr+ezaXfsqNIeMQUknQccEpaK+bJJYdwbykPP9WybCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7cfe4735d1d1db7bcdc9030c91f2f5dd311bc381edd32eff3f23497412b3043","last_reissued_at":"2026-07-05T05:45:41.067855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:41.067855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.12940","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-07-05T05:45:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHLgzBb4JecmQ5G73+sWTQzz9wnF3XkDUCZtpfizOS+uYKnUZnxjz5Y+EhdjvY8F1CR22Qwe6B5dcQ1zttWxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T06:30:35.152651Z"},"content_sha256":"38543779f3e0e8aacde2e659eb193f9587673f3079cc14ad2aad0ad6aaa946c6","schema_version":"1.0","event_id":"sha256:38543779f3e0e8aacde2e659eb193f9587673f3079cc14ad2aad0ad6aaa946c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:U7H6I425DUO3PPG4SAYMSHZPLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Hardness of Reinforcement Learning with Linear Function Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LG","authors_text":"Csaba Szepesv\\'ari, Daniel Kane, Gaurav Mahajan, Gell\\'ert Weisz, Shachar Lovett, Sihan Liu","submitted_at":"2023-02-25T00:19:49Z","abstract_excerpt":"A fundamental question in reinforcement learning theory is: suppose the optimal value functions are linear in given features, can we learn them efficiently? This problem's counterpart in supervised learning, linear regression, can be solved both statistically and computationally efficiently. Therefore, it was quite surprising when a recent work \\cite{kane2022computational} showed a computational-statistical gap for linear reinforcement learning: even though there are polynomial sample-complexity algorithms, unless NP = RP, there are no polynomial time algorithms for this setting.\n  In this wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12940","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.12940/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-05T05:45:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vI2BbiJTfrC+/scn95M8pBPgNxvkbeiv3UcxUjdCCb539svrfdGZME4krUsMl+VqbZgLLE5qk+3+07nhctA5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T06:30:35.153021Z"},"content_sha256":"2a60a383106000848b82b364ba0c38c0cabf623f5fadb3492e2c98496d97e016","schema_version":"1.0","event_id":"sha256:2a60a383106000848b82b364ba0c38c0cabf623f5fadb3492e2c98496d97e016"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7H6I425DUO3PPG4SAYMSHZPLX/bundle.json","state_url":"https://pith.science/pith/U7H6I425DUO3PPG4SAYMSHZPLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7H6I425DUO3PPG4SAYMSHZPLX/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-18T06:30:35Z","links":{"resolver":"https://pith.science/pith/U7H6I425DUO3PPG4SAYMSHZPLX","bundle":"https://pith.science/pith/U7H6I425DUO3PPG4SAYMSHZPLX/bundle.json","state":"https://pith.science/pith/U7H6I425DUO3PPG4SAYMSHZPLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7H6I425DUO3PPG4SAYMSHZPLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:U7H6I425DUO3PPG4SAYMSHZPLX","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":"59def31355d611b5c67252c9c5bda856ca98d2648114e23f69fe08891c6f864b","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-25T00:19:49Z","title_canon_sha256":"362c2f925472275ebef00a0a294ece5fa8397de6e93cbaa661fe2cb560f345be"},"schema_version":"1.0","source":{"id":"2302.12940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12940","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12940v1","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12940","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"U7H6I425DUO3","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"U7H6I425DUO3PPG4","created_at":"2026-07-05T05:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"U7H6I425","created_at":"2026-07-05T05:45:41Z"}],"graph_snapshots":[{"event_id":"sha256:2a60a383106000848b82b364ba0c38c0cabf623f5fadb3492e2c98496d97e016","target":"graph","created_at":"2026-07-05T05:45:41Z","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/2302.12940/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A fundamental question in reinforcement learning theory is: suppose the optimal value functions are linear in given features, can we learn them efficiently? This problem's counterpart in supervised learning, linear regression, can be solved both statistically and computationally efficiently. Therefore, it was quite surprising when a recent work \\cite{kane2022computational} showed a computational-statistical gap for linear reinforcement learning: even though there are polynomial sample-complexity algorithms, unless NP = RP, there are no polynomial time algorithms for this setting.\n  In this wor","authors_text":"Csaba Szepesv\\'ari, Daniel Kane, Gaurav Mahajan, Gell\\'ert Weisz, Shachar Lovett, Sihan Liu","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-25T00:19:49Z","title":"Exponential Hardness of Reinforcement Learning with Linear Function Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12940","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:38543779f3e0e8aacde2e659eb193f9587673f3079cc14ad2aad0ad6aaa946c6","target":"record","created_at":"2026-07-05T05:45:41Z","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":"59def31355d611b5c67252c9c5bda856ca98d2648114e23f69fe08891c6f864b","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-25T00:19:49Z","title_canon_sha256":"362c2f925472275ebef00a0a294ece5fa8397de6e93cbaa661fe2cb560f345be"},"schema_version":"1.0","source":{"id":"2302.12940","kind":"arxiv","version":1}},"canonical_sha256":"a7cfe4735d1d1db7bcdc9030c91f2f5dd311bc381edd32eff3f23497412b3043","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7cfe4735d1d1db7bcdc9030c91f2f5dd311bc381edd32eff3f23497412b3043","first_computed_at":"2026-07-05T05:45:41.067855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:41.067855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nw1ZlF+UofujQUH71vwlbWa6xFqapC6+9YfbqUX5T+vBr+ezaXfsqNIeMQUknQccEpaK+bJJYdwbykPP9WybCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:41.068188Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.12940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38543779f3e0e8aacde2e659eb193f9587673f3079cc14ad2aad0ad6aaa946c6","sha256:2a60a383106000848b82b364ba0c38c0cabf623f5fadb3492e2c98496d97e016"],"state_sha256":"6919ee4474ba95ab3d79136200655dd6a41e0cd330a34986f982f8d72a84bee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6X0M+Fb7mEP09aRsBtg7eDWn0bMbZWxw+3bbQA5g/wI5jIlZMv2V3w2y2bjasD/gtn698u/UJsKIqTSaZUYeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T06:30:35.155515Z","bundle_sha256":"8fd192bbce703260ae49c6a38651cdef36aedab414e6b6fd0e4bd7d786039e73"}}