{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NVXCRUSMX2QSPNETYFGHJI2OAS","short_pith_number":"pith:NVXCRUSM","schema_version":"1.0","canonical_sha256":"6d6e28d24cbea127b493c14c74a34e0489a1a3aded8bce025938c7760179916a","source":{"kind":"arxiv","id":"1010.2312","version":2},"attestation_state":"computed","paper":{"title":"A Cost-Minimizing Algorithm for School Choice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.CO"],"primary_cat":"math.OC","authors_text":"Adam Azzam, Chaya Coppersmith, Gizem Karaali, Julie Glass, Sinan Aksoy, Xinjing Zhu, Xueying Zhao","submitted_at":"2010-10-12T07:33:15Z","abstract_excerpt":"The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. In this note we define a simple student-optimal criterion that is not met by any previously employed mechanism in the school choice literature. We then use this criterion to adapt a well-known combinatorial optimization technique (Hungarian algorithm) to the school choice problem."},"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":"1010.2312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-12T07:33:15Z","cross_cats_sorted":["cs.GT","math.CO"],"title_canon_sha256":"ab9dd3ad7dfb6e95eaa2418273c967ed246d17946b6ea419d5b2320ed6652da7","abstract_canon_sha256":"de8eacb552514d0845b36c81498710d57dd586ff2c4e413dbbe9ac59dad1193a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.014671Z","signature_b64":"rnmbLlrD3hlr+YwDxA+s8s6XqLIg+r5fuoTmWLTDOgNDPgSU/FZSbirVO1LreI/T7IaSJpx7vhLQX70c5s58BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d6e28d24cbea127b493c14c74a34e0489a1a3aded8bce025938c7760179916a","last_reissued_at":"2026-05-18T03:27:02.014097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.014097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cost-Minimizing Algorithm for School Choice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.CO"],"primary_cat":"math.OC","authors_text":"Adam Azzam, Chaya Coppersmith, Gizem Karaali, Julie Glass, Sinan Aksoy, Xinjing Zhu, Xueying Zhao","submitted_at":"2010-10-12T07:33:15Z","abstract_excerpt":"The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. In this note we define a simple student-optimal criterion that is not met by any previously employed mechanism in the school choice literature. We then use this criterion to adapt a well-known combinatorial optimization technique (Hungarian algorithm) to the school choice problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2312","kind":"arxiv","version":2},"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":"1010.2312","created_at":"2026-05-18T03:27:02.014184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2312v2","created_at":"2026-05-18T03:27:02.014184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2312","created_at":"2026-05-18T03:27:02.014184+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVXCRUSMX2QS","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVXCRUSMX2QSPNET","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVXCRUSM","created_at":"2026-05-18T12:26:10.704358+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/NVXCRUSMX2QSPNETYFGHJI2OAS","json":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS.json","graph_json":"https://pith.science/api/pith-number/NVXCRUSMX2QSPNETYFGHJI2OAS/graph.json","events_json":"https://pith.science/api/pith-number/NVXCRUSMX2QSPNETYFGHJI2OAS/events.json","paper":"https://pith.science/paper/NVXCRUSM"},"agent_actions":{"view_html":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS","download_json":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS.json","view_paper":"https://pith.science/paper/NVXCRUSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2312&json=true","fetch_graph":"https://pith.science/api/pith-number/NVXCRUSMX2QSPNETYFGHJI2OAS/graph.json","fetch_events":"https://pith.science/api/pith-number/NVXCRUSMX2QSPNETYFGHJI2OAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/action/storage_attestation","attest_author":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/action/author_attestation","sign_citation":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/action/citation_signature","submit_replication":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/action/replication_record"}},"created_at":"2026-05-18T03:27:02.014184+00:00","updated_at":"2026-05-18T03:27:02.014184+00:00"}