{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HBUTMXDVBLSXS2AX5GUF45EBBV","short_pith_number":"pith:HBUTMXDV","schema_version":"1.0","canonical_sha256":"3869365c750ae5796817e9a85e74810d63987c0afa27fb5324c5a9f03da89815","source":{"kind":"arxiv","id":"2410.14864","version":1},"attestation_state":"computed","paper":{"title":"Double Distributionally Robust Bid Shading for First Price Auctions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Aaron Flores, Brendan Kitts, Jose Blanchet, Ravi Kant, San Gultekin, Yan Chen, Yanlin Qu","submitted_at":"2024-10-18T21:13:23Z","abstract_excerpt":"Bid shading has become a standard practice in the digital advertising industry, in which most auctions for advertising (ad) opportunities are now of first price type. Given an ad opportunity, performing bid shading requires estimating not only the value of the opportunity but also the distribution of the highest bid from competitors (i.e. the competitive landscape). Since these two estimates tend to be very noisy in practice, first-price auction participants need a bid shading policy that is robust against relatively significant estimation errors. In this work, we provide a max-min formulation"},"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":"2410.14864","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-18T21:13:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"606ea557711358cc4fd86d32499793353dbf9948a1f568681a6be4473010845a","abstract_canon_sha256":"97f91e5621a5b5c7ed0ad387836c0e81fe89b12b7c9a3c7ecfff6add1297fd35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:45.758098Z","signature_b64":"5A+LiFk3AFNyf7dDCeUbjjINNh1dc50jTEo7ycOVwv3MSGaf1J7T4jwM1RUohUKXy+wqU8JiW994DkRfLux4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3869365c750ae5796817e9a85e74810d63987c0afa27fb5324c5a9f03da89815","last_reissued_at":"2026-07-05T09:22:45.757696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:45.757696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double Distributionally Robust Bid Shading for First Price Auctions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Aaron Flores, Brendan Kitts, Jose Blanchet, Ravi Kant, San Gultekin, Yan Chen, Yanlin Qu","submitted_at":"2024-10-18T21:13:23Z","abstract_excerpt":"Bid shading has become a standard practice in the digital advertising industry, in which most auctions for advertising (ad) opportunities are now of first price type. Given an ad opportunity, performing bid shading requires estimating not only the value of the opportunity but also the distribution of the highest bid from competitors (i.e. the competitive landscape). Since these two estimates tend to be very noisy in practice, first-price auction participants need a bid shading policy that is robust against relatively significant estimation errors. In this work, we provide a max-min formulation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14864","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/2410.14864/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":"2410.14864","created_at":"2026-07-05T09:22:45.757760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.14864v1","created_at":"2026-07-05T09:22:45.757760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14864","created_at":"2026-07-05T09:22:45.757760+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBUTMXDVBLSX","created_at":"2026-07-05T09:22:45.757760+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBUTMXDVBLSXS2AX","created_at":"2026-07-05T09:22:45.757760+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBUTMXDV","created_at":"2026-07-05T09:22:45.757760+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/HBUTMXDVBLSXS2AX5GUF45EBBV","json":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV.json","graph_json":"https://pith.science/api/pith-number/HBUTMXDVBLSXS2AX5GUF45EBBV/graph.json","events_json":"https://pith.science/api/pith-number/HBUTMXDVBLSXS2AX5GUF45EBBV/events.json","paper":"https://pith.science/paper/HBUTMXDV"},"agent_actions":{"view_html":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV","download_json":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV.json","view_paper":"https://pith.science/paper/HBUTMXDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.14864&json=true","fetch_graph":"https://pith.science/api/pith-number/HBUTMXDVBLSXS2AX5GUF45EBBV/graph.json","fetch_events":"https://pith.science/api/pith-number/HBUTMXDVBLSXS2AX5GUF45EBBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV/action/storage_attestation","attest_author":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV/action/author_attestation","sign_citation":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV/action/citation_signature","submit_replication":"https://pith.science/pith/HBUTMXDVBLSXS2AX5GUF45EBBV/action/replication_record"}},"created_at":"2026-07-05T09:22:45.757760+00:00","updated_at":"2026-07-05T09:22:45.757760+00:00"}