{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EWP23T2S5XTXLEVMVJM335SGDC","short_pith_number":"pith:EWP23T2S","canonical_record":{"source":{"id":"2210.00832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-03T11:35:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0ed0d06292a7183377d3649c4023762accf750b20ca80b5b5667a4072cdb06d5","abstract_canon_sha256":"b7217c9122148d601bed2ba8e262c83b303a9ed46bb93eef33c048db263bda28"},"schema_version":"1.0"},"canonical_sha256":"259fadcf52ede77592acaa59bdf64618932aa125f1b3a0ff9cb679ee836e8ec7","source":{"kind":"arxiv","id":"2210.00832","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00832","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00832v2","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00832","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"EWP23T2S5XTX","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"pith_short_16","alias_value":"EWP23T2S5XTXLEVM","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"pith_short_8","alias_value":"EWP23T2S","created_at":"2026-07-05T06:56:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EWP23T2S5XTXLEVMVJM335SGDC","target":"record","payload":{"canonical_record":{"source":{"id":"2210.00832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-03T11:35:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0ed0d06292a7183377d3649c4023762accf750b20ca80b5b5667a4072cdb06d5","abstract_canon_sha256":"b7217c9122148d601bed2ba8e262c83b303a9ed46bb93eef33c048db263bda28"},"schema_version":"1.0"},"canonical_sha256":"259fadcf52ede77592acaa59bdf64618932aa125f1b3a0ff9cb679ee836e8ec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:30.027124Z","signature_b64":"IQcctF8zA3QvbR5sAattqQVvtgBYeJDW6uzjpznj3rqdtBO8mgsP7RpcI8AL7ekEq4NagB8CId5hLJNOOkAPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"259fadcf52ede77592acaa59bdf64618932aa125f1b3a0ff9cb679ee836e8ec7","last_reissued_at":"2026-07-05T06:56:30.026663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:30.026663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.00832","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-05T06:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LBE0ckU0f0DRVw3OeDrbT73RiFS7bzb7g8wegwPLe/Us/cNe/NybDOc7qtN0wkJu1Vua5LfNVsQUkSd86qeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:23:15.346346Z"},"content_sha256":"3266298a45ef2ad062531d24e516976b3f6121df133401e18310f827099b8637","schema_version":"1.0","event_id":"sha256:3266298a45ef2ad062531d24e516976b3f6121df133401e18310f827099b8637"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EWP23T2S5XTXLEVMVJM335SGDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Square-root regret bounds for continuous-time episodic Markov decision processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Xuefeng Gao, Xun Yu Zhou","submitted_at":"2022-10-03T11:35:07Z","abstract_excerpt":"We study reinforcement learning for continuous-time Markov decision processes (MDPs) in the finite-horizon episodic setting. In contrast to discrete-time MDPs, the inter-transition times of a continuous-time MDP are exponentially distributed with rate parameters depending on the state--action pair at each transition. We present a learning algorithm based on the methods of value iteration and upper confidence bound. We derive an upper bound on the worst-case expected regret for the proposed algorithm, and establish a worst-case lower bound, both bounds are of the order of square-root on the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00832","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/2210.00832/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-05T06:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+IcXNVJwwdJnXdliPB0jgpYwVJku5Q8mu5k4mC8Wl4yTuBcEDtzr0gAVfIlaDVqREl078eFuPlN7KSbwdkoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:23:15.347250Z"},"content_sha256":"6b313524ba1257ce7fc221bcfa41c9bb73f331cf75ef77f2cd1bd5c441c68516","schema_version":"1.0","event_id":"sha256:6b313524ba1257ce7fc221bcfa41c9bb73f331cf75ef77f2cd1bd5c441c68516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWP23T2S5XTXLEVMVJM335SGDC/bundle.json","state_url":"https://pith.science/pith/EWP23T2S5XTXLEVMVJM335SGDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWP23T2S5XTXLEVMVJM335SGDC/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-08-04T21:23:15Z","links":{"resolver":"https://pith.science/pith/EWP23T2S5XTXLEVMVJM335SGDC","bundle":"https://pith.science/pith/EWP23T2S5XTXLEVMVJM335SGDC/bundle.json","state":"https://pith.science/pith/EWP23T2S5XTXLEVMVJM335SGDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWP23T2S5XTXLEVMVJM335SGDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EWP23T2S5XTXLEVMVJM335SGDC","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":"b7217c9122148d601bed2ba8e262c83b303a9ed46bb93eef33c048db263bda28","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-03T11:35:07Z","title_canon_sha256":"0ed0d06292a7183377d3649c4023762accf750b20ca80b5b5667a4072cdb06d5"},"schema_version":"1.0","source":{"id":"2210.00832","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00832","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00832v2","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00832","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"EWP23T2S5XTX","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"pith_short_16","alias_value":"EWP23T2S5XTXLEVM","created_at":"2026-07-05T06:56:30Z"},{"alias_kind":"pith_short_8","alias_value":"EWP23T2S","created_at":"2026-07-05T06:56:30Z"}],"graph_snapshots":[{"event_id":"sha256:6b313524ba1257ce7fc221bcfa41c9bb73f331cf75ef77f2cd1bd5c441c68516","target":"graph","created_at":"2026-07-05T06:56:30Z","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/2210.00832/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study reinforcement learning for continuous-time Markov decision processes (MDPs) in the finite-horizon episodic setting. In contrast to discrete-time MDPs, the inter-transition times of a continuous-time MDP are exponentially distributed with rate parameters depending on the state--action pair at each transition. We present a learning algorithm based on the methods of value iteration and upper confidence bound. We derive an upper bound on the worst-case expected regret for the proposed algorithm, and establish a worst-case lower bound, both bounds are of the order of square-root on the num","authors_text":"Xuefeng Gao, Xun Yu Zhou","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-03T11:35:07Z","title":"Square-root regret bounds for continuous-time episodic Markov decision processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00832","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:3266298a45ef2ad062531d24e516976b3f6121df133401e18310f827099b8637","target":"record","created_at":"2026-07-05T06:56:30Z","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":"b7217c9122148d601bed2ba8e262c83b303a9ed46bb93eef33c048db263bda28","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-03T11:35:07Z","title_canon_sha256":"0ed0d06292a7183377d3649c4023762accf750b20ca80b5b5667a4072cdb06d5"},"schema_version":"1.0","source":{"id":"2210.00832","kind":"arxiv","version":2}},"canonical_sha256":"259fadcf52ede77592acaa59bdf64618932aa125f1b3a0ff9cb679ee836e8ec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"259fadcf52ede77592acaa59bdf64618932aa125f1b3a0ff9cb679ee836e8ec7","first_computed_at":"2026-07-05T06:56:30.026663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:56:30.026663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IQcctF8zA3QvbR5sAattqQVvtgBYeJDW6uzjpznj3rqdtBO8mgsP7RpcI8AL7ekEq4NagB8CId5hLJNOOkAPAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:56:30.027124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.00832","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3266298a45ef2ad062531d24e516976b3f6121df133401e18310f827099b8637","sha256:6b313524ba1257ce7fc221bcfa41c9bb73f331cf75ef77f2cd1bd5c441c68516"],"state_sha256":"4c9e97d8257f066153659984085b31427070a39798ae9bb15e711744a4bf8f2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BR0nwDt+zyr1hg2ZU3bfukYfA8uJ9sGiPJ/AtnlVf0kFVeYS+Mp8KmJ1nNr7PLITQf5AmAevcC3crueMx9O3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:23:15.398224Z","bundle_sha256":"a979e1c0f5a66e995b2d6b7c8503a93a892bcb8da3ff727a7869d7c476221160"}}