{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6BN2JW6WGG2OJXIZKLKUBJK7X5","short_pith_number":"pith:6BN2JW6W","canonical_record":{"source":{"id":"2401.08016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-15T23:58:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7637bc34d62466e789f7c0de5ac883061097a1ac69e2f601f08dfd5dd2a8ff43","abstract_canon_sha256":"21f3499e2af7539352302eaab82aa6145bcae5bd7cc891a8736f5e962699c397"},"schema_version":"1.0"},"canonical_sha256":"f05ba4dbd631b4e4dd1952d540a55fbf4b447f319fab985689fa5fa3334a79b7","source":{"kind":"arxiv","id":"2401.08016","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.08016","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"arxiv_version","alias_value":"2401.08016v2","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08016","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"pith_short_12","alias_value":"6BN2JW6WGG2O","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"pith_short_16","alias_value":"6BN2JW6WGG2OJXIZ","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"pith_short_8","alias_value":"6BN2JW6W","created_at":"2026-07-05T11:56:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6BN2JW6WGG2OJXIZKLKUBJK7X5","target":"record","payload":{"canonical_record":{"source":{"id":"2401.08016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-15T23:58:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7637bc34d62466e789f7c0de5ac883061097a1ac69e2f601f08dfd5dd2a8ff43","abstract_canon_sha256":"21f3499e2af7539352302eaab82aa6145bcae5bd7cc891a8736f5e962699c397"},"schema_version":"1.0"},"canonical_sha256":"f05ba4dbd631b4e4dd1952d540a55fbf4b447f319fab985689fa5fa3334a79b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:47.831279Z","signature_b64":"5RlV4zj4of9S0ZDxLBzJ8QVVUAd3jfNISXV/JcKBsVpukAyD2wBj37PoXSW5Jc65fB2VsFMTfTIAYNyfqS/hDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f05ba4dbd631b4e4dd1952d540a55fbf4b447f319fab985689fa5fa3334a79b7","last_reissued_at":"2026-07-05T11:56:47.830828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:47.830828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.08016","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-05T11:56:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ge00piDIxBBjqtLRqCzii4sazHEWIn+4QG+b4ouGrQUODyse02EznkFfb4INvmQ/KKtVJK1H1sAqejvd5UGsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:12:58.281659Z"},"content_sha256":"70125a67124d328a2e2d5d0b9d686139d3ad32d1208e389f722a5addcdc8f5d9","schema_version":"1.0","event_id":"sha256:70125a67124d328a2e2d5d0b9d686139d3ad32d1208e389f722a5addcdc8f5d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6BN2JW6WGG2OJXIZKLKUBJK7X5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contextual Bandits with Stage-wise Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aldo Pacchiano, Mohammad Ghavamzadeh, Peter Bartlett","submitted_at":"2024-01-15T23:58:21Z","abstract_excerpt":"We study contextual bandits in the presence of a stage-wise constraint when the constraint must be satisfied both with high probability and in expectation. We start with the linear case where both the reward function and the stage-wise constraint (cost function) are linear. In each of the high probability and in expectation settings, we propose an upper-confidence bound algorithm for the problem and prove a $T$-round regret bound for it. We also prove a lower-bound for this constrained problem, show how our algorithms and analyses can be extended to multiple constraints, and provide simulation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08016","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/2401.08016/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-05T11:56:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMRj6t8wFkSiio87dAGN/J6det0EsokQ7El5GPUh6rOBv2j0YjO8iaIB7K1vLTmt4iKGFFh06nxWzFQA+OqiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:12:58.282172Z"},"content_sha256":"a1df96fcb2ef69b2d237e15d0968af81e09f15d163b1c611596d1d08f045159b","schema_version":"1.0","event_id":"sha256:a1df96fcb2ef69b2d237e15d0968af81e09f15d163b1c611596d1d08f045159b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BN2JW6WGG2OJXIZKLKUBJK7X5/bundle.json","state_url":"https://pith.science/pith/6BN2JW6WGG2OJXIZKLKUBJK7X5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BN2JW6WGG2OJXIZKLKUBJK7X5/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-11T01:12:58Z","links":{"resolver":"https://pith.science/pith/6BN2JW6WGG2OJXIZKLKUBJK7X5","bundle":"https://pith.science/pith/6BN2JW6WGG2OJXIZKLKUBJK7X5/bundle.json","state":"https://pith.science/pith/6BN2JW6WGG2OJXIZKLKUBJK7X5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BN2JW6WGG2OJXIZKLKUBJK7X5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6BN2JW6WGG2OJXIZKLKUBJK7X5","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":"21f3499e2af7539352302eaab82aa6145bcae5bd7cc891a8736f5e962699c397","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-15T23:58:21Z","title_canon_sha256":"7637bc34d62466e789f7c0de5ac883061097a1ac69e2f601f08dfd5dd2a8ff43"},"schema_version":"1.0","source":{"id":"2401.08016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.08016","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"arxiv_version","alias_value":"2401.08016v2","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08016","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"pith_short_12","alias_value":"6BN2JW6WGG2O","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"pith_short_16","alias_value":"6BN2JW6WGG2OJXIZ","created_at":"2026-07-05T11:56:47Z"},{"alias_kind":"pith_short_8","alias_value":"6BN2JW6W","created_at":"2026-07-05T11:56:47Z"}],"graph_snapshots":[{"event_id":"sha256:a1df96fcb2ef69b2d237e15d0968af81e09f15d163b1c611596d1d08f045159b","target":"graph","created_at":"2026-07-05T11:56:47Z","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/2401.08016/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study contextual bandits in the presence of a stage-wise constraint when the constraint must be satisfied both with high probability and in expectation. We start with the linear case where both the reward function and the stage-wise constraint (cost function) are linear. In each of the high probability and in expectation settings, we propose an upper-confidence bound algorithm for the problem and prove a $T$-round regret bound for it. We also prove a lower-bound for this constrained problem, show how our algorithms and analyses can be extended to multiple constraints, and provide simulation","authors_text":"Aldo Pacchiano, Mohammad Ghavamzadeh, Peter Bartlett","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-15T23:58:21Z","title":"Contextual Bandits with Stage-wise Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08016","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:70125a67124d328a2e2d5d0b9d686139d3ad32d1208e389f722a5addcdc8f5d9","target":"record","created_at":"2026-07-05T11:56:47Z","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":"21f3499e2af7539352302eaab82aa6145bcae5bd7cc891a8736f5e962699c397","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-15T23:58:21Z","title_canon_sha256":"7637bc34d62466e789f7c0de5ac883061097a1ac69e2f601f08dfd5dd2a8ff43"},"schema_version":"1.0","source":{"id":"2401.08016","kind":"arxiv","version":2}},"canonical_sha256":"f05ba4dbd631b4e4dd1952d540a55fbf4b447f319fab985689fa5fa3334a79b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f05ba4dbd631b4e4dd1952d540a55fbf4b447f319fab985689fa5fa3334a79b7","first_computed_at":"2026-07-05T11:56:47.830828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:56:47.830828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5RlV4zj4of9S0ZDxLBzJ8QVVUAd3jfNISXV/JcKBsVpukAyD2wBj37PoXSW5Jc65fB2VsFMTfTIAYNyfqS/hDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:56:47.831279Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.08016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70125a67124d328a2e2d5d0b9d686139d3ad32d1208e389f722a5addcdc8f5d9","sha256:a1df96fcb2ef69b2d237e15d0968af81e09f15d163b1c611596d1d08f045159b"],"state_sha256":"d6e7ff8923407b5950d8b09c06c069e93e124e6c98c64fd850d00e1a0923ee38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Te59ZOtsIYjCtY9Bh1vxSZrRVPQe+UlU22pe3P8eZStfEs0xzMig1tv5D5rTuQWSma29lrmWql6EV9NiCiDOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:12:58.286030Z","bundle_sha256":"02ed17172511e5551018aa6223f119f5f78cb1aeef79927f344958a87d63d5d3"}}