{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RKTZ4JSIJUVULSVDEDGWGJEV74","short_pith_number":"pith:RKTZ4JSI","schema_version":"1.0","canonical_sha256":"8aa79e26484d2b45caa320cd632495ff39ffb67f2b334c3d8bdb877099555eec","source":{"kind":"arxiv","id":"1305.4002","version":1},"attestation_state":"computed","paper":{"title":"Understanding Incentives: Mechanism Design becomes Algorithm Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Constantinos Daskalakis, S. Matthew Weinberg, Yang Cai","submitted_at":"2013-05-17T07:28:53Z","abstract_excerpt":"We provide a computationally efficient black-box reduction from mechanism design to algorithm design in very general settings. Specifically, we give an approximation-preserving reduction from truthfully maximizing \\emph{any} objective under \\emph{arbitrary} feasibility constraints with \\emph{arbitrary} bidder types to (not necessarily truthfully) maximizing the same objective plus virtual welfare (under the same feasibility constraints). Our reduction is based on a fundamentally new approach: we describe a mechanism's behavior indirectly only in terms of the expected value it awards bidders fo"},"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":"1305.4002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-17T07:28:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cf67bd6f55a3c4ef6d560b487181ba7dfb14810a704cf186b5cf3565c8595332","abstract_canon_sha256":"fb5a7d8f990c00a87125456ee41dfe0306f6fedcbcd23af655db4eefe79852b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.600874Z","signature_b64":"d86w4PnkmGLAS77szCNGORVNiqYXUvAmOIEPDedmpqL+TlPJ+UvjqUPul4rBR54DHvO47B9BZoFqI+cZ451pAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aa79e26484d2b45caa320cd632495ff39ffb67f2b334c3d8bdb877099555eec","last_reissued_at":"2026-05-18T03:25:26.600186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.600186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Incentives: Mechanism Design becomes Algorithm Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Constantinos Daskalakis, S. Matthew Weinberg, Yang Cai","submitted_at":"2013-05-17T07:28:53Z","abstract_excerpt":"We provide a computationally efficient black-box reduction from mechanism design to algorithm design in very general settings. Specifically, we give an approximation-preserving reduction from truthfully maximizing \\emph{any} objective under \\emph{arbitrary} feasibility constraints with \\emph{arbitrary} bidder types to (not necessarily truthfully) maximizing the same objective plus virtual welfare (under the same feasibility constraints). Our reduction is based on a fundamentally new approach: we describe a mechanism's behavior indirectly only in terms of the expected value it awards bidders fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4002","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":"1305.4002","created_at":"2026-05-18T03:25:26.600259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4002v1","created_at":"2026-05-18T03:25:26.600259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4002","created_at":"2026-05-18T03:25:26.600259+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKTZ4JSIJUVU","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKTZ4JSIJUVULSVD","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKTZ4JSI","created_at":"2026-05-18T12:27:57.521954+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/RKTZ4JSIJUVULSVDEDGWGJEV74","json":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74.json","graph_json":"https://pith.science/api/pith-number/RKTZ4JSIJUVULSVDEDGWGJEV74/graph.json","events_json":"https://pith.science/api/pith-number/RKTZ4JSIJUVULSVDEDGWGJEV74/events.json","paper":"https://pith.science/paper/RKTZ4JSI"},"agent_actions":{"view_html":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74","download_json":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74.json","view_paper":"https://pith.science/paper/RKTZ4JSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4002&json=true","fetch_graph":"https://pith.science/api/pith-number/RKTZ4JSIJUVULSVDEDGWGJEV74/graph.json","fetch_events":"https://pith.science/api/pith-number/RKTZ4JSIJUVULSVDEDGWGJEV74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/action/storage_attestation","attest_author":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/action/author_attestation","sign_citation":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/action/citation_signature","submit_replication":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/action/replication_record"}},"created_at":"2026-05-18T03:25:26.600259+00:00","updated_at":"2026-05-18T03:25:26.600259+00:00"}