{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IIGEFZMKSX6DV3A34VGSJDLG2U","short_pith_number":"pith:IIGEFZMK","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"},"canonical_sha256":"420c42e58a95fc3aec1be54d248d66d53067dbcee21017cbb4c30607b3ee305c","source":{"kind":"arxiv","id":"1805.08638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08638","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08638v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08638","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"IIGEFZMKSX6D","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IIGEFZMKSX6DV3A3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IIGEFZMK","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IIGEFZMKSX6DV3A34VGSJDLG2U","target":"record","payload":{"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"},"canonical_sha256":"420c42e58a95fc3aec1be54d248d66d53067dbcee21017cbb4c30607b3ee305c","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"},"source_kind":"arxiv","source_id":"1805.08638","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HiR/1zenjxoJ6DsLfLJm0/hupJLhxGDB17u7q4vqbc3nIluO/O8aoP8CaiM1rMBeERz8quUAp9dFs1gb5Pq4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:37:55.398655Z"},"content_sha256":"61f4af1ea6e0c76f72b04f37fb2530eff3882eba4002309a9ac6ca7e634c04be","schema_version":"1.0","event_id":"sha256:61f4af1ea6e0c76f72b04f37fb2530eff3882eba4002309a9ac6ca7e634c04be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IIGEFZMKSX6DV3A34VGSJDLG2U","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS3AQjsU+qLAKyg13FHlpfILhjFLIQ2tBXdbzB8Lkzb/SQZTsfMqpKldA/WAY560LdJf3KCMt9of0BtsmdmkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:37:55.399393Z"},"content_sha256":"c9c48ef05b2a2888e895236e18f8f06658c8d929cf62d7579c5d58cef8bda5ee","schema_version":"1.0","event_id":"sha256:c9c48ef05b2a2888e895236e18f8f06658c8d929cf62d7579c5d58cef8bda5ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/bundle.json","state_url":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T05:37:55Z","links":{"resolver":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U","bundle":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/bundle.json","state":"https://pith.science/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIGEFZMKSX6DV3A34VGSJDLG2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IIGEFZMKSX6DV3A34VGSJDLG2U","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ed540194f71adf05c757eb38730a935f02dc7f2afd0637bd1d8c53320d63bb12","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T14:39:30Z","title_canon_sha256":"a9d2b32acd32365094da9e0c93a858124e2da8125fc30cfaa06aab07cba1a650"},"schema_version":"1.0","source":{"id":"1805.08638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08638","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08638v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08638","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"IIGEFZMKSX6D","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IIGEFZMKSX6DV3A3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IIGEFZMK","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:c9c48ef05b2a2888e895236e18f8f06658c8d929cf62d7579c5d58cef8bda5ee","target":"graph","created_at":"2026-05-18T00:15:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Chao Gan, Cong Shen, Jing Yan, Ruida Zhou","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T14:39:30Z","title":"Cost-aware Cascading Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08638","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61f4af1ea6e0c76f72b04f37fb2530eff3882eba4002309a9ac6ca7e634c04be","target":"record","created_at":"2026-05-18T00:15:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ed540194f71adf05c757eb38730a935f02dc7f2afd0637bd1d8c53320d63bb12","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T14:39:30Z","title_canon_sha256":"a9d2b32acd32365094da9e0c93a858124e2da8125fc30cfaa06aab07cba1a650"},"schema_version":"1.0","source":{"id":"1805.08638","kind":"arxiv","version":1}},"canonical_sha256":"420c42e58a95fc3aec1be54d248d66d53067dbcee21017cbb4c30607b3ee305c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"420c42e58a95fc3aec1be54d248d66d53067dbcee21017cbb4c30607b3ee305c","first_computed_at":"2026-05-18T00:15:25.600097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:25.600097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aegC8lCH7n3CPaE8zR8yb137pxlm1xZWmAZ4Eyunue7Wr/6zSKc9KBH9bB6wIaZyth/DqkiSBgeORRhPq9FHCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:25.600839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61f4af1ea6e0c76f72b04f37fb2530eff3882eba4002309a9ac6ca7e634c04be","sha256:c9c48ef05b2a2888e895236e18f8f06658c8d929cf62d7579c5d58cef8bda5ee"],"state_sha256":"020e24afec0c3ce5e694372ac7da171a1626ad153cbe10a8d738677a1d1a5d3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/esZ7d3RhJh+bMd+DlXSLXDXMM4MhdfcB0nYgqYVAWBB1hbOp09die5Ro5D/YK7fxiTgHZLSv2+cDwXY9WsOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:37:55.403417Z","bundle_sha256":"bf2c95964db94f9817e422a4bcac79712ff9c7ea9e2437f7f29acf3e8c4a254e"}}