{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Y5LPMPFGOLWERORW4PKRC6J6YG","short_pith_number":"pith:Y5LPMPFG","schema_version":"1.0","canonical_sha256":"c756f63ca672ec48ba36e3d511793ec1a53018a790676d72b34a681266c8549a","source":{"kind":"arxiv","id":"1202.1483","version":1},"attestation_state":"computed","paper":{"title":"Send Mixed Signals -- Earn More, Work Less","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Or Sheffet, Peter Bro Miltersen","submitted_at":"2012-02-07T18:13:15Z","abstract_excerpt":"Emek et al. presented a model of probabilistic single-item second price auctions where an auctioneer who is informed about the type of an item for sale, broadcasts a signal about this type to uninformed bidders. They proved that finding the optimal (for the purpose of generating revenue) {\\em pure} signaling scheme is strongly NP-hard. In contrast, we prove that finding the optimal {\\em mixed} signaling scheme can be done in polynomial time using linear programming. For the proof, we show that the problem is strongly related to a problem of optimally bundling divisible goods for auctioning. We"},"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":"1202.1483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-07T18:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"769ce2024fd32cd03a9bd210370a0a63cb6f5b8f248873a62ebc178220ae946b","abstract_canon_sha256":"180507008b1f0cf1fbbcb09bb3d46b6fcf98127dd9635b18ccd8da8f894ca688"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:53.271074Z","signature_b64":"ZsKF1UEp3Bfb68YK6DJQSYmNR+jkY8/NxhtR4Wo0PVxL762xnnjNVc4lH3wYb3seVCiXv7To9INGFEH+AubOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c756f63ca672ec48ba36e3d511793ec1a53018a790676d72b34a681266c8549a","last_reissued_at":"2026-05-18T04:02:53.270200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:53.270200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Send Mixed Signals -- Earn More, Work Less","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Or Sheffet, Peter Bro Miltersen","submitted_at":"2012-02-07T18:13:15Z","abstract_excerpt":"Emek et al. presented a model of probabilistic single-item second price auctions where an auctioneer who is informed about the type of an item for sale, broadcasts a signal about this type to uninformed bidders. They proved that finding the optimal (for the purpose of generating revenue) {\\em pure} signaling scheme is strongly NP-hard. In contrast, we prove that finding the optimal {\\em mixed} signaling scheme can be done in polynomial time using linear programming. For the proof, we show that the problem is strongly related to a problem of optimally bundling divisible goods for auctioning. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1483","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":"1202.1483","created_at":"2026-05-18T04:02:53.270349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1483v1","created_at":"2026-05-18T04:02:53.270349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1483","created_at":"2026-05-18T04:02:53.270349+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5LPMPFGOLWE","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5LPMPFGOLWERORW","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5LPMPFG","created_at":"2026-05-18T12:27:27.928770+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/Y5LPMPFGOLWERORW4PKRC6J6YG","json":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG.json","graph_json":"https://pith.science/api/pith-number/Y5LPMPFGOLWERORW4PKRC6J6YG/graph.json","events_json":"https://pith.science/api/pith-number/Y5LPMPFGOLWERORW4PKRC6J6YG/events.json","paper":"https://pith.science/paper/Y5LPMPFG"},"agent_actions":{"view_html":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG","download_json":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG.json","view_paper":"https://pith.science/paper/Y5LPMPFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1483&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5LPMPFGOLWERORW4PKRC6J6YG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5LPMPFGOLWERORW4PKRC6J6YG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG/action/storage_attestation","attest_author":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG/action/author_attestation","sign_citation":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG/action/citation_signature","submit_replication":"https://pith.science/pith/Y5LPMPFGOLWERORW4PKRC6J6YG/action/replication_record"}},"created_at":"2026-05-18T04:02:53.270349+00:00","updated_at":"2026-05-18T04:02:53.270349+00:00"}