{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TLJ2EMSOPPZFVXJJ6W76EWTEGQ","short_pith_number":"pith:TLJ2EMSO","schema_version":"1.0","canonical_sha256":"9ad3a2324e7bf25add29f5bfe25a64343fefe6fa72b8d1b0dd7afab514a85333","source":{"kind":"arxiv","id":"2505.06717","version":2},"attestation_state":"computed","paper":{"title":"Perspectives on Unsolvability in the Roommates Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"David Manlove, Frederik Glitzner","submitted_at":"2025-05-10T17:52:07Z","abstract_excerpt":"In the well-studied Stable Roommates problem, we seek a stable matching of agents into pairs, where no two agents prefer each other over their assigned partners. However, some instances of this problem are unsolvable, lacking any stable matching. A long-standing open question posed by Gusfield and Irving (1989) asks about the behavior of the probability function Pn, which measures the likelihood that a random instance with n agents is solvable.\n  This paper provides a comprehensive analysis of the landscape surrounding this question, combining structural, probabilistic, and experimental perspe"},"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":"2505.06717","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-05-10T17:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"14195d88955b43480c5ba5f79ae232fe868aa680bf160299bd639b2c20b034f0","abstract_canon_sha256":"aa8578512bc9d284e6754721356d16916922df36678d4023b152b7340a71c59d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:05.002738Z","signature_b64":"iA2t1yrC9aw1Wz0Ua/iK4OcvfWy6pMect5NEe9xyBkT1vCiB5Zh9hzWun2xSPDankxWGRWfJh0S3epH164jxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad3a2324e7bf25add29f5bfe25a64343fefe6fa72b8d1b0dd7afab514a85333","last_reissued_at":"2026-07-05T11:33:05.002137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:05.002137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perspectives on Unsolvability in the Roommates Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"David Manlove, Frederik Glitzner","submitted_at":"2025-05-10T17:52:07Z","abstract_excerpt":"In the well-studied Stable Roommates problem, we seek a stable matching of agents into pairs, where no two agents prefer each other over their assigned partners. However, some instances of this problem are unsolvable, lacking any stable matching. A long-standing open question posed by Gusfield and Irving (1989) asks about the behavior of the probability function Pn, which measures the likelihood that a random instance with n agents is solvable.\n  This paper provides a comprehensive analysis of the landscape surrounding this question, combining structural, probabilistic, and experimental perspe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06717","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.06717/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":"2505.06717","created_at":"2026-07-05T11:33:05.002208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.06717v2","created_at":"2026-07-05T11:33:05.002208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06717","created_at":"2026-07-05T11:33:05.002208+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLJ2EMSOPPZF","created_at":"2026-07-05T11:33:05.002208+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLJ2EMSOPPZFVXJJ","created_at":"2026-07-05T11:33:05.002208+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLJ2EMSO","created_at":"2026-07-05T11:33:05.002208+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.27102","citing_title":"Designing Pairwise-Stable Agent Seating Arrangements","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ","json":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ.json","graph_json":"https://pith.science/api/pith-number/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/graph.json","events_json":"https://pith.science/api/pith-number/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/events.json","paper":"https://pith.science/paper/TLJ2EMSO"},"agent_actions":{"view_html":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ","download_json":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ.json","view_paper":"https://pith.science/paper/TLJ2EMSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.06717&json=true","fetch_graph":"https://pith.science/api/pith-number/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/action/storage_attestation","attest_author":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/action/author_attestation","sign_citation":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/action/citation_signature","submit_replication":"https://pith.science/pith/TLJ2EMSOPPZFVXJJ6W76EWTEGQ/action/replication_record"}},"created_at":"2026-07-05T11:33:05.002208+00:00","updated_at":"2026-07-05T11:33:05.002208+00:00"}