{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QZOJWS2QOABGGUSUEHGKUP7KU5","short_pith_number":"pith:QZOJWS2Q","schema_version":"1.0","canonical_sha256":"865c9b4b50700263525421ccaa3feaa77ac2dc3e94dc8623bb97773119d442fe","source":{"kind":"arxiv","id":"2107.07725","version":2},"attestation_state":"computed","paper":{"title":"Learning to Price against a Budget and ROI Constrained Buyer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jason Cheuk Nam Liang, Negin Golrezaei, Patrick Jaillet, Vahab Mirrokni","submitted_at":"2021-07-16T06:50:52Z","abstract_excerpt":"Internet advertisers (buyers) repeatedly procure ad impressions from ad platforms (sellers) with the aim to maximize total conversion (i.e. ad value) while respecting both budget and return-on-investment (ROI) constraints for efficient utilization of limited monetary resources. Facing such a constrained buyer who aims to learn her optimal strategy to acquire impressions, we study from a seller's perspective how to learn and price ad impressions through repeated posted price mechanisms to maximize revenue. For this two-sided learning setup, we propose a learning algorithm for the seller that ut"},"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":"2107.07725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2021-07-16T06:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"be70048c2cbbb3c948ebcbbcb702507b077778c9ac8cbd884ff4d08485c3e959","abstract_canon_sha256":"d6ebb1cf5b1f79072ec16cc24b1738817da126dfd4a553dde0bd48a03299e4f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:10.758594Z","signature_b64":"v8bXwp0XU0yjHFzOlPT5lbADXZ0rJk97hrmP8P1S4+viTkb61MN2pP4+XI8jd+Po2f+TN5t5QaboEF94YcMJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865c9b4b50700263525421ccaa3feaa77ac2dc3e94dc8623bb97773119d442fe","last_reissued_at":"2026-07-05T05:39:10.758103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:10.758103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Price against a Budget and ROI Constrained Buyer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jason Cheuk Nam Liang, Negin Golrezaei, Patrick Jaillet, Vahab Mirrokni","submitted_at":"2021-07-16T06:50:52Z","abstract_excerpt":"Internet advertisers (buyers) repeatedly procure ad impressions from ad platforms (sellers) with the aim to maximize total conversion (i.e. ad value) while respecting both budget and return-on-investment (ROI) constraints for efficient utilization of limited monetary resources. Facing such a constrained buyer who aims to learn her optimal strategy to acquire impressions, we study from a seller's perspective how to learn and price ad impressions through repeated posted price mechanisms to maximize revenue. For this two-sided learning setup, we propose a learning algorithm for the seller that ut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.07725","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/2107.07725/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":"2107.07725","created_at":"2026-07-05T05:39:10.758162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.07725v2","created_at":"2026-07-05T05:39:10.758162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.07725","created_at":"2026-07-05T05:39:10.758162+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZOJWS2QOABG","created_at":"2026-07-05T05:39:10.758162+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZOJWS2QOABGGUSU","created_at":"2026-07-05T05:39:10.758162+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZOJWS2Q","created_at":"2026-07-05T05:39:10.758162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.04993","citing_title":"On the Coordination of Value-Maximizing Bidders","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5","json":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5.json","graph_json":"https://pith.science/api/pith-number/QZOJWS2QOABGGUSUEHGKUP7KU5/graph.json","events_json":"https://pith.science/api/pith-number/QZOJWS2QOABGGUSUEHGKUP7KU5/events.json","paper":"https://pith.science/paper/QZOJWS2Q"},"agent_actions":{"view_html":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5","download_json":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5.json","view_paper":"https://pith.science/paper/QZOJWS2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.07725&json=true","fetch_graph":"https://pith.science/api/pith-number/QZOJWS2QOABGGUSUEHGKUP7KU5/graph.json","fetch_events":"https://pith.science/api/pith-number/QZOJWS2QOABGGUSUEHGKUP7KU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5/action/storage_attestation","attest_author":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5/action/author_attestation","sign_citation":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5/action/citation_signature","submit_replication":"https://pith.science/pith/QZOJWS2QOABGGUSUEHGKUP7KU5/action/replication_record"}},"created_at":"2026-07-05T05:39:10.758162+00:00","updated_at":"2026-07-05T05:39:10.758162+00:00"}