{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X265LXJVXXRCTEF2V3VFSHXDVV","short_pith_number":"pith:X265LXJV","schema_version":"1.0","canonical_sha256":"bebdd5dd35bde22990baaeea591ee3ad44c5062adc5d7d63a2641db7a005aac6","source":{"kind":"arxiv","id":"2403.00845","version":1},"attestation_state":"computed","paper":{"title":"Improved Online Learning Algorithms for CTR Prediction in Ad Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.IR","authors_text":"Christopher Liaw, Zhe Feng, Zixin Zhou","submitted_at":"2024-02-29T14:10:26Z","abstract_excerpt":"In this work, we investigate the online learning problem of revenue maximization in ad auctions, where the seller needs to learn the click-through rates (CTRs) of each ad candidate and charge the price of the winner through a pay-per-click manner. We focus on two models of the advertisers' strategic behaviors. First, we assume that the advertiser is completely myopic; i.e.~in each round, they aim to maximize their utility only for the current round. In this setting, we develop an online mechanism based on upper-confidence bounds that achieves a tight $O(\\sqrt{T})$ regret in the worst-case and "},"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":"2403.00845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-29T14:10:26Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"ee0ae9c0b4b68a4966af0a734f02813f399b0ee948212fbfe924e44eb1401363","abstract_canon_sha256":"9c69e3743efa1903782011dc29f9b71ce055f4b5207a38f3a57190459e2727e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:12.700485Z","signature_b64":"i8tECYm11MI9h0I3NaGFGTSQh4/ipMshMZNVUjZ/+GjaVTg6lU11dp2cSCWe692TRpVjy6mMwIwIuZQrlaWQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bebdd5dd35bde22990baaeea591ee3ad44c5062adc5d7d63a2641db7a005aac6","last_reissued_at":"2026-07-05T07:51:12.700045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:12.700045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Online Learning Algorithms for CTR Prediction in Ad Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.IR","authors_text":"Christopher Liaw, Zhe Feng, Zixin Zhou","submitted_at":"2024-02-29T14:10:26Z","abstract_excerpt":"In this work, we investigate the online learning problem of revenue maximization in ad auctions, where the seller needs to learn the click-through rates (CTRs) of each ad candidate and charge the price of the winner through a pay-per-click manner. We focus on two models of the advertisers' strategic behaviors. First, we assume that the advertiser is completely myopic; i.e.~in each round, they aim to maximize their utility only for the current round. In this setting, we develop an online mechanism based on upper-confidence bounds that achieves a tight $O(\\sqrt{T})$ regret in the worst-case and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00845","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/2403.00845/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":"2403.00845","created_at":"2026-07-05T07:51:12.700105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.00845v1","created_at":"2026-07-05T07:51:12.700105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00845","created_at":"2026-07-05T07:51:12.700105+00:00"},{"alias_kind":"pith_short_12","alias_value":"X265LXJVXXRC","created_at":"2026-07-05T07:51:12.700105+00:00"},{"alias_kind":"pith_short_16","alias_value":"X265LXJVXXRCTEF2","created_at":"2026-07-05T07:51:12.700105+00:00"},{"alias_kind":"pith_short_8","alias_value":"X265LXJV","created_at":"2026-07-05T07:51:12.700105+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03892","citing_title":"Mistake-bounded online learning with operation caps","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV","json":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV.json","graph_json":"https://pith.science/api/pith-number/X265LXJVXXRCTEF2V3VFSHXDVV/graph.json","events_json":"https://pith.science/api/pith-number/X265LXJVXXRCTEF2V3VFSHXDVV/events.json","paper":"https://pith.science/paper/X265LXJV"},"agent_actions":{"view_html":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV","download_json":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV.json","view_paper":"https://pith.science/paper/X265LXJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.00845&json=true","fetch_graph":"https://pith.science/api/pith-number/X265LXJVXXRCTEF2V3VFSHXDVV/graph.json","fetch_events":"https://pith.science/api/pith-number/X265LXJVXXRCTEF2V3VFSHXDVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV/action/storage_attestation","attest_author":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV/action/author_attestation","sign_citation":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV/action/citation_signature","submit_replication":"https://pith.science/pith/X265LXJVXXRCTEF2V3VFSHXDVV/action/replication_record"}},"created_at":"2026-07-05T07:51:12.700105+00:00","updated_at":"2026-07-05T07:51:12.700105+00:00"}