{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AF26CJ33WQP7WDBRYMMYKF4LXL","short_pith_number":"pith:AF26CJ33","schema_version":"1.0","canonical_sha256":"0175e1277bb41ffb0c31c31985178bbae4aa073a3b6cef288a45cc2414214683","source":{"kind":"arxiv","id":"1605.04609","version":3},"attestation_state":"computed","paper":{"title":"The Stable Roommates problem with short lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"\\'Agnes Cseh, David F. Manlove, Robert W. Irving","submitted_at":"2016-05-15T21:51:47Z","abstract_excerpt":"We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d=3. On the positive side we give a (2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-S"},"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":"1605.04609","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-15T21:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"bc5cc9502eaa767161d4b735aa8b51e2fecaac8007359e28103d6e119a318ced","abstract_canon_sha256":"ad2125b600e9df7a7d7d9dc1e4471c78042a9a7dddb1b2d4269392dd829d529a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:15.435565Z","signature_b64":"TnqlR3sjtcQgmKb3uUeWMv5diKg25Jp6nMifLmgCitEEhFz2dxAQgewd9F5ub0kNhUeiJvFlG9YXgTo+KZ5NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0175e1277bb41ffb0c31c31985178bbae4aa073a3b6cef288a45cc2414214683","last_reissued_at":"2026-05-18T00:36:15.435070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:15.435070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stable Roommates problem with short lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"\\'Agnes Cseh, David F. Manlove, Robert W. Irving","submitted_at":"2016-05-15T21:51:47Z","abstract_excerpt":"We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d=3. On the positive side we give a (2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04609","kind":"arxiv","version":3},"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":"1605.04609","created_at":"2026-05-18T00:36:15.435152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04609v3","created_at":"2026-05-18T00:36:15.435152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04609","created_at":"2026-05-18T00:36:15.435152+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF26CJ33WQP7","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF26CJ33WQP7WDBR","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF26CJ33","created_at":"2026-05-18T12:30:07.202191+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/AF26CJ33WQP7WDBRYMMYKF4LXL","json":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL.json","graph_json":"https://pith.science/api/pith-number/AF26CJ33WQP7WDBRYMMYKF4LXL/graph.json","events_json":"https://pith.science/api/pith-number/AF26CJ33WQP7WDBRYMMYKF4LXL/events.json","paper":"https://pith.science/paper/AF26CJ33"},"agent_actions":{"view_html":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL","download_json":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL.json","view_paper":"https://pith.science/paper/AF26CJ33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04609&json=true","fetch_graph":"https://pith.science/api/pith-number/AF26CJ33WQP7WDBRYMMYKF4LXL/graph.json","fetch_events":"https://pith.science/api/pith-number/AF26CJ33WQP7WDBRYMMYKF4LXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL/action/storage_attestation","attest_author":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL/action/author_attestation","sign_citation":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL/action/citation_signature","submit_replication":"https://pith.science/pith/AF26CJ33WQP7WDBRYMMYKF4LXL/action/replication_record"}},"created_at":"2026-05-18T00:36:15.435152+00:00","updated_at":"2026-05-18T00:36:15.435152+00:00"}