{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2X3XVKZWC7GR4JLNB55VPWRF6G","short_pith_number":"pith:2X3XVKZW","schema_version":"1.0","canonical_sha256":"d5f77aab3617cd1e256d0f7b57da25f181195acdd0b10dedb11a63896bba9347","source":{"kind":"arxiv","id":"2110.02555","version":1},"attestation_state":"computed","paper":{"title":"Profile-based optimal stable matchings in the Roommates problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Manlove, Sofia Simola","submitted_at":"2021-10-06T07:54:53Z","abstract_excerpt":"The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard.\n  We show that the problem of finding generous or rank-maximal stable matchings in an instance of the roommates problem with incomplete lists is NP-hard even when the preference lists are at most length 3. We show that just maximising the number of first choices or minimising the number of last choices is NP-hard with the short preference lists.\n  We show that the number of $R^{th}$ choices, where $R$ is the minimum-regr"},"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":"2110.02555","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-10-06T07:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"0c667d664c5644655a5798c576ca1d705d0d147c19ec4b233ce8effc95b787f8","abstract_canon_sha256":"e2b8a80b46c9b1f7b5ebda207a864f8016c69cc96b01a55f2b5daff1e891b4cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:27.648638Z","signature_b64":"23xeuJrHLSQ5EIbR369z7hEVDZkIbNeNrWrAZDqNQ7Qz8bmNB7hJL2R2ZSfy28y+Vd7JSaaiH9QCvVxGTu0iAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f77aab3617cd1e256d0f7b57da25f181195acdd0b10dedb11a63896bba9347","last_reissued_at":"2026-07-05T03:20:27.648256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:27.648256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Profile-based optimal stable matchings in the Roommates problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Manlove, Sofia Simola","submitted_at":"2021-10-06T07:54:53Z","abstract_excerpt":"The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard.\n  We show that the problem of finding generous or rank-maximal stable matchings in an instance of the roommates problem with incomplete lists is NP-hard even when the preference lists are at most length 3. We show that just maximising the number of first choices or minimising the number of last choices is NP-hard with the short preference lists.\n  We show that the number of $R^{th}$ choices, where $R$ is the minimum-regr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02555","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.02555/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.02555","created_at":"2026-07-05T03:20:27.648320+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.02555v1","created_at":"2026-07-05T03:20:27.648320+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02555","created_at":"2026-07-05T03:20:27.648320+00:00"},{"alias_kind":"pith_short_12","alias_value":"2X3XVKZWC7GR","created_at":"2026-07-05T03:20:27.648320+00:00"},{"alias_kind":"pith_short_16","alias_value":"2X3XVKZWC7GR4JLN","created_at":"2026-07-05T03:20:27.648320+00:00"},{"alias_kind":"pith_short_8","alias_value":"2X3XVKZW","created_at":"2026-07-05T03:20:27.648320+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.06717","citing_title":"Perspectives on Unsolvability in the Roommates Problem","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G","json":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G.json","graph_json":"https://pith.science/api/pith-number/2X3XVKZWC7GR4JLNB55VPWRF6G/graph.json","events_json":"https://pith.science/api/pith-number/2X3XVKZWC7GR4JLNB55VPWRF6G/events.json","paper":"https://pith.science/paper/2X3XVKZW"},"agent_actions":{"view_html":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G","download_json":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G.json","view_paper":"https://pith.science/paper/2X3XVKZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.02555&json=true","fetch_graph":"https://pith.science/api/pith-number/2X3XVKZWC7GR4JLNB55VPWRF6G/graph.json","fetch_events":"https://pith.science/api/pith-number/2X3XVKZWC7GR4JLNB55VPWRF6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/action/storage_attestation","attest_author":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/action/author_attestation","sign_citation":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/action/citation_signature","submit_replication":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/action/replication_record"}},"created_at":"2026-07-05T03:20:27.648320+00:00","updated_at":"2026-07-05T03:20:27.648320+00:00"}