{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:QUF24P4E3L4SH5D5I5AFXCBPSJ","short_pith_number":"pith:QUF24P4E","canonical_record":{"source":{"id":"2307.03997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-08T15:41:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bfb1cf28e8f7d8ebdfb6ad7d0be2d95db68584b3ca947ae6f42507bc2302a5e3","abstract_canon_sha256":"cc2543670aafa6a0446dd7cb34078f15921ba5a3a11e5d5fcff1e337b19819f8"},"schema_version":"1.0"},"canonical_sha256":"850bae3f84daf923f47d47405b882f924d15a8ab0116483d6f2756d47755b88d","source":{"kind":"arxiv","id":"2307.03997","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03997","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03997v2","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03997","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"QUF24P4E3L4S","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"pith_short_16","alias_value":"QUF24P4E3L4SH5D5","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"pith_short_8","alias_value":"QUF24P4E","created_at":"2026-07-05T07:50:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:QUF24P4E3L4SH5D5I5AFXCBPSJ","target":"record","payload":{"canonical_record":{"source":{"id":"2307.03997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-08T15:41:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bfb1cf28e8f7d8ebdfb6ad7d0be2d95db68584b3ca947ae6f42507bc2302a5e3","abstract_canon_sha256":"cc2543670aafa6a0446dd7cb34078f15921ba5a3a11e5d5fcff1e337b19819f8"},"schema_version":"1.0"},"canonical_sha256":"850bae3f84daf923f47d47405b882f924d15a8ab0116483d6f2756d47755b88d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:38.385938Z","signature_b64":"ZQEfAB8W21qzcI995bA/tNYaQWaV+TIoG7N6zteCI82RA5Pz6A+pk6y/zpZQ/hrM7fJYRU07X2KZuqTSP+jBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"850bae3f84daf923f47d47405b882f924d15a8ab0116483d6f2756d47755b88d","last_reissued_at":"2026-07-05T07:50:38.385424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:38.385424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.03997","source_version":2,"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-05T07:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljDGx11PBHEHihF+pw8csgpsC3gveUgVZIsGXfi1XKye9Zc2eEaK8qfAVfk6cH4wi3axp+Gz0jt1eLHHSpWBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T06:57:44.012836Z"},"content_sha256":"8d90bb2b6094fdd05243e91bdbc811e3c414cb8c4c27540c93c70e64112589e9","schema_version":"1.0","event_id":"sha256:8d90bb2b6094fdd05243e91bdbc811e3c414cb8c4c27540c93c70e64112589e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:QUF24P4E3L4SH5D5I5AFXCBPSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Model-Free Exploration in Low-Rank MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Adam Block, Alexander Rakhlin, Dylan J. Foster, Zakaria Mhammedi","submitted_at":"2023-07-08T15:41:48Z","abstract_excerpt":"A major challenge in reinforcement learning is to develop practical, sample-efficient algorithms for exploration in high-dimensional domains where generalization and function approximation is required. Low-Rank Markov Decision Processes -- where transition probabilities admit a low-rank factorization based on an unknown feature embedding -- offer a simple, yet expressive framework for RL with function approximation, but existing algorithms are either (1) computationally intractable, or (2) reliant upon restrictive statistical assumptions such as latent variable structure, access to model-based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03997","kind":"arxiv","version":2},"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/2307.03997/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-05T07:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ky9onWAnPC+3b+IxnuVE2ohsMcWJ3gaycw8f+2wRP/b3U8WjJhaR7EjcvSyxOR8RRmVHL5zfgdnRE2j6JjJaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T06:57:44.013209Z"},"content_sha256":"0646f69c500e40a60938b72c9e59291f06112794e25d04504f385ec39bd282ab","schema_version":"1.0","event_id":"sha256:0646f69c500e40a60938b72c9e59291f06112794e25d04504f385ec39bd282ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUF24P4E3L4SH5D5I5AFXCBPSJ/bundle.json","state_url":"https://pith.science/pith/QUF24P4E3L4SH5D5I5AFXCBPSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUF24P4E3L4SH5D5I5AFXCBPSJ/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-06T06:57:44Z","links":{"resolver":"https://pith.science/pith/QUF24P4E3L4SH5D5I5AFXCBPSJ","bundle":"https://pith.science/pith/QUF24P4E3L4SH5D5I5AFXCBPSJ/bundle.json","state":"https://pith.science/pith/QUF24P4E3L4SH5D5I5AFXCBPSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUF24P4E3L4SH5D5I5AFXCBPSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:QUF24P4E3L4SH5D5I5AFXCBPSJ","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":"cc2543670aafa6a0446dd7cb34078f15921ba5a3a11e5d5fcff1e337b19819f8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-08T15:41:48Z","title_canon_sha256":"bfb1cf28e8f7d8ebdfb6ad7d0be2d95db68584b3ca947ae6f42507bc2302a5e3"},"schema_version":"1.0","source":{"id":"2307.03997","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03997","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03997v2","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03997","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"QUF24P4E3L4S","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"pith_short_16","alias_value":"QUF24P4E3L4SH5D5","created_at":"2026-07-05T07:50:38Z"},{"alias_kind":"pith_short_8","alias_value":"QUF24P4E","created_at":"2026-07-05T07:50:38Z"}],"graph_snapshots":[{"event_id":"sha256:0646f69c500e40a60938b72c9e59291f06112794e25d04504f385ec39bd282ab","target":"graph","created_at":"2026-07-05T07:50:38Z","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/2307.03997/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A major challenge in reinforcement learning is to develop practical, sample-efficient algorithms for exploration in high-dimensional domains where generalization and function approximation is required. Low-Rank Markov Decision Processes -- where transition probabilities admit a low-rank factorization based on an unknown feature embedding -- offer a simple, yet expressive framework for RL with function approximation, but existing algorithms are either (1) computationally intractable, or (2) reliant upon restrictive statistical assumptions such as latent variable structure, access to model-based","authors_text":"Adam Block, Alexander Rakhlin, Dylan J. Foster, Zakaria Mhammedi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-08T15:41:48Z","title":"Efficient Model-Free Exploration in Low-Rank MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03997","kind":"arxiv","version":2},"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:8d90bb2b6094fdd05243e91bdbc811e3c414cb8c4c27540c93c70e64112589e9","target":"record","created_at":"2026-07-05T07:50:38Z","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":"cc2543670aafa6a0446dd7cb34078f15921ba5a3a11e5d5fcff1e337b19819f8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-08T15:41:48Z","title_canon_sha256":"bfb1cf28e8f7d8ebdfb6ad7d0be2d95db68584b3ca947ae6f42507bc2302a5e3"},"schema_version":"1.0","source":{"id":"2307.03997","kind":"arxiv","version":2}},"canonical_sha256":"850bae3f84daf923f47d47405b882f924d15a8ab0116483d6f2756d47755b88d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"850bae3f84daf923f47d47405b882f924d15a8ab0116483d6f2756d47755b88d","first_computed_at":"2026-07-05T07:50:38.385424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:38.385424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQEfAB8W21qzcI995bA/tNYaQWaV+TIoG7N6zteCI82RA5Pz6A+pk6y/zpZQ/hrM7fJYRU07X2KZuqTSP+jBDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:38.385938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.03997","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d90bb2b6094fdd05243e91bdbc811e3c414cb8c4c27540c93c70e64112589e9","sha256:0646f69c500e40a60938b72c9e59291f06112794e25d04504f385ec39bd282ab"],"state_sha256":"eeb43afa7dfd1579b65a7507ff3aa4edf5e83a4059e4571962c2ce330c6fdfd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Of2p6xVmZ+bzvomHH5M0D5j9C48ipr+eKQ4AH7eqVub0MzCBedRBbIjpZsH7yqSZ4248rXyOhZH5ZdAxiBCfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T06:57:44.016157Z","bundle_sha256":"aab036d1e27308cdb5d2a288d3eee842c41b41174f22b045e980819e94356c06"}}