{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TBSQLKENSIZKCTNX22U4RWFM7E","short_pith_number":"pith:TBSQLKEN","schema_version":"1.0","canonical_sha256":"986505a88d9232a14db7d6a9c8d8acf93765684b44eb1d8f424f92298dab1388","source":{"kind":"arxiv","id":"1503.07240","version":1},"attestation_state":"computed","paper":{"title":"Regularized Minimax Conditional Entropy for Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Meek, Dengyong Zhou, John C. Platt, Nihar B. Shah, Qiang Liu","submitted_at":"2015-03-25T00:10:11Z","abstract_excerpt":"There is a rapidly increasing interest in crowdsourcing for data labeling. By crowdsourcing, a large number of labels can be often quickly gathered at low cost. However, the labels provided by the crowdsourcing workers are usually not of high quality. In this paper, we propose a minimax conditional entropy principle to infer ground truth from noisy crowdsourced labels. Under this principle, we derive a unique probabilistic labeling model jointly parameterized by worker ability and item difficulty. We also propose an objective measurement principle, and show that our method is the only method w"},"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":"1503.07240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-25T00:10:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b8d165fca49a11d9c829981a5f8d1ab23ec4dc19ba6a8a2c51f4a60665a8df6b","abstract_canon_sha256":"d5b1df034daae15a866457939a4da4351c1bcdb160fdc73c7e4aeaeab0b7137f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:27.956438Z","signature_b64":"LW9fauaV78Mh9Wt3SO5W9P8VmPiOMvFn/7DFMQXt8ZavcoINnHVsbxG3Cm98fFWKih83Cu34/bGikYDSzvzWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"986505a88d9232a14db7d6a9c8d8acf93765684b44eb1d8f424f92298dab1388","last_reissued_at":"2026-05-18T02:20:27.955788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:27.955788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Minimax Conditional Entropy for Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Meek, Dengyong Zhou, John C. Platt, Nihar B. Shah, Qiang Liu","submitted_at":"2015-03-25T00:10:11Z","abstract_excerpt":"There is a rapidly increasing interest in crowdsourcing for data labeling. By crowdsourcing, a large number of labels can be often quickly gathered at low cost. However, the labels provided by the crowdsourcing workers are usually not of high quality. In this paper, we propose a minimax conditional entropy principle to infer ground truth from noisy crowdsourced labels. Under this principle, we derive a unique probabilistic labeling model jointly parameterized by worker ability and item difficulty. We also propose an objective measurement principle, and show that our method is the only method w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07240","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":"1503.07240","created_at":"2026-05-18T02:20:27.955877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07240v1","created_at":"2026-05-18T02:20:27.955877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07240","created_at":"2026-05-18T02:20:27.955877+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBSQLKENSIZK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBSQLKENSIZKCTNX","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBSQLKEN","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.08776","citing_title":"Latent Distribution Assumption for Unbiased and Consistent Consensus Modelling","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E","json":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E.json","graph_json":"https://pith.science/api/pith-number/TBSQLKENSIZKCTNX22U4RWFM7E/graph.json","events_json":"https://pith.science/api/pith-number/TBSQLKENSIZKCTNX22U4RWFM7E/events.json","paper":"https://pith.science/paper/TBSQLKEN"},"agent_actions":{"view_html":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E","download_json":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E.json","view_paper":"https://pith.science/paper/TBSQLKEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07240&json=true","fetch_graph":"https://pith.science/api/pith-number/TBSQLKENSIZKCTNX22U4RWFM7E/graph.json","fetch_events":"https://pith.science/api/pith-number/TBSQLKENSIZKCTNX22U4RWFM7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E/action/storage_attestation","attest_author":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E/action/author_attestation","sign_citation":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E/action/citation_signature","submit_replication":"https://pith.science/pith/TBSQLKENSIZKCTNX22U4RWFM7E/action/replication_record"}},"created_at":"2026-05-18T02:20:27.955877+00:00","updated_at":"2026-05-18T02:20:27.955877+00:00"}