{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TQDSJZEE7O6XDRDRBQIATTA3RY","short_pith_number":"pith:TQDSJZEE","schema_version":"1.0","canonical_sha256":"9c0724e484fbbd71c4710c1009cc1b8e0538151005cc2ff1105b585ffd93957d","source":{"kind":"arxiv","id":"1906.10794","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Black-Box Mechanism Design with Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brendan Lucier, Christos Tzamos, Evangelia Gergatsouli","submitted_at":"2019-06-26T00:32:15Z","abstract_excerpt":"We study black-box reductions from mechanism design to algorithm design for welfare maximization in settings of incomplete information. Given oracle access to an algorithm for an underlying optimization problem, the goal is to simulate an incentive compatible mechanism. The mechanism will be evaluated on its expected welfare, relative to the algorithm provided, and its complexity is measured by the time (and queries) needed to simulate the mechanism on any input. While it is known that black-box reductions are not possible in many prior-free settings, settings with priors appear more promising"},"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":"1906.10794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-26T00:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"6de6019824fc5affebfc24f585b98a4ed2fea1edcb2b230ff664e3cee1c25e7a","abstract_canon_sha256":"32e0ee64660edfee6f16ce1698ab561bfbd9d447388d12e7ad2b0c73d71edca4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:14.757095Z","signature_b64":"rjXLfzZNWakOXfkwR05ZwkZGnae+M23vroDjjbDokgp4hj9AhsRSdhu9zQ2o8Ls1ow9bvzsJGDUP2nKw8iHKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c0724e484fbbd71c4710c1009cc1b8e0538151005cc2ff1105b585ffd93957d","last_reissued_at":"2026-05-17T23:42:14.756271Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:14.756271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Black-Box Mechanism Design with Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brendan Lucier, Christos Tzamos, Evangelia Gergatsouli","submitted_at":"2019-06-26T00:32:15Z","abstract_excerpt":"We study black-box reductions from mechanism design to algorithm design for welfare maximization in settings of incomplete information. Given oracle access to an algorithm for an underlying optimization problem, the goal is to simulate an incentive compatible mechanism. The mechanism will be evaluated on its expected welfare, relative to the algorithm provided, and its complexity is measured by the time (and queries) needed to simulate the mechanism on any input. While it is known that black-box reductions are not possible in many prior-free settings, settings with priors appear more promising"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10794","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":"1906.10794","created_at":"2026-05-17T23:42:14.756402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10794v1","created_at":"2026-05-17T23:42:14.756402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10794","created_at":"2026-05-17T23:42:14.756402+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQDSJZEE7O6X","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQDSJZEE7O6XDRDR","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQDSJZEE","created_at":"2026-05-18T12:33:30.264802+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/TQDSJZEE7O6XDRDRBQIATTA3RY","json":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY.json","graph_json":"https://pith.science/api/pith-number/TQDSJZEE7O6XDRDRBQIATTA3RY/graph.json","events_json":"https://pith.science/api/pith-number/TQDSJZEE7O6XDRDRBQIATTA3RY/events.json","paper":"https://pith.science/paper/TQDSJZEE"},"agent_actions":{"view_html":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY","download_json":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY.json","view_paper":"https://pith.science/paper/TQDSJZEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10794&json=true","fetch_graph":"https://pith.science/api/pith-number/TQDSJZEE7O6XDRDRBQIATTA3RY/graph.json","fetch_events":"https://pith.science/api/pith-number/TQDSJZEE7O6XDRDRBQIATTA3RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY/action/storage_attestation","attest_author":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY/action/author_attestation","sign_citation":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY/action/citation_signature","submit_replication":"https://pith.science/pith/TQDSJZEE7O6XDRDRBQIATTA3RY/action/replication_record"}},"created_at":"2026-05-17T23:42:14.756402+00:00","updated_at":"2026-05-17T23:42:14.756402+00:00"}