{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6UDDSM6TTQ6TG7PBMNSKHEG2D2","short_pith_number":"pith:6UDDSM6T","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"},"canonical_sha256":"f5063933d39c3d337de16364a390da1e8f50770d7e5ace4344322e564110884e","source":{"kind":"arxiv","id":"1608.07328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07328","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07328v1","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07328","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"6UDDSM6TTQ6T","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6UDDSM6TTQ6TG7PB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6UDDSM6T","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6UDDSM6TTQ6TG7PBMNSKHEG2D2","target":"record","payload":{"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"},"canonical_sha256":"f5063933d39c3d337de16364a390da1e8f50770d7e5ace4344322e564110884e","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"},"source_kind":"arxiv","source_id":"1608.07328","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-18T01:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJsBwURG+9wQnyJ0PAY9UJfJI94Ytbpxx5xp/4w3aGgLi01wGtxHYmEwRPXs8zkypWUXJpwah1cAb5/pN5tcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:36.481901Z"},"content_sha256":"74d39fe6d084da1f9eb159a8359018d349d8e2792591b9776f52db2d47f2224d","schema_version":"1.0","event_id":"sha256:74d39fe6d084da1f9eb159a8359018d349d8e2792591b9776f52db2d47f2224d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6UDDSM6TTQ6TG7PBMNSKHEG2D2","target":"graph","payload":{"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"},"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:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey2H/jwDibMj/VBM6zRpvzQiIUhu1hDvHPH9GghvUdbgqlH5FbvGlz/zNNJv+ddTCSEJSnLH4iXH/dWQV/jSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:36.482527Z"},"content_sha256":"0fb1f26ca733145e0af64cb1e50b2db654d17ef4e9a338de2c36e0256833bd09","schema_version":"1.0","event_id":"sha256:0fb1f26ca733145e0af64cb1e50b2db654d17ef4e9a338de2c36e0256833bd09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/bundle.json","state_url":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/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-05T19:21:36Z","links":{"resolver":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2","bundle":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/bundle.json","state":"https://pith.science/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UDDSM6TTQ6TG7PBMNSKHEG2D2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6UDDSM6TTQ6TG7PBMNSKHEG2D2","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":"d105363dce82b1873b03a6aab2225eda32e99abce902ec907945cf21639d5899","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-25T22:43:46Z","title_canon_sha256":"fda6dccce255377339d9f3a4aa1fdf064c8d9c1b9e3c6d7a76a6ddd5feea5327"},"schema_version":"1.0","source":{"id":"1608.07328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07328","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07328v1","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07328","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"6UDDSM6TTQ6T","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6UDDSM6TTQ6TG7PB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6UDDSM6T","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:0fb1f26ca733145e0af64cb1e50b2db654d17ef4e9a338de2c36e0256833bd09","target":"graph","created_at":"2026-05-18T01:07:53Z","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":"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 ","authors_text":"Babak Hassibi, Farshad Lahouti","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-25T22:43:46Z","title":"Fundamental Limits of Budget-Fidelity Trade-off in Label Crowdsourcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07328","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:74d39fe6d084da1f9eb159a8359018d349d8e2792591b9776f52db2d47f2224d","target":"record","created_at":"2026-05-18T01:07:53Z","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":"d105363dce82b1873b03a6aab2225eda32e99abce902ec907945cf21639d5899","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-25T22:43:46Z","title_canon_sha256":"fda6dccce255377339d9f3a4aa1fdf064c8d9c1b9e3c6d7a76a6ddd5feea5327"},"schema_version":"1.0","source":{"id":"1608.07328","kind":"arxiv","version":1}},"canonical_sha256":"f5063933d39c3d337de16364a390da1e8f50770d7e5ace4344322e564110884e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5063933d39c3d337de16364a390da1e8f50770d7e5ace4344322e564110884e","first_computed_at":"2026-05-18T01:07:53.360716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:53.360716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XC8RuyUFOAeDkR84dpJPK7HBT0diGaOC5i9XsV02LZ1J4a0c1DI/5xD50iNaO6i3PuwUOHwzeCmycEKw9HUACw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:53.361161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74d39fe6d084da1f9eb159a8359018d349d8e2792591b9776f52db2d47f2224d","sha256:0fb1f26ca733145e0af64cb1e50b2db654d17ef4e9a338de2c36e0256833bd09"],"state_sha256":"df255b54e71e1b38eca6758bf69e9a209b5f31c3584f56c14aaf43e5aebb7881"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvKaZ529ABj65Cv8eBl6LMrtk37OGxWcEYdTvXCYaM/3k0VrOwpb9B+7d+6ds7KwjIBjaNJ+S+JfCIeAfr1sBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:21:36.485816Z","bundle_sha256":"5b2b03f62e9c6bd5b74021c2c28a45b330f95701b88f2f1719629e8ab2593bb9"}}