{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X5WTYJP7QE35CZRIMJXCY6FKXI","short_pith_number":"pith:X5WTYJP7","schema_version":"1.0","canonical_sha256":"bf6d3c25ff8137d16628626e2c78aaba2b393b532a84803b488965ce72add857","source":{"kind":"arxiv","id":"1704.05027","version":1},"attestation_state":"computed","paper":{"title":"Optimal Multi-Unit Mechanisms with Private Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christos-Alexandros Psomas, Nikhil R. Devanur, Nima Haghpanah","submitted_at":"2017-04-17T16:37:32Z","abstract_excerpt":"In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \\min \\{ n, d\\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the buyer. We consider this problem in the Bayesian setting, where the pair $(v,d)$ is drawn jointly from a given probability distribution. In the \\emph{unlimited supply} setting, the optimal (revenue maximizing) mechanism is a pricing problem, i.e., it is a menu of lotteries. In this paper we show that under a natural regularity condition on the probability distrib"},"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":"1704.05027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-17T16:37:32Z","cross_cats_sorted":[],"title_canon_sha256":"126f766234b650bd3418029b3e4d1e67d7142d24e5d058b5d52629a383a5830c","abstract_canon_sha256":"0ede7ad7672981b9469089f0d22c6c66fdf99a6cde0eedf38e8ff7d87abbfd84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.201073Z","signature_b64":"rV0VG24F+5LwI8TtB1doFvJ+9gtIFvI9GTo/dKY9xIBt4cqT90rYS1yFbMWzt3CPa9eosWeCB3jgviQ6nVedDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf6d3c25ff8137d16628626e2c78aaba2b393b532a84803b488965ce72add857","last_reissued_at":"2026-05-18T00:46:17.200482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.200482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Multi-Unit Mechanisms with Private Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christos-Alexandros Psomas, Nikhil R. Devanur, Nima Haghpanah","submitted_at":"2017-04-17T16:37:32Z","abstract_excerpt":"In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \\min \\{ n, d\\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the buyer. We consider this problem in the Bayesian setting, where the pair $(v,d)$ is drawn jointly from a given probability distribution. In the \\emph{unlimited supply} setting, the optimal (revenue maximizing) mechanism is a pricing problem, i.e., it is a menu of lotteries. In this paper we show that under a natural regularity condition on the probability distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05027","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":""},"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":"1704.05027","created_at":"2026-05-18T00:46:17.200594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05027v1","created_at":"2026-05-18T00:46:17.200594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05027","created_at":"2026-05-18T00:46:17.200594+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5WTYJP7QE35","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5WTYJP7QE35CZRI","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5WTYJP7","created_at":"2026-05-18T12:31:53.515858+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/X5WTYJP7QE35CZRIMJXCY6FKXI","json":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI.json","graph_json":"https://pith.science/api/pith-number/X5WTYJP7QE35CZRIMJXCY6FKXI/graph.json","events_json":"https://pith.science/api/pith-number/X5WTYJP7QE35CZRIMJXCY6FKXI/events.json","paper":"https://pith.science/paper/X5WTYJP7"},"agent_actions":{"view_html":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI","download_json":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI.json","view_paper":"https://pith.science/paper/X5WTYJP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05027&json=true","fetch_graph":"https://pith.science/api/pith-number/X5WTYJP7QE35CZRIMJXCY6FKXI/graph.json","fetch_events":"https://pith.science/api/pith-number/X5WTYJP7QE35CZRIMJXCY6FKXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/action/storage_attestation","attest_author":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/action/author_attestation","sign_citation":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/action/citation_signature","submit_replication":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/action/replication_record"}},"created_at":"2026-05-18T00:46:17.200594+00:00","updated_at":"2026-05-18T00:46:17.200594+00:00"}