{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XOZSBA6SYLFH4O6UJYGKFGTZTX","short_pith_number":"pith:XOZSBA6S","schema_version":"1.0","canonical_sha256":"bbb32083d2c2ca7e3bd44e0ca29a799ddea1989495ed16bc328b2e33c7181974","source":{"kind":"arxiv","id":"1707.09678","version":1},"attestation_state":"computed","paper":{"title":"Learning to Match","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aristide Tossou, Christos Dimitrakakis, Philip Ekman, Sebastian Bellevik","submitted_at":"2017-07-30T21:50:50Z","abstract_excerpt":"Outsourcing tasks to previously unknown parties is becoming more common. One specific such problem involves matching a set of workers to a set of tasks. Even if the latter have precise requirements, the quality of individual workers is usually unknown. The problem is thus a version of matching under uncertainty. We believe that this type of problem is going to be increasingly important.\n  When the problem involves only a single skill or type of job, it is essentially a type of bandit problem, and can be solved with standard algorithms. However, we develop an algorithm that can perform matching"},"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":"1707.09678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-30T21:50:50Z","cross_cats_sorted":[],"title_canon_sha256":"0e0c357c6863184e78b1f33eb1d8411dd236cc7347ef456865ff1997dc9b4799","abstract_canon_sha256":"65f1d071f936d01697f8f44d1823a330342c9b28ecc4d8bec388f674a1bcc780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:10.634170Z","signature_b64":"d7ktb4L4tWUMdPHqdYuDIKNyQbhsmQPrPzV2NPy96Mk+1B/OnIjvGJtPx1smUUsEl0qUtO2BrBxdkSWRW8RDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbb32083d2c2ca7e3bd44e0ca29a799ddea1989495ed16bc328b2e33c7181974","last_reissued_at":"2026-05-18T00:39:10.633578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:10.633578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Match","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aristide Tossou, Christos Dimitrakakis, Philip Ekman, Sebastian Bellevik","submitted_at":"2017-07-30T21:50:50Z","abstract_excerpt":"Outsourcing tasks to previously unknown parties is becoming more common. One specific such problem involves matching a set of workers to a set of tasks. Even if the latter have precise requirements, the quality of individual workers is usually unknown. The problem is thus a version of matching under uncertainty. We believe that this type of problem is going to be increasingly important.\n  When the problem involves only a single skill or type of job, it is essentially a type of bandit problem, and can be solved with standard algorithms. However, we develop an algorithm that can perform matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09678","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":"1707.09678","created_at":"2026-05-18T00:39:10.633655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09678v1","created_at":"2026-05-18T00:39:10.633655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09678","created_at":"2026-05-18T00:39:10.633655+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOZSBA6SYLFH","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOZSBA6SYLFH4O6U","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOZSBA6S","created_at":"2026-05-18T12:31:56.362134+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/XOZSBA6SYLFH4O6UJYGKFGTZTX","json":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX.json","graph_json":"https://pith.science/api/pith-number/XOZSBA6SYLFH4O6UJYGKFGTZTX/graph.json","events_json":"https://pith.science/api/pith-number/XOZSBA6SYLFH4O6UJYGKFGTZTX/events.json","paper":"https://pith.science/paper/XOZSBA6S"},"agent_actions":{"view_html":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX","download_json":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX.json","view_paper":"https://pith.science/paper/XOZSBA6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09678&json=true","fetch_graph":"https://pith.science/api/pith-number/XOZSBA6SYLFH4O6UJYGKFGTZTX/graph.json","fetch_events":"https://pith.science/api/pith-number/XOZSBA6SYLFH4O6UJYGKFGTZTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX/action/storage_attestation","attest_author":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX/action/author_attestation","sign_citation":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX/action/citation_signature","submit_replication":"https://pith.science/pith/XOZSBA6SYLFH4O6UJYGKFGTZTX/action/replication_record"}},"created_at":"2026-05-18T00:39:10.633655+00:00","updated_at":"2026-05-18T00:39:10.633655+00:00"}