{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4I4UXBXXPYVQK5BENPWJJ36TLK","short_pith_number":"pith:4I4UXBXX","schema_version":"1.0","canonical_sha256":"e2394b86f77e2b0574246bec94efd35aa72cd62a97f7fc1b6be3cb7b3c28352d","source":{"kind":"arxiv","id":"1702.07032","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.GT","authors_text":"Dimitris Paparas, George Matikas, Mihalis Yannakakis, Xi Chen","submitted_at":"2017-02-22T22:43:45Z","abstract_excerpt":"We show that the Revenue-Optimal Deterministic Mechanism Design problem for a single additive buyer is #P-hard, even when the distributions have support size 2 for each item and, more importantly, even when the optimal solution is guaranteed to be of a very simple kind: the seller picks a price for each individual item and a price for the grand bundle of all the items; the buyer can purchase either the grand bundle at its given price or any subset of items at their total individual prices. The following problems are also #P-hard, as immediate corollaries of the proof:\n  1. determining if indiv"},"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":"1702.07032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-22T22:43:45Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"b1a84ba9c54b2b20de7227a620c9502af4a5ac65895ececeb4afe5f9f7d0b38b","abstract_canon_sha256":"041965232376a77a0e3fd8feef22c6c550353ec0e3042bbfcdc32cf10f4bfe53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:19.251551Z","signature_b64":"YfgqRkdl9Goxffkgyb9gMlU/PN9hsjHoFo1viL3Axc5/eP5paGTQUCHT806Q0i7PmxbNHdLi6lQkLpz6mj88DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2394b86f77e2b0574246bec94efd35aa72cd62a97f7fc1b6be3cb7b3c28352d","last_reissued_at":"2026-05-18T00:40:19.250866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:19.250866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.GT","authors_text":"Dimitris Paparas, George Matikas, Mihalis Yannakakis, Xi Chen","submitted_at":"2017-02-22T22:43:45Z","abstract_excerpt":"We show that the Revenue-Optimal Deterministic Mechanism Design problem for a single additive buyer is #P-hard, even when the distributions have support size 2 for each item and, more importantly, even when the optimal solution is guaranteed to be of a very simple kind: the seller picks a price for each individual item and a price for the grand bundle of all the items; the buyer can purchase either the grand bundle at its given price or any subset of items at their total individual prices. The following problems are also #P-hard, as immediate corollaries of the proof:\n  1. determining if indiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07032","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":""},"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":"1702.07032","created_at":"2026-05-18T00:40:19.250969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07032v2","created_at":"2026-05-18T00:40:19.250969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07032","created_at":"2026-05-18T00:40:19.250969+00:00"},{"alias_kind":"pith_short_12","alias_value":"4I4UXBXXPYVQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4I4UXBXXPYVQK5BE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4I4UXBXX","created_at":"2026-05-18T12:30:58.224056+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/4I4UXBXXPYVQK5BENPWJJ36TLK","json":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK.json","graph_json":"https://pith.science/api/pith-number/4I4UXBXXPYVQK5BENPWJJ36TLK/graph.json","events_json":"https://pith.science/api/pith-number/4I4UXBXXPYVQK5BENPWJJ36TLK/events.json","paper":"https://pith.science/paper/4I4UXBXX"},"agent_actions":{"view_html":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK","download_json":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK.json","view_paper":"https://pith.science/paper/4I4UXBXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07032&json=true","fetch_graph":"https://pith.science/api/pith-number/4I4UXBXXPYVQK5BENPWJJ36TLK/graph.json","fetch_events":"https://pith.science/api/pith-number/4I4UXBXXPYVQK5BENPWJJ36TLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK/action/storage_attestation","attest_author":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK/action/author_attestation","sign_citation":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK/action/citation_signature","submit_replication":"https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK/action/replication_record"}},"created_at":"2026-05-18T00:40:19.250969+00:00","updated_at":"2026-05-18T00:40:19.250969+00:00"}