{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6RYYFAQTD6AOSQZVKIJ6PN2KZN","short_pith_number":"pith:6RYYFAQT","schema_version":"1.0","canonical_sha256":"f4718282131f80e943355213e7b74acb5750594fecb4b08b581899ad1da1c491","source":{"kind":"arxiv","id":"1904.04431","version":6},"attestation_state":"computed","paper":{"title":"Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"James Liu, Karthik Gajulapalli, Tung Mai, Vijay V. Vazirani","submitted_at":"2019-04-09T02:41:34Z","abstract_excerpt":"We address the following dynamic version of the school choice question: a city, named City, admits students in two temporally-separated rounds, denoted $\\mathcal{R}_1$ and $\\mathcal{R}_2$. In round $\\mathcal{R}_1$, the capacity of each school is fixed and mechanism $\\mathcal{M}_1$ finds a student optimal stable matching. In round $\\mathcal{R}_2$, certain parameters change, e.g., new students move into the City or the City is happy to allocate extra seats to specific schools. We study a number of Settings of this kind and give polynomial time algorithms for obtaining a stable matching for the n"},"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":"1904.04431","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-09T02:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"7c5d676341822d51a661b749132b26ef19c834fa4905b05910641da054c90368","abstract_canon_sha256":"31d4c973e85ed58efd1578543e7fbc0acb684c19698eb3ddc9ba50ce080e60a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:33.862912Z","signature_b64":"Ck/FrQ5G9dJKv+uMaLbq1thAx++tDKaf/C2IojV+YTLPrTDRpmA8BGD5Xhzv3lq2DmZ4GDBDVWW38YiL/kG3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4718282131f80e943355213e7b74acb5750594fecb4b08b581899ad1da1c491","last_reissued_at":"2026-07-05T01:21:33.862446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:33.862446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"James Liu, Karthik Gajulapalli, Tung Mai, Vijay V. Vazirani","submitted_at":"2019-04-09T02:41:34Z","abstract_excerpt":"We address the following dynamic version of the school choice question: a city, named City, admits students in two temporally-separated rounds, denoted $\\mathcal{R}_1$ and $\\mathcal{R}_2$. In round $\\mathcal{R}_1$, the capacity of each school is fixed and mechanism $\\mathcal{M}_1$ finds a student optimal stable matching. In round $\\mathcal{R}_2$, certain parameters change, e.g., new students move into the City or the City is happy to allocate extra seats to specific schools. We study a number of Settings of this kind and give polynomial time algorithms for obtaining a stable matching for the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04431","kind":"arxiv","version":6},"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/1904.04431/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":"1904.04431","created_at":"2026-07-05T01:21:33.862500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04431v6","created_at":"2026-07-05T01:21:33.862500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04431","created_at":"2026-07-05T01:21:33.862500+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RYYFAQTD6AO","created_at":"2026-07-05T01:21:33.862500+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RYYFAQTD6AOSQZV","created_at":"2026-07-05T01:21:33.862500+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RYYFAQT","created_at":"2026-07-05T01:21:33.862500+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/6RYYFAQTD6AOSQZVKIJ6PN2KZN","json":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN.json","graph_json":"https://pith.science/api/pith-number/6RYYFAQTD6AOSQZVKIJ6PN2KZN/graph.json","events_json":"https://pith.science/api/pith-number/6RYYFAQTD6AOSQZVKIJ6PN2KZN/events.json","paper":"https://pith.science/paper/6RYYFAQT"},"agent_actions":{"view_html":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN","download_json":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN.json","view_paper":"https://pith.science/paper/6RYYFAQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04431&json=true","fetch_graph":"https://pith.science/api/pith-number/6RYYFAQTD6AOSQZVKIJ6PN2KZN/graph.json","fetch_events":"https://pith.science/api/pith-number/6RYYFAQTD6AOSQZVKIJ6PN2KZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN/action/storage_attestation","attest_author":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN/action/author_attestation","sign_citation":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN/action/citation_signature","submit_replication":"https://pith.science/pith/6RYYFAQTD6AOSQZVKIJ6PN2KZN/action/replication_record"}},"created_at":"2026-07-05T01:21:33.862500+00:00","updated_at":"2026-07-05T01:21:33.862500+00:00"}