{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QRUDLSFGWA5552WDJDDFH7NMGD","short_pith_number":"pith:QRUDLSFG","schema_version":"1.0","canonical_sha256":"846835c8a6b03bdeeac348c653fdac30e2fcd8d351d93b5dc1b864748657b710","source":{"kind":"arxiv","id":"1012.3005","version":2},"attestation_state":"computed","paper":{"title":"On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NI","cs.SY","math.PR"],"primary_cat":"math.OC","authors_text":"Bhaskar Krishnamachari, Mingyan Liu, Yi Gai","submitted_at":"2010-12-14T12:29:43Z","abstract_excerpt":"We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of $M$ users and $N \\geq M$ resources. For each user-resource pair $(i,j)$, there is an associated state that evolves as an aperiodic irreducible finite-state Markov chain with unknown parameters, with transitions occurring each time the particular user $i$ is allocated resource $j$. The user $i$ receives a reward that depends on the corresponding state each time it is allocated the resource $j$. The system objective is to learn the best matching o"},"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":"1012.3005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-12-14T12:29:43Z","cross_cats_sorted":["cs.LG","cs.NI","cs.SY","math.PR"],"title_canon_sha256":"5c73028b1adeac34ee4cc59f35ebffd72278064647eb2fa8b86f76787e678b5d","abstract_canon_sha256":"3d16ab40fe7099cddb113af16a621094335becf1475b0ff8e7f29e3bfc2972e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:07.281867Z","signature_b64":"JlStjNsd5eSkuTynnFjKZH0ru9RgnrpJVGmNZZOoz07gFjk2JSosrAvF5w9EGL9wL/ovVo4KVd3fsJpHNRGYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"846835c8a6b03bdeeac348c653fdac30e2fcd8d351d93b5dc1b864748657b710","last_reissued_at":"2026-05-18T02:23:07.281228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:07.281228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NI","cs.SY","math.PR"],"primary_cat":"math.OC","authors_text":"Bhaskar Krishnamachari, Mingyan Liu, Yi Gai","submitted_at":"2010-12-14T12:29:43Z","abstract_excerpt":"We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of $M$ users and $N \\geq M$ resources. For each user-resource pair $(i,j)$, there is an associated state that evolves as an aperiodic irreducible finite-state Markov chain with unknown parameters, with transitions occurring each time the particular user $i$ is allocated resource $j$. The user $i$ receives a reward that depends on the corresponding state each time it is allocated the resource $j$. The system objective is to learn the best matching o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3005","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":""},"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":"1012.3005","created_at":"2026-05-18T02:23:07.281324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3005v2","created_at":"2026-05-18T02:23:07.281324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3005","created_at":"2026-05-18T02:23:07.281324+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRUDLSFGWA55","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRUDLSFGWA5552WD","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRUDLSFG","created_at":"2026-05-18T12:26:12.377268+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/QRUDLSFGWA5552WDJDDFH7NMGD","json":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD.json","graph_json":"https://pith.science/api/pith-number/QRUDLSFGWA5552WDJDDFH7NMGD/graph.json","events_json":"https://pith.science/api/pith-number/QRUDLSFGWA5552WDJDDFH7NMGD/events.json","paper":"https://pith.science/paper/QRUDLSFG"},"agent_actions":{"view_html":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD","download_json":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD.json","view_paper":"https://pith.science/paper/QRUDLSFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3005&json=true","fetch_graph":"https://pith.science/api/pith-number/QRUDLSFGWA5552WDJDDFH7NMGD/graph.json","fetch_events":"https://pith.science/api/pith-number/QRUDLSFGWA5552WDJDDFH7NMGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD/action/storage_attestation","attest_author":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD/action/author_attestation","sign_citation":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD/action/citation_signature","submit_replication":"https://pith.science/pith/QRUDLSFGWA5552WDJDDFH7NMGD/action/replication_record"}},"created_at":"2026-05-18T02:23:07.281324+00:00","updated_at":"2026-05-18T02:23:07.281324+00:00"}