{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2YEN3LBFU64ITPVXAVCQKKRXSW","short_pith_number":"pith:2YEN3LBF","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"},"canonical_sha256":"d608ddac25a7b889beb70545052a3795a0f3ddd77ec0176986970573e9548306","source":{"kind":"arxiv","id":"1408.6292","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6292","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6292v1","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6292","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"2YEN3LBFU64I","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2YEN3LBFU64ITPVX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2YEN3LBF","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2YEN3LBFU64ITPVXAVCQKKRXSW","target":"record","payload":{"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"},"canonical_sha256":"d608ddac25a7b889beb70545052a3795a0f3ddd77ec0176986970573e9548306","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"},"source_kind":"arxiv","source_id":"1408.6292","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-18T02:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQJ5XQYBr1T7vsIaTgBfle+/OSKhoCKmHla1FZ52LCKDncFUWt9BiOm3KgMjeLvOSmbqhrCsXNNoxXp6hWDcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:18:04.012617Z"},"content_sha256":"7843e5f79877e562845123c5e1f4326937809086ab095646fa555d5cdf9d6f20","schema_version":"1.0","event_id":"sha256:7843e5f79877e562845123c5e1f4326937809086ab095646fa555d5cdf9d6f20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2YEN3LBFU64ITPVXAVCQKKRXSW","target":"graph","payload":{"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"},"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:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXEyEQia5KUR4B4NKOJ4o8HUEOPZ61fQ3HvGnQkGT0Fv6c3Dtb728nLUji2a7A+Nakpy/iPpJ3ZNxKwo9hI3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:18:04.012983Z"},"content_sha256":"04eea18020c6161ad112cc638c29dbfbb030d3fc1618546d4f560cb897ae8025","schema_version":"1.0","event_id":"sha256:04eea18020c6161ad112cc638c29dbfbb030d3fc1618546d4f560cb897ae8025"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/bundle.json","state_url":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/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-05-19T22:18:04Z","links":{"resolver":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW","bundle":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/bundle.json","state":"https://pith.science/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YEN3LBFU64ITPVXAVCQKKRXSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2YEN3LBFU64ITPVXAVCQKKRXSW","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":"26af3453c634cbe9170ae5082083e44f5346bed1e40718270fd1ddba9254ecb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-27T02:01:48Z","title_canon_sha256":"e588d76a649fd68ed25aba10b21cbb93307fa72af81ab828dc4470972234b246"},"schema_version":"1.0","source":{"id":"1408.6292","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6292","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6292v1","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6292","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"2YEN3LBFU64I","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2YEN3LBFU64ITPVX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2YEN3LBF","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:04eea18020c6161ad112cc638c29dbfbb030d3fc1618546d4f560cb897ae8025","target":"graph","created_at":"2026-05-18T02:44:07Z","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":"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 ","authors_text":"Aditya Parameswaran, Yihan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-27T02:01:48Z","title":"Finish Them!: Pricing Algorithms for Human Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6292","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:7843e5f79877e562845123c5e1f4326937809086ab095646fa555d5cdf9d6f20","target":"record","created_at":"2026-05-18T02:44:07Z","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":"26af3453c634cbe9170ae5082083e44f5346bed1e40718270fd1ddba9254ecb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-27T02:01:48Z","title_canon_sha256":"e588d76a649fd68ed25aba10b21cbb93307fa72af81ab828dc4470972234b246"},"schema_version":"1.0","source":{"id":"1408.6292","kind":"arxiv","version":1}},"canonical_sha256":"d608ddac25a7b889beb70545052a3795a0f3ddd77ec0176986970573e9548306","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d608ddac25a7b889beb70545052a3795a0f3ddd77ec0176986970573e9548306","first_computed_at":"2026-05-18T02:44:07.804489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:07.804489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iz2L34ZAa2ENCeoSWbn2AY53I28gXJ7V021X94yqoF5PMIaMEDEwEDE9gdL4Ug0m1us545LyFoDB1NIUyvbnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:07.805062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.6292","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7843e5f79877e562845123c5e1f4326937809086ab095646fa555d5cdf9d6f20","sha256:04eea18020c6161ad112cc638c29dbfbb030d3fc1618546d4f560cb897ae8025"],"state_sha256":"78dbf820179ad8cd166bb93de0dda1226c7699d9b98d00f0ec1dc8722349d028"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZbrfpkKDotFPfe4G63nQK9sz0ONzPylgBFZeulvTo+yObczMsb5UX+wiUrQjQLN6fpYGcFzvQTG127wIC+ECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T22:18:04.014899Z","bundle_sha256":"a8e42ac128ed6a15dad984551a1616f6a561aa13a37b7b402d75864075062a9f"}}