{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TY2LMCCNA7UT2DFGOFMNWWDVFM","short_pith_number":"pith:TY2LMCCN","canonical_record":{"source":{"id":"1510.06335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-21T16:42:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1817bd3492d00db2c990b7afae3c716231aa5325b9c35e9cc4ede37f44ec40b2","abstract_canon_sha256":"7cda60aab06b2587de56144df3fe32ca4bdd8c368371991d1724d003913148e4"},"schema_version":"1.0"},"canonical_sha256":"9e34b6084d07e93d0ca67158db58752b1469f4c8fd55b28ed8559f7f59d91abc","source":{"kind":"arxiv","id":"1510.06335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06335","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06335v2","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06335","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"TY2LMCCNA7UT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TY2LMCCNA7UT2DFG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TY2LMCCN","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TY2LMCCNA7UT2DFGOFMNWWDVFM","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-21T16:42:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1817bd3492d00db2c990b7afae3c716231aa5325b9c35e9cc4ede37f44ec40b2","abstract_canon_sha256":"7cda60aab06b2587de56144df3fe32ca4bdd8c368371991d1724d003913148e4"},"schema_version":"1.0"},"canonical_sha256":"9e34b6084d07e93d0ca67158db58752b1469f4c8fd55b28ed8559f7f59d91abc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:54.656658Z","signature_b64":"bVIOQkJZdAMuavSH4D49/25zQPP1u5QUriApD7H8FFDf72XIg9Vfm18ax/d0L0w50g5E2fwTyl2ZMLkXUo8nAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e34b6084d07e93d0ca67158db58752b1469f4c8fd55b28ed8559f7f59d91abc","last_reissued_at":"2026-05-18T01:16:54.655948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:54.655948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06335","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:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4grrtNSeDi0fgqIPLLbZyxYTh9X2nseL5hCw4wPuYkTEuwGwrU+JptuKulWznndNC2I6tuuCAZ7ljViOe5nvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:05:03.206149Z"},"content_sha256":"80995dfa82dae503f0d5f00fa6998eec379c41ce5b6f0c47e450ae0e6b80199c","schema_version":"1.0","event_id":"sha256:80995dfa82dae503f0d5f00fa6998eec379c41ce5b6f0c47e450ae0e6b80199c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TY2LMCCNA7UT2DFGOFMNWWDVFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Sensitive Bayesian Information Aggregation for Crowdsourcing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"John Guiver, Matteo Venanzi, Nick Jennings, Pushmeet Kohli","submitted_at":"2015-10-21T16:42:55Z","abstract_excerpt":"Crowdsourcing systems commonly face the problem of aggregating multiple judgments provided by potentially unreliable workers. In addition, several aspects of the design of efficient crowdsourcing processes, such as defining worker's bonuses, fair prices and time limits of the tasks, involve knowledge of the likely duration of the task at hand. Bringing this together, in this work we introduce a new time--sensitive Bayesian aggregation method that simultaneously estimates a task's duration and obtains reliable aggregations of crowdsourced judgments. Our method, called BCCTime, builds on the key"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06335","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:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLiEBlPmZOMUOS7BAePfJo3CnekjuKS2H/ZjOH3qUJvP2gEA7LDIvZWdq1vus5qLhTsrBhWvP9Shm40XT4lJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:05:03.206535Z"},"content_sha256":"c98a241bef5af64cfa23cec548968e91b57103e1a9e769c2048a6e69aa126f95","schema_version":"1.0","event_id":"sha256:c98a241bef5af64cfa23cec548968e91b57103e1a9e769c2048a6e69aa126f95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY2LMCCNA7UT2DFGOFMNWWDVFM/bundle.json","state_url":"https://pith.science/pith/TY2LMCCNA7UT2DFGOFMNWWDVFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY2LMCCNA7UT2DFGOFMNWWDVFM/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-03T16:05:03Z","links":{"resolver":"https://pith.science/pith/TY2LMCCNA7UT2DFGOFMNWWDVFM","bundle":"https://pith.science/pith/TY2LMCCNA7UT2DFGOFMNWWDVFM/bundle.json","state":"https://pith.science/pith/TY2LMCCNA7UT2DFGOFMNWWDVFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY2LMCCNA7UT2DFGOFMNWWDVFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TY2LMCCNA7UT2DFGOFMNWWDVFM","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":"7cda60aab06b2587de56144df3fe32ca4bdd8c368371991d1724d003913148e4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-21T16:42:55Z","title_canon_sha256":"1817bd3492d00db2c990b7afae3c716231aa5325b9c35e9cc4ede37f44ec40b2"},"schema_version":"1.0","source":{"id":"1510.06335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06335","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06335v2","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06335","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"TY2LMCCNA7UT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TY2LMCCNA7UT2DFG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TY2LMCCN","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:c98a241bef5af64cfa23cec548968e91b57103e1a9e769c2048a6e69aa126f95","target":"graph","created_at":"2026-05-18T01:16:54Z","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 commonly face the problem of aggregating multiple judgments provided by potentially unreliable workers. In addition, several aspects of the design of efficient crowdsourcing processes, such as defining worker's bonuses, fair prices and time limits of the tasks, involve knowledge of the likely duration of the task at hand. Bringing this together, in this work we introduce a new time--sensitive Bayesian aggregation method that simultaneously estimates a task's duration and obtains reliable aggregations of crowdsourced judgments. Our method, called BCCTime, builds on the key","authors_text":"John Guiver, Matteo Venanzi, Nick Jennings, Pushmeet Kohli","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-21T16:42:55Z","title":"Time-Sensitive Bayesian Information Aggregation for Crowdsourcing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06335","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:80995dfa82dae503f0d5f00fa6998eec379c41ce5b6f0c47e450ae0e6b80199c","target":"record","created_at":"2026-05-18T01:16:54Z","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":"7cda60aab06b2587de56144df3fe32ca4bdd8c368371991d1724d003913148e4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-21T16:42:55Z","title_canon_sha256":"1817bd3492d00db2c990b7afae3c716231aa5325b9c35e9cc4ede37f44ec40b2"},"schema_version":"1.0","source":{"id":"1510.06335","kind":"arxiv","version":2}},"canonical_sha256":"9e34b6084d07e93d0ca67158db58752b1469f4c8fd55b28ed8559f7f59d91abc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e34b6084d07e93d0ca67158db58752b1469f4c8fd55b28ed8559f7f59d91abc","first_computed_at":"2026-05-18T01:16:54.655948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:54.655948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bVIOQkJZdAMuavSH4D49/25zQPP1u5QUriApD7H8FFDf72XIg9Vfm18ax/d0L0w50g5E2fwTyl2ZMLkXUo8nAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:54.656658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80995dfa82dae503f0d5f00fa6998eec379c41ce5b6f0c47e450ae0e6b80199c","sha256:c98a241bef5af64cfa23cec548968e91b57103e1a9e769c2048a6e69aa126f95"],"state_sha256":"08a54d95a09d9a206856b01a0fce5a0ff55b9b509d13dcaf37373dedb2b1491b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REo3Hh9VfG8dzMxOHgNvw6oF6240NJrXc/F+effVTYLh3Ejw1XTAoBkl9DJr2yG6g+AW0nQXCRaYYpjRZEX2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:05:03.208535Z","bundle_sha256":"7acfe4fe34718bb0abeee84be0004c65b72f3fa6d0171506dd1ba0cb174fbf95"}}