{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IUOMRPGYUONAVZAKEMNXWZTKPR","short_pith_number":"pith:IUOMRPGY","canonical_record":{"source":{"id":"1311.2138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-09T06:21:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"823d46c82e3081f73b5276fa6be072ece72e5d37fead91a379a4e2fef41e3ac8","abstract_canon_sha256":"487fe40e9a11eaea8b4920399dcd5daad5c6a55d663e8b91cf397315a1146717"},"schema_version":"1.0"},"canonical_sha256":"451cc8bcd8a39a0ae40a231b7b666a7c7ab0510d24838f89e08853699911b679","source":{"kind":"arxiv","id":"1311.2138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2138","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2138v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2138","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"IUOMRPGYUONA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IUOMRPGYUONAVZAK","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IUOMRPGY","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IUOMRPGYUONAVZAKEMNXWZTKPR","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-09T06:21:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"823d46c82e3081f73b5276fa6be072ece72e5d37fead91a379a4e2fef41e3ac8","abstract_canon_sha256":"487fe40e9a11eaea8b4920399dcd5daad5c6a55d663e8b91cf397315a1146717"},"schema_version":"1.0"},"canonical_sha256":"451cc8bcd8a39a0ae40a231b7b666a7c7ab0510d24838f89e08853699911b679","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:10.045425Z","signature_b64":"Th46k3Z+3Y4/QghEoQtJZwpODXKZ5lHVNl1bDoB4MaQSeN1hgfs8Gt4RDqgCalVUestCfVQ4suUXLbv8D2yaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"451cc8bcd8a39a0ae40a231b7b666a7c7ab0510d24838f89e08853699911b679","last_reissued_at":"2026-05-18T00:50:10.044786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:10.044786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2138","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:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fWMFSV3Ik955G2fIR2mvGCPFJQ65CUzK7QlLqkuc99q1fXccaY0qdxvRJUUzzo/GwTVAU348E2LMl9G46wdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:17:42.401384Z"},"content_sha256":"9791aae177e8f86fff356017b43decca79a2d8028103c24d4bc9f744235655f2","schema_version":"1.0","event_id":"sha256:9791aae177e8f86fff356017b43decca79a2d8028103c24d4bc9f744235655f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IUOMRPGYUONAVZAKEMNXWZTKPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Optimal Multidimensional Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Dimitris Paparas, Ilias Diakonikolas, Mihalis Yannakakis, Xiaorui Sun, Xi Chen","submitted_at":"2013-11-09T06:21:33Z","abstract_excerpt":"We resolve the complexity of revenue-optimal deterministic auctions in the unit-demand single-buyer Bayesian setting, i.e., the optimal item pricing problem, when the buyer's values for the items are independent. We show that the problem of computing a revenue-optimal pricing can be solved in polynomial time for distributions of support size 2, and its decision version is NP-complete for distributions of support size 3. We also show that the problem remains NP-complete for the case of identical distributions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2138","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:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2ynlFf9IB8boAOMQhRrYA4cDhtC5FWs2v7gRDp3N7H3GO9RWBfSOr1FBVAMlNb/m5dzJZSvF7NrcB/gt4/iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:17:42.402331Z"},"content_sha256":"304b664385d7786d26b2bf17bddb58314ca35c2087eeb22c5122d445199ab60f","schema_version":"1.0","event_id":"sha256:304b664385d7786d26b2bf17bddb58314ca35c2087eeb22c5122d445199ab60f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUOMRPGYUONAVZAKEMNXWZTKPR/bundle.json","state_url":"https://pith.science/pith/IUOMRPGYUONAVZAKEMNXWZTKPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUOMRPGYUONAVZAKEMNXWZTKPR/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-06T04:17:42Z","links":{"resolver":"https://pith.science/pith/IUOMRPGYUONAVZAKEMNXWZTKPR","bundle":"https://pith.science/pith/IUOMRPGYUONAVZAKEMNXWZTKPR/bundle.json","state":"https://pith.science/pith/IUOMRPGYUONAVZAKEMNXWZTKPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUOMRPGYUONAVZAKEMNXWZTKPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IUOMRPGYUONAVZAKEMNXWZTKPR","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":"487fe40e9a11eaea8b4920399dcd5daad5c6a55d663e8b91cf397315a1146717","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-09T06:21:33Z","title_canon_sha256":"823d46c82e3081f73b5276fa6be072ece72e5d37fead91a379a4e2fef41e3ac8"},"schema_version":"1.0","source":{"id":"1311.2138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2138","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2138v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2138","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"IUOMRPGYUONA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IUOMRPGYUONAVZAK","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IUOMRPGY","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:304b664385d7786d26b2bf17bddb58314ca35c2087eeb22c5122d445199ab60f","target":"graph","created_at":"2026-05-18T00:50:10Z","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":"We resolve the complexity of revenue-optimal deterministic auctions in the unit-demand single-buyer Bayesian setting, i.e., the optimal item pricing problem, when the buyer's values for the items are independent. We show that the problem of computing a revenue-optimal pricing can be solved in polynomial time for distributions of support size 2, and its decision version is NP-complete for distributions of support size 3. We also show that the problem remains NP-complete for the case of identical distributions.","authors_text":"Dimitris Paparas, Ilias Diakonikolas, Mihalis Yannakakis, Xiaorui Sun, Xi Chen","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-09T06:21:33Z","title":"The Complexity of Optimal Multidimensional Pricing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2138","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:9791aae177e8f86fff356017b43decca79a2d8028103c24d4bc9f744235655f2","target":"record","created_at":"2026-05-18T00:50:10Z","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":"487fe40e9a11eaea8b4920399dcd5daad5c6a55d663e8b91cf397315a1146717","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-09T06:21:33Z","title_canon_sha256":"823d46c82e3081f73b5276fa6be072ece72e5d37fead91a379a4e2fef41e3ac8"},"schema_version":"1.0","source":{"id":"1311.2138","kind":"arxiv","version":1}},"canonical_sha256":"451cc8bcd8a39a0ae40a231b7b666a7c7ab0510d24838f89e08853699911b679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"451cc8bcd8a39a0ae40a231b7b666a7c7ab0510d24838f89e08853699911b679","first_computed_at":"2026-05-18T00:50:10.044786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:10.044786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Th46k3Z+3Y4/QghEoQtJZwpODXKZ5lHVNl1bDoB4MaQSeN1hgfs8Gt4RDqgCalVUestCfVQ4suUXLbv8D2yaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:10.045425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9791aae177e8f86fff356017b43decca79a2d8028103c24d4bc9f744235655f2","sha256:304b664385d7786d26b2bf17bddb58314ca35c2087eeb22c5122d445199ab60f"],"state_sha256":"59e9c4f0fcaf46bbc6898a8c123c540010308fd56ef033253ce5cbd2d38985dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jS5FEvlTFU0QZ1b9QxyBaprko0kM/Xch4QOX4vrpTlglnFTgTUcFIQBprmEb2BN6GVv7WOOg4rPcgIoPGALMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T04:17:42.406411Z","bundle_sha256":"ddf632efeeb2336d625ebfc61495b21c859f6c20efdb8c2a4aac19956149dbc9"}}