{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:37HCCE5PFMPVXAW5K5FEWOLKIC","short_pith_number":"pith:37HCCE5P","schema_version":"1.0","canonical_sha256":"dfce2113af2b1f5b82dd574a4b396a40add71627903f2adf13560e90369b06b1","source":{"kind":"arxiv","id":"2603.18972","version":3},"attestation_state":"computed","paper":{"title":"Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jawar Singh, Pratik Gajane, S Akash","submitted_at":"2026-03-19T14:38:52Z","abstract_excerpt":"Multi-dueling bandits, where a learner selects $m \\geq 2$ arms per round and observes only the winner, arise naturally in many applications including ranking and recommendation systems, yet a fundamental question has remained open: can a single algorithm perform optimally in both stochastic and adversarial environments, without knowing which regime it faces? We answer this affirmatively, providing the first best-of-both-worlds algorithms for multi-dueling bandits under both Condorcet and Borda objectives. For the Condorcet setting, we propose $\\texttt{MetaDueling}$, a black-box reduction that "},"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":"2603.18972","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-03-19T14:38:52Z","cross_cats_sorted":[],"title_canon_sha256":"5cafa82c380af471afaff00d9cb48e3a82dd1238c4b63ec645803cfac1fc731f","abstract_canon_sha256":"7091b4dd2f289ec77ebd5c0e197ac6eec130bad4c3ef0239a5e3e00dd5292e8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:28.825219Z","signature_b64":"T04unx1vzwxht/5fXK3igDkyLqFBEEFMsyaQy71eonzkYK9mMwR4MdJKJFMRw0VV9M65DHpJt2oMr11VobDgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfce2113af2b1f5b82dd574a4b396a40add71627903f2adf13560e90369b06b1","last_reissued_at":"2026-05-20T00:04:28.824438Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:28.824438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jawar Singh, Pratik Gajane, S Akash","submitted_at":"2026-03-19T14:38:52Z","abstract_excerpt":"Multi-dueling bandits, where a learner selects $m \\geq 2$ arms per round and observes only the winner, arise naturally in many applications including ranking and recommendation systems, yet a fundamental question has remained open: can a single algorithm perform optimally in both stochastic and adversarial environments, without knowing which regime it faces? We answer this affirmatively, providing the first best-of-both-worlds algorithms for multi-dueling bandits under both Condorcet and Borda objectives. For the Condorcet setting, we propose $\\texttt{MetaDueling}$, a black-box reduction that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.18972","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/2603.18972/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":"2603.18972","created_at":"2026-05-20T00:04:28.824573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.18972v3","created_at":"2026-05-20T00:04:28.824573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18972","created_at":"2026-05-20T00:04:28.824573+00:00"},{"alias_kind":"pith_short_12","alias_value":"37HCCE5PFMPV","created_at":"2026-05-20T00:04:28.824573+00:00"},{"alias_kind":"pith_short_16","alias_value":"37HCCE5PFMPVXAW5","created_at":"2026-05-20T00:04:28.824573+00:00"},{"alias_kind":"pith_short_8","alias_value":"37HCCE5P","created_at":"2026-05-20T00:04:28.824573+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/37HCCE5PFMPVXAW5K5FEWOLKIC","json":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC.json","graph_json":"https://pith.science/api/pith-number/37HCCE5PFMPVXAW5K5FEWOLKIC/graph.json","events_json":"https://pith.science/api/pith-number/37HCCE5PFMPVXAW5K5FEWOLKIC/events.json","paper":"https://pith.science/paper/37HCCE5P"},"agent_actions":{"view_html":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC","download_json":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC.json","view_paper":"https://pith.science/paper/37HCCE5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.18972&json=true","fetch_graph":"https://pith.science/api/pith-number/37HCCE5PFMPVXAW5K5FEWOLKIC/graph.json","fetch_events":"https://pith.science/api/pith-number/37HCCE5PFMPVXAW5K5FEWOLKIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC/action/storage_attestation","attest_author":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC/action/author_attestation","sign_citation":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC/action/citation_signature","submit_replication":"https://pith.science/pith/37HCCE5PFMPVXAW5K5FEWOLKIC/action/replication_record"}},"created_at":"2026-05-20T00:04:28.824573+00:00","updated_at":"2026-05-20T00:04:28.824573+00:00"}