{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MTLORBOUIHW2QT43GNFP2IYWXC","short_pith_number":"pith:MTLORBOU","schema_version":"1.0","canonical_sha256":"64d6e885d441eda84f9b334afd2316b8913a4633ca027ed86d5d11530584f587","source":{"kind":"arxiv","id":"1305.2545","version":8},"attestation_state":"computed","paper":{"title":"Bandits with Knapsacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aleksandrs Slivkins, Ashwinkumar Badanidiyuru, Robert Kleinberg","submitted_at":"2013-05-11T21:50:46Z","abstract_excerpt":"Multi-armed bandit problems are the predominant theoretical model of exploration-exploitation tradeoffs in learning, and they have countless applications ranging from medical trials, to communication networks, to Web search and advertising. In many of these application domains the learner may be constrained by one or more supply (or budget) limits, in addition to the customary limitation on the time horizon. The literature lacks a general model encompassing these sorts of problems. We introduce such a model, called \"bandits with knapsacks\", that combines aspects of stochastic integer programmi"},"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":"1305.2545","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-11T21:50:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8c4cbf2a6181db1b053d74c825e392b4af3f00f9c4e950f4043e44a42d9fd864","abstract_canon_sha256":"df04ff0f814f7a4d7661dc636330103d3be60a7b117603b581e552389d16a49a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:04.304830Z","signature_b64":"X+sZ/NuXR+Qm5O/LQWRTC/7fUf7XduNVmsEuXClcoJsDTpBqKce1QQg7x2qbFa8PsILC2a2ATWCw+s+AvSpHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d6e885d441eda84f9b334afd2316b8913a4633ca027ed86d5d11530584f587","last_reissued_at":"2026-05-18T00:36:04.304246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:04.304246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bandits with Knapsacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aleksandrs Slivkins, Ashwinkumar Badanidiyuru, Robert Kleinberg","submitted_at":"2013-05-11T21:50:46Z","abstract_excerpt":"Multi-armed bandit problems are the predominant theoretical model of exploration-exploitation tradeoffs in learning, and they have countless applications ranging from medical trials, to communication networks, to Web search and advertising. In many of these application domains the learner may be constrained by one or more supply (or budget) limits, in addition to the customary limitation on the time horizon. The literature lacks a general model encompassing these sorts of problems. We introduce such a model, called \"bandits with knapsacks\", that combines aspects of stochastic integer programmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2545","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1305.2545","created_at":"2026-05-18T00:36:04.304332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2545v8","created_at":"2026-05-18T00:36:04.304332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2545","created_at":"2026-05-18T00:36:04.304332+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTLORBOUIHW2","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTLORBOUIHW2QT43","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTLORBOU","created_at":"2026-05-18T12:27:52.871228+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/MTLORBOUIHW2QT43GNFP2IYWXC","json":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC.json","graph_json":"https://pith.science/api/pith-number/MTLORBOUIHW2QT43GNFP2IYWXC/graph.json","events_json":"https://pith.science/api/pith-number/MTLORBOUIHW2QT43GNFP2IYWXC/events.json","paper":"https://pith.science/paper/MTLORBOU"},"agent_actions":{"view_html":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC","download_json":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC.json","view_paper":"https://pith.science/paper/MTLORBOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2545&json=true","fetch_graph":"https://pith.science/api/pith-number/MTLORBOUIHW2QT43GNFP2IYWXC/graph.json","fetch_events":"https://pith.science/api/pith-number/MTLORBOUIHW2QT43GNFP2IYWXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC/action/storage_attestation","attest_author":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC/action/author_attestation","sign_citation":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC/action/citation_signature","submit_replication":"https://pith.science/pith/MTLORBOUIHW2QT43GNFP2IYWXC/action/replication_record"}},"created_at":"2026-05-18T00:36:04.304332+00:00","updated_at":"2026-05-18T00:36:04.304332+00:00"}