{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WGJN5TB3567VRBGPRU5BAVERQP","short_pith_number":"pith:WGJN5TB3","schema_version":"1.0","canonical_sha256":"b192decc3befbf5884cf8d3a10549183d3d599731f697aae764b9ae2fc0f1552","source":{"kind":"arxiv","id":"2007.03069","version":5},"attestation_state":"computed","paper":{"title":"Outcome-Driven Dynamic Refugee Assignment with Allocation Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","stat.ME"],"primary_cat":"math.OC","authors_text":"Elisabeth Paulson, Kirk Bansak","submitted_at":"2020-07-02T21:28:15Z","abstract_excerpt":"This study proposes two new dynamic assignment algorithms to match refugees and asylum seekers to geographic localities within a host country. The first, currently implemented in a multi-year randomized control trial in Switzerland, seeks to maximize the average predicted employment level (or any measured outcome of interest) of refugees through a minimum-discord online assignment algorithm. The performance of this algorithm is tested on real refugee resettlement data from both the US and Switzerland, where we find that it is able to achieve near-optimal expected employment compared to the hin"},"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":"2007.03069","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-02T21:28:15Z","cross_cats_sorted":["cs.GT","cs.LG","stat.ME"],"title_canon_sha256":"5e44f7aeaae6ce308c795177ea185fb6c52c8887ee0ff64928f480894da6b552","abstract_canon_sha256":"8cf6586ab414b7226ee35a3ac9044418671fa6306d654993337542e46287ec31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:54.199102Z","signature_b64":"FynkGTRyldrzrtAPmqmiJE33x+oEzP3gXQQnXM3jUOJNCQ7O/CNYHIG3VmSLk8fsoBNdyleGhH84WssU+3tRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b192decc3befbf5884cf8d3a10549183d3d599731f697aae764b9ae2fc0f1552","last_reissued_at":"2026-07-05T08:22:54.198648Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:54.198648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Outcome-Driven Dynamic Refugee Assignment with Allocation Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","stat.ME"],"primary_cat":"math.OC","authors_text":"Elisabeth Paulson, Kirk Bansak","submitted_at":"2020-07-02T21:28:15Z","abstract_excerpt":"This study proposes two new dynamic assignment algorithms to match refugees and asylum seekers to geographic localities within a host country. The first, currently implemented in a multi-year randomized control trial in Switzerland, seeks to maximize the average predicted employment level (or any measured outcome of interest) of refugees through a minimum-discord online assignment algorithm. The performance of this algorithm is tested on real refugee resettlement data from both the US and Switzerland, where we find that it is able to achieve near-optimal expected employment compared to the hin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03069","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.03069/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.03069","created_at":"2026-07-05T08:22:54.198706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03069v5","created_at":"2026-07-05T08:22:54.198706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03069","created_at":"2026-07-05T08:22:54.198706+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGJN5TB3567V","created_at":"2026-07-05T08:22:54.198706+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGJN5TB3567VRBGP","created_at":"2026-07-05T08:22:54.198706+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGJN5TB3","created_at":"2026-07-05T08:22:54.198706+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04669","citing_title":"Differentiating Through Dual Prices: End-to-End Policy Learning Under Capacity Constraints","ref_index":2021,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP","json":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP.json","graph_json":"https://pith.science/api/pith-number/WGJN5TB3567VRBGPRU5BAVERQP/graph.json","events_json":"https://pith.science/api/pith-number/WGJN5TB3567VRBGPRU5BAVERQP/events.json","paper":"https://pith.science/paper/WGJN5TB3"},"agent_actions":{"view_html":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP","download_json":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP.json","view_paper":"https://pith.science/paper/WGJN5TB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03069&json=true","fetch_graph":"https://pith.science/api/pith-number/WGJN5TB3567VRBGPRU5BAVERQP/graph.json","fetch_events":"https://pith.science/api/pith-number/WGJN5TB3567VRBGPRU5BAVERQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP/action/storage_attestation","attest_author":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP/action/author_attestation","sign_citation":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP/action/citation_signature","submit_replication":"https://pith.science/pith/WGJN5TB3567VRBGPRU5BAVERQP/action/replication_record"}},"created_at":"2026-07-05T08:22:54.198706+00:00","updated_at":"2026-07-05T08:22:54.198706+00:00"}