{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DCCJRYGLFV4ZZEC5RB4DA7SA4E","short_pith_number":"pith:DCCJRYGL","canonical_record":{"source":{"id":"1805.00559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T21:31:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"83f88d13c9ad005b8715833b2017b38a7144dadddbe030f13a0d842f4a02400b","abstract_canon_sha256":"7eff5373407dc12c301dda0c326d7f50d0e1842cbd486a348edf02f42f6b5001"},"schema_version":"1.0"},"canonical_sha256":"188498e0cb2d799c905d8878307e40e10449a7ea1738a0c98f32789d04013335","source":{"kind":"arxiv","id":"1805.00559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00559","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00559v1","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00559","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"pith_short_12","alias_value":"DCCJRYGLFV4Z","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCCJRYGLFV4ZZEC5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCCJRYGL","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DCCJRYGLFV4ZZEC5RB4DA7SA4E","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T21:31:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"83f88d13c9ad005b8715833b2017b38a7144dadddbe030f13a0d842f4a02400b","abstract_canon_sha256":"7eff5373407dc12c301dda0c326d7f50d0e1842cbd486a348edf02f42f6b5001"},"schema_version":"1.0"},"canonical_sha256":"188498e0cb2d799c905d8878307e40e10449a7ea1738a0c98f32789d04013335","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:58.520619Z","signature_b64":"LHEmEyUBrwhGMDhDXYACisAL5v5zeabS/EIfqhTD2BZSGtoynzk8ilpBMeYXY22LF8fsvXBg62BgQf+sw5dCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"188498e0cb2d799c905d8878307e40e10449a7ea1738a0c98f32789d04013335","last_reissued_at":"2026-05-18T00:16:58.520007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:58.520007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00559","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-18T00:16:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+A5XRifLvgxWEGgj4fC+e1hhu2Qy4LzmY/KBTvmkSciHWEhbQ8p8voys6F7vsjHqjjtw63rxrvrOL3l8m3FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:56:57.640929Z"},"content_sha256":"61444b249755c8a002464523d3a5c521ec3d7151f0568efb6e4e492f211b9f4e","schema_version":"1.0","event_id":"sha256:61444b249755c8a002464523d3a5c521ec3d7151f0568efb6e4e492f211b9f4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DCCJRYGLFV4ZZEC5RB4DA7SA4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decision Tree Design for Classification in Crowdsourcing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baocheng Geng, Pramod K. Varshney, Qunwei Li","submitted_at":"2018-05-01T21:31:08Z","abstract_excerpt":"In this paper, we present a novel sequential paradigm for classification in crowdsourcing systems. Considering that workers are unreliable and they perform the tests with errors, we study the construction of decision trees so as to minimize the probability of mis-classification. By exploiting the connection between probability of mis-classification and entropy at each level of the decision tree, we propose two algorithms for decision tree design. Furthermore, the worker assignment problem is studied when workers can be assigned to different tests of the decision tree to provide a trade-off bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00559","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-18T00:16:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOhnHGqjhENkD+ygc9ctK9sVZjniidTzt5AQQamTf8rSK7nCB6DUKLqEgdeqYFgmXf7YmAOu+ycrxQ2fW2HeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:56:57.641707Z"},"content_sha256":"aedfc6eab85b389d30519acbcc9bbfa51cb1a634462468ada1833f28b036ef7b","schema_version":"1.0","event_id":"sha256:aedfc6eab85b389d30519acbcc9bbfa51cb1a634462468ada1833f28b036ef7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCCJRYGLFV4ZZEC5RB4DA7SA4E/bundle.json","state_url":"https://pith.science/pith/DCCJRYGLFV4ZZEC5RB4DA7SA4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCCJRYGLFV4ZZEC5RB4DA7SA4E/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-30T04:56:57Z","links":{"resolver":"https://pith.science/pith/DCCJRYGLFV4ZZEC5RB4DA7SA4E","bundle":"https://pith.science/pith/DCCJRYGLFV4ZZEC5RB4DA7SA4E/bundle.json","state":"https://pith.science/pith/DCCJRYGLFV4ZZEC5RB4DA7SA4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCCJRYGLFV4ZZEC5RB4DA7SA4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCCJRYGLFV4ZZEC5RB4DA7SA4E","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":"7eff5373407dc12c301dda0c326d7f50d0e1842cbd486a348edf02f42f6b5001","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T21:31:08Z","title_canon_sha256":"83f88d13c9ad005b8715833b2017b38a7144dadddbe030f13a0d842f4a02400b"},"schema_version":"1.0","source":{"id":"1805.00559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00559","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00559v1","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00559","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"pith_short_12","alias_value":"DCCJRYGLFV4Z","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCCJRYGLFV4ZZEC5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCCJRYGL","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:aedfc6eab85b389d30519acbcc9bbfa51cb1a634462468ada1833f28b036ef7b","target":"graph","created_at":"2026-05-18T00:16:58Z","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":"In this paper, we present a novel sequential paradigm for classification in crowdsourcing systems. Considering that workers are unreliable and they perform the tests with errors, we study the construction of decision trees so as to minimize the probability of mis-classification. By exploiting the connection between probability of mis-classification and entropy at each level of the decision tree, we propose two algorithms for decision tree design. Furthermore, the worker assignment problem is studied when workers can be assigned to different tests of the decision tree to provide a trade-off bet","authors_text":"Baocheng Geng, Pramod K. Varshney, Qunwei Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T21:31:08Z","title":"Decision Tree Design for Classification in Crowdsourcing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00559","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:61444b249755c8a002464523d3a5c521ec3d7151f0568efb6e4e492f211b9f4e","target":"record","created_at":"2026-05-18T00:16:58Z","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":"7eff5373407dc12c301dda0c326d7f50d0e1842cbd486a348edf02f42f6b5001","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T21:31:08Z","title_canon_sha256":"83f88d13c9ad005b8715833b2017b38a7144dadddbe030f13a0d842f4a02400b"},"schema_version":"1.0","source":{"id":"1805.00559","kind":"arxiv","version":1}},"canonical_sha256":"188498e0cb2d799c905d8878307e40e10449a7ea1738a0c98f32789d04013335","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"188498e0cb2d799c905d8878307e40e10449a7ea1738a0c98f32789d04013335","first_computed_at":"2026-05-18T00:16:58.520007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:58.520007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHEmEyUBrwhGMDhDXYACisAL5v5zeabS/EIfqhTD2BZSGtoynzk8ilpBMeYXY22LF8fsvXBg62BgQf+sw5dCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:58.520619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61444b249755c8a002464523d3a5c521ec3d7151f0568efb6e4e492f211b9f4e","sha256:aedfc6eab85b389d30519acbcc9bbfa51cb1a634462468ada1833f28b036ef7b"],"state_sha256":"b305c14db032683be531e23d2481da099ae7ca531d4ec7f85744a26eeb9024af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdvvUeEM18VgylcdL0mVUpOt/zoJkWQV2kdhT/Ojj0sABhj9tfGujG8WacbHdHoSsyYe9B5rvU5Gn0oXV3cGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:56:57.645366Z","bundle_sha256":"4bc95b4a6c3c0c0296981732a7f5b356bb4d566e24aaf126b71a68a5ff80f96c"}}