{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PYQWO6OFJEY3EDX7SB5QMPVRFZ","short_pith_number":"pith:PYQWO6OF","canonical_record":{"source":{"id":"1512.09204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-31T03:09:33Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"764dd3c6bc948d7627f02e5467e8dc3df2b41a5709d3cebd20a0bb57548174fa","abstract_canon_sha256":"249e91961aacc9a1e7f8c5024603f982ea3178861bc12bcc4547d4c2bddaab5b"},"schema_version":"1.0"},"canonical_sha256":"7e216779c54931b20eff907b063eb12e4d0ebe52b1bfa546f5fd21858a311e80","source":{"kind":"arxiv","id":"1512.09204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09204","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09204v1","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09204","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"pith_short_12","alias_value":"PYQWO6OFJEY3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PYQWO6OFJEY3EDX7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PYQWO6OF","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PYQWO6OFJEY3EDX7SB5QMPVRFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-31T03:09:33Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"764dd3c6bc948d7627f02e5467e8dc3df2b41a5709d3cebd20a0bb57548174fa","abstract_canon_sha256":"249e91961aacc9a1e7f8c5024603f982ea3178861bc12bcc4547d4c2bddaab5b"},"schema_version":"1.0"},"canonical_sha256":"7e216779c54931b20eff907b063eb12e4d0ebe52b1bfa546f5fd21858a311e80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:33.006245Z","signature_b64":"fYtQzGWgnMeme3XduNGDrWWDdbfRRpSNhmPhHo/L9YdSn4oHGNY2tMTgOGx++7mI4Np2rBkXU3cITMHdu+k3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e216779c54931b20eff907b063eb12e4d0ebe52b1bfa546f5fd21858a311e80","last_reissued_at":"2026-05-18T01:23:33.005598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:33.005598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09204","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-18T01:23:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yuuh8c270AMci9FUbEvo3qpXamAA6Z50cQB4KFvEs44oWntZsKx7P1AwG/z7Kt83+yhg59XzzUIhEV275HkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:57:48.465386Z"},"content_sha256":"6851cef13a93bc7e873b207ea7cef7327942521fad1b5908b7b25b96c5aa5ee0","schema_version":"1.0","event_id":"sha256:6851cef13a93bc7e873b207ea7cef7327942521fad1b5908b7b25b96c5aa5ee0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PYQWO6OFJEY3EDX7SB5QMPVRFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayes-Optimal Effort Allocation in Crowdsourcing: Bounds and Index Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Peter I. Frazier, Weici Hu","submitted_at":"2015-12-31T03:09:33Z","abstract_excerpt":"We consider effort allocation in crowdsourcing, where we wish to assign labeling tasks to imperfect homogeneous crowd workers to maximize overall accuracy in a continuous-time Bayesian setting, subject to budget and time constraints. The Bayes-optimal policy for this problem is the solution to a partially observable Markov decision process, but the curse of dimensionality renders the computation infeasible. Based on the Lagrangian Relaxation technique in Adelman & Mersereau (2008), we provide a computationally tractable instance-specific upper bound on the value of this Bayes-optimal policy, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09204","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-18T01:23:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHWNNt+K1/BvJLWIzPvsRIZG3Bf3Ad0ppwbGsMjjogGat5z/nN5Y75DIwyNCimqN1TNFyT2FEO/B/2cF2lihDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:57:48.466162Z"},"content_sha256":"fb98bf95cce75df759985e1eebc2e3dcffe76934797224a81329e22d60c41e2f","schema_version":"1.0","event_id":"sha256:fb98bf95cce75df759985e1eebc2e3dcffe76934797224a81329e22d60c41e2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYQWO6OFJEY3EDX7SB5QMPVRFZ/bundle.json","state_url":"https://pith.science/pith/PYQWO6OFJEY3EDX7SB5QMPVRFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYQWO6OFJEY3EDX7SB5QMPVRFZ/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-25T14:57:48Z","links":{"resolver":"https://pith.science/pith/PYQWO6OFJEY3EDX7SB5QMPVRFZ","bundle":"https://pith.science/pith/PYQWO6OFJEY3EDX7SB5QMPVRFZ/bundle.json","state":"https://pith.science/pith/PYQWO6OFJEY3EDX7SB5QMPVRFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYQWO6OFJEY3EDX7SB5QMPVRFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PYQWO6OFJEY3EDX7SB5QMPVRFZ","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":"249e91961aacc9a1e7f8c5024603f982ea3178861bc12bcc4547d4c2bddaab5b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-31T03:09:33Z","title_canon_sha256":"764dd3c6bc948d7627f02e5467e8dc3df2b41a5709d3cebd20a0bb57548174fa"},"schema_version":"1.0","source":{"id":"1512.09204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09204","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09204v1","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09204","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"pith_short_12","alias_value":"PYQWO6OFJEY3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PYQWO6OFJEY3EDX7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PYQWO6OF","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:fb98bf95cce75df759985e1eebc2e3dcffe76934797224a81329e22d60c41e2f","target":"graph","created_at":"2026-05-18T01:23:33Z","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":"We consider effort allocation in crowdsourcing, where we wish to assign labeling tasks to imperfect homogeneous crowd workers to maximize overall accuracy in a continuous-time Bayesian setting, subject to budget and time constraints. The Bayes-optimal policy for this problem is the solution to a partially observable Markov decision process, but the curse of dimensionality renders the computation infeasible. Based on the Lagrangian Relaxation technique in Adelman & Mersereau (2008), we provide a computationally tractable instance-specific upper bound on the value of this Bayes-optimal policy, w","authors_text":"Peter I. Frazier, Weici Hu","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-31T03:09:33Z","title":"Bayes-Optimal Effort Allocation in Crowdsourcing: Bounds and Index Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09204","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:6851cef13a93bc7e873b207ea7cef7327942521fad1b5908b7b25b96c5aa5ee0","target":"record","created_at":"2026-05-18T01:23:33Z","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":"249e91961aacc9a1e7f8c5024603f982ea3178861bc12bcc4547d4c2bddaab5b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-31T03:09:33Z","title_canon_sha256":"764dd3c6bc948d7627f02e5467e8dc3df2b41a5709d3cebd20a0bb57548174fa"},"schema_version":"1.0","source":{"id":"1512.09204","kind":"arxiv","version":1}},"canonical_sha256":"7e216779c54931b20eff907b063eb12e4d0ebe52b1bfa546f5fd21858a311e80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e216779c54931b20eff907b063eb12e4d0ebe52b1bfa546f5fd21858a311e80","first_computed_at":"2026-05-18T01:23:33.005598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:33.005598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fYtQzGWgnMeme3XduNGDrWWDdbfRRpSNhmPhHo/L9YdSn4oHGNY2tMTgOGx++7mI4Np2rBkXU3cITMHdu+k3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:33.006245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6851cef13a93bc7e873b207ea7cef7327942521fad1b5908b7b25b96c5aa5ee0","sha256:fb98bf95cce75df759985e1eebc2e3dcffe76934797224a81329e22d60c41e2f"],"state_sha256":"8488399b0803c4365ab6f8eaf5eedef3f49eca024d81646bfe8dd8ddc14aa8d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFOAu5jBS1Wiio19YlTHkwctp3fTykh8X6a9Cn5buw13d7MrOXL+N1wJq7ubPXQSA7eijoDJ+PpZcH5mm5PiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:57:48.469377Z","bundle_sha256":"bd65657ed69f552f8462192075a9558b961f3f19f5b187b030aa8a3c1a9ebd86"}}