{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XHZCDK33576MTXRSMKBHRFYV4I","short_pith_number":"pith:XHZCDK33","schema_version":"1.0","canonical_sha256":"b9f221ab7beffcc9de326282789715e234baee222eac63be8640013ddf97a3f3","source":{"kind":"arxiv","id":"1805.02851","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.02851","created_at":"2026-05-18T00:03:56.007461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02851v2","created_at":"2026-05-18T00:03:56.007461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02851","created_at":"2026-05-18T00:03:56.007461+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHZCDK33576M","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHZCDK33576MTXRS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHZCDK33","created_at":"2026-05-18T12:33:01.666342+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/XHZCDK33576MTXRSMKBHRFYV4I","json":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I.json","graph_json":"https://pith.science/api/pith-number/XHZCDK33576MTXRSMKBHRFYV4I/graph.json","events_json":"https://pith.science/api/pith-number/XHZCDK33576MTXRSMKBHRFYV4I/events.json","paper":"https://pith.science/paper/XHZCDK33"},"agent_actions":{"view_html":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I","download_json":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I.json","view_paper":"https://pith.science/paper/XHZCDK33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02851&json=true","fetch_graph":"https://pith.science/api/pith-number/XHZCDK33576MTXRSMKBHRFYV4I/graph.json","fetch_events":"https://pith.science/api/pith-number/XHZCDK33576MTXRSMKBHRFYV4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/action/storage_attestation","attest_author":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/action/author_attestation","sign_citation":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/action/citation_signature","submit_replication":"https://pith.science/pith/XHZCDK33576MTXRSMKBHRFYV4I/action/replication_record"}},"created_at":"2026-05-18T00:03:56.007461+00:00","updated_at":"2026-05-18T00:03:56.007461+00:00"}