{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CMKEKGKLZJXTQ674XSC6CB75KK","short_pith_number":"pith:CMKEKGKL","schema_version":"1.0","canonical_sha256":"131445194bca6f387bfcbc85e107fd5291d97210c5aebd86660a41695253554d","source":{"kind":"arxiv","id":"1704.07546","version":2},"attestation_state":"computed","paper":{"title":"Popular Matching with Lower Quotas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meghana Nasre, Prajakta Nimbhorkar","submitted_at":"2017-04-25T06:10:54Z","abstract_excerpt":"We consider the well-studied Hospital Residents (HR) problem in the presence of lower quotas (LQ). The input instance consists of a bipartite graph $G = (\\mathcal{R} \\cup \\mathcal{H}, E)$ where $\\mathcal{R}$ and $\\mathcal{H}$ denote sets of residents and hospitals respectively. Every vertex has a preference list that imposes a strict ordering on its neighbors. In addition, each hospital $h$ has an associated upper-quota $q^+(h)$ and lower-quota $q^-(h)$. A matching $M$ in $G$ is an assignment of residents to hospitals, and $M$ is said to be feasible if every resident is assigned to at most one"},"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":"1704.07546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-25T06:10:54Z","cross_cats_sorted":[],"title_canon_sha256":"5677f50528f1e58c7ab1361818446711429e86d4f7df056dc27d25ab84db5137","abstract_canon_sha256":"8729ecaf6181cdd13dc05b81659b155175fc06f88c771ffe273d057b6ec33d5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:31.771452Z","signature_b64":"Qjd7okA1aYUYTp84WmqdK3cUGRTsGVjvcmQFWq5PsdNy0vSc5ijP/NCc8kigiARITf8jIAcJ9dzuZtKgJBj5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"131445194bca6f387bfcbc85e107fd5291d97210c5aebd86660a41695253554d","last_reissued_at":"2026-05-18T00:45:31.771019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:31.771019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Popular Matching with Lower Quotas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meghana Nasre, Prajakta Nimbhorkar","submitted_at":"2017-04-25T06:10:54Z","abstract_excerpt":"We consider the well-studied Hospital Residents (HR) problem in the presence of lower quotas (LQ). The input instance consists of a bipartite graph $G = (\\mathcal{R} \\cup \\mathcal{H}, E)$ where $\\mathcal{R}$ and $\\mathcal{H}$ denote sets of residents and hospitals respectively. Every vertex has a preference list that imposes a strict ordering on its neighbors. In addition, each hospital $h$ has an associated upper-quota $q^+(h)$ and lower-quota $q^-(h)$. A matching $M$ in $G$ is an assignment of residents to hospitals, and $M$ is said to be feasible if every resident is assigned to at most one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07546","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":"1704.07546","created_at":"2026-05-18T00:45:31.771092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07546v2","created_at":"2026-05-18T00:45:31.771092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07546","created_at":"2026-05-18T00:45:31.771092+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMKEKGKLZJXT","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMKEKGKLZJXTQ674","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMKEKGKL","created_at":"2026-05-18T12:31:10.602751+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/CMKEKGKLZJXTQ674XSC6CB75KK","json":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK.json","graph_json":"https://pith.science/api/pith-number/CMKEKGKLZJXTQ674XSC6CB75KK/graph.json","events_json":"https://pith.science/api/pith-number/CMKEKGKLZJXTQ674XSC6CB75KK/events.json","paper":"https://pith.science/paper/CMKEKGKL"},"agent_actions":{"view_html":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK","download_json":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK.json","view_paper":"https://pith.science/paper/CMKEKGKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07546&json=true","fetch_graph":"https://pith.science/api/pith-number/CMKEKGKLZJXTQ674XSC6CB75KK/graph.json","fetch_events":"https://pith.science/api/pith-number/CMKEKGKLZJXTQ674XSC6CB75KK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK/action/storage_attestation","attest_author":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK/action/author_attestation","sign_citation":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK/action/citation_signature","submit_replication":"https://pith.science/pith/CMKEKGKLZJXTQ674XSC6CB75KK/action/replication_record"}},"created_at":"2026-05-18T00:45:31.771092+00:00","updated_at":"2026-05-18T00:45:31.771092+00:00"}