{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OIVAD4NW5GUEGVYIJAQFMEHDMY","short_pith_number":"pith:OIVAD4NW","canonical_record":{"source":{"id":"1606.00226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T11:18:21Z","cross_cats_sorted":["cs.HC","cs.LG","cs.SI"],"title_canon_sha256":"66da666863c75e2ca6c991ddc51c19224dadbeaf7d7b8c009206dcec568f9954","abstract_canon_sha256":"6b40c753d7ba99c12eb11579c466f801ebf5f97eb93b81efe60bdfbb76d5ae72"},"schema_version":"1.0"},"canonical_sha256":"722a01f1b6e9a843570848205610e366253f128efe36d81d14881aef51746527","source":{"kind":"arxiv","id":"1606.00226","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00226","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00226v2","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00226","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"OIVAD4NW5GUE","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OIVAD4NW5GUEGVYI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OIVAD4NW","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OIVAD4NW5GUEGVYIJAQFMEHDMY","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T11:18:21Z","cross_cats_sorted":["cs.HC","cs.LG","cs.SI"],"title_canon_sha256":"66da666863c75e2ca6c991ddc51c19224dadbeaf7d7b8c009206dcec568f9954","abstract_canon_sha256":"6b40c753d7ba99c12eb11579c466f801ebf5f97eb93b81efe60bdfbb76d5ae72"},"schema_version":"1.0"},"canonical_sha256":"722a01f1b6e9a843570848205610e366253f128efe36d81d14881aef51746527","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:03.147380Z","signature_b64":"K+O9NO38wHcSFwFaCiTdbLJ01BoApiiM7Txyrki6Qo/HgAF1FahJynqTLpF5v7WJcV5s8MijCnuvvMKw333lBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722a01f1b6e9a843570848205610e366253f128efe36d81d14881aef51746527","last_reissued_at":"2026-05-18T00:32:03.146844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:03.146844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00226","source_version":2,"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-18T00:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcdJ3k9UX2f6D8Gfqa6LyX6sl99TPO7n48jVtQ6IeDq9Mskttkd79T3F9IL8Y2zg7CrsC4WjcW+snfT2OYEWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:02:31.492472Z"},"content_sha256":"a012df65c41e7562f2994f46a789334f92974e4fe786113bbf81381c957837c0","schema_version":"1.0","event_id":"sha256:a012df65c41e7562f2994f46a789334f92974e4fe786113bbf81381c957837c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OIVAD4NW5GUEGVYIJAQFMEHDMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Minimax Optimal Algorithm for Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC","cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Richard Combes, Thomas Bonald","submitted_at":"2016-06-01T11:18:21Z","abstract_excerpt":"We consider the problem of accurately estimating the reliability of workers based on noisy labels they provide, which is a fundamental question in crowdsourcing. We propose a novel lower bound on the minimax estimation error which applies to any estimation procedure. We further propose Triangular Estimation (TE), an algorithm for estimating the reliability of workers. TE has low complexity, may be implemented in a streaming setting when labels are provided by workers in real time, and does not rely on an iterative procedure. We further prove that TE is minimax optimal and matches our lower bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00226","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"},"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-18T00:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mpl3gFsJUdhVqHbE+WoXgA9tGsRSqWkUsmO6G7hrKuBQM1oHjIhVVtCUdznO1ems/c1JNuKFQ8vS9ve5jUUqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:02:31.493122Z"},"content_sha256":"81a71c83d3a646b51067a57bce8ea7a4e7e3e1649d525173ebdf2b9c36179830","schema_version":"1.0","event_id":"sha256:81a71c83d3a646b51067a57bce8ea7a4e7e3e1649d525173ebdf2b9c36179830"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIVAD4NW5GUEGVYIJAQFMEHDMY/bundle.json","state_url":"https://pith.science/pith/OIVAD4NW5GUEGVYIJAQFMEHDMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIVAD4NW5GUEGVYIJAQFMEHDMY/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-27T12:02:31Z","links":{"resolver":"https://pith.science/pith/OIVAD4NW5GUEGVYIJAQFMEHDMY","bundle":"https://pith.science/pith/OIVAD4NW5GUEGVYIJAQFMEHDMY/bundle.json","state":"https://pith.science/pith/OIVAD4NW5GUEGVYIJAQFMEHDMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIVAD4NW5GUEGVYIJAQFMEHDMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OIVAD4NW5GUEGVYIJAQFMEHDMY","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":"6b40c753d7ba99c12eb11579c466f801ebf5f97eb93b81efe60bdfbb76d5ae72","cross_cats_sorted":["cs.HC","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T11:18:21Z","title_canon_sha256":"66da666863c75e2ca6c991ddc51c19224dadbeaf7d7b8c009206dcec568f9954"},"schema_version":"1.0","source":{"id":"1606.00226","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00226","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00226v2","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00226","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"OIVAD4NW5GUE","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OIVAD4NW5GUEGVYI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OIVAD4NW","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:81a71c83d3a646b51067a57bce8ea7a4e7e3e1649d525173ebdf2b9c36179830","target":"graph","created_at":"2026-05-18T00:32:03Z","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 the problem of accurately estimating the reliability of workers based on noisy labels they provide, which is a fundamental question in crowdsourcing. We propose a novel lower bound on the minimax estimation error which applies to any estimation procedure. We further propose Triangular Estimation (TE), an algorithm for estimating the reliability of workers. TE has low complexity, may be implemented in a streaming setting when labels are provided by workers in real time, and does not rely on an iterative procedure. We further prove that TE is minimax optimal and matches our lower bou","authors_text":"Richard Combes, Thomas Bonald","cross_cats":["cs.HC","cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T11:18:21Z","title":"A Minimax Optimal Algorithm for Crowdsourcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00226","kind":"arxiv","version":2},"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:a012df65c41e7562f2994f46a789334f92974e4fe786113bbf81381c957837c0","target":"record","created_at":"2026-05-18T00:32:03Z","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":"6b40c753d7ba99c12eb11579c466f801ebf5f97eb93b81efe60bdfbb76d5ae72","cross_cats_sorted":["cs.HC","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T11:18:21Z","title_canon_sha256":"66da666863c75e2ca6c991ddc51c19224dadbeaf7d7b8c009206dcec568f9954"},"schema_version":"1.0","source":{"id":"1606.00226","kind":"arxiv","version":2}},"canonical_sha256":"722a01f1b6e9a843570848205610e366253f128efe36d81d14881aef51746527","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"722a01f1b6e9a843570848205610e366253f128efe36d81d14881aef51746527","first_computed_at":"2026-05-18T00:32:03.146844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:03.146844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K+O9NO38wHcSFwFaCiTdbLJ01BoApiiM7Txyrki6Qo/HgAF1FahJynqTLpF5v7WJcV5s8MijCnuvvMKw333lBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:03.147380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00226","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a012df65c41e7562f2994f46a789334f92974e4fe786113bbf81381c957837c0","sha256:81a71c83d3a646b51067a57bce8ea7a4e7e3e1649d525173ebdf2b9c36179830"],"state_sha256":"bdf5d047b0f6a0dd8dcae3a4c7f052e1a4fb59e6ae08677550595647d4747754"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbbBtX/4V2h7jBdD00LcfFec+1oO56fzLuUgiL/UHYenrtnu/8YBl4jRIr4Fi04nbHhxMS3XZCEB4czQoELdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:02:31.496753Z","bundle_sha256":"577b25cfbded2037c6e3e81b1893f35728ba581a2afb3db2928af6d111d40119"}}