{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:W4625GTPIQ6UJRQGC6LS2FWEYF","short_pith_number":"pith:W4625GTP","canonical_record":{"source":{"id":"2306.07001","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-12T10:10:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6770a2236b1eed017de294aeb487923490611f1868c9d32671c240e85b42d303","abstract_canon_sha256":"e9b10140910f19f1dd8b39221d829b2f7b202d388cebe256d390affefe498317"},"schema_version":"1.0"},"canonical_sha256":"b73dae9a6f443d44c60617972d16c4c1564ebcd4fb1789164997629135ece1ee","source":{"kind":"arxiv","id":"2306.07001","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.07001","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"2306.07001v2","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07001","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"W4625GTPIQ6U","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"pith_short_16","alias_value":"W4625GTPIQ6UJRQG","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"pith_short_8","alias_value":"W4625GTP","created_at":"2026-07-05T06:46:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:W4625GTPIQ6UJRQGC6LS2FWEYF","target":"record","payload":{"canonical_record":{"source":{"id":"2306.07001","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-12T10:10:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6770a2236b1eed017de294aeb487923490611f1868c9d32671c240e85b42d303","abstract_canon_sha256":"e9b10140910f19f1dd8b39221d829b2f7b202d388cebe256d390affefe498317"},"schema_version":"1.0"},"canonical_sha256":"b73dae9a6f443d44c60617972d16c4c1564ebcd4fb1789164997629135ece1ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:05.884689Z","signature_b64":"FZ2gpYD0I560HbY+irUEQ/SbCJJqJnmKutEBwLCFQ8ILopa+1NkwXkNHOPStWEoao1cNFyZIvznCOhLy+xM9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b73dae9a6f443d44c60617972d16c4c1564ebcd4fb1789164997629135ece1ee","last_reissued_at":"2026-07-05T06:46:05.884173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:05.884173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.07001","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:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+Ch6emKaNd3BuLfm7alzkR4zO/P6nWYq3xUUk87xsLtpp0R30JrrukmUBEz2uoaPhqXlxVurSvRbS4jdj+JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:14:42.588900Z"},"content_sha256":"caacf03caff6f8cb92c54a7989491993391e514ac68ef82c0f5412f62cd75582","schema_version":"1.0","event_id":"sha256:caacf03caff6f8cb92c54a7989491993391e514ac68ef82c0f5412f62cd75582"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:W4625GTPIQ6UJRQGC6LS2FWEYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cancellation-Free Regret Bounds for Lagrangian Approaches in Constrained Markov Decision Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian M\\\"uller, Giorgia Ramponi, Niao He, Pragnya Alatur","submitted_at":"2023-06-12T10:10:57Z","abstract_excerpt":"Constrained Markov Decision Processes (CMDPs) are one of the common ways to model safe reinforcement learning problems, where constraint functions model the safety objectives. Lagrangian-based dual or primal-dual algorithms provide efficient methods for learning in CMDPs. For these algorithms, the currently known regret bounds in the finite-horizon setting allow for a \"cancellation of errors\"; one can compensate for a constraint violation in one episode with a strict constraint satisfaction in another. However, we do not consider such a behavior safe in practical applications. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07001","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/2306.07001/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:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23ZL62Gsw2O6JeL80Jed90y/ySH6OMLlGAZRT7YHlMkQX+44jm4k+XMviUDZ8VMjM8iAfIbJ/HurdHv9ZwB5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:14:42.589409Z"},"content_sha256":"b2acc97c17bf9e34c2bfa78b8d1448024d9af1764f584f569d0644566b91b83a","schema_version":"1.0","event_id":"sha256:b2acc97c17bf9e34c2bfa78b8d1448024d9af1764f584f569d0644566b91b83a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4625GTPIQ6UJRQGC6LS2FWEYF/bundle.json","state_url":"https://pith.science/pith/W4625GTPIQ6UJRQGC6LS2FWEYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4625GTPIQ6UJRQGC6LS2FWEYF/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-08T09:14:42Z","links":{"resolver":"https://pith.science/pith/W4625GTPIQ6UJRQGC6LS2FWEYF","bundle":"https://pith.science/pith/W4625GTPIQ6UJRQGC6LS2FWEYF/bundle.json","state":"https://pith.science/pith/W4625GTPIQ6UJRQGC6LS2FWEYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4625GTPIQ6UJRQGC6LS2FWEYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:W4625GTPIQ6UJRQGC6LS2FWEYF","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":"e9b10140910f19f1dd8b39221d829b2f7b202d388cebe256d390affefe498317","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-12T10:10:57Z","title_canon_sha256":"6770a2236b1eed017de294aeb487923490611f1868c9d32671c240e85b42d303"},"schema_version":"1.0","source":{"id":"2306.07001","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.07001","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"2306.07001v2","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07001","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"W4625GTPIQ6U","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"pith_short_16","alias_value":"W4625GTPIQ6UJRQG","created_at":"2026-07-05T06:46:05Z"},{"alias_kind":"pith_short_8","alias_value":"W4625GTP","created_at":"2026-07-05T06:46:05Z"}],"graph_snapshots":[{"event_id":"sha256:b2acc97c17bf9e34c2bfa78b8d1448024d9af1764f584f569d0644566b91b83a","target":"graph","created_at":"2026-07-05T06:46:05Z","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/2306.07001/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constrained Markov Decision Processes (CMDPs) are one of the common ways to model safe reinforcement learning problems, where constraint functions model the safety objectives. Lagrangian-based dual or primal-dual algorithms provide efficient methods for learning in CMDPs. For these algorithms, the currently known regret bounds in the finite-horizon setting allow for a \"cancellation of errors\"; one can compensate for a constraint violation in one episode with a strict constraint satisfaction in another. However, we do not consider such a behavior safe in practical applications. In this paper, w","authors_text":"Adrian M\\\"uller, Giorgia Ramponi, Niao He, Pragnya Alatur","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-12T10:10:57Z","title":"Cancellation-Free Regret Bounds for Lagrangian Approaches in Constrained Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07001","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:caacf03caff6f8cb92c54a7989491993391e514ac68ef82c0f5412f62cd75582","target":"record","created_at":"2026-07-05T06:46:05Z","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":"e9b10140910f19f1dd8b39221d829b2f7b202d388cebe256d390affefe498317","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-12T10:10:57Z","title_canon_sha256":"6770a2236b1eed017de294aeb487923490611f1868c9d32671c240e85b42d303"},"schema_version":"1.0","source":{"id":"2306.07001","kind":"arxiv","version":2}},"canonical_sha256":"b73dae9a6f443d44c60617972d16c4c1564ebcd4fb1789164997629135ece1ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b73dae9a6f443d44c60617972d16c4c1564ebcd4fb1789164997629135ece1ee","first_computed_at":"2026-07-05T06:46:05.884173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:46:05.884173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FZ2gpYD0I560HbY+irUEQ/SbCJJqJnmKutEBwLCFQ8ILopa+1NkwXkNHOPStWEoao1cNFyZIvznCOhLy+xM9Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:46:05.884689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.07001","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caacf03caff6f8cb92c54a7989491993391e514ac68ef82c0f5412f62cd75582","sha256:b2acc97c17bf9e34c2bfa78b8d1448024d9af1764f584f569d0644566b91b83a"],"state_sha256":"5681ad885dd05da2874200b8f51aea11b9445c1ccd2ec9b7ef218630d66bcf32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAeqGSSQd6TsBgqvDgGS+H4b4nU+l7OZHR1SXpPegkFWkCpB9Ktb6Hkn5Fg+Ba9ysPOu+KDeLy5g9m0QJg62AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:14:42.593541Z","bundle_sha256":"0d8f6ee0b8a989ba33cffbb132a72e7a8f58eb938961ed473a6ef1802326ce7e"}}