{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ILM5VV5K7ACM7QFCEFGR4SXAQQ","short_pith_number":"pith:ILM5VV5K","schema_version":"1.0","canonical_sha256":"42d9dad7aaf804cfc0a2214d1e4ae0842cb3bcf57b5af47931cec538cc7ee1a0","source":{"kind":"arxiv","id":"2002.08841","version":2},"attestation_state":"computed","paper":{"title":"Contextual Reserve Price Optimization in Auctions via Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Haihao Lu, Hossein Esfandiari, Joey Huchette, Vahab Mirrokni","submitted_at":"2020-02-20T16:28:49Z","abstract_excerpt":"We study the problem of learning a linear model to set the reserve price in an auction, given contextual information, in order to maximize expected revenue from the seller side. First, we show that it is not possible to solve this problem in polynomial time unless the \\emph{Exponential Time Hypothesis} fails. Second, we present a strong mixed-integer programming (MIP) formulation for this problem, which is capable of exactly modeling the nonconvex and discontinuous expected reward function. Moreover, we show that this MIP formulation is ideal (i.e. the strongest possible formulation) for the r"},"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":"2002.08841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-20T16:28:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65eec59179d6da22f7b5c0342fede9f0723dfd64d6fa99e635ea717df037b88d","abstract_canon_sha256":"81dac53bcbc857ed72860468af942ea78359f0f23d754765e728703516c171b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:27.722913Z","signature_b64":"Z79J4o3abBcI6zJ4KaUXko3NfeQ7+OXf3rizvuD9Mi+2cP4jemu76Ta2H7PgS+JTR0NHaemFCV2JQtJ8qaa2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42d9dad7aaf804cfc0a2214d1e4ae0842cb3bcf57b5af47931cec538cc7ee1a0","last_reissued_at":"2026-07-05T01:51:27.722479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:27.722479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contextual Reserve Price Optimization in Auctions via Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Haihao Lu, Hossein Esfandiari, Joey Huchette, Vahab Mirrokni","submitted_at":"2020-02-20T16:28:49Z","abstract_excerpt":"We study the problem of learning a linear model to set the reserve price in an auction, given contextual information, in order to maximize expected revenue from the seller side. First, we show that it is not possible to solve this problem in polynomial time unless the \\emph{Exponential Time Hypothesis} fails. Second, we present a strong mixed-integer programming (MIP) formulation for this problem, which is capable of exactly modeling the nonconvex and discontinuous expected reward function. Moreover, we show that this MIP formulation is ideal (i.e. the strongest possible formulation) for the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.08841","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/2002.08841/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":"2002.08841","created_at":"2026-07-05T01:51:27.722541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.08841v2","created_at":"2026-07-05T01:51:27.722541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.08841","created_at":"2026-07-05T01:51:27.722541+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILM5VV5K7ACM","created_at":"2026-07-05T01:51:27.722541+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILM5VV5K7ACM7QFC","created_at":"2026-07-05T01:51:27.722541+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILM5VV5K","created_at":"2026-07-05T01:51:27.722541+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/ILM5VV5K7ACM7QFCEFGR4SXAQQ","json":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ.json","graph_json":"https://pith.science/api/pith-number/ILM5VV5K7ACM7QFCEFGR4SXAQQ/graph.json","events_json":"https://pith.science/api/pith-number/ILM5VV5K7ACM7QFCEFGR4SXAQQ/events.json","paper":"https://pith.science/paper/ILM5VV5K"},"agent_actions":{"view_html":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ","download_json":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ.json","view_paper":"https://pith.science/paper/ILM5VV5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.08841&json=true","fetch_graph":"https://pith.science/api/pith-number/ILM5VV5K7ACM7QFCEFGR4SXAQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ILM5VV5K7ACM7QFCEFGR4SXAQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ/action/storage_attestation","attest_author":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ/action/author_attestation","sign_citation":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ/action/citation_signature","submit_replication":"https://pith.science/pith/ILM5VV5K7ACM7QFCEFGR4SXAQQ/action/replication_record"}},"created_at":"2026-07-05T01:51:27.722541+00:00","updated_at":"2026-07-05T01:51:27.722541+00:00"}