{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AIATUCNCHAJO5E2BQOSWYCTYCA","short_pith_number":"pith:AIATUCNC","canonical_record":{"source":{"id":"1806.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-06-01T06:00:58Z","cross_cats_sorted":["cs.HC","cs.LG"],"title_canon_sha256":"52468e93f4367a84ceeb414533bd6c6d3ff18baf2d2fe4c8197bbe430d876714","abstract_canon_sha256":"5b15980526fb45481247cd7a2d42a4c1aed6c239879a6d58f5086d797734793e"},"schema_version":"1.0"},"canonical_sha256":"02013a09a23812ee934183a56c0a781013bc3435afc17f386fff3a3be3694cfe","source":{"kind":"arxiv","id":"1806.00206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00206","created_at":"2026-05-18T00:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00206v1","created_at":"2026-05-18T00:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00206","created_at":"2026-05-18T00:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"AIATUCNCHAJO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIATUCNCHAJO5E2B","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIATUCNC","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AIATUCNCHAJO5E2BQOSWYCTYCA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-06-01T06:00:58Z","cross_cats_sorted":["cs.HC","cs.LG"],"title_canon_sha256":"52468e93f4367a84ceeb414533bd6c6d3ff18baf2d2fe4c8197bbe430d876714","abstract_canon_sha256":"5b15980526fb45481247cd7a2d42a4c1aed6c239879a6d58f5086d797734793e"},"schema_version":"1.0"},"canonical_sha256":"02013a09a23812ee934183a56c0a781013bc3435afc17f386fff3a3be3694cfe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:27.623280Z","signature_b64":"wAKAPkzYcii/gK+ujGqsc+At4Jd2IeCWLIXQGjne8ngJi3fstwWH1twhmpq8eRd0BY5c9UIbeEVoum+DaE3QBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02013a09a23812ee934183a56c0a781013bc3435afc17f386fff3a3be3694cfe","last_reissued_at":"2026-05-18T00:14:27.622491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:27.622491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00206","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-18T00:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QniSDPqNZZIASlJLG4vH4dtiQirMGW2E1RqXVTDHOUgR2eLF9F8wYg7W8XABp+sRBMDAGTxWg711/zDT10InBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:27:41.216416Z"},"content_sha256":"c3494b7e952b95f0078a30c2c28282fbdaaec129e9205f80cc8186b00eb05a6a","schema_version":"1.0","event_id":"sha256:c3494b7e952b95f0078a30c2c28282fbdaaec129e9205f80cc8186b00eb05a6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AIATUCNCHAJO5E2BQOSWYCTYCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inference Aided Reinforcement Learning for Incentive Mechanism Design in Crowdsourcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC","cs.LG"],"primary_cat":"cs.GT","authors_text":"Jie Zhang, Yang Liu, Yitao Liang, Zehong Hu","submitted_at":"2018-06-01T06:00:58Z","abstract_excerpt":"Incentive mechanisms for crowdsourcing are designed to incentivize financially self-interested workers to generate and report high-quality labels. Existing mechanisms are often developed as one-shot static solutions, assuming a certain level of knowledge about worker models (expertise levels, costs of exerting efforts, etc.). In this paper, we propose a novel inference aided reinforcement mechanism that learns to incentivize high-quality data sequentially and requires no such prior assumptions. Specifically, we first design a Gibbs sampling augmented Bayesian inference algorithm to estimate wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00206","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-18T00:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9Whxkz8gLDBw2ZWjrxa4GG+COkVAl/qlsmc+z2opujHRF6sT1hs7owVD5di7dJ2iMfFDe2lKIeImZOYzaMdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:27:41.216760Z"},"content_sha256":"4d734c720d1de3818f043a513f74462847c4ee0a82c97638adb44ad8eb192fda","schema_version":"1.0","event_id":"sha256:4d734c720d1de3818f043a513f74462847c4ee0a82c97638adb44ad8eb192fda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIATUCNCHAJO5E2BQOSWYCTYCA/bundle.json","state_url":"https://pith.science/pith/AIATUCNCHAJO5E2BQOSWYCTYCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIATUCNCHAJO5E2BQOSWYCTYCA/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-05-31T02:27:41Z","links":{"resolver":"https://pith.science/pith/AIATUCNCHAJO5E2BQOSWYCTYCA","bundle":"https://pith.science/pith/AIATUCNCHAJO5E2BQOSWYCTYCA/bundle.json","state":"https://pith.science/pith/AIATUCNCHAJO5E2BQOSWYCTYCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIATUCNCHAJO5E2BQOSWYCTYCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AIATUCNCHAJO5E2BQOSWYCTYCA","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":"5b15980526fb45481247cd7a2d42a4c1aed6c239879a6d58f5086d797734793e","cross_cats_sorted":["cs.HC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-06-01T06:00:58Z","title_canon_sha256":"52468e93f4367a84ceeb414533bd6c6d3ff18baf2d2fe4c8197bbe430d876714"},"schema_version":"1.0","source":{"id":"1806.00206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00206","created_at":"2026-05-18T00:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00206v1","created_at":"2026-05-18T00:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00206","created_at":"2026-05-18T00:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"AIATUCNCHAJO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIATUCNCHAJO5E2B","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIATUCNC","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:4d734c720d1de3818f043a513f74462847c4ee0a82c97638adb44ad8eb192fda","target":"graph","created_at":"2026-05-18T00:14:27Z","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":"Incentive mechanisms for crowdsourcing are designed to incentivize financially self-interested workers to generate and report high-quality labels. Existing mechanisms are often developed as one-shot static solutions, assuming a certain level of knowledge about worker models (expertise levels, costs of exerting efforts, etc.). In this paper, we propose a novel inference aided reinforcement mechanism that learns to incentivize high-quality data sequentially and requires no such prior assumptions. Specifically, we first design a Gibbs sampling augmented Bayesian inference algorithm to estimate wo","authors_text":"Jie Zhang, Yang Liu, Yitao Liang, Zehong Hu","cross_cats":["cs.HC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-06-01T06:00:58Z","title":"Inference Aided Reinforcement Learning for Incentive Mechanism Design in Crowdsourcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00206","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:c3494b7e952b95f0078a30c2c28282fbdaaec129e9205f80cc8186b00eb05a6a","target":"record","created_at":"2026-05-18T00:14:27Z","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":"5b15980526fb45481247cd7a2d42a4c1aed6c239879a6d58f5086d797734793e","cross_cats_sorted":["cs.HC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-06-01T06:00:58Z","title_canon_sha256":"52468e93f4367a84ceeb414533bd6c6d3ff18baf2d2fe4c8197bbe430d876714"},"schema_version":"1.0","source":{"id":"1806.00206","kind":"arxiv","version":1}},"canonical_sha256":"02013a09a23812ee934183a56c0a781013bc3435afc17f386fff3a3be3694cfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02013a09a23812ee934183a56c0a781013bc3435afc17f386fff3a3be3694cfe","first_computed_at":"2026-05-18T00:14:27.622491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:27.622491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wAKAPkzYcii/gK+ujGqsc+At4Jd2IeCWLIXQGjne8ngJi3fstwWH1twhmpq8eRd0BY5c9UIbeEVoum+DaE3QBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:27.623280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3494b7e952b95f0078a30c2c28282fbdaaec129e9205f80cc8186b00eb05a6a","sha256:4d734c720d1de3818f043a513f74462847c4ee0a82c97638adb44ad8eb192fda"],"state_sha256":"aaf2767d3867889d758841fe592ddd1379f46296aa24d25335b43c2eb3050267"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uP8Ps3YXS348LavmzCoUyjswN4RWf6C9vOL8voCxn38k+Bm7risX83snBeuF91diWMvS4iyhrfRzkv6AIMZrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:27:41.218588Z","bundle_sha256":"39baae45a15865897f3205386751cd60ef3387b685d645fa24dad9c3b6f2abd9"}}