{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5NKACSEISOEWQR3RP2GAIGLBLN","short_pith_number":"pith:5NKACSEI","schema_version":"1.0","canonical_sha256":"eb5401488893896847717e8c0419615b67225454170427808ccef5c199712751","source":{"kind":"arxiv","id":"1811.11925","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Top-$K$ Subset Bandits with Linear Space and Non-Linear Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhishek K. Umrawal, Christopher J. Quinn, Mridul Agarwal, Vaneet Aggarwal","submitted_at":"2018-11-29T02:12:37Z","abstract_excerpt":"Many real-world problems like Social Influence Maximization face the dilemma of choosing the best $K$ out of $N$ options at a given time instant. This setup can be modeled as a combinatorial bandit which chooses $K$ out of $N$ arms at each time, with an aim to achieve an efficient trade-off between exploration and exploitation. This is the first work for combinatorial bandits where the feedback received can be a non-linear function of the chosen $K$ arms. The direct use of multi-armed bandit requires choosing among $N$-choose-$K$ options making the state space large. In this paper, we present "},"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":"1811.11925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-29T02:12:37Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0459449a30579e01448d82f3ecf753cd84833937bb34d72ed76536485168aad0","abstract_canon_sha256":"2ee4fe466d7c36bf90fd9c3a47c6a65c7ad88c96c463d035ef326dbd968c90e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:32.052065Z","signature_b64":"dUjj3UYgt7oBAN951fKC9Hr+pnAqXWGXTFmH7kssUQvEapNnacAzqbm100y6w85QFldDDqw79llUoH0kmTWCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb5401488893896847717e8c0419615b67225454170427808ccef5c199712751","last_reissued_at":"2026-07-05T03:21:32.051713Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:32.051713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Top-$K$ Subset Bandits with Linear Space and Non-Linear Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhishek K. Umrawal, Christopher J. Quinn, Mridul Agarwal, Vaneet Aggarwal","submitted_at":"2018-11-29T02:12:37Z","abstract_excerpt":"Many real-world problems like Social Influence Maximization face the dilemma of choosing the best $K$ out of $N$ options at a given time instant. This setup can be modeled as a combinatorial bandit which chooses $K$ out of $N$ arms at each time, with an aim to achieve an efficient trade-off between exploration and exploitation. This is the first work for combinatorial bandits where the feedback received can be a non-linear function of the chosen $K$ arms. The direct use of multi-armed bandit requires choosing among $N$-choose-$K$ options making the state space large. In this paper, we present "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11925","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.11925/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1811.11925","created_at":"2026-07-05T03:21:32.051771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11925v2","created_at":"2026-07-05T03:21:32.051771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11925","created_at":"2026-07-05T03:21:32.051771+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NKACSEISOEW","created_at":"2026-07-05T03:21:32.051771+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NKACSEISOEWQR3R","created_at":"2026-07-05T03:21:32.051771+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NKACSEI","created_at":"2026-07-05T03:21:32.051771+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/5NKACSEISOEWQR3RP2GAIGLBLN","json":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN.json","graph_json":"https://pith.science/api/pith-number/5NKACSEISOEWQR3RP2GAIGLBLN/graph.json","events_json":"https://pith.science/api/pith-number/5NKACSEISOEWQR3RP2GAIGLBLN/events.json","paper":"https://pith.science/paper/5NKACSEI"},"agent_actions":{"view_html":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN","download_json":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN.json","view_paper":"https://pith.science/paper/5NKACSEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11925&json=true","fetch_graph":"https://pith.science/api/pith-number/5NKACSEISOEWQR3RP2GAIGLBLN/graph.json","fetch_events":"https://pith.science/api/pith-number/5NKACSEISOEWQR3RP2GAIGLBLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN/action/storage_attestation","attest_author":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN/action/author_attestation","sign_citation":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN/action/citation_signature","submit_replication":"https://pith.science/pith/5NKACSEISOEWQR3RP2GAIGLBLN/action/replication_record"}},"created_at":"2026-07-05T03:21:32.051771+00:00","updated_at":"2026-07-05T03:21:32.051771+00:00"}