{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MIHN4PXTSUR2PRXNHCTQFJ3QRI","short_pith_number":"pith:MIHN4PXT","schema_version":"1.0","canonical_sha256":"620ede3ef39523a7c6ed38a702a7708a0148a874206dd42a623c72bfb49177cd","source":{"kind":"arxiv","id":"1405.2452","version":3},"attestation_state":"computed","paper":{"title":"Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Afshin Nikzad, Gagan Goel, Nima Anari","submitted_at":"2014-05-10T16:55:57Z","abstract_excerpt":"In this paper we consider a mechanism design problem in the context of large-scale crowdsourcing markets such as Amazon's Mechanical Turk, ClickWorker, CrowdFlower. In these markets, there is a requester who wants to hire workers to accomplish some tasks. Each worker is assumed to give some utility to the requester. Moreover each worker has a minimum cost that he wants to get paid for getting hired. This minimum cost is assumed to be private information of the workers. The question then is - if the requester has a limited budget, how to design a direct revelation mechanism that picks the right"},"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":"1405.2452","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-10T16:55:57Z","cross_cats_sorted":[],"title_canon_sha256":"614ee5a3e91d8bc34efa44a50b6936240da0233c19f4f4036d6a4f4a633a94da","abstract_canon_sha256":"070b5742c6bacf0bea8284b141e25b147ebb2840b91a40ce99db94d5f30f186d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:21.347946Z","signature_b64":"nwgqEjivOPOZluxOb3oFPmD1lLtgfMSB9fYZD0f9TcvhkKYLj6VR3ivZx3lIgTOOwe9nxA7UCVzBcTUaiHyUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"620ede3ef39523a7c6ed38a702a7708a0148a874206dd42a623c72bfb49177cd","last_reissued_at":"2026-05-18T02:45:21.347535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:21.347535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Afshin Nikzad, Gagan Goel, Nima Anari","submitted_at":"2014-05-10T16:55:57Z","abstract_excerpt":"In this paper we consider a mechanism design problem in the context of large-scale crowdsourcing markets such as Amazon's Mechanical Turk, ClickWorker, CrowdFlower. In these markets, there is a requester who wants to hire workers to accomplish some tasks. Each worker is assumed to give some utility to the requester. Moreover each worker has a minimum cost that he wants to get paid for getting hired. This minimum cost is assumed to be private information of the workers. The question then is - if the requester has a limited budget, how to design a direct revelation mechanism that picks the right"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2452","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":"1405.2452","created_at":"2026-05-18T02:45:21.347598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2452v3","created_at":"2026-05-18T02:45:21.347598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2452","created_at":"2026-05-18T02:45:21.347598+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIHN4PXTSUR2","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIHN4PXTSUR2PRXN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIHN4PXT","created_at":"2026-05-18T12:28:38.356838+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/MIHN4PXTSUR2PRXNHCTQFJ3QRI","json":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI.json","graph_json":"https://pith.science/api/pith-number/MIHN4PXTSUR2PRXNHCTQFJ3QRI/graph.json","events_json":"https://pith.science/api/pith-number/MIHN4PXTSUR2PRXNHCTQFJ3QRI/events.json","paper":"https://pith.science/paper/MIHN4PXT"},"agent_actions":{"view_html":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI","download_json":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI.json","view_paper":"https://pith.science/paper/MIHN4PXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2452&json=true","fetch_graph":"https://pith.science/api/pith-number/MIHN4PXTSUR2PRXNHCTQFJ3QRI/graph.json","fetch_events":"https://pith.science/api/pith-number/MIHN4PXTSUR2PRXNHCTQFJ3QRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/action/storage_attestation","attest_author":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/action/author_attestation","sign_citation":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/action/citation_signature","submit_replication":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/action/replication_record"}},"created_at":"2026-05-18T02:45:21.347598+00:00","updated_at":"2026-05-18T02:45:21.347598+00:00"}