{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YBYW7CENGZIHYJ4EEZ7LRPSSYH","short_pith_number":"pith:YBYW7CEN","schema_version":"1.0","canonical_sha256":"c0716f888d36507c2784267eb8be52c1dcb798b2a7c5edaed80d915a5a1f733d","source":{"kind":"arxiv","id":"1308.4064","version":2},"attestation_state":"computed","paper":{"title":"An Integer Programming Approach to the Hospital/Residents Problem with Ties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Augustine Kwanashie, David F. Manlove","submitted_at":"2013-08-19T15:46:38Z","abstract_excerpt":"The classical Hospitals/Residents problem (HR) models the assignment of junior doctors to hospitals based on their preferences over one another. In an instance of this problem, a stable matching M is sought which ensures that no blocking pair can exist in which a resident r and hospital h can improve relative to M by becoming assigned to each other. Such a situation is undesirable as it could naturally lead to r and h forming a private arrangement outside of the matching. The original HR model assumes that preference lists are strictly ordered. However in practice, this may be an unreasonable "},"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":"1308.4064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-19T15:46:38Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"400f5a241564a00dbfc6fc1ec196703945a6551bdeecdad1c14def9413303e42","abstract_canon_sha256":"badc870a31eb789b950f330b1ef8c98acfece804905065b15ce1aeaec495817f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.683649Z","signature_b64":"4+h/zMJyWquC7uYhRd2FfuGdg4NTZVh/2ketBqan7sPuzuIDtgQrvoT4TWlvdSGL37avzVsVgsJluBXO5UwQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0716f888d36507c2784267eb8be52c1dcb798b2a7c5edaed80d915a5a1f733d","last_reissued_at":"2026-05-18T03:15:33.682987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.682987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Integer Programming Approach to the Hospital/Residents Problem with Ties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Augustine Kwanashie, David F. Manlove","submitted_at":"2013-08-19T15:46:38Z","abstract_excerpt":"The classical Hospitals/Residents problem (HR) models the assignment of junior doctors to hospitals based on their preferences over one another. In an instance of this problem, a stable matching M is sought which ensures that no blocking pair can exist in which a resident r and hospital h can improve relative to M by becoming assigned to each other. Such a situation is undesirable as it could naturally lead to r and h forming a private arrangement outside of the matching. The original HR model assumes that preference lists are strictly ordered. However in practice, this may be an unreasonable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4064","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":"1308.4064","created_at":"2026-05-18T03:15:33.683111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4064v2","created_at":"2026-05-18T03:15:33.683111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4064","created_at":"2026-05-18T03:15:33.683111+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBYW7CENGZIH","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBYW7CENGZIHYJ4E","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBYW7CEN","created_at":"2026-05-18T12:28:06.772260+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/YBYW7CENGZIHYJ4EEZ7LRPSSYH","json":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH.json","graph_json":"https://pith.science/api/pith-number/YBYW7CENGZIHYJ4EEZ7LRPSSYH/graph.json","events_json":"https://pith.science/api/pith-number/YBYW7CENGZIHYJ4EEZ7LRPSSYH/events.json","paper":"https://pith.science/paper/YBYW7CEN"},"agent_actions":{"view_html":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH","download_json":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH.json","view_paper":"https://pith.science/paper/YBYW7CEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4064&json=true","fetch_graph":"https://pith.science/api/pith-number/YBYW7CENGZIHYJ4EEZ7LRPSSYH/graph.json","fetch_events":"https://pith.science/api/pith-number/YBYW7CENGZIHYJ4EEZ7LRPSSYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH/action/storage_attestation","attest_author":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH/action/author_attestation","sign_citation":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH/action/citation_signature","submit_replication":"https://pith.science/pith/YBYW7CENGZIHYJ4EEZ7LRPSSYH/action/replication_record"}},"created_at":"2026-05-18T03:15:33.683111+00:00","updated_at":"2026-05-18T03:15:33.683111+00:00"}