{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:AOQ6E6Y6QY6265FV5OIU5HFI7I","short_pith_number":"pith:AOQ6E6Y6","schema_version":"1.0","canonical_sha256":"03a1e27b1e863daf74b5eb914e9ca8fa2b5e01f791a732e3957415b6f1862daa","source":{"kind":"arxiv","id":"0809.0141","version":2},"attestation_state":"computed","paper":{"title":"The t-stability number of a random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Nikolaos Fountoulakis, Ross J. Kang","submitted_at":"2008-08-31T18:35:55Z","abstract_excerpt":"Given a graph G = (V,E), a vertex subset S is called t-stable (or t-dependent) if the subgraph G[S] induced on S has maximum degree at most t. The t-stability number of G is the maximum order of a t-stable set in G. We investigate the typical values that this parameter takes on a random graph on n vertices and edge probability equal to p. For any fixed 0 < p < 1 and fixed non-negative integer t, we show that, with probability tending to 1 as n grows, the t-stability number takes on at most two values which we identify as functions of t, p and n. The main tool we use is an asymptotic expression"},"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":"0809.0141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-31T18:35:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8a7a7bf6e4dee9587c3db26823028b39fa0e6569645e58a30fe8e3e6e95ee39e","abstract_canon_sha256":"55a532b4c371d6ce1c04e67056d36176007e828d1fdad110bbe0bc7df581a90d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:48.724028Z","signature_b64":"JjEmX63okwb2rt4zb2wdXltSBlbB6aycSLs1+g4NuSHuNlRID6GRayclsEwUaA1bqsHhf9jA1O5ZyoamCXtgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03a1e27b1e863daf74b5eb914e9ca8fa2b5e01f791a732e3957415b6f1862daa","last_reissued_at":"2026-05-18T04:38:48.723551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:48.723551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The t-stability number of a random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Nikolaos Fountoulakis, Ross J. Kang","submitted_at":"2008-08-31T18:35:55Z","abstract_excerpt":"Given a graph G = (V,E), a vertex subset S is called t-stable (or t-dependent) if the subgraph G[S] induced on S has maximum degree at most t. The t-stability number of G is the maximum order of a t-stable set in G. We investigate the typical values that this parameter takes on a random graph on n vertices and edge probability equal to p. For any fixed 0 < p < 1 and fixed non-negative integer t, we show that, with probability tending to 1 as n grows, the t-stability number takes on at most two values which we identify as functions of t, p and n. The main tool we use is an asymptotic expression"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.0141","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":"0809.0141","created_at":"2026-05-18T04:38:48.723627+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.0141v2","created_at":"2026-05-18T04:38:48.723627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0141","created_at":"2026-05-18T04:38:48.723627+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOQ6E6Y6QY62","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOQ6E6Y6QY6265FV","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOQ6E6Y6","created_at":"2026-05-18T12:25:56.245647+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/AOQ6E6Y6QY6265FV5OIU5HFI7I","json":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I.json","graph_json":"https://pith.science/api/pith-number/AOQ6E6Y6QY6265FV5OIU5HFI7I/graph.json","events_json":"https://pith.science/api/pith-number/AOQ6E6Y6QY6265FV5OIU5HFI7I/events.json","paper":"https://pith.science/paper/AOQ6E6Y6"},"agent_actions":{"view_html":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I","download_json":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I.json","view_paper":"https://pith.science/paper/AOQ6E6Y6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.0141&json=true","fetch_graph":"https://pith.science/api/pith-number/AOQ6E6Y6QY6265FV5OIU5HFI7I/graph.json","fetch_events":"https://pith.science/api/pith-number/AOQ6E6Y6QY6265FV5OIU5HFI7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/action/storage_attestation","attest_author":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/action/author_attestation","sign_citation":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/action/citation_signature","submit_replication":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/action/replication_record"}},"created_at":"2026-05-18T04:38:48.723627+00:00","updated_at":"2026-05-18T04:38:48.723627+00:00"}