{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DHVIODK456C5JAMOJ244JZ7TZZ","short_pith_number":"pith:DHVIODK4","canonical_record":{"source":{"id":"0908.0429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-04T12:11:05Z","cross_cats_sorted":[],"title_canon_sha256":"9bff11f0c8af16c95ac9a82f71984fe1a117778c337d9ae0309841316282b837","abstract_canon_sha256":"993b68c132064618f229e614322cff9daebc0f7aaeb82fd1396f1e2c578d4577"},"schema_version":"1.0"},"canonical_sha256":"19ea870d5cef85d4818e4eb9c4e7f3ce74ef6cd7531bf1e7ed0985d112886bba","source":{"kind":"arxiv","id":"0908.0429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.0429","created_at":"2026-05-18T02:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"0908.0429v1","created_at":"2026-05-18T02:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.0429","created_at":"2026-05-18T02:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"DHVIODK456C5","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DHVIODK456C5JAMO","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DHVIODK4","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DHVIODK456C5JAMOJ244JZ7TZZ","target":"record","payload":{"canonical_record":{"source":{"id":"0908.0429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-04T12:11:05Z","cross_cats_sorted":[],"title_canon_sha256":"9bff11f0c8af16c95ac9a82f71984fe1a117778c337d9ae0309841316282b837","abstract_canon_sha256":"993b68c132064618f229e614322cff9daebc0f7aaeb82fd1396f1e2c578d4577"},"schema_version":"1.0"},"canonical_sha256":"19ea870d5cef85d4818e4eb9c4e7f3ce74ef6cd7531bf1e7ed0985d112886bba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:44.871450Z","signature_b64":"wpPJKLSY3TGQzTO9R3+rittu2Hmycufe9Ay5IqmXOzk4hEBiaCzBSnbAdyHR/+CnDGAjDWUzBb4N1o5XaTxrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19ea870d5cef85d4818e4eb9c4e7f3ce74ef6cd7531bf1e7ed0985d112886bba","last_reissued_at":"2026-05-18T02:12:44.870963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:44.870963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.0429","source_version":1,"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-18T02:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onZg9JiFLPtjqOSPhHKuSUV7tOycRadBMIMR7gxu5wv2+D6gabqhHsqNGw2SHqUaSpRPmygB1K5HYwgF6BXwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:51:19.748871Z"},"content_sha256":"ea21926168650b7b41172414654ff0ecee2e94969b6f3e3e31195b14efe9d3fa","schema_version":"1.0","event_id":"sha256:ea21926168650b7b41172414654ff0ecee2e94969b6f3e3e31195b14efe9d3fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DHVIODK456C5JAMOJ244JZ7TZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The early evolution of the H-free process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Keevash, Tom Bohman","submitted_at":"2009-08-04T12:11:05Z","abstract_excerpt":"The H-free process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal H-free graph obtained at the end of the process. When H is strictly 2-balanced, we show that for some c>0, with high probability as $n \\to \\infty$, the minimum degree in G is at least $cn^{1-(v_H-2)/(e_H-1)}(\\log n)^{1/(e_H-1)}$. This gives new lower bounds for the Tur\\'an numbers of certain bipartite graphs, such as the com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.0429","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"},"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-18T02:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJaRpZYU28Ttjfn+YgexWZDOblA+s0cjYMWf1uPEsRj+7+/PDvBD2oPyj7pytPiQPDb7LgijKQU3cny+mPTWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:51:19.749254Z"},"content_sha256":"2ef8aef09faa2f68a55c755196765d416af3c96e18157a7f1ceda62ba1e439f0","schema_version":"1.0","event_id":"sha256:2ef8aef09faa2f68a55c755196765d416af3c96e18157a7f1ceda62ba1e439f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHVIODK456C5JAMOJ244JZ7TZZ/bundle.json","state_url":"https://pith.science/pith/DHVIODK456C5JAMOJ244JZ7TZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHVIODK456C5JAMOJ244JZ7TZZ/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-05-30T11:51:19Z","links":{"resolver":"https://pith.science/pith/DHVIODK456C5JAMOJ244JZ7TZZ","bundle":"https://pith.science/pith/DHVIODK456C5JAMOJ244JZ7TZZ/bundle.json","state":"https://pith.science/pith/DHVIODK456C5JAMOJ244JZ7TZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHVIODK456C5JAMOJ244JZ7TZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DHVIODK456C5JAMOJ244JZ7TZZ","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":"993b68c132064618f229e614322cff9daebc0f7aaeb82fd1396f1e2c578d4577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-04T12:11:05Z","title_canon_sha256":"9bff11f0c8af16c95ac9a82f71984fe1a117778c337d9ae0309841316282b837"},"schema_version":"1.0","source":{"id":"0908.0429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.0429","created_at":"2026-05-18T02:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"0908.0429v1","created_at":"2026-05-18T02:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.0429","created_at":"2026-05-18T02:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"DHVIODK456C5","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DHVIODK456C5JAMO","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DHVIODK4","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:2ef8aef09faa2f68a55c755196765d416af3c96e18157a7f1ceda62ba1e439f0","target":"graph","created_at":"2026-05-18T02:12:44Z","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":"The H-free process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal H-free graph obtained at the end of the process. When H is strictly 2-balanced, we show that for some c>0, with high probability as $n \\to \\infty$, the minimum degree in G is at least $cn^{1-(v_H-2)/(e_H-1)}(\\log n)^{1/(e_H-1)}$. This gives new lower bounds for the Tur\\'an numbers of certain bipartite graphs, such as the com","authors_text":"Peter Keevash, Tom Bohman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-04T12:11:05Z","title":"The early evolution of the H-free process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.0429","kind":"arxiv","version":1},"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:ea21926168650b7b41172414654ff0ecee2e94969b6f3e3e31195b14efe9d3fa","target":"record","created_at":"2026-05-18T02:12:44Z","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":"993b68c132064618f229e614322cff9daebc0f7aaeb82fd1396f1e2c578d4577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-04T12:11:05Z","title_canon_sha256":"9bff11f0c8af16c95ac9a82f71984fe1a117778c337d9ae0309841316282b837"},"schema_version":"1.0","source":{"id":"0908.0429","kind":"arxiv","version":1}},"canonical_sha256":"19ea870d5cef85d4818e4eb9c4e7f3ce74ef6cd7531bf1e7ed0985d112886bba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19ea870d5cef85d4818e4eb9c4e7f3ce74ef6cd7531bf1e7ed0985d112886bba","first_computed_at":"2026-05-18T02:12:44.870963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:44.870963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpPJKLSY3TGQzTO9R3+rittu2Hmycufe9Ay5IqmXOzk4hEBiaCzBSnbAdyHR/+CnDGAjDWUzBb4N1o5XaTxrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:44.871450Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.0429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea21926168650b7b41172414654ff0ecee2e94969b6f3e3e31195b14efe9d3fa","sha256:2ef8aef09faa2f68a55c755196765d416af3c96e18157a7f1ceda62ba1e439f0"],"state_sha256":"2cbde5b0eaf09044610d721b8fc6a60f7a13c1f3c8513fa6076160b64a6ed7ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKQx5ph5A6mEfoFl1CSGVluyzSTs6463jn2ckPHM+hLPCCFpn0O+jfsX9yhuCrP1bIY4Dg4wD/r/1KM9ZWCtBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:51:19.752623Z","bundle_sha256":"4007ca6b27727baa4a488cac88f5684433edd45dcab50ce0850a988de289dabf"}}