{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XXKFN6YIOAAQJMAGJNW73BHZZW","short_pith_number":"pith:XXKFN6YI","canonical_record":{"source":{"id":"1408.6878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-28T22:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"75e56e25eaa7886049a4287ba9f5495924081596814f1eaa1afb2256a9cb34ab","abstract_canon_sha256":"86ee8f00eb9fa944cd6fdd73666f578f5142189c40952437847a1d71e41ced78"},"schema_version":"1.0"},"canonical_sha256":"bdd456fb08700104b0064b6dfd84f9cd94ab65460d13abcc57134cc19e9250d8","source":{"kind":"arxiv","id":"1408.6878","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6878","created_at":"2026-05-18T02:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6878v2","created_at":"2026-05-18T02:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6878","created_at":"2026-05-18T02:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"XXKFN6YIOAAQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XXKFN6YIOAAQJMAG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XXKFN6YI","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XXKFN6YIOAAQJMAGJNW73BHZZW","target":"record","payload":{"canonical_record":{"source":{"id":"1408.6878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-28T22:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"75e56e25eaa7886049a4287ba9f5495924081596814f1eaa1afb2256a9cb34ab","abstract_canon_sha256":"86ee8f00eb9fa944cd6fdd73666f578f5142189c40952437847a1d71e41ced78"},"schema_version":"1.0"},"canonical_sha256":"bdd456fb08700104b0064b6dfd84f9cd94ab65460d13abcc57134cc19e9250d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:27.621775Z","signature_b64":"agJ3EEKDoPyQ6ZqamqIoTlYOJoxj5ZP38BnpNu7h0tERRlFSmZcf9fnjx9s4OAU6b0c6b6kU+4lKxn9xSJpTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdd456fb08700104b0064b6dfd84f9cd94ab65460d13abcc57134cc19e9250d8","last_reissued_at":"2026-05-18T02:43:27.621060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:27.621060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.6878","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiTx5QB4+td13BUMLOFFSs/hEbz7OJ6AKHwm9tCIQprsk/oJJ3+Jc6aNQxUpJKMLNl9HN9lBIbAPYS0MtNaVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:27:10.156080Z"},"content_sha256":"34599bf800e228e609a618fd3e81b9a19f85076744a81cd1d284e0fbae526b00","schema_version":"1.0","event_id":"sha256:34599bf800e228e609a618fd3e81b9a19f85076744a81cd1d284e0fbae526b00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XXKFN6YIOAAQJMAGJNW73BHZZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer programming methods for special college admissions problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Iain McBride, Peter Biro","submitted_at":"2014-08-28T22:56:48Z","abstract_excerpt":"We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired applications. We note that each of the latter three special feature makes the college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the application. The IP methods that we propose are not only interesting theoretically, but may also serve as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6878","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfHQuE7I/oUcxWeRZu70dCZOmovCe+tQN6mAiWoWQXMWXNOjg5vK2/cI/wxXdMNwDV6yC3naCLb5NZRIWgDkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:27:10.156902Z"},"content_sha256":"27a8b6f458b1a71dcde484f7b706e87f9067ba914edc63f83244962e19585b8b","schema_version":"1.0","event_id":"sha256:27a8b6f458b1a71dcde484f7b706e87f9067ba914edc63f83244962e19585b8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXKFN6YIOAAQJMAGJNW73BHZZW/bundle.json","state_url":"https://pith.science/pith/XXKFN6YIOAAQJMAGJNW73BHZZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXKFN6YIOAAQJMAGJNW73BHZZW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T13:27:10Z","links":{"resolver":"https://pith.science/pith/XXKFN6YIOAAQJMAGJNW73BHZZW","bundle":"https://pith.science/pith/XXKFN6YIOAAQJMAGJNW73BHZZW/bundle.json","state":"https://pith.science/pith/XXKFN6YIOAAQJMAGJNW73BHZZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXKFN6YIOAAQJMAGJNW73BHZZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XXKFN6YIOAAQJMAGJNW73BHZZW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"86ee8f00eb9fa944cd6fdd73666f578f5142189c40952437847a1d71e41ced78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-28T22:56:48Z","title_canon_sha256":"75e56e25eaa7886049a4287ba9f5495924081596814f1eaa1afb2256a9cb34ab"},"schema_version":"1.0","source":{"id":"1408.6878","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6878","created_at":"2026-05-18T02:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6878v2","created_at":"2026-05-18T02:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6878","created_at":"2026-05-18T02:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"XXKFN6YIOAAQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XXKFN6YIOAAQJMAG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XXKFN6YI","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:27a8b6f458b1a71dcde484f7b706e87f9067ba914edc63f83244962e19585b8b","target":"graph","created_at":"2026-05-18T02:43:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired applications. We note that each of the latter three special feature makes the college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the application. The IP methods that we propose are not only interesting theoretically, but may also serve as ","authors_text":"Iain McBride, Peter Biro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-28T22:56:48Z","title":"Integer programming methods for special college admissions problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6878","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:34599bf800e228e609a618fd3e81b9a19f85076744a81cd1d284e0fbae526b00","target":"record","created_at":"2026-05-18T02:43:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"86ee8f00eb9fa944cd6fdd73666f578f5142189c40952437847a1d71e41ced78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-08-28T22:56:48Z","title_canon_sha256":"75e56e25eaa7886049a4287ba9f5495924081596814f1eaa1afb2256a9cb34ab"},"schema_version":"1.0","source":{"id":"1408.6878","kind":"arxiv","version":2}},"canonical_sha256":"bdd456fb08700104b0064b6dfd84f9cd94ab65460d13abcc57134cc19e9250d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdd456fb08700104b0064b6dfd84f9cd94ab65460d13abcc57134cc19e9250d8","first_computed_at":"2026-05-18T02:43:27.621060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:27.621060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"agJ3EEKDoPyQ6ZqamqIoTlYOJoxj5ZP38BnpNu7h0tERRlFSmZcf9fnjx9s4OAU6b0c6b6kU+4lKxn9xSJpTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:27.621775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.6878","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34599bf800e228e609a618fd3e81b9a19f85076744a81cd1d284e0fbae526b00","sha256:27a8b6f458b1a71dcde484f7b706e87f9067ba914edc63f83244962e19585b8b"],"state_sha256":"4ab072ba26e49fad74e5ed6a179fbc77809101b996cd60be0e777fa10224d8bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/B4koN5cV902EAHDZcRH5E/H+46Hxuq+6QJa1dDTxvLrDchTOmGB0AcdR7E+e86uUsJhep0m35+dKBBGOdj9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:27:10.162237Z","bundle_sha256":"e487b5067aaf8f58bd3bb4c8523f5a85f119db5e27d0a1937c41f9be00f1c5d3"}}