{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G2Q3DC5P2BIPJWKDMQYYF7Y57Q","short_pith_number":"pith:G2Q3DC5P","schema_version":"1.0","canonical_sha256":"36a1b18bafd050f4d943643182ff1dfc0b02a41b4a84e1a18c18e49d83235e49","source":{"kind":"arxiv","id":"1406.7157","version":3},"attestation_state":"computed","paper":{"title":"An Incentive Compatible Multi-Armed-Bandit Crowdsourcing Mechanism with Quality Assurance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Onno Zoeter, Satyanath Bhat, Shweta Jain, Sujit Gujar, Y. Narahari","submitted_at":"2014-06-27T11:59:47Z","abstract_excerpt":"Consider a requester who wishes to crowdsource a series of identical binary labeling tasks to a pool of workers so as to achieve an assured accuracy for each task, in a cost optimal way. The workers are heterogeneous with unknown but fixed qualities and their costs are private. The problem is to select for each task an optimal subset of workers so that the outcome obtained from the selected workers guarantees a target accuracy level. The problem is a challenging one even in a non strategic setting since the accuracy of aggregated label depends on unknown qualities. We develop a novel multi-arm"},"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":"1406.7157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-06-27T11:59:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5316b19cec39266551ee6febaee02171740c4cd63f3b45a0d2c31f59a0f35add","abstract_canon_sha256":"30ebf83f640be2d8216ddad7d5f8e7d0c6c6a46d7117b2b8dc1e85002ef42eea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:14.153354Z","signature_b64":"j4ip6EWfrl5UEcL3F/IT1yCrdafVERHZ5A3WeDV6pY1/tpSrHm42IqiqUWH7G08e6UuArYM6XXoyhZCwTRWcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36a1b18bafd050f4d943643182ff1dfc0b02a41b4a84e1a18c18e49d83235e49","last_reissued_at":"2026-05-18T01:46:14.152719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:14.152719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Incentive Compatible Multi-Armed-Bandit Crowdsourcing Mechanism with Quality Assurance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Onno Zoeter, Satyanath Bhat, Shweta Jain, Sujit Gujar, Y. Narahari","submitted_at":"2014-06-27T11:59:47Z","abstract_excerpt":"Consider a requester who wishes to crowdsource a series of identical binary labeling tasks to a pool of workers so as to achieve an assured accuracy for each task, in a cost optimal way. The workers are heterogeneous with unknown but fixed qualities and their costs are private. The problem is to select for each task an optimal subset of workers so that the outcome obtained from the selected workers guarantees a target accuracy level. The problem is a challenging one even in a non strategic setting since the accuracy of aggregated label depends on unknown qualities. We develop a novel multi-arm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7157","kind":"arxiv","version":3},"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":"1406.7157","created_at":"2026-05-18T01:46:14.152801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7157v3","created_at":"2026-05-18T01:46:14.152801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7157","created_at":"2026-05-18T01:46:14.152801+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2Q3DC5P2BIP","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2Q3DC5P2BIPJWKD","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2Q3DC5P","created_at":"2026-05-18T12:28:28.263976+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/G2Q3DC5P2BIPJWKDMQYYF7Y57Q","json":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q.json","graph_json":"https://pith.science/api/pith-number/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/graph.json","events_json":"https://pith.science/api/pith-number/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/events.json","paper":"https://pith.science/paper/G2Q3DC5P"},"agent_actions":{"view_html":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q","download_json":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q.json","view_paper":"https://pith.science/paper/G2Q3DC5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7157&json=true","fetch_graph":"https://pith.science/api/pith-number/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/graph.json","fetch_events":"https://pith.science/api/pith-number/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/action/storage_attestation","attest_author":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/action/author_attestation","sign_citation":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/action/citation_signature","submit_replication":"https://pith.science/pith/G2Q3DC5P2BIPJWKDMQYYF7Y57Q/action/replication_record"}},"created_at":"2026-05-18T01:46:14.152801+00:00","updated_at":"2026-05-18T01:46:14.152801+00:00"}