{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SHTHVSK4DIQTDOS74WSFQOISO7","short_pith_number":"pith:SHTHVSK4","canonical_record":{"source":{"id":"1708.01054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T08:51:38Z","cross_cats_sorted":[],"title_canon_sha256":"335219db2df4491fc3a8fd1862829a31d8ce7c746f578e0bcf4823b196bd3f35","abstract_canon_sha256":"646a65f0119738d581f1814469b6aef091d67526af2fde0350d9f4d8a25627d3"},"schema_version":"1.0"},"canonical_sha256":"91e67ac95c1a2131ba5fe5a458391277e83ccd4eb2f7aaedab0607f7c155fdcf","source":{"kind":"arxiv","id":"1708.01054","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01054","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01054v2","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01054","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"SHTHVSK4DIQT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SHTHVSK4DIQTDOS7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SHTHVSK4","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SHTHVSK4DIQTDOS74WSFQOISO7","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T08:51:38Z","cross_cats_sorted":[],"title_canon_sha256":"335219db2df4491fc3a8fd1862829a31d8ce7c746f578e0bcf4823b196bd3f35","abstract_canon_sha256":"646a65f0119738d581f1814469b6aef091d67526af2fde0350d9f4d8a25627d3"},"schema_version":"1.0"},"canonical_sha256":"91e67ac95c1a2131ba5fe5a458391277e83ccd4eb2f7aaedab0607f7c155fdcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:54.702947Z","signature_b64":"mZ5tL98WmQmyYkfc7vPt+USi0aht2rqYXb8DW75X+pUd/vSlc+zJ2Gb3L1bKpADYGQpWwvGIeCJxmJibSlNcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91e67ac95c1a2131ba5fe5a458391277e83ccd4eb2f7aaedab0607f7c155fdcf","last_reissued_at":"2026-05-18T00:14:54.702313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:54.702313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01054","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-18T00:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5APNIqltkqyMenkpNDvDDuxBGtPS0IG2bS13NZB0E4iVqnp7RZ6N8ONkW27CRDz0s78EpWaf93dZR9UuWtOOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:33.964519Z"},"content_sha256":"2ec56033e859670de4a37e8dbd6d3326da2916c495c09f5f42978c9bfec7f46e","schema_version":"1.0","event_id":"sha256:2ec56033e859670de4a37e8dbd6d3326da2916c495c09f5f42978c9bfec7f46e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SHTHVSK4DIQTDOS74WSFQOISO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The random k-matching-free process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matthew Kwan, Michael Krivelevich, Po-Shen Loh","submitted_at":"2017-08-03T08:51:38Z","abstract_excerpt":"Let $\\mathcal{P}$ be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty $n$-vertex graph and then adds edges one-by-one, each chosen uniformly at random subject to the constraint that $\\mathcal{P}$ is not violated. These types of random processes have been the subject of extensive research over the last 20 years, having striking applications in extremal combinatorics, and leading to the discovery of important probabilistic tools. In this paper we consider the $k$-matching-free process, where $\\mathcal{P}$ is the property of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01054","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-18T00:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"477JARBkQyCQ1FvQ3zcYLXN0remPQTSincO/0/XkraQ+aSn4WFgrh7xBhi6WZGdebgXFdoVvPUFohU86k/E4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:33.965130Z"},"content_sha256":"0b204f2415d419fa5b1c05cafffa01b981d8d6b26ac025e470bd6cea2298f4be","schema_version":"1.0","event_id":"sha256:0b204f2415d419fa5b1c05cafffa01b981d8d6b26ac025e470bd6cea2298f4be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHTHVSK4DIQTDOS74WSFQOISO7/bundle.json","state_url":"https://pith.science/pith/SHTHVSK4DIQTDOS74WSFQOISO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHTHVSK4DIQTDOS74WSFQOISO7/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-30T03:33:33Z","links":{"resolver":"https://pith.science/pith/SHTHVSK4DIQTDOS74WSFQOISO7","bundle":"https://pith.science/pith/SHTHVSK4DIQTDOS74WSFQOISO7/bundle.json","state":"https://pith.science/pith/SHTHVSK4DIQTDOS74WSFQOISO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHTHVSK4DIQTDOS74WSFQOISO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SHTHVSK4DIQTDOS74WSFQOISO7","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":"646a65f0119738d581f1814469b6aef091d67526af2fde0350d9f4d8a25627d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T08:51:38Z","title_canon_sha256":"335219db2df4491fc3a8fd1862829a31d8ce7c746f578e0bcf4823b196bd3f35"},"schema_version":"1.0","source":{"id":"1708.01054","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01054","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01054v2","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01054","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"SHTHVSK4DIQT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SHTHVSK4DIQTDOS7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SHTHVSK4","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:0b204f2415d419fa5b1c05cafffa01b981d8d6b26ac025e470bd6cea2298f4be","target":"graph","created_at":"2026-05-18T00:14:54Z","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":"Let $\\mathcal{P}$ be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty $n$-vertex graph and then adds edges one-by-one, each chosen uniformly at random subject to the constraint that $\\mathcal{P}$ is not violated. These types of random processes have been the subject of extensive research over the last 20 years, having striking applications in extremal combinatorics, and leading to the discovery of important probabilistic tools. In this paper we consider the $k$-matching-free process, where $\\mathcal{P}$ is the property of","authors_text":"Benny Sudakov, Matthew Kwan, Michael Krivelevich, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T08:51:38Z","title":"The random k-matching-free process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01054","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:2ec56033e859670de4a37e8dbd6d3326da2916c495c09f5f42978c9bfec7f46e","target":"record","created_at":"2026-05-18T00:14:54Z","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":"646a65f0119738d581f1814469b6aef091d67526af2fde0350d9f4d8a25627d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T08:51:38Z","title_canon_sha256":"335219db2df4491fc3a8fd1862829a31d8ce7c746f578e0bcf4823b196bd3f35"},"schema_version":"1.0","source":{"id":"1708.01054","kind":"arxiv","version":2}},"canonical_sha256":"91e67ac95c1a2131ba5fe5a458391277e83ccd4eb2f7aaedab0607f7c155fdcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91e67ac95c1a2131ba5fe5a458391277e83ccd4eb2f7aaedab0607f7c155fdcf","first_computed_at":"2026-05-18T00:14:54.702313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:54.702313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mZ5tL98WmQmyYkfc7vPt+USi0aht2rqYXb8DW75X+pUd/vSlc+zJ2Gb3L1bKpADYGQpWwvGIeCJxmJibSlNcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:54.702947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01054","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ec56033e859670de4a37e8dbd6d3326da2916c495c09f5f42978c9bfec7f46e","sha256:0b204f2415d419fa5b1c05cafffa01b981d8d6b26ac025e470bd6cea2298f4be"],"state_sha256":"d98f5e6ea363127e45aa44f2cac75a8a2b25b703a9bed4f08743335c0347ff82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbAg3Y07eSUFYsVFdBjh3JPwuQrlpM8TymPFu2MONVJ+scQhy9Q8EDLz7HxUYZLX7kFNPggI9L2iXjTsJNfVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:33:33.968674Z","bundle_sha256":"2cc9250258fe3c80bde1807cbaa537756e7c4f5b35368839473a134cf135b84e"}}