{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RGCQRINAFHGGL5B7LX2LVWELWX","short_pith_number":"pith:RGCQRINA","schema_version":"1.0","canonical_sha256":"898508a1a029cc65f43f5df4bad88bb5d2f8e3f6b4d7bc58a55d2d9de294f6f1","source":{"kind":"arxiv","id":"2510.21431","version":2},"attestation_state":"computed","paper":{"title":"Oracle-Efficient Combinatorial Semi-Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jung-Hun Kim, Milan Vojnovi\\'c, Min-hwan Oh","submitted_at":"2025-10-24T13:07:08Z","abstract_excerpt":"We study the combinatorial semi-bandit problem where an agent selects a subset of base arms and receives individual feedback. While this generalizes the classical multi-armed bandit and has broad applicability, its scalability is limited by the high cost of combinatorial optimization, requiring oracle queries at every round. To tackle this, we propose oracle-efficient frameworks that significantly reduce oracle calls while maintaining tight regret guarantees. For the worst-case linear reward setting, our algorithms achieve $\\tilde{O}(\\sqrt{T})$ regret using only $O(\\log\\log T)$ oracle queries."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2510.21431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-10-24T13:07:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6d88f5d703db701af2dc7c74988d7e400b099d3246b7bdade08035a7ae90efea","abstract_canon_sha256":"16a7e61a66f948587d7c84c2b513290627437813116a0ed671ed63a477201aae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:47.587361Z","signature_b64":"N3Qbu9blnDYXwpQjRCHSC2q2QxIl3eeDolIuBbwOFKnzO+j/Y3EjzkPvyjLPwOJTj1EH0Tm7ag4t+Nv3ooI5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"898508a1a029cc65f43f5df4bad88bb5d2f8e3f6b4d7bc58a55d2d9de294f6f1","last_reissued_at":"2026-07-14T01:20:47.586350Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:47.586350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oracle-Efficient Combinatorial Semi-Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jung-Hun Kim, Milan Vojnovi\\'c, Min-hwan Oh","submitted_at":"2025-10-24T13:07:08Z","abstract_excerpt":"We study the combinatorial semi-bandit problem where an agent selects a subset of base arms and receives individual feedback. While this generalizes the classical multi-armed bandit and has broad applicability, its scalability is limited by the high cost of combinatorial optimization, requiring oracle queries at every round. To tackle this, we propose oracle-efficient frameworks that significantly reduce oracle calls while maintaining tight regret guarantees. For the worst-case linear reward setting, our algorithms achieve $\\tilde{O}(\\sqrt{T})$ regret using only $O(\\log\\log T)$ oracle queries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.21431","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/2510.21431/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.21431","created_at":"2026-07-14T01:20:47.586847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.21431v2","created_at":"2026-07-14T01:20:47.586847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.21431","created_at":"2026-07-14T01:20:47.586847+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGCQRINAFHGG","created_at":"2026-07-14T01:20:47.586847+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGCQRINAFHGGL5B7","created_at":"2026-07-14T01:20:47.586847+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGCQRINA","created_at":"2026-07-14T01:20:47.586847+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX","json":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX.json","graph_json":"https://pith.science/api/pith-number/RGCQRINAFHGGL5B7LX2LVWELWX/graph.json","events_json":"https://pith.science/api/pith-number/RGCQRINAFHGGL5B7LX2LVWELWX/events.json","paper":"https://pith.science/paper/RGCQRINA"},"agent_actions":{"view_html":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX","download_json":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX.json","view_paper":"https://pith.science/paper/RGCQRINA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.21431&json=true","fetch_graph":"https://pith.science/api/pith-number/RGCQRINAFHGGL5B7LX2LVWELWX/graph.json","fetch_events":"https://pith.science/api/pith-number/RGCQRINAFHGGL5B7LX2LVWELWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX/action/storage_attestation","attest_author":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX/action/author_attestation","sign_citation":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX/action/citation_signature","submit_replication":"https://pith.science/pith/RGCQRINAFHGGL5B7LX2LVWELWX/action/replication_record"}},"created_at":"2026-07-14T01:20:47.586847+00:00","updated_at":"2026-07-14T01:20:47.586847+00:00"}