{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RMNP3CGS2OTBDURG6SC3J4JP3Q","short_pith_number":"pith:RMNP3CGS","schema_version":"1.0","canonical_sha256":"8b1afd88d2d3a611d226f485b4f12fdc2bf4f5778a71a754985e244f63eaf227","source":{"kind":"arxiv","id":"1605.07162","version":3},"attestation_state":"computed","paper":{"title":"Pure Exploration of Multi-armed Bandit Under Matroid Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Anupam Gupta, Jian Li, Lijie Chen","submitted_at":"2016-05-23T19:51:42Z","abstract_excerpt":"We study the pure exploration problem subject to a matroid constraint (Best-Basis) in a stochastic multi-armed bandit game. In a Best-Basis instance, we are given $n$ stochastic arms with unknown reward distributions, as well as a matroid $\\mathcal{M}$ over the arms. Let the weight of an arm be the mean of its reward distribution. Our goal is to identify a basis of $\\mathcal{M}$ with the maximum total weight, using as few samples as possible.\n  The problem is a significant generalization of the best arm identification problem and the top-$k$ arm identification problem, which have attracted sig"},"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":"1605.07162","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-23T19:51:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8f997bc5f1d8880656a7c442f4da95eb4182f15fbdfe7a97cdeb352c7513fae5","abstract_canon_sha256":"656510a95b11a5fe0ac79c1b6b305fdb552d5f93f29ca299d44a42fd82c30ae1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:39.404977Z","signature_b64":"pY0afIyadEWGGeRCbT2vbsgFPU8m7kbBw/AWvTHVZQj9Evhiy1U4VpFCG1qjjjci6OxTrm3TTVWvRKxHD0d5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b1afd88d2d3a611d226f485b4f12fdc2bf4f5778a71a754985e244f63eaf227","last_reissued_at":"2026-05-18T01:13:39.404292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:39.404292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pure Exploration of Multi-armed Bandit Under Matroid Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Anupam Gupta, Jian Li, Lijie Chen","submitted_at":"2016-05-23T19:51:42Z","abstract_excerpt":"We study the pure exploration problem subject to a matroid constraint (Best-Basis) in a stochastic multi-armed bandit game. In a Best-Basis instance, we are given $n$ stochastic arms with unknown reward distributions, as well as a matroid $\\mathcal{M}$ over the arms. Let the weight of an arm be the mean of its reward distribution. Our goal is to identify a basis of $\\mathcal{M}$ with the maximum total weight, using as few samples as possible.\n  The problem is a significant generalization of the best arm identification problem and the top-$k$ arm identification problem, which have attracted sig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07162","kind":"arxiv","version":3},"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":"1605.07162","created_at":"2026-05-18T01:13:39.404402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07162v3","created_at":"2026-05-18T01:13:39.404402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07162","created_at":"2026-05-18T01:13:39.404402+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMNP3CGS2OTB","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMNP3CGS2OTBDURG","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMNP3CGS","created_at":"2026-05-18T12:30:41.710351+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/RMNP3CGS2OTBDURG6SC3J4JP3Q","json":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q.json","graph_json":"https://pith.science/api/pith-number/RMNP3CGS2OTBDURG6SC3J4JP3Q/graph.json","events_json":"https://pith.science/api/pith-number/RMNP3CGS2OTBDURG6SC3J4JP3Q/events.json","paper":"https://pith.science/paper/RMNP3CGS"},"agent_actions":{"view_html":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q","download_json":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q.json","view_paper":"https://pith.science/paper/RMNP3CGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07162&json=true","fetch_graph":"https://pith.science/api/pith-number/RMNP3CGS2OTBDURG6SC3J4JP3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/RMNP3CGS2OTBDURG6SC3J4JP3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q/action/storage_attestation","attest_author":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q/action/author_attestation","sign_citation":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q/action/citation_signature","submit_replication":"https://pith.science/pith/RMNP3CGS2OTBDURG6SC3J4JP3Q/action/replication_record"}},"created_at":"2026-05-18T01:13:39.404402+00:00","updated_at":"2026-05-18T01:13:39.404402+00:00"}