{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XWUO65X3PJ7H3JNDHYNA5OSIM5","short_pith_number":"pith:XWUO65X3","canonical_record":{"source":{"id":"2505.07101","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-11T19:22:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fd8c945da1ee34bb39bf37418bf23be69bcb6079d51f034c91ccd78177a9ac18","abstract_canon_sha256":"2fd6f835dab17452739fc5068ee004f21eaa7d75907e0d1f16a6710c924437cd"},"schema_version":"1.0"},"canonical_sha256":"bda8ef76fb7a7e7da5a33e1a0eba486750e0fd81a507d5e4757a32a850234917","source":{"kind":"arxiv","id":"2505.07101","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.07101","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"2505.07101v3","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07101","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"XWUO65X3PJ7H","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"pith_short_16","alias_value":"XWUO65X3PJ7H3JND","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"pith_short_8","alias_value":"XWUO65X3","created_at":"2026-07-05T11:07:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XWUO65X3PJ7H3JNDHYNA5OSIM5","target":"record","payload":{"canonical_record":{"source":{"id":"2505.07101","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-11T19:22:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fd8c945da1ee34bb39bf37418bf23be69bcb6079d51f034c91ccd78177a9ac18","abstract_canon_sha256":"2fd6f835dab17452739fc5068ee004f21eaa7d75907e0d1f16a6710c924437cd"},"schema_version":"1.0"},"canonical_sha256":"bda8ef76fb7a7e7da5a33e1a0eba486750e0fd81a507d5e4757a32a850234917","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:24.499454Z","signature_b64":"LgB60j42fV+3P5ux8/cGdePA4QWJEhmZFDCLEgpUhHTVF37tTkn1vDidNIhRuk9w5DoJozf09z0Sq0ds+NT/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda8ef76fb7a7e7da5a33e1a0eba486750e0fd81a507d5e4757a32a850234917","last_reissued_at":"2026-07-05T11:07:24.498975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:24.498975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.07101","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-07-05T11:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjCE37Wz91x+2PzSNC/yReU9lCS4TFcCRCLza/hYVUauyW0OakU0TV50sjy4C6+u/9tXtZmOAIhD3199LjFpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:09:51.534845Z"},"content_sha256":"39922e6b9ac68688b723c48d87e27e207abf87f18fea8c84357fc8464fd2128d","schema_version":"1.0","event_id":"sha256:39922e6b9ac68688b723c48d87e27e207abf87f18fea8c84357fc8464fd2128d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XWUO65X3PJ7H3JNDHYNA5OSIM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Online Decision-Making: A Unified Framework","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"David Simchi-Levi, Haichen Hu, Navid Azizan","submitted_at":"2025-05-11T19:22:04Z","abstract_excerpt":"Contextual online decision-making problems with constraints appear in a wide range of real-world applications, such as adaptive experimental design under safety constraints, personalized recommendation with resource limits, and dynamic pricing under fairness requirements. In this paper, we investigate a general formulation of sequential decision-making with stage-wise feasibility constraints, where at each round, the learner must select an action based on observed context while ensuring that a problem-specific feasibility criterion is satisfied. We propose a unified algorithmic framework that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07101","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.07101/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:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBbtQTwTEduzQZSTIignqu5hXS+X38HtHg6PdRXvTzCkVE4Fqsdf7cqZ+3OnE9DjiZwLBsxG2l1s2x5Lvd8WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:09:51.535403Z"},"content_sha256":"89a5a412199d7d49d3c1f1e4d4b5a8086b959f0f782d1661126a4ca0206ad63e","schema_version":"1.0","event_id":"sha256:89a5a412199d7d49d3c1f1e4d4b5a8086b959f0f782d1661126a4ca0206ad63e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWUO65X3PJ7H3JNDHYNA5OSIM5/bundle.json","state_url":"https://pith.science/pith/XWUO65X3PJ7H3JNDHYNA5OSIM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWUO65X3PJ7H3JNDHYNA5OSIM5/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-16T12:09:51Z","links":{"resolver":"https://pith.science/pith/XWUO65X3PJ7H3JNDHYNA5OSIM5","bundle":"https://pith.science/pith/XWUO65X3PJ7H3JNDHYNA5OSIM5/bundle.json","state":"https://pith.science/pith/XWUO65X3PJ7H3JNDHYNA5OSIM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWUO65X3PJ7H3JNDHYNA5OSIM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XWUO65X3PJ7H3JNDHYNA5OSIM5","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":"2fd6f835dab17452739fc5068ee004f21eaa7d75907e0d1f16a6710c924437cd","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-11T19:22:04Z","title_canon_sha256":"fd8c945da1ee34bb39bf37418bf23be69bcb6079d51f034c91ccd78177a9ac18"},"schema_version":"1.0","source":{"id":"2505.07101","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.07101","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"2505.07101v3","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07101","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"XWUO65X3PJ7H","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"pith_short_16","alias_value":"XWUO65X3PJ7H3JND","created_at":"2026-07-05T11:07:24Z"},{"alias_kind":"pith_short_8","alias_value":"XWUO65X3","created_at":"2026-07-05T11:07:24Z"}],"graph_snapshots":[{"event_id":"sha256:89a5a412199d7d49d3c1f1e4d4b5a8086b959f0f782d1661126a4ca0206ad63e","target":"graph","created_at":"2026-07-05T11:07:24Z","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/2505.07101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Contextual online decision-making problems with constraints appear in a wide range of real-world applications, such as adaptive experimental design under safety constraints, personalized recommendation with resource limits, and dynamic pricing under fairness requirements. In this paper, we investigate a general formulation of sequential decision-making with stage-wise feasibility constraints, where at each round, the learner must select an action based on observed context while ensuring that a problem-specific feasibility criterion is satisfied. We propose a unified algorithmic framework that ","authors_text":"David Simchi-Levi, Haichen Hu, Navid Azizan","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-11T19:22:04Z","title":"Constrained Online Decision-Making: A Unified Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07101","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:39922e6b9ac68688b723c48d87e27e207abf87f18fea8c84357fc8464fd2128d","target":"record","created_at":"2026-07-05T11:07:24Z","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":"2fd6f835dab17452739fc5068ee004f21eaa7d75907e0d1f16a6710c924437cd","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-11T19:22:04Z","title_canon_sha256":"fd8c945da1ee34bb39bf37418bf23be69bcb6079d51f034c91ccd78177a9ac18"},"schema_version":"1.0","source":{"id":"2505.07101","kind":"arxiv","version":3}},"canonical_sha256":"bda8ef76fb7a7e7da5a33e1a0eba486750e0fd81a507d5e4757a32a850234917","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bda8ef76fb7a7e7da5a33e1a0eba486750e0fd81a507d5e4757a32a850234917","first_computed_at":"2026-07-05T11:07:24.498975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:07:24.498975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LgB60j42fV+3P5ux8/cGdePA4QWJEhmZFDCLEgpUhHTVF37tTkn1vDidNIhRuk9w5DoJozf09z0Sq0ds+NT/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:07:24.499454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.07101","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39922e6b9ac68688b723c48d87e27e207abf87f18fea8c84357fc8464fd2128d","sha256:89a5a412199d7d49d3c1f1e4d4b5a8086b959f0f782d1661126a4ca0206ad63e"],"state_sha256":"fa955a98f193ed9e80d24dd58c21487eb19cdd9e7b1374e3549b7e044bd331c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iC4Ed6ql4fWaZ/HaEoQmbxakN+7svzc7dD0viOuS/6qEVmGdXr8XGm/06tUjvz7WAkMT3MwImTOu4gi+vIRMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:09:51.538984Z","bundle_sha256":"30eb106fb1d011c76eed14f1826457acd79e93b19445266c1e0cd6e79ba8661a"}}