{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6UDDSM6TTQ6TG7PBMNSKHEG2D2","short_pith_number":"pith:6UDDSM6T","schema_version":"1.0","canonical_sha256":"f5063933d39c3d337de16364a390da1e8f50770d7e5ace4344322e564110884e","source":{"kind":"arxiv","id":"1608.07328","version":1},"attestation_state":"computed","paper":{"title":"Fundamental Limits of Budget-Fidelity Trade-off in Label Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Babak Hassibi, Farshad Lahouti","submitted_at":"2016-08-25T22:43:46Z","abstract_excerpt":"Digital crowdsourcing (CS) is a modern approach to perform certain large projects using small contributions of a large crowd. In CS, a taskmaster typically breaks down the project into small batches of tasks and assigns them to so-called workers with imperfect skill levels. The crowdsourcer then collects and analyzes the results for inference and serving the purpose of the project. In this work, the CS problem, as a human-in-the-loop computation problem, is modeled and analyzed in an information theoretic rate-distortion framework. The purpose is to identify the ultimate fidelity that one can "},"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":"1608.07328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-25T22:43:46Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fda6dccce255377339d9f3a4aa1fdf064c8d9c1b9e3c6d7a76a6ddd5feea5327","abstract_canon_sha256":"d105363dce82b1873b03a6aab2225eda32e99abce902ec907945cf21639d5899"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:53.361161Z","signature_b64":"XC8RuyUFOAeDkR84dpJPK7HBT0diGaOC5i9XsV02LZ1J4a0c1DI/5xD50iNaO6i3PuwUOHwzeCmycEKw9HUACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5063933d39c3d337de16364a390da1e8f50770d7e5ace4344322e564110884e","last_reissued_at":"2026-05-18T01:07:53.360716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:53.360716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Limits of Budget-Fidelity Trade-off in Label Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Babak Hassibi, Farshad Lahouti","submitted_at":"2016-08-25T22:43:46Z","abstract_excerpt":"Digital crowdsourcing (CS) is a modern approach to perform certain large projects using small contributions of a large crowd. In CS, a taskmaster typically breaks down the project into small batches of tasks and assigns them to so-called workers with imperfect skill levels. The crowdsourcer then collects and analyzes the results for inference and serving the purpose of the project. In this work, the CS problem, as a human-in-the-loop computation problem, is modeled and analyzed in an information theoretic rate-distortion framework. The purpose is to identify the ultimate fidelity that one can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07328","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":"1608.07328","created_at":"2026-05-18T01:07:53.360778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07328v1","created_at":"2026-05-18T01:07:53.360778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07328","created_at":"2026-05-18T01:07:53.360778+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UDDSM6TTQ6T","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UDDSM6TTQ6TG7PB","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UDDSM6T","created_at":"2026-05-18T12:30:04.600751+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/6UDDSM6TTQ6TG7PBMNSKHEG2D2","json":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2.json","graph_json":"https://pith.science/api/pith-number/6UDDSM6TTQ6TG7PBMNSKHEG2D2/graph.json","events_json":"https://pith.science/api/pith-number/6UDDSM6TTQ6TG7PBMNSKHEG2D2/events.json","paper":"https://pith.science/paper/6UDDSM6T"},"agent_actions":{"view_html":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2","download_json":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2.json","view_paper":"https://pith.science/paper/6UDDSM6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07328&json=true","fetch_graph":"https://pith.science/api/pith-number/6UDDSM6TTQ6TG7PBMNSKHEG2D2/graph.json","fetch_events":"https://pith.science/api/pith-number/6UDDSM6TTQ6TG7PBMNSKHEG2D2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/action/storage_attestation","attest_author":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/action/author_attestation","sign_citation":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/action/citation_signature","submit_replication":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/action/replication_record"}},"created_at":"2026-05-18T01:07:53.360778+00:00","updated_at":"2026-05-18T01:07:53.360778+00:00"}