{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:AOQ6E6Y6QY6265FV5OIU5HFI7I","short_pith_number":"pith:AOQ6E6Y6","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"},"canonical_sha256":"03a1e27b1e863daf74b5eb914e9ca8fa2b5e01f791a732e3957415b6f1862daa","source":{"kind":"arxiv","id":"0809.0141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.0141","created_at":"2026-05-18T04:38:48Z"},{"alias_kind":"arxiv_version","alias_value":"0809.0141v2","created_at":"2026-05-18T04:38:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0141","created_at":"2026-05-18T04:38:48Z"},{"alias_kind":"pith_short_12","alias_value":"AOQ6E6Y6QY62","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"AOQ6E6Y6QY6265FV","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"AOQ6E6Y6","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:AOQ6E6Y6QY6265FV5OIU5HFI7I","target":"record","payload":{"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"},"canonical_sha256":"03a1e27b1e863daf74b5eb914e9ca8fa2b5e01f791a732e3957415b6f1862daa","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"},"source_kind":"arxiv","source_id":"0809.0141","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:38:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjfXKN3tUEF6Pa8V7ADoHGjZn2RKcoxcFtwoGIDjagKDUxKrh8rbcGekgPcbwBpqXlzKb5FggRAYd2b4DGOiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:14:21.131565Z"},"content_sha256":"d597ee80ac0e5e811c4342a10923ce7c839bc5eef4d78759963067ddbded6364","schema_version":"1.0","event_id":"sha256:d597ee80ac0e5e811c4342a10923ce7c839bc5eef4d78759963067ddbded6364"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:AOQ6E6Y6QY6265FV5OIU5HFI7I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:38:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWlJET0zVhKQ75i5FVlXx/xJOmnCuMHvB9nEVSPSZNZNJro6Wsq0evwlxPhdVFsSqFqGlJeIx9hxIhJ6IJkOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:14:21.131908Z"},"content_sha256":"6e1777eaf6d4bfc8f8e876b89b157aac92cbfed18dad81a3d72a30f7d25120fd","schema_version":"1.0","event_id":"sha256:6e1777eaf6d4bfc8f8e876b89b157aac92cbfed18dad81a3d72a30f7d25120fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/bundle.json","state_url":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T22:14:21Z","links":{"resolver":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I","bundle":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/bundle.json","state":"https://pith.science/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOQ6E6Y6QY6265FV5OIU5HFI7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:AOQ6E6Y6QY6265FV5OIU5HFI7I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"55a532b4c371d6ce1c04e67056d36176007e828d1fdad110bbe0bc7df581a90d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-31T18:35:55Z","title_canon_sha256":"8a7a7bf6e4dee9587c3db26823028b39fa0e6569645e58a30fe8e3e6e95ee39e"},"schema_version":"1.0","source":{"id":"0809.0141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.0141","created_at":"2026-05-18T04:38:48Z"},{"alias_kind":"arxiv_version","alias_value":"0809.0141v2","created_at":"2026-05-18T04:38:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0141","created_at":"2026-05-18T04:38:48Z"},{"alias_kind":"pith_short_12","alias_value":"AOQ6E6Y6QY62","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"AOQ6E6Y6QY6265FV","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"AOQ6E6Y6","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:6e1777eaf6d4bfc8f8e876b89b157aac92cbfed18dad81a3d72a30f7d25120fd","target":"graph","created_at":"2026-05-18T04:38:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Colin McDiarmid, Nikolaos Fountoulakis, Ross J. Kang","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-31T18:35:55Z","title":"The t-stability number of a random graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.0141","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d597ee80ac0e5e811c4342a10923ce7c839bc5eef4d78759963067ddbded6364","target":"record","created_at":"2026-05-18T04:38:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"55a532b4c371d6ce1c04e67056d36176007e828d1fdad110bbe0bc7df581a90d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-31T18:35:55Z","title_canon_sha256":"8a7a7bf6e4dee9587c3db26823028b39fa0e6569645e58a30fe8e3e6e95ee39e"},"schema_version":"1.0","source":{"id":"0809.0141","kind":"arxiv","version":2}},"canonical_sha256":"03a1e27b1e863daf74b5eb914e9ca8fa2b5e01f791a732e3957415b6f1862daa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03a1e27b1e863daf74b5eb914e9ca8fa2b5e01f791a732e3957415b6f1862daa","first_computed_at":"2026-05-18T04:38:48.723551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:48.723551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JjEmX63okwb2rt4zb2wdXltSBlbB6aycSLs1+g4NuSHuNlRID6GRayclsEwUaA1bqsHhf9jA1O5ZyoamCXtgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:48.724028Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.0141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d597ee80ac0e5e811c4342a10923ce7c839bc5eef4d78759963067ddbded6364","sha256:6e1777eaf6d4bfc8f8e876b89b157aac92cbfed18dad81a3d72a30f7d25120fd"],"state_sha256":"3a485a3be6b6f7bc2965bee93c7d217e831572f5bd19068532e4626a9ca3dceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4OIlZs+hFNlSZ7rSP7qDazuXhslMtmYm9++djvx7UVJFZq1mwysoy5k/cvUTMNW3509JUwwea73rHS3uKBvUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:14:21.133914Z","bundle_sha256":"ee5b0f7e687b5bd2e91b685933aa50f3c45646f9b6088e817e588133d6697c92"}}