{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XHZCDK33576MTXRSMKBHRFYV4I","short_pith_number":"pith:XHZCDK33","canonical_record":{"source":{"id":"1805.02851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T06:16:23Z","cross_cats_sorted":[],"title_canon_sha256":"771189b92d21fa9d3ffd3f81ec550e0d597ce25036312f9cbc09f1aa4a6eccfa","abstract_canon_sha256":"5c85e99f7e1f0fc6facab05e4abfc1bae58fd40f4c873d336f1c867054bdcfbb"},"schema_version":"1.0"},"canonical_sha256":"b9f221ab7beffcc9de326282789715e234baee222eac63be8640013ddf97a3f3","source":{"kind":"arxiv","id":"1805.02851","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02851","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02851v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02851","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"XHZCDK33576M","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XHZCDK33576MTXRS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XHZCDK33","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XHZCDK33576MTXRSMKBHRFYV4I","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T06:16:23Z","cross_cats_sorted":[],"title_canon_sha256":"771189b92d21fa9d3ffd3f81ec550e0d597ce25036312f9cbc09f1aa4a6eccfa","abstract_canon_sha256":"5c85e99f7e1f0fc6facab05e4abfc1bae58fd40f4c873d336f1c867054bdcfbb"},"schema_version":"1.0"},"canonical_sha256":"b9f221ab7beffcc9de326282789715e234baee222eac63be8640013ddf97a3f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.008021Z","signature_b64":"vfPxFz3/cCFShAu6rPIrnD0GeiMfeCFYiXaVn0Do5Yr+jfYLwrvgO5zwWKnCJ7HuYI3zS6M4R06wLzYafhK2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9f221ab7beffcc9de326282789715e234baee222eac63be8640013ddf97a3f3","last_reissued_at":"2026-05-18T00:03:56.007360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.007360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02851","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/q2fn0Ci/rQhwZDg6fR4/FC/MRufNvCm2PDZqHwjB+HIyD/cS6cBXqYcXav/KjCxaIV4Mv+19kvNjfgxrauCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:27:57.235504Z"},"content_sha256":"6d7590da749d327a8b2b9b4d4ec2ab0662c7b2b080d3a87d32f7f5a1835fa9a3","schema_version":"1.0","event_id":"sha256:6d7590da749d327a8b2b9b4d4ec2ab0662c7b2b080d3a87d32f7f5a1835fa9a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XHZCDK33576MTXRSMKBHRFYV4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meghana Nasre, Nada Pulath, Prajakta Nimbhorkar","submitted_at":"2018-05-08T06:16:23Z","abstract_excerpt":"In this paper, we consider the problem of computing an optimal matching in a bipartite graph where elements of one side of the bipartition specify preferences over the other side, and one or both sides can have capacities and classifications. The input instance is a bipartite graph G=(A U P,E), where A is a set of applicants, P is a set of posts, and each applicant ranks its neighbors in an order of preference, possibly involving ties. Moreover, each vertex v in A U P has a quota q(v) denoting the maximum number of partners it can have in any allocation of applicants to posts - referred to as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02851","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lj59I3CdX+Q60mDdKnzko4tcPEr0gF1QCsPYr+rLL+1I667r23PjNajm4hbf8lo2g6oCvwLbb/gk59CzgDumBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:27:57.235857Z"},"content_sha256":"2ec4ad3486ab648204864e306f5ca866124a276566ec2c563ca3104b0d7bebe5","schema_version":"1.0","event_id":"sha256:2ec4ad3486ab648204864e306f5ca866124a276566ec2c563ca3104b0d7bebe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/bundle.json","state_url":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHZCDK33576MTXRSMKBHRFYV4I/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-24T20:27:57Z","links":{"resolver":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I","bundle":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/bundle.json","state":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHZCDK33576MTXRSMKBHRFYV4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XHZCDK33576MTXRSMKBHRFYV4I","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":"5c85e99f7e1f0fc6facab05e4abfc1bae58fd40f4c873d336f1c867054bdcfbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T06:16:23Z","title_canon_sha256":"771189b92d21fa9d3ffd3f81ec550e0d597ce25036312f9cbc09f1aa4a6eccfa"},"schema_version":"1.0","source":{"id":"1805.02851","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02851","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02851v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02851","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"XHZCDK33576M","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XHZCDK33576MTXRS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XHZCDK33","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:2ec4ad3486ab648204864e306f5ca866124a276566ec2c563ca3104b0d7bebe5","target":"graph","created_at":"2026-05-18T00:03:56Z","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":"In this paper, we consider the problem of computing an optimal matching in a bipartite graph where elements of one side of the bipartition specify preferences over the other side, and one or both sides can have capacities and classifications. The input instance is a bipartite graph G=(A U P,E), where A is a set of applicants, P is a set of posts, and each applicant ranks its neighbors in an order of preference, possibly involving ties. Moreover, each vertex v in A U P has a quota q(v) denoting the maximum number of partners it can have in any allocation of applicants to posts - referred to as ","authors_text":"Meghana Nasre, Nada Pulath, Prajakta Nimbhorkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T06:16:23Z","title":"Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02851","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:6d7590da749d327a8b2b9b4d4ec2ab0662c7b2b080d3a87d32f7f5a1835fa9a3","target":"record","created_at":"2026-05-18T00:03:56Z","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":"5c85e99f7e1f0fc6facab05e4abfc1bae58fd40f4c873d336f1c867054bdcfbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T06:16:23Z","title_canon_sha256":"771189b92d21fa9d3ffd3f81ec550e0d597ce25036312f9cbc09f1aa4a6eccfa"},"schema_version":"1.0","source":{"id":"1805.02851","kind":"arxiv","version":2}},"canonical_sha256":"b9f221ab7beffcc9de326282789715e234baee222eac63be8640013ddf97a3f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9f221ab7beffcc9de326282789715e234baee222eac63be8640013ddf97a3f3","first_computed_at":"2026-05-18T00:03:56.007360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.007360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vfPxFz3/cCFShAu6rPIrnD0GeiMfeCFYiXaVn0Do5Yr+jfYLwrvgO5zwWKnCJ7HuYI3zS6M4R06wLzYafhK2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.008021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02851","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d7590da749d327a8b2b9b4d4ec2ab0662c7b2b080d3a87d32f7f5a1835fa9a3","sha256:2ec4ad3486ab648204864e306f5ca866124a276566ec2c563ca3104b0d7bebe5"],"state_sha256":"b3c6151c5113ced65eabbfb75e62f59f65a8734e292b1de0d463c5d2b7437539"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnS6wkk321wGeX56WA+r2GvnaLiOifI1FIXqLNX3mn+hR/025pHouKmBBinlPrG6dD/zs83pKkIZ5BKcz+7FBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:27:57.237830Z","bundle_sha256":"ef6f0055045a976a1f89cd48f888db6e364f9ab0e7558fafb2225948ac5b552e"}}