{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SSKVVR7S2BJSXYIJCCWHMGNOGY","short_pith_number":"pith:SSKVVR7S","schema_version":"1.0","canonical_sha256":"94955ac7f2d0532be10910ac7619ae363afaba6e087a198246ee7be5396c1bc1","source":{"kind":"arxiv","id":"1906.08656","version":1},"attestation_state":"computed","paper":{"title":"Stochastic One-Sided Full-Information Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoyu Zhao, Wei Chen","submitted_at":"2019-06-20T14:19:28Z","abstract_excerpt":"In this paper, we study the stochastic version of the one-sided full information bandit problem, where we have $K$ arms $[K] = \\{1, 2, \\ldots, K\\}$, and playing arm $i$ would gain reward from an unknown distribution for arm $i$ while obtaining reward feedback for all arms $j \\ge i$. One-sided full information bandit can model the online repeated second-price auctions, where the auctioneer could select the reserved price in each round and the bidders only reveal their bids when their bids are higher than the reserved price. In this paper, we present an elimination-based algorithm to solve the p"},"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":"1906.08656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T14:19:28Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"27e08af85de8ca06fe5a39efeacb721e56431fa7428df87d86e18ffbedbc5484","abstract_canon_sha256":"5f1eed9c727c4791a0a8aaa5e18ddda694e7c6859d894ce8223b9748038beb86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.960431Z","signature_b64":"panun/zwOQhyOaZedMQbCDLMsbAYiuOq6Yeni4Rly1q1L5Rp0WwXCyR5V60yazNGEgV9tzv0eo246mkUyzwGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94955ac7f2d0532be10910ac7619ae363afaba6e087a198246ee7be5396c1bc1","last_reissued_at":"2026-05-17T23:42:49.959935Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.959935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic One-Sided Full-Information Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoyu Zhao, Wei Chen","submitted_at":"2019-06-20T14:19:28Z","abstract_excerpt":"In this paper, we study the stochastic version of the one-sided full information bandit problem, where we have $K$ arms $[K] = \\{1, 2, \\ldots, K\\}$, and playing arm $i$ would gain reward from an unknown distribution for arm $i$ while obtaining reward feedback for all arms $j \\ge i$. One-sided full information bandit can model the online repeated second-price auctions, where the auctioneer could select the reserved price in each round and the bidders only reveal their bids when their bids are higher than the reserved price. In this paper, we present an elimination-based algorithm to solve the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08656","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":"1906.08656","created_at":"2026-05-17T23:42:49.960016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08656v1","created_at":"2026-05-17T23:42:49.960016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08656","created_at":"2026-05-17T23:42:49.960016+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSKVVR7S2BJS","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSKVVR7S2BJSXYIJ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSKVVR7S","created_at":"2026-05-18T12:33:27.125529+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/SSKVVR7S2BJSXYIJCCWHMGNOGY","json":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY.json","graph_json":"https://pith.science/api/pith-number/SSKVVR7S2BJSXYIJCCWHMGNOGY/graph.json","events_json":"https://pith.science/api/pith-number/SSKVVR7S2BJSXYIJCCWHMGNOGY/events.json","paper":"https://pith.science/paper/SSKVVR7S"},"agent_actions":{"view_html":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY","download_json":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY.json","view_paper":"https://pith.science/paper/SSKVVR7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08656&json=true","fetch_graph":"https://pith.science/api/pith-number/SSKVVR7S2BJSXYIJCCWHMGNOGY/graph.json","fetch_events":"https://pith.science/api/pith-number/SSKVVR7S2BJSXYIJCCWHMGNOGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY/action/storage_attestation","attest_author":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY/action/author_attestation","sign_citation":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY/action/citation_signature","submit_replication":"https://pith.science/pith/SSKVVR7S2BJSXYIJCCWHMGNOGY/action/replication_record"}},"created_at":"2026-05-17T23:42:49.960016+00:00","updated_at":"2026-05-17T23:42:49.960016+00:00"}