{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WWSI4SX67M5CJVB574WVV4S3K2","short_pith_number":"pith:WWSI4SX6","schema_version":"1.0","canonical_sha256":"b5a48e4afefb3a24d43dff2d5af25b56847a3d0fa5b2d9e90d6b53e552e9dfdd","source":{"kind":"arxiv","id":"1610.06718","version":6},"attestation_state":"computed","paper":{"title":"Optimal Mechanisms for Selling Two Items to a Single Buyer Having Uniformly Distributed Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"D. Thirumulanathan, Rajesh Sundaresan, Y Narahari","submitted_at":"2016-10-21T09:32:37Z","abstract_excerpt":"We consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\\times[c_2,c_2+b_2]$ in the positive quadrant. We provide an explicit, complete solution for arbitrary nonnegative values of $(c_1,c_2,b_1,b_2)$. We identify eight simple structures, each with at most $4$ (possibly stochastic) menu items, and prove that the optimal mechanism has one of these eight structures. We also characterize the optimal mechanism as a function of $(c_1,c_2,b_1,b_2)$. The structure"},"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":"1610.06718","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-21T09:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"0867e918a11beb398ab5d8347e89195d9b22ec5a7416589f33d8863b7ccfd8eb","abstract_canon_sha256":"38afb6941c9ecd0063f5fbce2c28e6294e5f5cefcf95fc6f0478825ca620c57b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:08.650242Z","signature_b64":"JzxBFJZp9CbrNADx+VG7R93OvGHQeFqou8OF72ByUdeLDmohPRxEPvRYjyjSE7cg3uOR79Z30c5gW5OycP2eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a48e4afefb3a24d43dff2d5af25b56847a3d0fa5b2d9e90d6b53e552e9dfdd","last_reissued_at":"2026-05-17T23:52:08.649877Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:08.649877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Mechanisms for Selling Two Items to a Single Buyer Having Uniformly Distributed Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"D. Thirumulanathan, Rajesh Sundaresan, Y Narahari","submitted_at":"2016-10-21T09:32:37Z","abstract_excerpt":"We consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\\times[c_2,c_2+b_2]$ in the positive quadrant. We provide an explicit, complete solution for arbitrary nonnegative values of $(c_1,c_2,b_1,b_2)$. We identify eight simple structures, each with at most $4$ (possibly stochastic) menu items, and prove that the optimal mechanism has one of these eight structures. We also characterize the optimal mechanism as a function of $(c_1,c_2,b_1,b_2)$. The structure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06718","kind":"arxiv","version":6},"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":"1610.06718","created_at":"2026-05-17T23:52:08.649935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06718v6","created_at":"2026-05-17T23:52:08.649935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06718","created_at":"2026-05-17T23:52:08.649935+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWSI4SX67M5C","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWSI4SX67M5CJVB5","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWSI4SX6","created_at":"2026-05-18T12:30:51.357362+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/WWSI4SX67M5CJVB574WVV4S3K2","json":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2.json","graph_json":"https://pith.science/api/pith-number/WWSI4SX67M5CJVB574WVV4S3K2/graph.json","events_json":"https://pith.science/api/pith-number/WWSI4SX67M5CJVB574WVV4S3K2/events.json","paper":"https://pith.science/paper/WWSI4SX6"},"agent_actions":{"view_html":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2","download_json":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2.json","view_paper":"https://pith.science/paper/WWSI4SX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06718&json=true","fetch_graph":"https://pith.science/api/pith-number/WWSI4SX67M5CJVB574WVV4S3K2/graph.json","fetch_events":"https://pith.science/api/pith-number/WWSI4SX67M5CJVB574WVV4S3K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2/action/storage_attestation","attest_author":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2/action/author_attestation","sign_citation":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2/action/citation_signature","submit_replication":"https://pith.science/pith/WWSI4SX67M5CJVB574WVV4S3K2/action/replication_record"}},"created_at":"2026-05-17T23:52:08.649935+00:00","updated_at":"2026-05-17T23:52:08.649935+00:00"}