{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L7PYXRTLUOO57OC7M3R4ITXJ4T","short_pith_number":"pith:L7PYXRTL","canonical_record":{"source":{"id":"1502.00725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:45:48Z","cross_cats_sorted":["cs.AI","cs.LG","stat.AP"],"title_canon_sha256":"c40293192feb0d51263b77c285b979b15c8347647434c50440cd30db719d0b36","abstract_canon_sha256":"ce15803ccae07f469aaa229d2e8ddc62824a0548bf8bfd28acc603353f99ad7e"},"schema_version":"1.0"},"canonical_sha256":"5fdf8bc66ba39ddfb85f66e3c44ee9e4d09741c3a933eb04d661ebaff17d1aea","source":{"kind":"arxiv","id":"1502.00725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00725","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00725v1","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00725","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"L7PYXRTLUOO5","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7PYXRTLUOO57OC7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7PYXRTL","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L7PYXRTLUOO57OC7M3R4ITXJ4T","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:45:48Z","cross_cats_sorted":["cs.AI","cs.LG","stat.AP"],"title_canon_sha256":"c40293192feb0d51263b77c285b979b15c8347647434c50440cd30db719d0b36","abstract_canon_sha256":"ce15803ccae07f469aaa229d2e8ddc62824a0548bf8bfd28acc603353f99ad7e"},"schema_version":"1.0"},"canonical_sha256":"5fdf8bc66ba39ddfb85f66e3c44ee9e4d09741c3a933eb04d661ebaff17d1aea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:04.483685Z","signature_b64":"XYLdRiNnbREXKJap2lkKojsYR7IN1MdkG2XcaH/ZsICRRrJMvh7bBljHuBRpeV458OGgwCiKaD8tGYzFbPXdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fdf8bc66ba39ddfb85f66e3c44ee9e4d09741c3a933eb04d661ebaff17d1aea","last_reissued_at":"2026-05-18T02:28:04.483239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:04.483239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00725","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:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgHlZlerXDyk+kLJmhYwNcijsVSJqkwHovLt8xrRH1lCSXVgVUxP6i2qPgih1PP+ML0ZvSI/2qnUlAGq8lLtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:38:13.230366Z"},"content_sha256":"06b7b5ef600715b45e8e97838435ce371084e8747c689d213c6c5c2e7f7d67e7","schema_version":"1.0","event_id":"sha256:06b7b5ef600715b45e8e97838435ce371084e8747c689d213c6c5c2e7f7d67e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L7PYXRTLUOO57OC7M3R4ITXJ4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cheaper and Better: Selecting Good Workers for Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.AP"],"primary_cat":"stat.ML","authors_text":"Hongwei Li, Qiang Liu","submitted_at":"2015-02-03T03:45:48Z","abstract_excerpt":"Crowdsourcing provides a popular paradigm for data collection at scale. We study the problem of selecting subsets of workers from a given worker pool to maximize the accuracy under a budget constraint. One natural question is whether we should hire as many workers as the budget allows, or restrict on a small number of top-quality workers. By theoretically analyzing the error rate of a typical setting in crowdsourcing, we frame the worker selection problem into a combinatorial optimization problem and propose an algorithm to solve it efficiently. Empirical results on both simulated and real-wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00725","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:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSpdj1G8qRl33QvMOT0ptZng6Xsyv49vwPGzv77Vv29pjm3nlN1tltUs4tNhhSQVNdFcd5LZv73t9oUFejwVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:38:13.230720Z"},"content_sha256":"0186353aa6231626053d89b3a0addc1214142c29c3899834fc261fd792ed1fdd","schema_version":"1.0","event_id":"sha256:0186353aa6231626053d89b3a0addc1214142c29c3899834fc261fd792ed1fdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7PYXRTLUOO57OC7M3R4ITXJ4T/bundle.json","state_url":"https://pith.science/pith/L7PYXRTLUOO57OC7M3R4ITXJ4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7PYXRTLUOO57OC7M3R4ITXJ4T/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-28T09:38:13Z","links":{"resolver":"https://pith.science/pith/L7PYXRTLUOO57OC7M3R4ITXJ4T","bundle":"https://pith.science/pith/L7PYXRTLUOO57OC7M3R4ITXJ4T/bundle.json","state":"https://pith.science/pith/L7PYXRTLUOO57OC7M3R4ITXJ4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7PYXRTLUOO57OC7M3R4ITXJ4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L7PYXRTLUOO57OC7M3R4ITXJ4T","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":"ce15803ccae07f469aaa229d2e8ddc62824a0548bf8bfd28acc603353f99ad7e","cross_cats_sorted":["cs.AI","cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:45:48Z","title_canon_sha256":"c40293192feb0d51263b77c285b979b15c8347647434c50440cd30db719d0b36"},"schema_version":"1.0","source":{"id":"1502.00725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00725","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00725v1","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00725","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"L7PYXRTLUOO5","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7PYXRTLUOO57OC7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7PYXRTL","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:0186353aa6231626053d89b3a0addc1214142c29c3899834fc261fd792ed1fdd","target":"graph","created_at":"2026-05-18T02:28:04Z","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":"Crowdsourcing provides a popular paradigm for data collection at scale. We study the problem of selecting subsets of workers from a given worker pool to maximize the accuracy under a budget constraint. One natural question is whether we should hire as many workers as the budget allows, or restrict on a small number of top-quality workers. By theoretically analyzing the error rate of a typical setting in crowdsourcing, we frame the worker selection problem into a combinatorial optimization problem and propose an algorithm to solve it efficiently. Empirical results on both simulated and real-wor","authors_text":"Hongwei Li, Qiang Liu","cross_cats":["cs.AI","cs.LG","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:45:48Z","title":"Cheaper and Better: Selecting Good Workers for Crowdsourcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00725","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:06b7b5ef600715b45e8e97838435ce371084e8747c689d213c6c5c2e7f7d67e7","target":"record","created_at":"2026-05-18T02:28:04Z","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":"ce15803ccae07f469aaa229d2e8ddc62824a0548bf8bfd28acc603353f99ad7e","cross_cats_sorted":["cs.AI","cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:45:48Z","title_canon_sha256":"c40293192feb0d51263b77c285b979b15c8347647434c50440cd30db719d0b36"},"schema_version":"1.0","source":{"id":"1502.00725","kind":"arxiv","version":1}},"canonical_sha256":"5fdf8bc66ba39ddfb85f66e3c44ee9e4d09741c3a933eb04d661ebaff17d1aea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fdf8bc66ba39ddfb85f66e3c44ee9e4d09741c3a933eb04d661ebaff17d1aea","first_computed_at":"2026-05-18T02:28:04.483239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:04.483239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XYLdRiNnbREXKJap2lkKojsYR7IN1MdkG2XcaH/ZsICRRrJMvh7bBljHuBRpeV458OGgwCiKaD8tGYzFbPXdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:04.483685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06b7b5ef600715b45e8e97838435ce371084e8747c689d213c6c5c2e7f7d67e7","sha256:0186353aa6231626053d89b3a0addc1214142c29c3899834fc261fd792ed1fdd"],"state_sha256":"0103b52924c529c4c32bd3eacfdd291f0588b7a76c3d8dfa4d70077ad1d6820a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGmMQ5VpgmkvjIWhn1HqbVvzoauWdh1iEca5vX3N5Iwe5isG6lQmND+q4cpnoNUhY3E3uzuyvpuKU509/R8cAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:38:13.232754Z","bundle_sha256":"643a33e269bb6166df3e2164724d007da43c1c113a7757fa1b9cb3779ebeb9b4"}}