{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3VCUT2ESLVSS36BRNLEWYBHZ34","short_pith_number":"pith:3VCUT2ES","canonical_record":{"source":{"id":"1703.07710","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T15:34:23Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"e13c3f9f433c674c6938dc861e4d11ae34f1e40b43253ecf14c8298f1b9ddf4d","abstract_canon_sha256":"54956bf1f931434a8708c76f33c73934925e3ca4993f01aee2e1456b10c1275c"},"schema_version":"1.0"},"canonical_sha256":"dd4549e8925d652df8316ac96c04f9df289201a3325a301cb58183c7d532c531","source":{"kind":"arxiv","id":"1703.07710","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07710","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07710v3","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07710","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"3VCUT2ESLVSS","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3VCUT2ESLVSS36BR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3VCUT2ES","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3VCUT2ESLVSS36BRNLEWYBHZ34","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07710","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T15:34:23Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"e13c3f9f433c674c6938dc861e4d11ae34f1e40b43253ecf14c8298f1b9ddf4d","abstract_canon_sha256":"54956bf1f931434a8708c76f33c73934925e3ca4993f01aee2e1456b10c1275c"},"schema_version":"1.0"},"canonical_sha256":"dd4549e8925d652df8316ac96c04f9df289201a3325a301cb58183c7d532c531","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:57.467769Z","signature_b64":"NjbyjvXUshxnQGZxCuJhrI4qQs78ulwlg48/5ltzpEDzHVVf6LTuF8vX0r6ilZIesr3C5+XHGWfruMjFy8JxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd4549e8925d652df8316ac96c04f9df289201a3325a301cb58183c7d532c531","last_reissued_at":"2026-05-18T00:26:57.467251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:57.467251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07710","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-05-18T00:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCi+cpSL7EDhA/vDxZ1jDfrglrsyCzTv1+F9VTvBPt0rXrmFy4EoOgwmtG390Bu1brxmBZEUIPUSlwXUBvngBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:42:15.050336Z"},"content_sha256":"a0276c2dabd51dc978ea3b8ea4018744c83fa00d51373f5e3897cf16095181ec","schema_version":"1.0","event_id":"sha256:a0276c2dabd51dc978ea3b8ea4018744c83fa00d51373f5e3897cf16095181ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3VCUT2ESLVSS36BRNLEWYBHZ34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christoph Dann, Emma Brunskill, Tor Lattimore","submitted_at":"2017-03-22T15:34:23Z","abstract_excerpt":"Statistical performance bounds for reinforcement learning (RL) algorithms can be critical for high-stakes applications like healthcare. This paper introduces a new framework for theoretically measuring the performance of such algorithms called Uniform-PAC, which is a strengthening of the classical Probably Approximately Correct (PAC) framework. In contrast to the PAC framework, the uniform version may be used to derive high probability regret guarantees and so forms a bridge between the two setups that has been missing in the literature. We demonstrate the benefits of the new framework for fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07710","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":""},"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-18T00:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZJ7AEeCi06G7s8hVqu/4MTT1bOg8Tb4qmk1MfewFGy6TzmWae9onSdZKkmQgTcRl2qn9dqjphmCcqIp9OXPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:42:15.050698Z"},"content_sha256":"dc94eb050e653275d33835c0511ee6c42cced6d5cfd6ef816910c6308b0c04b8","schema_version":"1.0","event_id":"sha256:dc94eb050e653275d33835c0511ee6c42cced6d5cfd6ef816910c6308b0c04b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VCUT2ESLVSS36BRNLEWYBHZ34/bundle.json","state_url":"https://pith.science/pith/3VCUT2ESLVSS36BRNLEWYBHZ34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VCUT2ESLVSS36BRNLEWYBHZ34/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-05T01:42:15Z","links":{"resolver":"https://pith.science/pith/3VCUT2ESLVSS36BRNLEWYBHZ34","bundle":"https://pith.science/pith/3VCUT2ESLVSS36BRNLEWYBHZ34/bundle.json","state":"https://pith.science/pith/3VCUT2ESLVSS36BRNLEWYBHZ34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VCUT2ESLVSS36BRNLEWYBHZ34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3VCUT2ESLVSS36BRNLEWYBHZ34","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":"54956bf1f931434a8708c76f33c73934925e3ca4993f01aee2e1456b10c1275c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T15:34:23Z","title_canon_sha256":"e13c3f9f433c674c6938dc861e4d11ae34f1e40b43253ecf14c8298f1b9ddf4d"},"schema_version":"1.0","source":{"id":"1703.07710","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07710","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07710v3","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07710","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"3VCUT2ESLVSS","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3VCUT2ESLVSS36BR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3VCUT2ES","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:dc94eb050e653275d33835c0511ee6c42cced6d5cfd6ef816910c6308b0c04b8","target":"graph","created_at":"2026-05-18T00:26:57Z","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":"Statistical performance bounds for reinforcement learning (RL) algorithms can be critical for high-stakes applications like healthcare. This paper introduces a new framework for theoretically measuring the performance of such algorithms called Uniform-PAC, which is a strengthening of the classical Probably Approximately Correct (PAC) framework. In contrast to the PAC framework, the uniform version may be used to derive high probability regret guarantees and so forms a bridge between the two setups that has been missing in the literature. We demonstrate the benefits of the new framework for fin","authors_text":"Christoph Dann, Emma Brunskill, Tor Lattimore","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T15:34:23Z","title":"Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07710","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:a0276c2dabd51dc978ea3b8ea4018744c83fa00d51373f5e3897cf16095181ec","target":"record","created_at":"2026-05-18T00:26:57Z","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":"54956bf1f931434a8708c76f33c73934925e3ca4993f01aee2e1456b10c1275c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T15:34:23Z","title_canon_sha256":"e13c3f9f433c674c6938dc861e4d11ae34f1e40b43253ecf14c8298f1b9ddf4d"},"schema_version":"1.0","source":{"id":"1703.07710","kind":"arxiv","version":3}},"canonical_sha256":"dd4549e8925d652df8316ac96c04f9df289201a3325a301cb58183c7d532c531","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd4549e8925d652df8316ac96c04f9df289201a3325a301cb58183c7d532c531","first_computed_at":"2026-05-18T00:26:57.467251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:57.467251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NjbyjvXUshxnQGZxCuJhrI4qQs78ulwlg48/5ltzpEDzHVVf6LTuF8vX0r6ilZIesr3C5+XHGWfruMjFy8JxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:57.467769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07710","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0276c2dabd51dc978ea3b8ea4018744c83fa00d51373f5e3897cf16095181ec","sha256:dc94eb050e653275d33835c0511ee6c42cced6d5cfd6ef816910c6308b0c04b8"],"state_sha256":"e49dcf67743b90b9bccf577adaf4615de94360fea88bd99314229521bc1c847e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mfc1UVNvmTiZJH/rkzTixJN1U6CFuTmS89rpTIa0NYwjjfbL/VUwezlCQkSe/1wPuxfItivTLTiocfxnMTtXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:42:15.052808Z","bundle_sha256":"8d929086bd617b37bf6d5310d61a59ddb7f68231b6ebf05ba5b00a5dc8164656"}}