{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X5WTYJP7QE35CZRIMJXCY6FKXI","short_pith_number":"pith:X5WTYJP7","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"},"canonical_sha256":"bf6d3c25ff8137d16628626e2c78aaba2b393b532a84803b488965ce72add857","source":{"kind":"arxiv","id":"1704.05027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05027","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05027v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05027","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"X5WTYJP7QE35","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X5WTYJP7QE35CZRI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X5WTYJP7","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X5WTYJP7QE35CZRIMJXCY6FKXI","target":"record","payload":{"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"},"canonical_sha256":"bf6d3c25ff8137d16628626e2c78aaba2b393b532a84803b488965ce72add857","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"},"source_kind":"arxiv","source_id":"1704.05027","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cag+HD/exWF8pImLPKqvYjxTizjsjo5jGOMrRFE/5LXWnKAwTYjF/1x6g274KfhdtU/wi8KgJ66zUff6HgEZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:26:55.468864Z"},"content_sha256":"e5a27bd06e814bd79f973379963234569d59503287c2e1f6db31ef3a146afc80","schema_version":"1.0","event_id":"sha256:e5a27bd06e814bd79f973379963234569d59503287c2e1f6db31ef3a146afc80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X5WTYJP7QE35CZRIMJXCY6FKXI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Im+ZN/Q0ydvAzUceWLRKkpeFTMzEhHu+lCBS6pZKdFiFaVdOAK1eNuLrtJcx8b15TOFKI7u1JBSfGOFrNS7gAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:26:55.469212Z"},"content_sha256":"ab1e03a9ff363b18b54f67bbe2d3ebe2b167863e3010b6c8c7aeb8e8fb51d9ec","schema_version":"1.0","event_id":"sha256:ab1e03a9ff363b18b54f67bbe2d3ebe2b167863e3010b6c8c7aeb8e8fb51d9ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/bundle.json","state_url":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T23:26:55Z","links":{"resolver":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI","bundle":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/bundle.json","state":"https://pith.science/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5WTYJP7QE35CZRIMJXCY6FKXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X5WTYJP7QE35CZRIMJXCY6FKXI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0ede7ad7672981b9469089f0d22c6c66fdf99a6cde0eedf38e8ff7d87abbfd84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-17T16:37:32Z","title_canon_sha256":"126f766234b650bd3418029b3e4d1e67d7142d24e5d058b5d52629a383a5830c"},"schema_version":"1.0","source":{"id":"1704.05027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05027","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05027v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05027","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"X5WTYJP7QE35","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X5WTYJP7QE35CZRI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X5WTYJP7","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:ab1e03a9ff363b18b54f67bbe2d3ebe2b167863e3010b6c8c7aeb8e8fb51d9ec","target":"graph","created_at":"2026-05-18T00:46:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christos-Alexandros Psomas, Nikhil R. Devanur, Nima Haghpanah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-17T16:37:32Z","title":"Optimal Multi-Unit Mechanisms with Private Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05027","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5a27bd06e814bd79f973379963234569d59503287c2e1f6db31ef3a146afc80","target":"record","created_at":"2026-05-18T00:46:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0ede7ad7672981b9469089f0d22c6c66fdf99a6cde0eedf38e8ff7d87abbfd84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-17T16:37:32Z","title_canon_sha256":"126f766234b650bd3418029b3e4d1e67d7142d24e5d058b5d52629a383a5830c"},"schema_version":"1.0","source":{"id":"1704.05027","kind":"arxiv","version":1}},"canonical_sha256":"bf6d3c25ff8137d16628626e2c78aaba2b393b532a84803b488965ce72add857","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf6d3c25ff8137d16628626e2c78aaba2b393b532a84803b488965ce72add857","first_computed_at":"2026-05-18T00:46:17.200482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:17.200482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rV0VG24F+5LwI8TtB1doFvJ+9gtIFvI9GTo/dKY9xIBt4cqT90rYS1yFbMWzt3CPa9eosWeCB3jgviQ6nVedDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:17.201073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5a27bd06e814bd79f973379963234569d59503287c2e1f6db31ef3a146afc80","sha256:ab1e03a9ff363b18b54f67bbe2d3ebe2b167863e3010b6c8c7aeb8e8fb51d9ec"],"state_sha256":"a2c8691460bf71b85da86937f0a72e820f4b9341fc15d0c8c9b20501876626da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUCr/7gHOgoSk9uuZd101bYarllC0eHp2tNeLBM08AeA/r+3A62EOkSgoQX460mBG+Ju3lc13mvMkCbh2AQlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:26:55.471083Z","bundle_sha256":"92592d9135b7842d71238fa72bd77049b99410324f837866b070de15e67d6ab7"}}