{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IGRMQ2A5WAW254YHJHVHJMJDZR","short_pith_number":"pith:IGRMQ2A5","schema_version":"1.0","canonical_sha256":"41a2c8681db02daef30749ea74b123cc7c0109a0055eaea1175ba33feeb8470c","source":{"kind":"arxiv","id":"2110.00734","version":5},"attestation_state":"computed","paper":{"title":"Capacity Planning in Stable Matching","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.GT","authors_text":"Alfredo Torrico, Andrea Lodi, Federico Bobbio, Ignacio Rios, Margarida Carvalho","submitted_at":"2021-10-02T05:57:44Z","abstract_excerpt":"Motivated by the shortage of seats that the Chilean school choice system is facing, we introduce the problem of jointly increasing school capacities and finding a student-optimal assignment in the expanded market. Due to the theoretical and practical complexity of the problem, we provide a comprehensive set of tools to solve the problem, including different mathematical programming formulations, a cutting plane algorithm, and two heuristics that allow obtaining near-optimal solutions quickly. On the theoretical side, we show the correctness of our formulations, different properties of the obje"},"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":"2110.00734","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2021-10-02T05:57:44Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"0693921749757e31978b80628578c66b8a2c50293b4ad5eb3666ef293017f41f","abstract_canon_sha256":"7af008341bd708707d9a4d2cea870bd36f1e2bf41e3d8a4df60985cc773d4e8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:13.701167Z","signature_b64":"ofFl7nGdUt8yLlMl3FJ8sUC2nd8mI+fut6e4A5n4ExrzjI5TH8U6SKW2UmRwJZ2GUu8BuLQNMxh8A/I4lEWhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41a2c8681db02daef30749ea74b123cc7c0109a0055eaea1175ba33feeb8470c","last_reissued_at":"2026-07-05T08:53:13.700760Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:13.700760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity Planning in Stable Matching","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.GT","authors_text":"Alfredo Torrico, Andrea Lodi, Federico Bobbio, Ignacio Rios, Margarida Carvalho","submitted_at":"2021-10-02T05:57:44Z","abstract_excerpt":"Motivated by the shortage of seats that the Chilean school choice system is facing, we introduce the problem of jointly increasing school capacities and finding a student-optimal assignment in the expanded market. Due to the theoretical and practical complexity of the problem, we provide a comprehensive set of tools to solve the problem, including different mathematical programming formulations, a cutting plane algorithm, and two heuristics that allow obtaining near-optimal solutions quickly. On the theoretical side, we show the correctness of our formulations, different properties of the obje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.00734","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/2110.00734/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":"2110.00734","created_at":"2026-07-05T08:53:13.700819+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.00734v5","created_at":"2026-07-05T08:53:13.700819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.00734","created_at":"2026-07-05T08:53:13.700819+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGRMQ2A5WAW2","created_at":"2026-07-05T08:53:13.700819+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGRMQ2A5WAW254YH","created_at":"2026-07-05T08:53:13.700819+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGRMQ2A5","created_at":"2026-07-05T08:53:13.700819+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.12549","citing_title":"Group Fair Matchings using Convex Cost Functions","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR","json":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR.json","graph_json":"https://pith.science/api/pith-number/IGRMQ2A5WAW254YHJHVHJMJDZR/graph.json","events_json":"https://pith.science/api/pith-number/IGRMQ2A5WAW254YHJHVHJMJDZR/events.json","paper":"https://pith.science/paper/IGRMQ2A5"},"agent_actions":{"view_html":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR","download_json":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR.json","view_paper":"https://pith.science/paper/IGRMQ2A5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.00734&json=true","fetch_graph":"https://pith.science/api/pith-number/IGRMQ2A5WAW254YHJHVHJMJDZR/graph.json","fetch_events":"https://pith.science/api/pith-number/IGRMQ2A5WAW254YHJHVHJMJDZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR/action/storage_attestation","attest_author":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR/action/author_attestation","sign_citation":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR/action/citation_signature","submit_replication":"https://pith.science/pith/IGRMQ2A5WAW254YHJHVHJMJDZR/action/replication_record"}},"created_at":"2026-07-05T08:53:13.700819+00:00","updated_at":"2026-07-05T08:53:13.700819+00:00"}