{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:I56QEXGZLDLDAUYVJKEPUUHYCY","short_pith_number":"pith:I56QEXGZ","canonical_record":{"source":{"id":"2211.02703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-04T18:41:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f093203e53255e893bdac17a0e30e72858a0c8c178442e9119b58f12310a7ce4","abstract_canon_sha256":"efe57f1579caf6aef11f2e14000637d51597e05af4baea05e80cc4e8d77b4b7e"},"schema_version":"1.0"},"canonical_sha256":"477d025cd958d63053154a88fa50f8160bc059b9379e5ea4787eba8505ad360c","source":{"kind":"arxiv","id":"2211.02703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02703","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02703v1","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02703","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"I56QEXGZLDLD","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"pith_short_16","alias_value":"I56QEXGZLDLDAUYV","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"pith_short_8","alias_value":"I56QEXGZ","created_at":"2026-07-05T05:13:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:I56QEXGZLDLDAUYVJKEPUUHYCY","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-04T18:41:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f093203e53255e893bdac17a0e30e72858a0c8c178442e9119b58f12310a7ce4","abstract_canon_sha256":"efe57f1579caf6aef11f2e14000637d51597e05af4baea05e80cc4e8d77b4b7e"},"schema_version":"1.0"},"canonical_sha256":"477d025cd958d63053154a88fa50f8160bc059b9379e5ea4787eba8505ad360c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:20.620755Z","signature_b64":"Tig6p/amPjErFRP5ZrYJ5/kLTwIioCSXATZyCqi0L6SbthXcszxn/BmTtqz11GYV31Wx7sb3Saaht6vidP7DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"477d025cd958d63053154a88fa50f8160bc059b9379e5ea4787eba8505ad360c","last_reissued_at":"2026-07-05T05:13:20.620251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:20.620251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02703","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-05T05:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4mQk3WlgpgBUP3MBZBdky6ltOrGVY0o4tbQ5uxX3Hshzsl53dswo93nba1rY6Ra0rCz62EPtGyAT+KbVeA1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:02:33.428909Z"},"content_sha256":"3b0902cd28bf91baa2824ec5c6c42e6296f21055e01c76f0363f6246d5345a3a","schema_version":"1.0","event_id":"sha256:3b0902cd28bf91baa2824ec5c6c42e6296f21055e01c76f0363f6246d5345a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:I56QEXGZLDLDAUYVJKEPUUHYCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning and Bandits with Queried Hints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aditya Bhaskara, Kamesh Munagala, Kostas Kollias, Sreenivas Gollapudi, Sungjin Im","submitted_at":"2022-11-04T18:41:08Z","abstract_excerpt":"We consider the classic online learning and stochastic multi-armed bandit (MAB) problems, when at each step, the online policy can probe and find out which of a small number ($k$) of choices has better reward (or loss) before making its choice. In this model, we derive algorithms whose regret bounds have exponentially better dependence on the time horizon compared to the classic regret bounds. In particular, we show that probing with $k=2$ suffices to achieve time-independent regret bounds for online linear and convex optimization. The same number of probes improve the regret bound of stochast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02703","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/2211.02703/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-05T05:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVr8974NRlETE4E4/1/2XUalDOs69CbdcvSYFn0RFvviVxaD7bD5CpmcHGqQiW80Iw67KtCl3DdwvcTGmOTqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:02:33.429766Z"},"content_sha256":"0dd3c4b50bb9f666afce484f8984ec97f898503def8b2823b97bf5f62d970368","schema_version":"1.0","event_id":"sha256:0dd3c4b50bb9f666afce484f8984ec97f898503def8b2823b97bf5f62d970368"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I56QEXGZLDLDAUYVJKEPUUHYCY/bundle.json","state_url":"https://pith.science/pith/I56QEXGZLDLDAUYVJKEPUUHYCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I56QEXGZLDLDAUYVJKEPUUHYCY/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-20T04:02:33Z","links":{"resolver":"https://pith.science/pith/I56QEXGZLDLDAUYVJKEPUUHYCY","bundle":"https://pith.science/pith/I56QEXGZLDLDAUYVJKEPUUHYCY/bundle.json","state":"https://pith.science/pith/I56QEXGZLDLDAUYVJKEPUUHYCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I56QEXGZLDLDAUYVJKEPUUHYCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:I56QEXGZLDLDAUYVJKEPUUHYCY","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":"efe57f1579caf6aef11f2e14000637d51597e05af4baea05e80cc4e8d77b4b7e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-04T18:41:08Z","title_canon_sha256":"f093203e53255e893bdac17a0e30e72858a0c8c178442e9119b58f12310a7ce4"},"schema_version":"1.0","source":{"id":"2211.02703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02703","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02703v1","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02703","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"I56QEXGZLDLD","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"pith_short_16","alias_value":"I56QEXGZLDLDAUYV","created_at":"2026-07-05T05:13:20Z"},{"alias_kind":"pith_short_8","alias_value":"I56QEXGZ","created_at":"2026-07-05T05:13:20Z"}],"graph_snapshots":[{"event_id":"sha256:0dd3c4b50bb9f666afce484f8984ec97f898503def8b2823b97bf5f62d970368","target":"graph","created_at":"2026-07-05T05:13:20Z","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/2211.02703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the classic online learning and stochastic multi-armed bandit (MAB) problems, when at each step, the online policy can probe and find out which of a small number ($k$) of choices has better reward (or loss) before making its choice. In this model, we derive algorithms whose regret bounds have exponentially better dependence on the time horizon compared to the classic regret bounds. In particular, we show that probing with $k=2$ suffices to achieve time-independent regret bounds for online linear and convex optimization. The same number of probes improve the regret bound of stochast","authors_text":"Aditya Bhaskara, Kamesh Munagala, Kostas Kollias, Sreenivas Gollapudi, Sungjin Im","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-04T18:41:08Z","title":"Online Learning and Bandits with Queried Hints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02703","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:3b0902cd28bf91baa2824ec5c6c42e6296f21055e01c76f0363f6246d5345a3a","target":"record","created_at":"2026-07-05T05:13:20Z","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":"efe57f1579caf6aef11f2e14000637d51597e05af4baea05e80cc4e8d77b4b7e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-04T18:41:08Z","title_canon_sha256":"f093203e53255e893bdac17a0e30e72858a0c8c178442e9119b58f12310a7ce4"},"schema_version":"1.0","source":{"id":"2211.02703","kind":"arxiv","version":1}},"canonical_sha256":"477d025cd958d63053154a88fa50f8160bc059b9379e5ea4787eba8505ad360c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"477d025cd958d63053154a88fa50f8160bc059b9379e5ea4787eba8505ad360c","first_computed_at":"2026-07-05T05:13:20.620251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:13:20.620251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tig6p/amPjErFRP5ZrYJ5/kLTwIioCSXATZyCqi0L6SbthXcszxn/BmTtqz11GYV31Wx7sb3Saaht6vidP7DBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:13:20.620755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b0902cd28bf91baa2824ec5c6c42e6296f21055e01c76f0363f6246d5345a3a","sha256:0dd3c4b50bb9f666afce484f8984ec97f898503def8b2823b97bf5f62d970368"],"state_sha256":"2d1981ed23f161ad68a5f8a352399895e66fc0d403d296bc910fd487f2ed43e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLY+k5kKzD8FDVicoCkpvJLzZ1YgZrYkp1RAZA69CXvnlSoEIXRw+la1rzek4heepcNNSqGrBGF4MIvCZl66BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:02:33.445770Z","bundle_sha256":"290c00f0e2a5d1df825ec90e00236d4230c74580ad54dc40d0678e5d94d21c14"}}