{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TUKUVNVYKAIZZYSR5TE4U6W23E","short_pith_number":"pith:TUKUVNVY","canonical_record":{"source":{"id":"1309.3330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T23:10:32Z","cross_cats_sorted":["cs.SI","math.IT"],"title_canon_sha256":"6b37885a67d34566fdb7612f1090aa3dbcb338c580199e244d9eedba73af46b9","abstract_canon_sha256":"b31d6d312b6c0434bb6cb281ecc45274e2deb09f49fb5229816d7562ce3e4440"},"schema_version":"1.0"},"canonical_sha256":"9d154ab6b850119ce251ecc9ca7adad91ea099543976c8218758e3be48d68b62","source":{"kind":"arxiv","id":"1309.3330","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3330","created_at":"2026-05-18T01:47:42Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3330v2","created_at":"2026-05-18T01:47:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3330","created_at":"2026-05-18T01:47:42Z"},{"alias_kind":"pith_short_12","alias_value":"TUKUVNVYKAIZ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TUKUVNVYKAIZZYSR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TUKUVNVY","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TUKUVNVYKAIZZYSR5TE4U6W23E","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T23:10:32Z","cross_cats_sorted":["cs.SI","math.IT"],"title_canon_sha256":"6b37885a67d34566fdb7612f1090aa3dbcb338c580199e244d9eedba73af46b9","abstract_canon_sha256":"b31d6d312b6c0434bb6cb281ecc45274e2deb09f49fb5229816d7562ce3e4440"},"schema_version":"1.0"},"canonical_sha256":"9d154ab6b850119ce251ecc9ca7adad91ea099543976c8218758e3be48d68b62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:42.360174Z","signature_b64":"qqq7P96ff7se4MvzDfyEGAQyeiZkdlXTI5w/IRf8AwCfXIar7ef+sGpFRN6w6iAWTkjRJ34totojo3EvNaRrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d154ab6b850119ce251ecc9ca7adad91ea099543976c8218758e3be48d68b62","last_reissued_at":"2026-05-18T01:47:42.359555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:42.359555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3330","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-18T01:47:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xecUKXxZcYc4p0oIFs5DeKvIIohcswcyWM7M0fM8yVkSeVDOdxkHdTo9e4lHrbOrwjEAQyUbtcKxNwuT0m4TCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:25:57.890730Z"},"content_sha256":"84eed05607070edbf4d86692bdb4806cb30f7586079a68bfff22c8123b880b96","schema_version":"1.0","event_id":"sha256:84eed05607070edbf4d86692bdb4806cb30f7586079a68bfff22c8123b880b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TUKUVNVYKAIZZYSR5TE4U6W23E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable Crowdsourcing for Multi-Class Labeling using Coding Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Vempaty, Lav R. Varshney, Pramod K. Varshney","submitted_at":"2013-09-12T23:10:32Z","abstract_excerpt":"Crowdsourcing systems often have crowd workers that perform unreliable work on the task they are assigned. In this paper, we propose the use of error-control codes and decoding algorithms to design crowdsourcing systems for reliable classification despite unreliable crowd workers. Coding-theory based techniques also allow us to pose easy-to-answer binary questions to the crowd workers. We consider three different crowdsourcing models: systems with independent crowd workers, systems with peer-dependent reward schemes, and systems where workers have common sources of information. For each of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3330","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-18T01:47:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6knEyWXEcmGe2ZJSOLMVWqH2QiIMQA4Y511EmZPmqUHHR6R07quv5X/i2cZbbgSZDsdlrPuw6++1Em4o2HW0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:25:57.891074Z"},"content_sha256":"4209c2668d6d8fd0f3bbaff9155314e121f88be142495ed465bbab8ed120d547","schema_version":"1.0","event_id":"sha256:4209c2668d6d8fd0f3bbaff9155314e121f88be142495ed465bbab8ed120d547"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUKUVNVYKAIZZYSR5TE4U6W23E/bundle.json","state_url":"https://pith.science/pith/TUKUVNVYKAIZZYSR5TE4U6W23E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUKUVNVYKAIZZYSR5TE4U6W23E/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-06-03T00:25:57Z","links":{"resolver":"https://pith.science/pith/TUKUVNVYKAIZZYSR5TE4U6W23E","bundle":"https://pith.science/pith/TUKUVNVYKAIZZYSR5TE4U6W23E/bundle.json","state":"https://pith.science/pith/TUKUVNVYKAIZZYSR5TE4U6W23E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUKUVNVYKAIZZYSR5TE4U6W23E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TUKUVNVYKAIZZYSR5TE4U6W23E","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":"b31d6d312b6c0434bb6cb281ecc45274e2deb09f49fb5229816d7562ce3e4440","cross_cats_sorted":["cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T23:10:32Z","title_canon_sha256":"6b37885a67d34566fdb7612f1090aa3dbcb338c580199e244d9eedba73af46b9"},"schema_version":"1.0","source":{"id":"1309.3330","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3330","created_at":"2026-05-18T01:47:42Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3330v2","created_at":"2026-05-18T01:47:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3330","created_at":"2026-05-18T01:47:42Z"},{"alias_kind":"pith_short_12","alias_value":"TUKUVNVYKAIZ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TUKUVNVYKAIZZYSR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TUKUVNVY","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:4209c2668d6d8fd0f3bbaff9155314e121f88be142495ed465bbab8ed120d547","target":"graph","created_at":"2026-05-18T01:47:42Z","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 systems often have crowd workers that perform unreliable work on the task they are assigned. In this paper, we propose the use of error-control codes and decoding algorithms to design crowdsourcing systems for reliable classification despite unreliable crowd workers. Coding-theory based techniques also allow us to pose easy-to-answer binary questions to the crowd workers. We consider three different crowdsourcing models: systems with independent crowd workers, systems with peer-dependent reward schemes, and systems where workers have common sources of information. For each of the","authors_text":"Aditya Vempaty, Lav R. Varshney, Pramod K. Varshney","cross_cats":["cs.SI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T23:10:32Z","title":"Reliable Crowdsourcing for Multi-Class Labeling using Coding Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3330","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:84eed05607070edbf4d86692bdb4806cb30f7586079a68bfff22c8123b880b96","target":"record","created_at":"2026-05-18T01:47:42Z","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":"b31d6d312b6c0434bb6cb281ecc45274e2deb09f49fb5229816d7562ce3e4440","cross_cats_sorted":["cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T23:10:32Z","title_canon_sha256":"6b37885a67d34566fdb7612f1090aa3dbcb338c580199e244d9eedba73af46b9"},"schema_version":"1.0","source":{"id":"1309.3330","kind":"arxiv","version":2}},"canonical_sha256":"9d154ab6b850119ce251ecc9ca7adad91ea099543976c8218758e3be48d68b62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d154ab6b850119ce251ecc9ca7adad91ea099543976c8218758e3be48d68b62","first_computed_at":"2026-05-18T01:47:42.359555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:47:42.359555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qqq7P96ff7se4MvzDfyEGAQyeiZkdlXTI5w/IRf8AwCfXIar7ef+sGpFRN6w6iAWTkjRJ34totojo3EvNaRrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:47:42.360174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3330","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84eed05607070edbf4d86692bdb4806cb30f7586079a68bfff22c8123b880b96","sha256:4209c2668d6d8fd0f3bbaff9155314e121f88be142495ed465bbab8ed120d547"],"state_sha256":"8f43dbc0a90ba6f2e17b777e1a3502f09bdd6431528c13670051808728ad8714"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+695/vDCf16sTRcFB/6fb55AEOk5hvieTUsQp+5pBTtiq6cQROjjd0ceN+EToeBWi8kDvlHroKKyjmTqihmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:25:57.893335Z","bundle_sha256":"835cd3f437d85864e8b0db5ea8d72c567a39390e943bc52df518a625281007f3"}}