{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2YEN3LBFU64ITPVXAVCQKKRXSW","short_pith_number":"pith:2YEN3LBF","schema_version":"1.0","canonical_sha256":"d608ddac25a7b889beb70545052a3795a0f3ddd77ec0176986970573e9548306","source":{"kind":"arxiv","id":"1408.6292","version":1},"attestation_state":"computed","paper":{"title":"Finish Them!: Pricing Algorithms for Human Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aditya Parameswaran, Yihan Gao","submitted_at":"2014-08-27T02:01:48Z","abstract_excerpt":"Given a batch of human computation tasks, a commonly ignored aspect is how the price (i.e., the reward paid to human workers) of these tasks must be set or varied in order to meet latency or cost constraints. Often, the price is set up-front and not modified, leading to either a much higher monetary cost than needed (if the price is set too high), or to a much larger latency than expected (if the price is set too low). Leveraging a pricing model from prior work, we develop algorithms to optimally set and then vary price over time in order to meet a (a) user-specified deadline while minimizing "},"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":"1408.6292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-27T02:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"e588d76a649fd68ed25aba10b21cbb93307fa72af81ab828dc4470972234b246","abstract_canon_sha256":"26af3453c634cbe9170ae5082083e44f5346bed1e40718270fd1ddba9254ecb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.805062Z","signature_b64":"Iz2L34ZAa2ENCeoSWbn2AY53I28gXJ7V021X94yqoF5PMIaMEDEwEDE9gdL4Ug0m1us545LyFoDB1NIUyvbnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d608ddac25a7b889beb70545052a3795a0f3ddd77ec0176986970573e9548306","last_reissued_at":"2026-05-18T02:44:07.804489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.804489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finish Them!: Pricing Algorithms for Human Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aditya Parameswaran, Yihan Gao","submitted_at":"2014-08-27T02:01:48Z","abstract_excerpt":"Given a batch of human computation tasks, a commonly ignored aspect is how the price (i.e., the reward paid to human workers) of these tasks must be set or varied in order to meet latency or cost constraints. Often, the price is set up-front and not modified, leading to either a much higher monetary cost than needed (if the price is set too high), or to a much larger latency than expected (if the price is set too low). Leveraging a pricing model from prior work, we develop algorithms to optimally set and then vary price over time in order to meet a (a) user-specified deadline while minimizing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6292","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":"1408.6292","created_at":"2026-05-18T02:44:07.804572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6292v1","created_at":"2026-05-18T02:44:07.804572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6292","created_at":"2026-05-18T02:44:07.804572+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YEN3LBFU64I","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YEN3LBFU64ITPVX","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YEN3LBF","created_at":"2026-05-18T12:28:11.866339+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/2YEN3LBFU64ITPVXAVCQKKRXSW","json":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW.json","graph_json":"https://pith.science/api/pith-number/2YEN3LBFU64ITPVXAVCQKKRXSW/graph.json","events_json":"https://pith.science/api/pith-number/2YEN3LBFU64ITPVXAVCQKKRXSW/events.json","paper":"https://pith.science/paper/2YEN3LBF"},"agent_actions":{"view_html":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW","download_json":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW.json","view_paper":"https://pith.science/paper/2YEN3LBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6292&json=true","fetch_graph":"https://pith.science/api/pith-number/2YEN3LBFU64ITPVXAVCQKKRXSW/graph.json","fetch_events":"https://pith.science/api/pith-number/2YEN3LBFU64ITPVXAVCQKKRXSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/action/storage_attestation","attest_author":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/action/author_attestation","sign_citation":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/action/citation_signature","submit_replication":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/action/replication_record"}},"created_at":"2026-05-18T02:44:07.804572+00:00","updated_at":"2026-05-18T02:44:07.804572+00:00"}