{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T5YOX2TOAJV5K2HNR6BJZWQNPF","short_pith_number":"pith:T5YOX2TO","schema_version":"1.0","canonical_sha256":"9f70ebea6e026bd568ed8f829cda0d797d4556693826507f4c00d6ac2b8ad7a8","source":{"kind":"arxiv","id":"1604.00890","version":2},"attestation_state":"computed","paper":{"title":"Random Perfect Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Nikola Yolov","submitted_at":"2016-04-04T14:57:55Z","abstract_excerpt":"We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\\{1,\\ldots,n\\}$. Our approach is based on the result of Pr\\\"omel and Steger that almost all perfect graphs are generalised split graphs, together with a method to generate such graphs almost uniformly.\n  We show that the distribution of the maximum of the stability number $\\alpha(P_n)$ and clique number $\\omega(P_n)$ is close to a concentrated distribution $L(n)$ which plays an important role in our generation method. We also prove that the probability that $P_n$ con"},"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":"1604.00890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-04T14:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"45df04378117b91d50cc0e24abb61cebec23bb0206080c6fe7dd971ff150f457","abstract_canon_sha256":"3751f081f1ee128ffb343bf3bd4b9e83a68cd1c89db12e6c6524fcf9e941ab8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:55.722391Z","signature_b64":"DLYDxIdeXO6GjHtCA7/VSvxjl0VOZAmfDHzYjAYLqFpp5Sez96rHoJr9Od8DAi13ZOLwYzi50FR9ef5HlRn1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f70ebea6e026bd568ed8f829cda0d797d4556693826507f4c00d6ac2b8ad7a8","last_reissued_at":"2026-05-18T00:35:55.721936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:55.721936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Perfect Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Nikola Yolov","submitted_at":"2016-04-04T14:57:55Z","abstract_excerpt":"We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\\{1,\\ldots,n\\}$. Our approach is based on the result of Pr\\\"omel and Steger that almost all perfect graphs are generalised split graphs, together with a method to generate such graphs almost uniformly.\n  We show that the distribution of the maximum of the stability number $\\alpha(P_n)$ and clique number $\\omega(P_n)$ is close to a concentrated distribution $L(n)$ which plays an important role in our generation method. We also prove that the probability that $P_n$ con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00890","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":"1604.00890","created_at":"2026-05-18T00:35:55.721992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00890v2","created_at":"2026-05-18T00:35:55.721992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00890","created_at":"2026-05-18T00:35:55.721992+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5YOX2TOAJV5","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5YOX2TOAJV5K2HN","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5YOX2TO","created_at":"2026-05-18T12:30:44.179134+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/T5YOX2TOAJV5K2HNR6BJZWQNPF","json":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF.json","graph_json":"https://pith.science/api/pith-number/T5YOX2TOAJV5K2HNR6BJZWQNPF/graph.json","events_json":"https://pith.science/api/pith-number/T5YOX2TOAJV5K2HNR6BJZWQNPF/events.json","paper":"https://pith.science/paper/T5YOX2TO"},"agent_actions":{"view_html":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF","download_json":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF.json","view_paper":"https://pith.science/paper/T5YOX2TO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00890&json=true","fetch_graph":"https://pith.science/api/pith-number/T5YOX2TOAJV5K2HNR6BJZWQNPF/graph.json","fetch_events":"https://pith.science/api/pith-number/T5YOX2TOAJV5K2HNR6BJZWQNPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF/action/storage_attestation","attest_author":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF/action/author_attestation","sign_citation":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF/action/citation_signature","submit_replication":"https://pith.science/pith/T5YOX2TOAJV5K2HNR6BJZWQNPF/action/replication_record"}},"created_at":"2026-05-18T00:35:55.721992+00:00","updated_at":"2026-05-18T00:35:55.721992+00:00"}