{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LP3RNN7WRWW6G4Z2EEGXFVFHVP","short_pith_number":"pith:LP3RNN7W","schema_version":"1.0","canonical_sha256":"5bf716b7f68dade3733a210d72d4a7abe176e70b43792dddd1a3e6904880b7a6","source":{"kind":"arxiv","id":"2301.08781","version":1},"attestation_state":"computed","paper":{"title":"GBOSE: Generalized Bandit Orthogonalized Semiparametric Estimation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Elkhan Ismayilzada, Gi-Soo Kim, Khalequzzaman Sayem, Mubarrat Chowdhury","submitted_at":"2023-01-20T19:39:10Z","abstract_excerpt":"In sequential decision-making scenarios i.e., mobile health recommendation systems revenue management contextual multi-armed bandit algorithms have garnered attention for their performance. But most of the existing algorithms are built on the assumption of a strictly parametric reward model mostly linear in nature. In this work we propose a new algorithm with a semi-parametric reward model with state-of-the-art complexity of upper bound on regret amongst existing semi-parametric algorithms. Our work expands the scope of another representative algorithm of state-of-the-art complexity with a sim"},"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":"2301.08781","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-20T19:39:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"184080c74624a033a3221ef33999cf9eb4e28701e505b53b33e64b2b18f0bb3a","abstract_canon_sha256":"2d3c302fe12fe9e7788a5f746e17d9f0017373d9f2b5fc9ef6ffdf5f41bf7976"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:52.716867Z","signature_b64":"0USjd5KuDQ5ira1mByO1QYs8Sjwtcx0ww2ev0zRe+0LGL08s9KsTKLQpDXqrKiSYN2rUGZIRMFJCyltMq0JZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bf716b7f68dade3733a210d72d4a7abe176e70b43792dddd1a3e6904880b7a6","last_reissued_at":"2026-07-05T05:34:52.716396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:52.716396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GBOSE: Generalized Bandit Orthogonalized Semiparametric Estimation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Elkhan Ismayilzada, Gi-Soo Kim, Khalequzzaman Sayem, Mubarrat Chowdhury","submitted_at":"2023-01-20T19:39:10Z","abstract_excerpt":"In sequential decision-making scenarios i.e., mobile health recommendation systems revenue management contextual multi-armed bandit algorithms have garnered attention for their performance. But most of the existing algorithms are built on the assumption of a strictly parametric reward model mostly linear in nature. In this work we propose a new algorithm with a semi-parametric reward model with state-of-the-art complexity of upper bound on regret amongst existing semi-parametric algorithms. Our work expands the scope of another representative algorithm of state-of-the-art complexity with a sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08781","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.08781/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":"2301.08781","created_at":"2026-07-05T05:34:52.716459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.08781v1","created_at":"2026-07-05T05:34:52.716459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08781","created_at":"2026-07-05T05:34:52.716459+00:00"},{"alias_kind":"pith_short_12","alias_value":"LP3RNN7WRWW6","created_at":"2026-07-05T05:34:52.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"LP3RNN7WRWW6G4Z2","created_at":"2026-07-05T05:34:52.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"LP3RNN7W","created_at":"2026-07-05T05:34:52.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13390","citing_title":"Experimental Design for Semiparametric Bandits","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP","json":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP.json","graph_json":"https://pith.science/api/pith-number/LP3RNN7WRWW6G4Z2EEGXFVFHVP/graph.json","events_json":"https://pith.science/api/pith-number/LP3RNN7WRWW6G4Z2EEGXFVFHVP/events.json","paper":"https://pith.science/paper/LP3RNN7W"},"agent_actions":{"view_html":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP","download_json":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP.json","view_paper":"https://pith.science/paper/LP3RNN7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.08781&json=true","fetch_graph":"https://pith.science/api/pith-number/LP3RNN7WRWW6G4Z2EEGXFVFHVP/graph.json","fetch_events":"https://pith.science/api/pith-number/LP3RNN7WRWW6G4Z2EEGXFVFHVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP/action/storage_attestation","attest_author":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP/action/author_attestation","sign_citation":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP/action/citation_signature","submit_replication":"https://pith.science/pith/LP3RNN7WRWW6G4Z2EEGXFVFHVP/action/replication_record"}},"created_at":"2026-07-05T05:34:52.716459+00:00","updated_at":"2026-07-05T05:34:52.716459+00:00"}