{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G2ZTL2QEXU3GWBOXUGPXBU7WUP","short_pith_number":"pith:G2ZTL2QE","schema_version":"1.0","canonical_sha256":"36b335ea04bd366b05d7a19f70d3f6a3cf48c186149cb9f01b5e48e390deffb2","source":{"kind":"arxiv","id":"1902.11102","version":2},"attestation_state":"computed","paper":{"title":"Constrained Thompson Sampling for Wireless Link Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hugo Tullberg, Ion Stoica, Joakim Jald\\'en, Joseph E. Gonzalez, Vidit Saxena","submitted_at":"2019-02-28T14:36:28Z","abstract_excerpt":"Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \\emph{rate selection} is used to select the optimal data transmission rate that maximizes the link throughput subject to an application-defined latency constraint. We model rate selection as a stochastic multi-armed bandit (MAB) problem, where a finite set of transmission rates are modeled as independent bandit arms. For this setup, we propose Con-TS, a novel constrained version of the Thompson samp"},"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":"1902.11102","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T14:36:28Z","cross_cats_sorted":["cs.NI","stat.ML"],"title_canon_sha256":"17165e1d909fa0804a4f2fab649a30c3f56729a744d9a330f6d00932dd9287f7","abstract_canon_sha256":"62c6125a8f1d2c75d1776ab34dc564ecbe18603b7ccf2c7572deaf09b8046991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:56.426256Z","signature_b64":"ehK3LgOo+oawMHQA5oVtasDQeo6HxNyKQ/eaevfsGgYrJFG6+sbDQcioDw1k/h378pa/+OxnrVsEij7OafwXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b335ea04bd366b05d7a19f70d3f6a3cf48c186149cb9f01b5e48e390deffb2","last_reissued_at":"2026-07-05T00:55:56.425733Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:56.425733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Thompson Sampling for Wireless Link Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hugo Tullberg, Ion Stoica, Joakim Jald\\'en, Joseph E. Gonzalez, Vidit Saxena","submitted_at":"2019-02-28T14:36:28Z","abstract_excerpt":"Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \\emph{rate selection} is used to select the optimal data transmission rate that maximizes the link throughput subject to an application-defined latency constraint. We model rate selection as a stochastic multi-armed bandit (MAB) problem, where a finite set of transmission rates are modeled as independent bandit arms. For this setup, we propose Con-TS, a novel constrained version of the Thompson samp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.11102","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/1902.11102/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":"1902.11102","created_at":"2026-07-05T00:55:56.425796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.11102v2","created_at":"2026-07-05T00:55:56.425796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.11102","created_at":"2026-07-05T00:55:56.425796+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2ZTL2QEXU3G","created_at":"2026-07-05T00:55:56.425796+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2ZTL2QEXU3GWBOX","created_at":"2026-07-05T00:55:56.425796+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2ZTL2QE","created_at":"2026-07-05T00:55:56.425796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07964","citing_title":"Constrained Thompson Sampling for Real-Time Electricity Pricing with Grid Reliability Constraints","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP","json":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP.json","graph_json":"https://pith.science/api/pith-number/G2ZTL2QEXU3GWBOXUGPXBU7WUP/graph.json","events_json":"https://pith.science/api/pith-number/G2ZTL2QEXU3GWBOXUGPXBU7WUP/events.json","paper":"https://pith.science/paper/G2ZTL2QE"},"agent_actions":{"view_html":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP","download_json":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP.json","view_paper":"https://pith.science/paper/G2ZTL2QE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.11102&json=true","fetch_graph":"https://pith.science/api/pith-number/G2ZTL2QEXU3GWBOXUGPXBU7WUP/graph.json","fetch_events":"https://pith.science/api/pith-number/G2ZTL2QEXU3GWBOXUGPXBU7WUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP/action/storage_attestation","attest_author":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP/action/author_attestation","sign_citation":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP/action/citation_signature","submit_replication":"https://pith.science/pith/G2ZTL2QEXU3GWBOXUGPXBU7WUP/action/replication_record"}},"created_at":"2026-07-05T00:55:56.425796+00:00","updated_at":"2026-07-05T00:55:56.425796+00:00"}