{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ICNGDYPFXBQDU4FVVE3FVAGVYV","short_pith_number":"pith:ICNGDYPF","schema_version":"1.0","canonical_sha256":"409a61e1e5b8603a70b5a9365a80d5c572bed2b294c2663564d6d4a7301a626b","source":{"kind":"arxiv","id":"1510.01800","version":4},"attestation_state":"computed","paper":{"title":"Logarithmic regret bounds for Bandits with Knapsacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arthur Flajolet, Patrick Jaillet","submitted_at":"2015-10-07T01:47:48Z","abstract_excerpt":"Optimal regret bounds for Multi-Armed Bandit problems are now well documented. They can be classified into two categories based on the growth rate with respect to the time horizon $T$: (i) small, distribution-dependent, bounds of order of magnitude $\\ln(T)$ and (ii) robust, distribution-free, bounds of order of magnitude $\\sqrt{T}$. The Bandits with Knapsacks model, an extension to the framework allowing to model resource consumption, lacks this clear-cut distinction. While several algorithms have been shown to achieve asymptotically optimal distribution-free bounds on regret, there has been l"},"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":"1510.01800","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-07T01:47:48Z","cross_cats_sorted":[],"title_canon_sha256":"4c0924e1c90c90e987f3fda75a55fd64f2272577b458ce7098ed19eaca8cc4e9","abstract_canon_sha256":"9dc2fbd85c57b38f4aae1d188d3268c8fed8d67a8f6858402449b6e916fdf453"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:43.141338Z","signature_b64":"SLD8WXH5//ZSE6yhjylWA//0NE12NGdbvmpnyU0XxR+vJBU1xyQ1u0fz1ho0wQUn2pasoqDl3GzkYAHDptsfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409a61e1e5b8603a70b5a9365a80d5c572bed2b294c2663564d6d4a7301a626b","last_reissued_at":"2026-05-18T00:46:43.140820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:43.140820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmic regret bounds for Bandits with Knapsacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arthur Flajolet, Patrick Jaillet","submitted_at":"2015-10-07T01:47:48Z","abstract_excerpt":"Optimal regret bounds for Multi-Armed Bandit problems are now well documented. They can be classified into two categories based on the growth rate with respect to the time horizon $T$: (i) small, distribution-dependent, bounds of order of magnitude $\\ln(T)$ and (ii) robust, distribution-free, bounds of order of magnitude $\\sqrt{T}$. The Bandits with Knapsacks model, an extension to the framework allowing to model resource consumption, lacks this clear-cut distinction. While several algorithms have been shown to achieve asymptotically optimal distribution-free bounds on regret, there has been l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01800","kind":"arxiv","version":4},"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":"1510.01800","created_at":"2026-05-18T00:46:43.140901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01800v4","created_at":"2026-05-18T00:46:43.140901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01800","created_at":"2026-05-18T00:46:43.140901+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICNGDYPFXBQD","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICNGDYPFXBQDU4FV","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICNGDYPF","created_at":"2026-05-18T12:29:25.134429+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/ICNGDYPFXBQDU4FVVE3FVAGVYV","json":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV.json","graph_json":"https://pith.science/api/pith-number/ICNGDYPFXBQDU4FVVE3FVAGVYV/graph.json","events_json":"https://pith.science/api/pith-number/ICNGDYPFXBQDU4FVVE3FVAGVYV/events.json","paper":"https://pith.science/paper/ICNGDYPF"},"agent_actions":{"view_html":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV","download_json":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV.json","view_paper":"https://pith.science/paper/ICNGDYPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01800&json=true","fetch_graph":"https://pith.science/api/pith-number/ICNGDYPFXBQDU4FVVE3FVAGVYV/graph.json","fetch_events":"https://pith.science/api/pith-number/ICNGDYPFXBQDU4FVVE3FVAGVYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV/action/storage_attestation","attest_author":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV/action/author_attestation","sign_citation":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV/action/citation_signature","submit_replication":"https://pith.science/pith/ICNGDYPFXBQDU4FVVE3FVAGVYV/action/replication_record"}},"created_at":"2026-05-18T00:46:43.140901+00:00","updated_at":"2026-05-18T00:46:43.140901+00:00"}