{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AKHPIQPCAVPTGUKLFMNDYC36WQ","short_pith_number":"pith:AKHPIQPC","canonical_record":{"source":{"id":"1310.5142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CY","submitted_at":"2013-10-18T14:37:24Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"9c37b1994db90f45419da99bbc773c0b5c7d4915d05a6ab13d9304a0ffdaefdd","abstract_canon_sha256":"a23b9414078bdf497eb373520b8da432d6830985a8e86128d53376dce600940a"},"schema_version":"1.0"},"canonical_sha256":"028ef441e2055f33514b2b1a3c0b7eb41a408f50a1e87e659af096628f996009","source":{"kind":"arxiv","id":"1310.5142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5142","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5142v1","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5142","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"AKHPIQPCAVPT","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AKHPIQPCAVPTGUKL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AKHPIQPC","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AKHPIQPCAVPTGUKLFMNDYC36WQ","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CY","submitted_at":"2013-10-18T14:37:24Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"9c37b1994db90f45419da99bbc773c0b5c7d4915d05a6ab13d9304a0ffdaefdd","abstract_canon_sha256":"a23b9414078bdf497eb373520b8da432d6830985a8e86128d53376dce600940a"},"schema_version":"1.0"},"canonical_sha256":"028ef441e2055f33514b2b1a3c0b7eb41a408f50a1e87e659af096628f996009","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:47.125432Z","signature_b64":"LHIS7mJeTVpiyOfKQbufmspLN1Sb5xgZmNTzZpvQ6EtgTM66HKsSpu3J03AuZ3HUZtqAsv6csD+YpAY3tx93DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028ef441e2055f33514b2b1a3c0b7eb41a408f50a1e87e659af096628f996009","last_reissued_at":"2026-05-18T03:09:47.124748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:47.124748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5142","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-18T03:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfBeyMl1igtUHbih2nw4o4VUU/gONYOVp9IcGbnBmuCZDFgoJdRA9xhauOeF0Ht0qiU/AzfiuiJVeDeDs+uGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:58:42.907665Z"},"content_sha256":"41af5074fb28f91ec8b7974e36a462b436fc7c46a5ef76dc7e1bd818a1733345","schema_version":"1.0","event_id":"sha256:41af5074fb28f91ec8b7974e36a462b436fc7c46a5ef76dc7e1bd818a1733345"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AKHPIQPCAVPTGUKLFMNDYC36WQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Crowdsourced Task Routing via Matrix Factorization","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CY","authors_text":"Hyun Joon Jung, Matthew Lease","submitted_at":"2013-10-18T14:37:24Z","abstract_excerpt":"We describe methods to predict a crowd worker's accuracy on new tasks based on his accuracy on past tasks. Such prediction provides a foundation for identifying the best workers to route work to in order to maximize accuracy on the new task. Our key insight is to model similarity of past tasks to the target task such that past task accuracies can be optimally integrated to predict target task accuracy. We describe two matrix factorization (MF) approaches from collaborative filtering which not only exploit such task similarity, but are known to be robust to sparse data. Experiments on synthetic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5142","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-18T03:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qpeewt+cIootUOcqqd7qAY70AQsxpjf4hD3Rc8WSq2qnDaVaBcd4C/cBGAsl7yq9n/bfdzI4XxpPprMcKyHACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:58:42.908006Z"},"content_sha256":"8b4b51a9522ae2e5e006116d515630d6403a9446d61a6b6e5ac82979c66ce5fd","schema_version":"1.0","event_id":"sha256:8b4b51a9522ae2e5e006116d515630d6403a9446d61a6b6e5ac82979c66ce5fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKHPIQPCAVPTGUKLFMNDYC36WQ/bundle.json","state_url":"https://pith.science/pith/AKHPIQPCAVPTGUKLFMNDYC36WQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKHPIQPCAVPTGUKLFMNDYC36WQ/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-07T06:58:42Z","links":{"resolver":"https://pith.science/pith/AKHPIQPCAVPTGUKLFMNDYC36WQ","bundle":"https://pith.science/pith/AKHPIQPCAVPTGUKLFMNDYC36WQ/bundle.json","state":"https://pith.science/pith/AKHPIQPCAVPTGUKLFMNDYC36WQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKHPIQPCAVPTGUKLFMNDYC36WQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AKHPIQPCAVPTGUKLFMNDYC36WQ","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":"a23b9414078bdf497eb373520b8da432d6830985a8e86128d53376dce600940a","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CY","submitted_at":"2013-10-18T14:37:24Z","title_canon_sha256":"9c37b1994db90f45419da99bbc773c0b5c7d4915d05a6ab13d9304a0ffdaefdd"},"schema_version":"1.0","source":{"id":"1310.5142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5142","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5142v1","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5142","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"AKHPIQPCAVPT","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AKHPIQPCAVPTGUKL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AKHPIQPC","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:8b4b51a9522ae2e5e006116d515630d6403a9446d61a6b6e5ac82979c66ce5fd","target":"graph","created_at":"2026-05-18T03:09:47Z","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":"We describe methods to predict a crowd worker's accuracy on new tasks based on his accuracy on past tasks. Such prediction provides a foundation for identifying the best workers to route work to in order to maximize accuracy on the new task. Our key insight is to model similarity of past tasks to the target task such that past task accuracies can be optimally integrated to predict target task accuracy. We describe two matrix factorization (MF) approaches from collaborative filtering which not only exploit such task similarity, but are known to be robust to sparse data. Experiments on synthetic","authors_text":"Hyun Joon Jung, Matthew Lease","cross_cats":["cs.IR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CY","submitted_at":"2013-10-18T14:37:24Z","title":"Crowdsourced Task Routing via Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5142","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:41af5074fb28f91ec8b7974e36a462b436fc7c46a5ef76dc7e1bd818a1733345","target":"record","created_at":"2026-05-18T03:09:47Z","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":"a23b9414078bdf497eb373520b8da432d6830985a8e86128d53376dce600940a","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CY","submitted_at":"2013-10-18T14:37:24Z","title_canon_sha256":"9c37b1994db90f45419da99bbc773c0b5c7d4915d05a6ab13d9304a0ffdaefdd"},"schema_version":"1.0","source":{"id":"1310.5142","kind":"arxiv","version":1}},"canonical_sha256":"028ef441e2055f33514b2b1a3c0b7eb41a408f50a1e87e659af096628f996009","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"028ef441e2055f33514b2b1a3c0b7eb41a408f50a1e87e659af096628f996009","first_computed_at":"2026-05-18T03:09:47.124748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:47.124748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHIS7mJeTVpiyOfKQbufmspLN1Sb5xgZmNTzZpvQ6EtgTM66HKsSpu3J03AuZ3HUZtqAsv6csD+YpAY3tx93DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:47.125432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41af5074fb28f91ec8b7974e36a462b436fc7c46a5ef76dc7e1bd818a1733345","sha256:8b4b51a9522ae2e5e006116d515630d6403a9446d61a6b6e5ac82979c66ce5fd"],"state_sha256":"8df515664c209c5fca04f7a6ee67d35c37ba8677f4096fef5664fa5eba2697ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ft/HuDPoQSAO3SkQaV9BQ1InwXa6mmLHLIgbAAAUGItWQnH+TTshcrHjQVerpfGIJRoiYKWnUO5knOtQaOdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:58:42.909938Z","bundle_sha256":"e9a9d4a0751b697eedab3f215b9551ec57cfb9cbce72f7245995d2d902ab31ef"}}