{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FNQGEKFGG2G5WNU42HPXKCHEOR","short_pith_number":"pith:FNQGEKFG","schema_version":"1.0","canonical_sha256":"2b606228a6368ddb369cd1df7508e474609c10851d658d5b5e07d95b783d925b","source":{"kind":"arxiv","id":"1705.08340","version":1},"attestation_state":"computed","paper":{"title":"On random stable partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel","submitted_at":"2017-05-23T15:02:43Z","abstract_excerpt":"The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows, and with Rob Irving we proved that the limiting probability of solvability is $e^{1/2}/2$, at most. Stephan Mertens's extensive numerics compelled him to conjecture that this probability is of order $n^{-1/4}$. Jimmy Tan introduced a notion of a stable cyclic partition, and proved existence of such a partition for every system of members' preferences, discove"},"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":"1705.08340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T15:02:43Z","cross_cats_sorted":[],"title_canon_sha256":"28852308507deef4666630992fca2ebab8064cb647f52d7c6512848ef4990544","abstract_canon_sha256":"9fef122ee07a9350e36b9ad385bb61b53f764d04d0696e9e50e84cfd81f70eb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.542659Z","signature_b64":"EPtANApsKvEEjkdkoT+ToIMgTZuBrDvbP4n5vjgkw8UJ4BB/vtMpHWp8LtxJKsA15uMLLONr/PGlA66GwZ7wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b606228a6368ddb369cd1df7508e474609c10851d658d5b5e07d95b783d925b","last_reissued_at":"2026-05-18T00:43:48.542126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.542126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On random stable partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel","submitted_at":"2017-05-23T15:02:43Z","abstract_excerpt":"The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows, and with Rob Irving we proved that the limiting probability of solvability is $e^{1/2}/2$, at most. Stephan Mertens's extensive numerics compelled him to conjecture that this probability is of order $n^{-1/4}$. Jimmy Tan introduced a notion of a stable cyclic partition, and proved existence of such a partition for every system of members' preferences, discove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08340","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":""},"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":"1705.08340","created_at":"2026-05-18T00:43:48.542213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08340v1","created_at":"2026-05-18T00:43:48.542213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08340","created_at":"2026-05-18T00:43:48.542213+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNQGEKFGG2G5","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNQGEKFGG2G5WNU4","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNQGEKFG","created_at":"2026-05-18T12:31:15.632608+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/FNQGEKFGG2G5WNU42HPXKCHEOR","json":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR.json","graph_json":"https://pith.science/api/pith-number/FNQGEKFGG2G5WNU42HPXKCHEOR/graph.json","events_json":"https://pith.science/api/pith-number/FNQGEKFGG2G5WNU42HPXKCHEOR/events.json","paper":"https://pith.science/paper/FNQGEKFG"},"agent_actions":{"view_html":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR","download_json":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR.json","view_paper":"https://pith.science/paper/FNQGEKFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08340&json=true","fetch_graph":"https://pith.science/api/pith-number/FNQGEKFGG2G5WNU42HPXKCHEOR/graph.json","fetch_events":"https://pith.science/api/pith-number/FNQGEKFGG2G5WNU42HPXKCHEOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR/action/storage_attestation","attest_author":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR/action/author_attestation","sign_citation":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR/action/citation_signature","submit_replication":"https://pith.science/pith/FNQGEKFGG2G5WNU42HPXKCHEOR/action/replication_record"}},"created_at":"2026-05-18T00:43:48.542213+00:00","updated_at":"2026-05-18T00:43:48.542213+00:00"}