{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QRXGQ2QH5NFIJ4HF5RYJHFNWA5","short_pith_number":"pith:QRXGQ2QH","canonical_record":{"source":{"id":"1807.02297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T08:03:39Z","cross_cats_sorted":["cs.AI","cs.SY","stat.ML"],"title_canon_sha256":"90d9f9a859720270fc715436cd049bce0e27d04e720673451f2041ef0ececa43","abstract_canon_sha256":"d79221d3783835359870731754eb8f7753194054a7126ef6632007b742a62056"},"schema_version":"1.0"},"canonical_sha256":"846e686a07eb4a84f0e5ec709395b607656446fff0eaf125870707146a4ba5ca","source":{"kind":"arxiv","id":"1807.02297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02297","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02297v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02297","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"QRXGQ2QH5NFI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QRXGQ2QH5NFIJ4HF","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QRXGQ2QH","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QRXGQ2QH5NFIJ4HF5RYJHFNWA5","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T08:03:39Z","cross_cats_sorted":["cs.AI","cs.SY","stat.ML"],"title_canon_sha256":"90d9f9a859720270fc715436cd049bce0e27d04e720673451f2041ef0ececa43","abstract_canon_sha256":"d79221d3783835359870731754eb8f7753194054a7126ef6632007b742a62056"},"schema_version":"1.0"},"canonical_sha256":"846e686a07eb4a84f0e5ec709395b607656446fff0eaf125870707146a4ba5ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.485289Z","signature_b64":"E3enbwE2vKfLMZAnkNRQy3v/Y2Ay/MvYFfxQZWThA82HLtV9E2siUTwp0yRx4v5LwfjPw74pS7ziU+iUvZr9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"846e686a07eb4a84f0e5ec709395b607656446fff0eaf125870707146a4ba5ca","last_reissued_at":"2026-05-18T00:11:22.484583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.484583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02297","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:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/jMSqFm5B6x5jIQtW+9/SKpPx0izGi6oAozJJdNIlF9dmU8lsXaIB4r/mWcNE+3hndF3t96ksU11fmGZNcLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:47:40.730140Z"},"content_sha256":"6b48af75f8067bf61a97a4aeaa211dc101cf7697b75a6251fd555f930c8c11ed","schema_version":"1.0","event_id":"sha256:6b48af75f8067bf61a97a4aeaa211dc101cf7697b75a6251fd555f930c8c11ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QRXGQ2QH5NFIJ4HF5RYJHFNWA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Bandits for Incentivizing Agents with Dynamic Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lillian J. Ratliff, Liyuan Zheng, Shreyas Sekar, Tanner Fiez","submitted_at":"2018-07-06T08:03:39Z","abstract_excerpt":"The design of personalized incentives or recommendations to improve user engagement is gaining prominence as digital platform providers continually emerge. We propose a multi-armed bandit framework for matching incentives to users, whose preferences are unknown a priori and evolving dynamically in time, in a resource constrained environment. We design an algorithm that combines ideas from three distinct domains: (i) a greedy matching paradigm, (ii) the upper confidence bound algorithm (UCB) for bandits, and (iii) mixing times from the theory of Markov chains. For this algorithm, we provide the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02297","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:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TA1UvEzcFsxDp48kMHeyVsxt/t9tNSXxF1gYsLhGnXdOodNdMx1IPMFmsWOqeEBLmnnoR7LXxGPWf7fUhEkyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:47:40.730501Z"},"content_sha256":"1914a0c8b9ddf2de170616ee3eb674b78dc90734847c3c78b58208f49c46c70e","schema_version":"1.0","event_id":"sha256:1914a0c8b9ddf2de170616ee3eb674b78dc90734847c3c78b58208f49c46c70e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRXGQ2QH5NFIJ4HF5RYJHFNWA5/bundle.json","state_url":"https://pith.science/pith/QRXGQ2QH5NFIJ4HF5RYJHFNWA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRXGQ2QH5NFIJ4HF5RYJHFNWA5/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-06-20T09:47:40Z","links":{"resolver":"https://pith.science/pith/QRXGQ2QH5NFIJ4HF5RYJHFNWA5","bundle":"https://pith.science/pith/QRXGQ2QH5NFIJ4HF5RYJHFNWA5/bundle.json","state":"https://pith.science/pith/QRXGQ2QH5NFIJ4HF5RYJHFNWA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRXGQ2QH5NFIJ4HF5RYJHFNWA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QRXGQ2QH5NFIJ4HF5RYJHFNWA5","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":"d79221d3783835359870731754eb8f7753194054a7126ef6632007b742a62056","cross_cats_sorted":["cs.AI","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T08:03:39Z","title_canon_sha256":"90d9f9a859720270fc715436cd049bce0e27d04e720673451f2041ef0ececa43"},"schema_version":"1.0","source":{"id":"1807.02297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02297","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02297v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02297","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"QRXGQ2QH5NFI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QRXGQ2QH5NFIJ4HF","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QRXGQ2QH","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:1914a0c8b9ddf2de170616ee3eb674b78dc90734847c3c78b58208f49c46c70e","target":"graph","created_at":"2026-05-18T00:11:22Z","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":"The design of personalized incentives or recommendations to improve user engagement is gaining prominence as digital platform providers continually emerge. We propose a multi-armed bandit framework for matching incentives to users, whose preferences are unknown a priori and evolving dynamically in time, in a resource constrained environment. We design an algorithm that combines ideas from three distinct domains: (i) a greedy matching paradigm, (ii) the upper confidence bound algorithm (UCB) for bandits, and (iii) mixing times from the theory of Markov chains. For this algorithm, we provide the","authors_text":"Lillian J. Ratliff, Liyuan Zheng, Shreyas Sekar, Tanner Fiez","cross_cats":["cs.AI","cs.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T08:03:39Z","title":"Combinatorial Bandits for Incentivizing Agents with Dynamic Preferences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02297","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:6b48af75f8067bf61a97a4aeaa211dc101cf7697b75a6251fd555f930c8c11ed","target":"record","created_at":"2026-05-18T00:11:22Z","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":"d79221d3783835359870731754eb8f7753194054a7126ef6632007b742a62056","cross_cats_sorted":["cs.AI","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T08:03:39Z","title_canon_sha256":"90d9f9a859720270fc715436cd049bce0e27d04e720673451f2041ef0ececa43"},"schema_version":"1.0","source":{"id":"1807.02297","kind":"arxiv","version":1}},"canonical_sha256":"846e686a07eb4a84f0e5ec709395b607656446fff0eaf125870707146a4ba5ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"846e686a07eb4a84f0e5ec709395b607656446fff0eaf125870707146a4ba5ca","first_computed_at":"2026-05-18T00:11:22.484583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:22.484583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E3enbwE2vKfLMZAnkNRQy3v/Y2Ay/MvYFfxQZWThA82HLtV9E2siUTwp0yRx4v5LwfjPw74pS7ziU+iUvZr9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:22.485289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b48af75f8067bf61a97a4aeaa211dc101cf7697b75a6251fd555f930c8c11ed","sha256:1914a0c8b9ddf2de170616ee3eb674b78dc90734847c3c78b58208f49c46c70e"],"state_sha256":"ddec01e2d96dbaa1d61334c7edfcdab55f404cb5f9e87d9ab01ba46e90ad14d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osHy86nOcURzag9j3rmLMgOO0mUX47bTNoFMAZ5OPclx0Wz2sUq0hEW0Fcaaf4DnVtecMilJVU1pGDHQS1/yAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:47:40.732393Z","bundle_sha256":"6aebddacff8ef84f830aadc18c2161e8e6703b90a71e06bd3d611c9c92a3b501"}}