{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RKTZ4JSIJUVULSVDEDGWGJEV74","short_pith_number":"pith:RKTZ4JSI","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"},"canonical_sha256":"8aa79e26484d2b45caa320cd632495ff39ffb67f2b334c3d8bdb877099555eec","source":{"kind":"arxiv","id":"1305.4002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4002","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4002v1","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4002","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"RKTZ4JSIJUVU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RKTZ4JSIJUVULSVD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RKTZ4JSI","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RKTZ4JSIJUVULSVDEDGWGJEV74","target":"record","payload":{"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"},"canonical_sha256":"8aa79e26484d2b45caa320cd632495ff39ffb67f2b334c3d8bdb877099555eec","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"},"source_kind":"arxiv","source_id":"1305.4002","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-18T03:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7AYsh9O+9wvIbZCS9YKnOWUMTqW63uFFTLl9c0RyXFHQ7Zkp2h3UbiFIPh/q7csgyeU7E8WzY9nwFtOH8E96DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:07:50.902710Z"},"content_sha256":"a63904b54fab29ce45fd590cf5665f8ad42b9749a37538e17a8bc9d48779fed6","schema_version":"1.0","event_id":"sha256:a63904b54fab29ce45fd590cf5665f8ad42b9749a37538e17a8bc9d48779fed6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RKTZ4JSIJUVULSVDEDGWGJEV74","target":"graph","payload":{"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"},"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-18T03:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZFrHStGpMoV4GldJ/9uSN08cSuhGbeEJhEk11e9bxR/AdN6j4UMsvA8Z0P7QhcPYJ9I9b05YM6OPtm3jdGNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:07:50.903214Z"},"content_sha256":"dd3da56efe31191b0aa1db9303d8ab0ab0e0712fc1c72fd34acc95ef07f82bc6","schema_version":"1.0","event_id":"sha256:dd3da56efe31191b0aa1db9303d8ab0ab0e0712fc1c72fd34acc95ef07f82bc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/bundle.json","state_url":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/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-20T12:07:50Z","links":{"resolver":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74","bundle":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/bundle.json","state":"https://pith.science/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKTZ4JSIJUVULSVDEDGWGJEV74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RKTZ4JSIJUVULSVDEDGWGJEV74","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":"fb5a7d8f990c00a87125456ee41dfe0306f6fedcbcd23af655db4eefe79852b9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-17T07:28:53Z","title_canon_sha256":"cf67bd6f55a3c4ef6d560b487181ba7dfb14810a704cf186b5cf3565c8595332"},"schema_version":"1.0","source":{"id":"1305.4002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4002","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4002v1","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4002","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"RKTZ4JSIJUVU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RKTZ4JSIJUVULSVD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RKTZ4JSI","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:dd3da56efe31191b0aa1db9303d8ab0ab0e0712fc1c72fd34acc95ef07f82bc6","target":"graph","created_at":"2026-05-18T03:25:26Z","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 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","authors_text":"Constantinos Daskalakis, S. Matthew Weinberg, Yang Cai","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-17T07:28:53Z","title":"Understanding Incentives: Mechanism Design becomes Algorithm Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4002","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:a63904b54fab29ce45fd590cf5665f8ad42b9749a37538e17a8bc9d48779fed6","target":"record","created_at":"2026-05-18T03:25:26Z","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":"fb5a7d8f990c00a87125456ee41dfe0306f6fedcbcd23af655db4eefe79852b9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-17T07:28:53Z","title_canon_sha256":"cf67bd6f55a3c4ef6d560b487181ba7dfb14810a704cf186b5cf3565c8595332"},"schema_version":"1.0","source":{"id":"1305.4002","kind":"arxiv","version":1}},"canonical_sha256":"8aa79e26484d2b45caa320cd632495ff39ffb67f2b334c3d8bdb877099555eec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8aa79e26484d2b45caa320cd632495ff39ffb67f2b334c3d8bdb877099555eec","first_computed_at":"2026-05-18T03:25:26.600186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:26.600186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d86w4PnkmGLAS77szCNGORVNiqYXUvAmOIEPDedmpqL+TlPJ+UvjqUPul4rBR54DHvO47B9BZoFqI+cZ451pAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:26.600874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a63904b54fab29ce45fd590cf5665f8ad42b9749a37538e17a8bc9d48779fed6","sha256:dd3da56efe31191b0aa1db9303d8ab0ab0e0712fc1c72fd34acc95ef07f82bc6"],"state_sha256":"147f54829b3dbd72d97c690975e2bfc3c32b08344d2cf4c372fe4a07a68f61da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZUtnOErtF83b1r4TLTajhl0fJJPe41XFDLA3iJheXnxjny8RBJ0XW0gqOpXmfRn9I/zQvp1gx+lRRey80hMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:07:50.905504Z","bundle_sha256":"2da8c46f3418afc33c295425e88808e0fb99b6af2163731a3ea17f3351213806"}}