{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3GGXGYM75OY2AEKZ3YDH7GFWA3","short_pith_number":"pith:3GGXGYM7","schema_version":"1.0","canonical_sha256":"d98d73619febb1a01159de067f98b606cc3055b74b17c29e817e2b391898f5c5","source":{"kind":"arxiv","id":"1111.2664","version":1},"attestation_state":"computed","paper":{"title":"A Collaborative Mechanism for Crowdsourcing Prediction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Jacob Abernethy, Rafael M. Frongillo","submitted_at":"2011-11-11T05:09:33Z","abstract_excerpt":"Machine Learning competitions such as the Netflix Prize have proven reasonably successful as a method of \"crowdsourcing\" prediction tasks. But these competitions have a number of weaknesses, particularly in the incentive structure they create for the participants. We propose a new approach, called a Crowdsourced Learning Mechanism, in which participants collaboratively \"learn\" a hypothesis for a given prediction task. The approach draws heavily from the concept of a prediction market, where traders bet on the likelihood of a future event. In our framework, the mechanism continues to publish th"},"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":"1111.2664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-11T05:09:33Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"60b19a36f83db32bff1e738d99313e05911a5bc237d1a92b79f76b734d7f7d67","abstract_canon_sha256":"088f7402dd452bd144102c2008f7a0db47c72d092faa5b97baeb3a70de017e1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:33.025782Z","signature_b64":"eWVut3Ce1N+lV3LidjScwrAvO8Wg6bVzW3+J3QlQPm1KVPqm5zL7k8/niVjUV5JGB4CPeEqGSbW7ziS07QCfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98d73619febb1a01159de067f98b606cc3055b74b17c29e817e2b391898f5c5","last_reissued_at":"2026-05-18T04:08:33.025169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:33.025169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Collaborative Mechanism for Crowdsourcing Prediction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Jacob Abernethy, Rafael M. Frongillo","submitted_at":"2011-11-11T05:09:33Z","abstract_excerpt":"Machine Learning competitions such as the Netflix Prize have proven reasonably successful as a method of \"crowdsourcing\" prediction tasks. But these competitions have a number of weaknesses, particularly in the incentive structure they create for the participants. We propose a new approach, called a Crowdsourced Learning Mechanism, in which participants collaboratively \"learn\" a hypothesis for a given prediction task. The approach draws heavily from the concept of a prediction market, where traders bet on the likelihood of a future event. In our framework, the mechanism continues to publish th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2664","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":"1111.2664","created_at":"2026-05-18T04:08:33.025258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2664v1","created_at":"2026-05-18T04:08:33.025258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2664","created_at":"2026-05-18T04:08:33.025258+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GGXGYM75OY2","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GGXGYM75OY2AEKZ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GGXGYM7","created_at":"2026-05-18T12:26:18.847500+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/3GGXGYM75OY2AEKZ3YDH7GFWA3","json":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3.json","graph_json":"https://pith.science/api/pith-number/3GGXGYM75OY2AEKZ3YDH7GFWA3/graph.json","events_json":"https://pith.science/api/pith-number/3GGXGYM75OY2AEKZ3YDH7GFWA3/events.json","paper":"https://pith.science/paper/3GGXGYM7"},"agent_actions":{"view_html":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3","download_json":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3.json","view_paper":"https://pith.science/paper/3GGXGYM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2664&json=true","fetch_graph":"https://pith.science/api/pith-number/3GGXGYM75OY2AEKZ3YDH7GFWA3/graph.json","fetch_events":"https://pith.science/api/pith-number/3GGXGYM75OY2AEKZ3YDH7GFWA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3/action/storage_attestation","attest_author":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3/action/author_attestation","sign_citation":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3/action/citation_signature","submit_replication":"https://pith.science/pith/3GGXGYM75OY2AEKZ3YDH7GFWA3/action/replication_record"}},"created_at":"2026-05-18T04:08:33.025258+00:00","updated_at":"2026-05-18T04:08:33.025258+00:00"}