{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B6JHMABRLRBJUJLUT3X2RNS5NU","short_pith_number":"pith:B6JHMABR","schema_version":"1.0","canonical_sha256":"0f927600315c429a25749eefa8b65d6d2b0b054f0e80e54a6f1d0e3c6ed5222d","source":{"kind":"arxiv","id":"1703.02626","version":1},"attestation_state":"computed","paper":{"title":"Horde of Bandits using Gaussian Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Laks V.S. Lakshmanan, Mark Schmidt, Sharan Vaswani","submitted_at":"2017-03-07T22:21:50Z","abstract_excerpt":"The gang of bandits (GOB) model \\cite{cesa2013gang} is a recent contextual bandits framework that shares information between a set of bandit problems, related by a known (possibly noisy) graph. This model is useful in problems like recommender systems where the large number of users makes it vital to transfer information between users. Despite its effectiveness, the existing GOB model can only be applied to small problems due to its quadratic time-dependence on the number of nodes. Existing solutions to combat the scalability issue require an often-unrealistic clustering assumption. By exploit"},"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":"1703.02626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T22:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"28f3b3c35292fa6ec582dd7f9c0a9d14d717ba77623217ada6de47d530c71d41","abstract_canon_sha256":"d1ed7546a9d312a7f6b0367d365e8717c24b9a8abd10a9e89f4d7365bc393092"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.997814Z","signature_b64":"2/4wpC8tivOYc2+LiXageKZ37pK5/Vko0bgSYbG2YX0TmddJ6FSV2xnQVXKFurNJ5W3K2Xw3F4aW1UcjMxj5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f927600315c429a25749eefa8b65d6d2b0b054f0e80e54a6f1d0e3c6ed5222d","last_reissued_at":"2026-05-18T00:49:05.997373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.997373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Horde of Bandits using Gaussian Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Laks V.S. Lakshmanan, Mark Schmidt, Sharan Vaswani","submitted_at":"2017-03-07T22:21:50Z","abstract_excerpt":"The gang of bandits (GOB) model \\cite{cesa2013gang} is a recent contextual bandits framework that shares information between a set of bandit problems, related by a known (possibly noisy) graph. This model is useful in problems like recommender systems where the large number of users makes it vital to transfer information between users. Despite its effectiveness, the existing GOB model can only be applied to small problems due to its quadratic time-dependence on the number of nodes. Existing solutions to combat the scalability issue require an often-unrealistic clustering assumption. By exploit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02626","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":"1703.02626","created_at":"2026-05-18T00:49:05.997455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02626v1","created_at":"2026-05-18T00:49:05.997455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02626","created_at":"2026-05-18T00:49:05.997455+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6JHMABRLRBJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6JHMABRLRBJUJLU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6JHMABR","created_at":"2026-05-18T12:31:08.081275+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/B6JHMABRLRBJUJLUT3X2RNS5NU","json":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU.json","graph_json":"https://pith.science/api/pith-number/B6JHMABRLRBJUJLUT3X2RNS5NU/graph.json","events_json":"https://pith.science/api/pith-number/B6JHMABRLRBJUJLUT3X2RNS5NU/events.json","paper":"https://pith.science/paper/B6JHMABR"},"agent_actions":{"view_html":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU","download_json":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU.json","view_paper":"https://pith.science/paper/B6JHMABR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02626&json=true","fetch_graph":"https://pith.science/api/pith-number/B6JHMABRLRBJUJLUT3X2RNS5NU/graph.json","fetch_events":"https://pith.science/api/pith-number/B6JHMABRLRBJUJLUT3X2RNS5NU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU/action/storage_attestation","attest_author":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU/action/author_attestation","sign_citation":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU/action/citation_signature","submit_replication":"https://pith.science/pith/B6JHMABRLRBJUJLUT3X2RNS5NU/action/replication_record"}},"created_at":"2026-05-18T00:49:05.997455+00:00","updated_at":"2026-05-18T00:49:05.997455+00:00"}