{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MIHN4PXTSUR2PRXNHCTQFJ3QRI","short_pith_number":"pith:MIHN4PXT","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"},"canonical_sha256":"620ede3ef39523a7c6ed38a702a7708a0148a874206dd42a623c72bfb49177cd","source":{"kind":"arxiv","id":"1405.2452","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2452","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2452v3","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2452","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"MIHN4PXTSUR2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MIHN4PXTSUR2PRXN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MIHN4PXT","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MIHN4PXTSUR2PRXNHCTQFJ3QRI","target":"record","payload":{"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"},"canonical_sha256":"620ede3ef39523a7c6ed38a702a7708a0148a874206dd42a623c72bfb49177cd","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"},"source_kind":"arxiv","source_id":"1405.2452","source_version":3,"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-18T02:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eW8WMOoCOFfGPmVU+tUI5IxkEeish9LziHgAAqK5HbKwtQuz/r7O8z1Jcl8i9479h7PipcIA5VflfbkQTngDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:45:41.859349Z"},"content_sha256":"6e72cd641b813024b7d585dc295b68cc83ace8fc433fc159da7f4346db7a6738","schema_version":"1.0","event_id":"sha256:6e72cd641b813024b7d585dc295b68cc83ace8fc433fc159da7f4346db7a6738"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MIHN4PXTSUR2PRXNHCTQFJ3QRI","target":"graph","payload":{"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"},"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-18T02:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccHOnI6T6d97l4yhHcXHpp/b/HdnOAa4kR0k1tKRkldYzN74qyvpzzufO9hNEyw6pgW6YztQ0PE/WAD8z60zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:45:41.859700Z"},"content_sha256":"9e92b33d0a5d41e95d317b27805c06eda59487a70f261078c71029e928bd5544","schema_version":"1.0","event_id":"sha256:9e92b33d0a5d41e95d317b27805c06eda59487a70f261078c71029e928bd5544"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/bundle.json","state_url":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/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-03T21:45:41Z","links":{"resolver":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI","bundle":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/bundle.json","state":"https://pith.science/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIHN4PXTSUR2PRXNHCTQFJ3QRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MIHN4PXTSUR2PRXNHCTQFJ3QRI","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":"070b5742c6bacf0bea8284b141e25b147ebb2840b91a40ce99db94d5f30f186d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-10T16:55:57Z","title_canon_sha256":"614ee5a3e91d8bc34efa44a50b6936240da0233c19f4f4036d6a4f4a633a94da"},"schema_version":"1.0","source":{"id":"1405.2452","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2452","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2452v3","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2452","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"MIHN4PXTSUR2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MIHN4PXTSUR2PRXN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MIHN4PXT","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:9e92b33d0a5d41e95d317b27805c06eda59487a70f261078c71029e928bd5544","target":"graph","created_at":"2026-05-18T02:45:21Z","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":"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","authors_text":"Afshin Nikzad, Gagan Goel, Nima Anari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-10T16:55:57Z","title":"Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2452","kind":"arxiv","version":3},"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:6e72cd641b813024b7d585dc295b68cc83ace8fc433fc159da7f4346db7a6738","target":"record","created_at":"2026-05-18T02:45:21Z","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":"070b5742c6bacf0bea8284b141e25b147ebb2840b91a40ce99db94d5f30f186d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-10T16:55:57Z","title_canon_sha256":"614ee5a3e91d8bc34efa44a50b6936240da0233c19f4f4036d6a4f4a633a94da"},"schema_version":"1.0","source":{"id":"1405.2452","kind":"arxiv","version":3}},"canonical_sha256":"620ede3ef39523a7c6ed38a702a7708a0148a874206dd42a623c72bfb49177cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"620ede3ef39523a7c6ed38a702a7708a0148a874206dd42a623c72bfb49177cd","first_computed_at":"2026-05-18T02:45:21.347535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:21.347535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nwgqEjivOPOZluxOb3oFPmD1lLtgfMSB9fYZD0f9TcvhkKYLj6VR3ivZx3lIgTOOwe9nxA7UCVzBcTUaiHyUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:21.347946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2452","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e72cd641b813024b7d585dc295b68cc83ace8fc433fc159da7f4346db7a6738","sha256:9e92b33d0a5d41e95d317b27805c06eda59487a70f261078c71029e928bd5544"],"state_sha256":"9136b108efc27cf6dec271fc917cee1b4fbbe8f4fdbc5c4978b4d6eb4736a446"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seJhWeBzD+HYdpUs27iu2k8JQ+00G6QE4lT1k/xzs0sXfzjnEXhsfmjMHEIAuvUEDLOvJ0OVR46XhjRp029lAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:45:41.861684Z","bundle_sha256":"4be7c4836d0ff84eb199f5be5dd2eff67af95a976ccbf9ebc86896fdddadad00"}}