{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GULIZDB4P5VODJRMUJZFSWOL3N","short_pith_number":"pith:GULIZDB4","schema_version":"1.0","canonical_sha256":"35168c8c3c7f6ae1a62ca2725959cbdb5d191fd6c1a27e471e7fdf0371886b90","source":{"kind":"arxiv","id":"1508.03593","version":1},"attestation_state":"computed","paper":{"title":"Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.DS","authors_text":"Justin Hsu, Sepehr Assadi, Shahin Jabbari","submitted_at":"2015-08-14T18:24:37Z","abstract_excerpt":"We investigate the problem of heterogeneous task assignment in crowdsourcing markets from the point of view of the requester, who has a collection of tasks. Workers arrive online one by one, and each declare a set of feasible tasks they can solve, and desired payment for each feasible task. The requester must decide on the fly which task (if any) to assign to the worker, while assigning workers only to feasible tasks. The goal is to maximize the number of assigned tasks with a fixed overall budget.\n  We provide an online algorithm for this problem and prove an upper bound on the competitive ra"},"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":"1508.03593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-14T18:24:37Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"df3eba854c7d7ff3e25e2f46135716914cd52c2d8e7cbb218ac4a6fbcc89ce8d","abstract_canon_sha256":"5167fcec41b85050e662afee3f1431b453194137193114c9d68d2771ef3edcbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:17.198161Z","signature_b64":"/3c/unz+LTyGFBGxXz3rCNTzGG9wLv1qW316ojU22AlTB73jmObcqEn+nhjKcWrvoGSTuNm5CDLgZ46ygdqcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35168c8c3c7f6ae1a62ca2725959cbdb5d191fd6c1a27e471e7fdf0371886b90","last_reissued_at":"2026-05-18T01:35:17.197479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:17.197479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.DS","authors_text":"Justin Hsu, Sepehr Assadi, Shahin Jabbari","submitted_at":"2015-08-14T18:24:37Z","abstract_excerpt":"We investigate the problem of heterogeneous task assignment in crowdsourcing markets from the point of view of the requester, who has a collection of tasks. Workers arrive online one by one, and each declare a set of feasible tasks they can solve, and desired payment for each feasible task. The requester must decide on the fly which task (if any) to assign to the worker, while assigning workers only to feasible tasks. The goal is to maximize the number of assigned tasks with a fixed overall budget.\n  We provide an online algorithm for this problem and prove an upper bound on the competitive ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03593","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":"1508.03593","created_at":"2026-05-18T01:35:17.197600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03593v1","created_at":"2026-05-18T01:35:17.197600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03593","created_at":"2026-05-18T01:35:17.197600+00:00"},{"alias_kind":"pith_short_12","alias_value":"GULIZDB4P5VO","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GULIZDB4P5VODJRM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GULIZDB4","created_at":"2026-05-18T12:29:22.688609+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/GULIZDB4P5VODJRMUJZFSWOL3N","json":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N.json","graph_json":"https://pith.science/api/pith-number/GULIZDB4P5VODJRMUJZFSWOL3N/graph.json","events_json":"https://pith.science/api/pith-number/GULIZDB4P5VODJRMUJZFSWOL3N/events.json","paper":"https://pith.science/paper/GULIZDB4"},"agent_actions":{"view_html":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N","download_json":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N.json","view_paper":"https://pith.science/paper/GULIZDB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03593&json=true","fetch_graph":"https://pith.science/api/pith-number/GULIZDB4P5VODJRMUJZFSWOL3N/graph.json","fetch_events":"https://pith.science/api/pith-number/GULIZDB4P5VODJRMUJZFSWOL3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N/action/storage_attestation","attest_author":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N/action/author_attestation","sign_citation":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N/action/citation_signature","submit_replication":"https://pith.science/pith/GULIZDB4P5VODJRMUJZFSWOL3N/action/replication_record"}},"created_at":"2026-05-18T01:35:17.197600+00:00","updated_at":"2026-05-18T01:35:17.197600+00:00"}