{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NVXCRUSMX2QSPNETYFGHJI2OAS","short_pith_number":"pith:NVXCRUSM","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"},"canonical_sha256":"6d6e28d24cbea127b493c14c74a34e0489a1a3aded8bce025938c7760179916a","source":{"kind":"arxiv","id":"1010.2312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2312","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2312v2","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2312","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"NVXCRUSMX2QS","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NVXCRUSMX2QSPNET","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NVXCRUSM","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NVXCRUSMX2QSPNETYFGHJI2OAS","target":"record","payload":{"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"},"canonical_sha256":"6d6e28d24cbea127b493c14c74a34e0489a1a3aded8bce025938c7760179916a","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"},"source_kind":"arxiv","source_id":"1010.2312","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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CEYsVOxS8sNlIT68iW+IFxQUKfrgq1lIb/+1AGDjYOgL8y5N0O7hmKb2Jit6PQivaLL9dCnovT4lIg4JGZbbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:15:30.119373Z"},"content_sha256":"0b9611a721c6e69fb84d82258f360aa4037a85ceacdb2a7cd37667fb93c7c428","schema_version":"1.0","event_id":"sha256:0b9611a721c6e69fb84d82258f360aa4037a85ceacdb2a7cd37667fb93c7c428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NVXCRUSMX2QSPNETYFGHJI2OAS","target":"graph","payload":{"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"},"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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ccyUSMTFjq7tnZSP6ou9J0hnCNfFiipR8HXOQm4VLD/tmDdLdRXm68uSC41WGYJNxp6rhK18Os5oJVP3dAiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:15:30.119720Z"},"content_sha256":"19c3ac807e5ae524b5cb318aeb0769af2e499ed2f7f4acb9814e6efe938ceb37","schema_version":"1.0","event_id":"sha256:19c3ac807e5ae524b5cb318aeb0769af2e499ed2f7f4acb9814e6efe938ceb37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/bundle.json","state_url":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/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-06-29T15:15:30Z","links":{"resolver":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS","bundle":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/bundle.json","state":"https://pith.science/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVXCRUSMX2QSPNETYFGHJI2OAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NVXCRUSMX2QSPNETYFGHJI2OAS","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":"de8eacb552514d0845b36c81498710d57dd586ff2c4e413dbbe9ac59dad1193a","cross_cats_sorted":["cs.GT","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-12T07:33:15Z","title_canon_sha256":"ab9dd3ad7dfb6e95eaa2418273c967ed246d17946b6ea419d5b2320ed6652da7"},"schema_version":"1.0","source":{"id":"1010.2312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2312","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2312v2","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2312","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"NVXCRUSMX2QS","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NVXCRUSMX2QSPNET","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NVXCRUSM","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:19c3ac807e5ae524b5cb318aeb0769af2e499ed2f7f4acb9814e6efe938ceb37","target":"graph","created_at":"2026-05-18T03:27:02Z","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":"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.","authors_text":"Adam Azzam, Chaya Coppersmith, Gizem Karaali, Julie Glass, Sinan Aksoy, Xinjing Zhu, Xueying Zhao","cross_cats":["cs.GT","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-12T07:33:15Z","title":"A Cost-Minimizing Algorithm for School Choice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2312","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:0b9611a721c6e69fb84d82258f360aa4037a85ceacdb2a7cd37667fb93c7c428","target":"record","created_at":"2026-05-18T03:27:02Z","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":"de8eacb552514d0845b36c81498710d57dd586ff2c4e413dbbe9ac59dad1193a","cross_cats_sorted":["cs.GT","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-12T07:33:15Z","title_canon_sha256":"ab9dd3ad7dfb6e95eaa2418273c967ed246d17946b6ea419d5b2320ed6652da7"},"schema_version":"1.0","source":{"id":"1010.2312","kind":"arxiv","version":2}},"canonical_sha256":"6d6e28d24cbea127b493c14c74a34e0489a1a3aded8bce025938c7760179916a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d6e28d24cbea127b493c14c74a34e0489a1a3aded8bce025938c7760179916a","first_computed_at":"2026-05-18T03:27:02.014097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:02.014097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rnmbLlrD3hlr+YwDxA+s8s6XqLIg+r5fuoTmWLTDOgNDPgSU/FZSbirVO1LreI/T7IaSJpx7vhLQX70c5s58BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:02.014671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b9611a721c6e69fb84d82258f360aa4037a85ceacdb2a7cd37667fb93c7c428","sha256:19c3ac807e5ae524b5cb318aeb0769af2e499ed2f7f4acb9814e6efe938ceb37"],"state_sha256":"d32a94c3274ce97f4fb8ecc1d7e858467865dfa5e883fa13d461f16a3e43769c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcTu33brrTrpCHonAwNdqLAlWyiC5gRDDgpXl4UtgJA2WhJZpooRs0xZgl9BAUxfABhef/MQClgl0hGWQWGJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:15:30.121556Z","bundle_sha256":"6fc5992fe31f9efcbc54b531bdb5b6bc93ae7a8631e15673db69eb35469c50f5"}}