{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MFKIZ66WQWA346YL45R5DKMD66","short_pith_number":"pith:MFKIZ66W","schema_version":"1.0","canonical_sha256":"61548cfbd68581be7b0be763d1a983f78cc4e1d45742fe9f508b327f01e4279f","source":{"kind":"arxiv","id":"1811.11881","version":11},"attestation_state":"computed","paper":{"title":"Adversarial Bandits with Knapsacks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aleksandrs Slivkins, Karthik Abinav Sankararaman, Nicole Immorlica, Robert Schapire","submitted_at":"2018-11-28T23:43:11Z","abstract_excerpt":"We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a well-known knapsack problem: find an optimal packing of items into a limited-size knapsack. The BwK problem is a common generalization of numerous motivating examples, which range from dynamic pricing to repeated auctions to dynamic ad allocation to network routing and scheduling. While the prior work on BwK focused on the stochastic version, we pioneer the other extreme in which the outcomes can be chosen adversariall"},"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":"1811.11881","kind":"arxiv","version":11},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-11-28T23:43:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"bcee8979f96e7722ba4e706b2a10ad29507fb0772feaf9d9e00c6f72bcbdd65d","abstract_canon_sha256":"c4bd3a84b5ca0e73facaab5961b1ba358631ea869c77ec8bc052cc78345f06ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:29.376523Z","signature_b64":"q4wRC2ZUXlt8iTHW0HbJ7WcPNhoDXfQ9up0LMLNJM4XSSz2zh563MqHBfIjuX0nIaa6dX4p7CxQAKnCFy70pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61548cfbd68581be7b0be763d1a983f78cc4e1d45742fe9f508b327f01e4279f","last_reissued_at":"2026-07-05T05:48:29.376059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:29.376059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Bandits with Knapsacks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aleksandrs Slivkins, Karthik Abinav Sankararaman, Nicole Immorlica, Robert Schapire","submitted_at":"2018-11-28T23:43:11Z","abstract_excerpt":"We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a well-known knapsack problem: find an optimal packing of items into a limited-size knapsack. The BwK problem is a common generalization of numerous motivating examples, which range from dynamic pricing to repeated auctions to dynamic ad allocation to network routing and scheduling. While the prior work on BwK focused on the stochastic version, we pioneer the other extreme in which the outcomes can be chosen adversariall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11881","kind":"arxiv","version":11},"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/1811.11881/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":"1811.11881","created_at":"2026-07-05T05:48:29.376113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11881v11","created_at":"2026-07-05T05:48:29.376113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11881","created_at":"2026-07-05T05:48:29.376113+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFKIZ66WQWA3","created_at":"2026-07-05T05:48:29.376113+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFKIZ66WQWA346YL","created_at":"2026-07-05T05:48:29.376113+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFKIZ66W","created_at":"2026-07-05T05:48:29.376113+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/MFKIZ66WQWA346YL45R5DKMD66","json":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66.json","graph_json":"https://pith.science/api/pith-number/MFKIZ66WQWA346YL45R5DKMD66/graph.json","events_json":"https://pith.science/api/pith-number/MFKIZ66WQWA346YL45R5DKMD66/events.json","paper":"https://pith.science/paper/MFKIZ66W"},"agent_actions":{"view_html":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66","download_json":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66.json","view_paper":"https://pith.science/paper/MFKIZ66W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11881&json=true","fetch_graph":"https://pith.science/api/pith-number/MFKIZ66WQWA346YL45R5DKMD66/graph.json","fetch_events":"https://pith.science/api/pith-number/MFKIZ66WQWA346YL45R5DKMD66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66/action/storage_attestation","attest_author":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66/action/author_attestation","sign_citation":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66/action/citation_signature","submit_replication":"https://pith.science/pith/MFKIZ66WQWA346YL45R5DKMD66/action/replication_record"}},"created_at":"2026-07-05T05:48:29.376113+00:00","updated_at":"2026-07-05T05:48:29.376113+00:00"}