{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:F5CL5ZK65JY42S6BS5N43D7CAN","short_pith_number":"pith:F5CL5ZK6","canonical_record":{"source":{"id":"2503.06751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-09T20:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"4f4637fbbf3c6f0127f4a8de883dfc07174e444701f99f59948d1730b5a394ff","abstract_canon_sha256":"e3280b3e353dc077a5bd19897acec82b0a17f65258da048fb2fd6880fe39b935"},"schema_version":"1.0"},"canonical_sha256":"2f44bee55eea71cd4bc1975bcd8fe203498c9f0e7fe09b6cbdb857c641ee2836","source":{"kind":"arxiv","id":"2503.06751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.06751","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"2503.06751v1","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.06751","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"F5CL5ZK65JY4","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"pith_short_16","alias_value":"F5CL5ZK65JY42S6B","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"pith_short_8","alias_value":"F5CL5ZK6","created_at":"2026-07-05T10:27:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:F5CL5ZK65JY42S6BS5N43D7CAN","target":"record","payload":{"canonical_record":{"source":{"id":"2503.06751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-09T20:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"4f4637fbbf3c6f0127f4a8de883dfc07174e444701f99f59948d1730b5a394ff","abstract_canon_sha256":"e3280b3e353dc077a5bd19897acec82b0a17f65258da048fb2fd6880fe39b935"},"schema_version":"1.0"},"canonical_sha256":"2f44bee55eea71cd4bc1975bcd8fe203498c9f0e7fe09b6cbdb857c641ee2836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:27:41.470954Z","signature_b64":"wYfp3qnCvYJ0cnRjqLLQcgyaz27RtFemku7oBg66thXe2dATa7Rr6rMs/zZZldNWUvc9l2g57iJnx8oxYcRYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f44bee55eea71cd4bc1975bcd8fe203498c9f0e7fe09b6cbdb857c641ee2836","last_reissued_at":"2026-07-05T10:27:41.469862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:27:41.469862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.06751","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-05T10:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFGgtS9Aoj+YUKS/nrM0etudVnoyxM04bHNTlo6+ovZKsyUYoBQCbXod5NE/kDoOxSN9lNQEoGF5rCdXyXDbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:28:30.729120Z"},"content_sha256":"b0f16721f3965f406e8488fce678f3556a3567c294a3ee7e4aca8346a60ec0a2","schema_version":"1.0","event_id":"sha256:b0f16721f3965f406e8488fce678f3556a3567c294a3ee7e4aca8346a60ec0a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:F5CL5ZK65JY42S6BS5N43D7CAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andreas Spanopoulos, Konstantinos Papathanasiou, Max Buckley","submitted_at":"2025-03-09T20:10:35Z","abstract_excerpt":"This paper addresses the challenge of solving Constrained Markov Decision Processes (CMDPs) with $d > 1$ constraints when the transition dynamics are unknown, but samples can be drawn from a generative model. We propose a model-based algorithm for infinite horizon CMDPs with multiple constraints in the tabular setting, aiming to derive and prove sample complexity bounds for learning near-optimal policies. Our approach tackles both the relaxed and strict feasibility settings, where relaxed feasibility allows some constraint violations, and strict feasibility requires adherence to all constraint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.06751","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/2503.06751/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-05T10:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNZYay/xxIaAbXPZ2rSep1hDteOR3f4TCmYSAoTXz1heikCGXCsScIpqwFny8SfhGDZWMKL5C091nsKMdVUMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:28:30.729504Z"},"content_sha256":"02702ae2ef4e536663ef5c7960894611fa3155ffd0ab59e78351ae96e9ed9250","schema_version":"1.0","event_id":"sha256:02702ae2ef4e536663ef5c7960894611fa3155ffd0ab59e78351ae96e9ed9250"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5CL5ZK65JY42S6BS5N43D7CAN/bundle.json","state_url":"https://pith.science/pith/F5CL5ZK65JY42S6BS5N43D7CAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5CL5ZK65JY42S6BS5N43D7CAN/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-06T20:28:30Z","links":{"resolver":"https://pith.science/pith/F5CL5ZK65JY42S6BS5N43D7CAN","bundle":"https://pith.science/pith/F5CL5ZK65JY42S6BS5N43D7CAN/bundle.json","state":"https://pith.science/pith/F5CL5ZK65JY42S6BS5N43D7CAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5CL5ZK65JY42S6BS5N43D7CAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:F5CL5ZK65JY42S6BS5N43D7CAN","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":"e3280b3e353dc077a5bd19897acec82b0a17f65258da048fb2fd6880fe39b935","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-09T20:10:35Z","title_canon_sha256":"4f4637fbbf3c6f0127f4a8de883dfc07174e444701f99f59948d1730b5a394ff"},"schema_version":"1.0","source":{"id":"2503.06751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.06751","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"2503.06751v1","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.06751","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"F5CL5ZK65JY4","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"pith_short_16","alias_value":"F5CL5ZK65JY42S6B","created_at":"2026-07-05T10:27:41Z"},{"alias_kind":"pith_short_8","alias_value":"F5CL5ZK6","created_at":"2026-07-05T10:27:41Z"}],"graph_snapshots":[{"event_id":"sha256:02702ae2ef4e536663ef5c7960894611fa3155ffd0ab59e78351ae96e9ed9250","target":"graph","created_at":"2026-07-05T10:27: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/2503.06751/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the challenge of solving Constrained Markov Decision Processes (CMDPs) with $d > 1$ constraints when the transition dynamics are unknown, but samples can be drawn from a generative model. We propose a model-based algorithm for infinite horizon CMDPs with multiple constraints in the tabular setting, aiming to derive and prove sample complexity bounds for learning near-optimal policies. Our approach tackles both the relaxed and strict feasibility settings, where relaxed feasibility allows some constraint violations, and strict feasibility requires adherence to all constraint","authors_text":"Andreas Spanopoulos, Konstantinos Papathanasiou, Max Buckley","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-09T20:10:35Z","title":"Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.06751","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:b0f16721f3965f406e8488fce678f3556a3567c294a3ee7e4aca8346a60ec0a2","target":"record","created_at":"2026-07-05T10:27: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":"e3280b3e353dc077a5bd19897acec82b0a17f65258da048fb2fd6880fe39b935","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-09T20:10:35Z","title_canon_sha256":"4f4637fbbf3c6f0127f4a8de883dfc07174e444701f99f59948d1730b5a394ff"},"schema_version":"1.0","source":{"id":"2503.06751","kind":"arxiv","version":1}},"canonical_sha256":"2f44bee55eea71cd4bc1975bcd8fe203498c9f0e7fe09b6cbdb857c641ee2836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f44bee55eea71cd4bc1975bcd8fe203498c9f0e7fe09b6cbdb857c641ee2836","first_computed_at":"2026-07-05T10:27:41.469862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:27:41.469862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wYfp3qnCvYJ0cnRjqLLQcgyaz27RtFemku7oBg66thXe2dATa7Rr6rMs/zZZldNWUvc9l2g57iJnx8oxYcRYCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:27:41.470954Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.06751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0f16721f3965f406e8488fce678f3556a3567c294a3ee7e4aca8346a60ec0a2","sha256:02702ae2ef4e536663ef5c7960894611fa3155ffd0ab59e78351ae96e9ed9250"],"state_sha256":"c6ebf149b5018eea0c803c910027131ca98dd791fd8734992bbe56364d34fe82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRGQYAmogS9UJrHpoUg5DsklrY+h3YrD3vAGUjqlv/B4cesittDh6mxBD6oIyF9aM2WW8FgWPZv8QCAB6/vxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:28:30.731647Z","bundle_sha256":"2fa051732714c5f048738b8a9bb95ac8692e8ea2ee264e30eee82b0daf32a33a"}}