{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IIGEFZMKSX6DV3A34VGSJDLG2U","short_pith_number":"pith:IIGEFZMK","schema_version":"1.0","canonical_sha256":"420c42e58a95fc3aec1be54d248d66d53067dbcee21017cbb4c30607b3ee305c","source":{"kind":"arxiv","id":"1805.08638","version":1},"attestation_state":"computed","paper":{"title":"Cost-aware Cascading Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Gan, Cong Shen, Jing Yan, Ruida Zhou","submitted_at":"2018-05-22T14:39:30Z","abstract_excerpt":"In this paper, we propose a cost-aware cascading bandits model, a new variant of multi-armed ban- dits with cascading feedback, by considering the random cost of pulling arms. In each step, the learning agent chooses an ordered list of items and examines them sequentially, until certain stopping condition is satisfied. Our objective is then to max- imize the expected net reward in each step, i.e., the reward obtained in each step minus the total cost in- curred in examining the items, by deciding the or- dered list of items, as well as when to stop examina- tion. We study both the offline and "},"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":"1805.08638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T14:39:30Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"a9d2b32acd32365094da9e0c93a858124e2da8125fc30cfaa06aab07cba1a650","abstract_canon_sha256":"ed540194f71adf05c757eb38730a935f02dc7f2afd0637bd1d8c53320d63bb12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:25.600839Z","signature_b64":"aegC8lCH7n3CPaE8zR8yb137pxlm1xZWmAZ4Eyunue7Wr/6zSKc9KBH9bB6wIaZyth/DqkiSBgeORRhPq9FHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"420c42e58a95fc3aec1be54d248d66d53067dbcee21017cbb4c30607b3ee305c","last_reissued_at":"2026-05-18T00:15:25.600097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:25.600097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost-aware Cascading Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Gan, Cong Shen, Jing Yan, Ruida Zhou","submitted_at":"2018-05-22T14:39:30Z","abstract_excerpt":"In this paper, we propose a cost-aware cascading bandits model, a new variant of multi-armed ban- dits with cascading feedback, by considering the random cost of pulling arms. In each step, the learning agent chooses an ordered list of items and examines them sequentially, until certain stopping condition is satisfied. Our objective is then to max- imize the expected net reward in each step, i.e., the reward obtained in each step minus the total cost in- curred in examining the items, by deciding the or- dered list of items, as well as when to stop examina- tion. We study both the offline and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08638","kind":"arxiv","version":1},"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":"1805.08638","created_at":"2026-05-18T00:15:25.600237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08638v1","created_at":"2026-05-18T00:15:25.600237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08638","created_at":"2026-05-18T00:15:25.600237+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIGEFZMKSX6D","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIGEFZMKSX6DV3A3","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIGEFZMK","created_at":"2026-05-18T12:32:31.084164+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/IIGEFZMKSX6DV3A34VGSJDLG2U","json":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U.json","graph_json":"https://pith.science/api/pith-number/IIGEFZMKSX6DV3A34VGSJDLG2U/graph.json","events_json":"https://pith.science/api/pith-number/IIGEFZMKSX6DV3A34VGSJDLG2U/events.json","paper":"https://pith.science/paper/IIGEFZMK"},"agent_actions":{"view_html":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U","download_json":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U.json","view_paper":"https://pith.science/paper/IIGEFZMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08638&json=true","fetch_graph":"https://pith.science/api/pith-number/IIGEFZMKSX6DV3A34VGSJDLG2U/graph.json","fetch_events":"https://pith.science/api/pith-number/IIGEFZMKSX6DV3A34VGSJDLG2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/action/storage_attestation","attest_author":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/action/author_attestation","sign_citation":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/action/citation_signature","submit_replication":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/action/replication_record"}},"created_at":"2026-05-18T00:15:25.600237+00:00","updated_at":"2026-05-18T00:15:25.600237+00:00"}