{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:666QDZ7U6ZLYNKRY6SEIM4YCU3","short_pith_number":"pith:666QDZ7U","schema_version":"1.0","canonical_sha256":"f7bd01e7f4f65786aa38f488867302a6dd40a171d7ec77b176906646408fbe87","source":{"kind":"arxiv","id":"1103.0040","version":3},"attestation_state":"computed","paper":{"title":"From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Qiqi Yan, Shaddin Dughmi, Tim Roughgarden","submitted_at":"2011-02-28T22:18:01Z","abstract_excerpt":"We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank sums (MRS), which encompass most concrete examples of submodular functions studied in this context, including coverage functions, matroid weighted-rank functions, and convex combinations thereof. Our approximation factor is the best possible, even for known and explicitly given coverage valuations, assuming P != NP. Ours is the first truthful-in-expectation "},"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":"1103.0040","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bdce53516eef8e6c8572d46ce072ddc7f0d4ec86efe74a49b394d611a21b2384","abstract_canon_sha256":"f0b188dd7abf57b8c79135aaefb4678a3ac5d680beb7d3f340f405941cc22e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.875770Z","signature_b64":"f4+sJI0P1O5FclbpSGdAVh/XR3WoCyClZ6A1iBziKR9A3Zv1RtaAoaZy9LbB/wy1LFTlOy4EhWK/uc3zHNFlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7bd01e7f4f65786aa38f488867302a6dd40a171d7ec77b176906646408fbe87","last_reissued_at":"2026-05-18T04:24:05.875088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.875088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Qiqi Yan, Shaddin Dughmi, Tim Roughgarden","submitted_at":"2011-02-28T22:18:01Z","abstract_excerpt":"We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank sums (MRS), which encompass most concrete examples of submodular functions studied in this context, including coverage functions, matroid weighted-rank functions, and convex combinations thereof. Our approximation factor is the best possible, even for known and explicitly given coverage valuations, assuming P != NP. Ours is the first truthful-in-expectation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0040","kind":"arxiv","version":3},"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":"1103.0040","created_at":"2026-05-18T04:24:05.875200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0040v3","created_at":"2026-05-18T04:24:05.875200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0040","created_at":"2026-05-18T04:24:05.875200+00:00"},{"alias_kind":"pith_short_12","alias_value":"666QDZ7U6ZLY","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"666QDZ7U6ZLYNKRY","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"666QDZ7U","created_at":"2026-05-18T12:26:22.705136+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/666QDZ7U6ZLYNKRY6SEIM4YCU3","json":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3.json","graph_json":"https://pith.science/api/pith-number/666QDZ7U6ZLYNKRY6SEIM4YCU3/graph.json","events_json":"https://pith.science/api/pith-number/666QDZ7U6ZLYNKRY6SEIM4YCU3/events.json","paper":"https://pith.science/paper/666QDZ7U"},"agent_actions":{"view_html":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3","download_json":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3.json","view_paper":"https://pith.science/paper/666QDZ7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0040&json=true","fetch_graph":"https://pith.science/api/pith-number/666QDZ7U6ZLYNKRY6SEIM4YCU3/graph.json","fetch_events":"https://pith.science/api/pith-number/666QDZ7U6ZLYNKRY6SEIM4YCU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/action/storage_attestation","attest_author":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/action/author_attestation","sign_citation":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/action/citation_signature","submit_replication":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/action/replication_record"}},"created_at":"2026-05-18T04:24:05.875200+00:00","updated_at":"2026-05-18T04:24:05.875200+00:00"}