{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AF7IPZYJC5MIDECIF7SSEKDYAY","short_pith_number":"pith:AF7IPZYJ","schema_version":"1.0","canonical_sha256":"017e87e70917588190482fe5222878061f110d61f842e1533ec86e41bb48c1af","source":{"kind":"arxiv","id":"1605.07696","version":2},"attestation_state":"computed","paper":{"title":"Exact Exponent in Optimal Rates for Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Chao Gao, Dengyong Zhou, Yu Lu","submitted_at":"2016-05-25T01:16:06Z","abstract_excerpt":"In many machine learning applications, crowdsourcing has become the primary means for label collection. In this paper, we study the optimal error rate for aggregating labels provided by a set of non-expert workers. Under the classic Dawid-Skene model, we establish matching upper and lower bounds with an exact exponent $mI(\\pi)$ in which $m$ is the number of workers and $I(\\pi)$ the average Chernoff information that characterizes the workers' collective ability. Such an exact characterization of the error exponent allows us to state a precise sample size requirement $m>\\frac{1}{I(\\pi)}\\log\\frac"},"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":"1605.07696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T01:16:06Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"cf8ad28cb690027db4e345b8071e53f46ee39ba76d87e2d7eb2cc9b25f74a115","abstract_canon_sha256":"0212b49ea4d4f9de28d546a0961401db6bcad32559d4e20c84eb111045e24f58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:37.360019Z","signature_b64":"xJEKxtyOVHZpv1lQQEnTHdIvEgPuU+gMJFI3tkcbZcKf8zvpyGqpCKAvcWgxWbIg5aAKor5+0l67Gr2QXXQGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017e87e70917588190482fe5222878061f110d61f842e1533ec86e41bb48c1af","last_reissued_at":"2026-05-18T01:13:37.359345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:37.359345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Exponent in Optimal Rates for Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Chao Gao, Dengyong Zhou, Yu Lu","submitted_at":"2016-05-25T01:16:06Z","abstract_excerpt":"In many machine learning applications, crowdsourcing has become the primary means for label collection. In this paper, we study the optimal error rate for aggregating labels provided by a set of non-expert workers. Under the classic Dawid-Skene model, we establish matching upper and lower bounds with an exact exponent $mI(\\pi)$ in which $m$ is the number of workers and $I(\\pi)$ the average Chernoff information that characterizes the workers' collective ability. Such an exact characterization of the error exponent allows us to state a precise sample size requirement $m>\\frac{1}{I(\\pi)}\\log\\frac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07696","kind":"arxiv","version":2},"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":"1605.07696","created_at":"2026-05-18T01:13:37.359454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07696v2","created_at":"2026-05-18T01:13:37.359454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07696","created_at":"2026-05-18T01:13:37.359454+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF7IPZYJC5MI","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF7IPZYJC5MIDECI","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF7IPZYJ","created_at":"2026-05-18T12:30:07.202191+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/AF7IPZYJC5MIDECIF7SSEKDYAY","json":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY.json","graph_json":"https://pith.science/api/pith-number/AF7IPZYJC5MIDECIF7SSEKDYAY/graph.json","events_json":"https://pith.science/api/pith-number/AF7IPZYJC5MIDECIF7SSEKDYAY/events.json","paper":"https://pith.science/paper/AF7IPZYJ"},"agent_actions":{"view_html":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY","download_json":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY.json","view_paper":"https://pith.science/paper/AF7IPZYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07696&json=true","fetch_graph":"https://pith.science/api/pith-number/AF7IPZYJC5MIDECIF7SSEKDYAY/graph.json","fetch_events":"https://pith.science/api/pith-number/AF7IPZYJC5MIDECIF7SSEKDYAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY/action/storage_attestation","attest_author":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY/action/author_attestation","sign_citation":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY/action/citation_signature","submit_replication":"https://pith.science/pith/AF7IPZYJC5MIDECIF7SSEKDYAY/action/replication_record"}},"created_at":"2026-05-18T01:13:37.359454+00:00","updated_at":"2026-05-18T01:13:37.359454+00:00"}