{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YGZ3JOW6MHI7AMUNPN2K2FOFQ5","short_pith_number":"pith:YGZ3JOW6","canonical_record":{"source":{"id":"1510.09187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T18:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"bc83515d87cb7dc82cf11f0629e214f6445cf401eb6148c4a2d9bc1f5459da19","abstract_canon_sha256":"63c8aa5c644bb15b29c137005fe612d714763f8f1ffdea26497a268fd6107b3b"},"schema_version":"1.0"},"canonical_sha256":"c1b3b4bade61d1f0328d7b74ad15c587414ccd3dbd2cd4106c4cee102c45dfd0","source":{"kind":"arxiv","id":"1510.09187","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09187","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09187v2","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09187","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"YGZ3JOW6MHI7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YGZ3JOW6MHI7AMUN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YGZ3JOW6","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YGZ3JOW6MHI7AMUNPN2K2FOFQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1510.09187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T18:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"bc83515d87cb7dc82cf11f0629e214f6445cf401eb6148c4a2d9bc1f5459da19","abstract_canon_sha256":"63c8aa5c644bb15b29c137005fe612d714763f8f1ffdea26497a268fd6107b3b"},"schema_version":"1.0"},"canonical_sha256":"c1b3b4bade61d1f0328d7b74ad15c587414ccd3dbd2cd4106c4cee102c45dfd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:11.514338Z","signature_b64":"GAdTVuZqkkdQh79Rv9zWk2nAFWOFXXdz6hMhZLDJaaeQ8Ose0Qwh5Dz1P88nre6eaKX2LWfLEt7g+uqepmdHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1b3b4bade61d1f0328d7b74ad15c587414ccd3dbd2cd4106c4cee102c45dfd0","last_reissued_at":"2026-05-18T01:17:11.513564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:11.513564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.09187","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-18T01:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLMejqhtSrtqux7ZZ6YQ70l6OwgDAudXqRxdZ+VLd+r4sNdTqJXtZLW9P+j01Ga1Rk9YCb7OUS6xAhFX4k+TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:58:03.505642Z"},"content_sha256":"0dc940a38b612d56c2792e62042ed7f25761124695c59f4caf6db15a34b69192","schema_version":"1.0","event_id":"sha256:0dc940a38b612d56c2792e62042ed7f25761124695c59f4caf6db15a34b69192"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YGZ3JOW6MHI7AMUNPN2K2FOFQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Saturation in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi","submitted_at":"2015-10-30T18:34:59Z","abstract_excerpt":"A graph $H$ is $K_s$-saturated if it is a maximal $K_s$-free graph, i.e., $H$ contains no clique on $s$ vertices, but the addition of any missing edge creates one. The minimum number of edges in a $K_s$-saturated graph was determined over 50 years ago by Zykov and independently by Erd\\H{o}s, Hajnal and Moon. In this paper, we study the random analog of this problem: minimizing the number of edges in a maximal $K_s$-free subgraph of the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$. We give asymptotically tight estimates on this minimum, and also provide exact bounds for the related notion of weak sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09187","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-18T01:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emHHl/skqmyWRFESsKOqmWPNWcfYHqxm3aZpsnGXb5CrFui6E6/VMtzgaDjvMZmdmAHBVLlfUPX/8rm9oPZABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:58:03.506303Z"},"content_sha256":"1f817b2cfbbb661d430d9c823b88bb84f1a584f54c2dcf2f700e2b9b9978efa8","schema_version":"1.0","event_id":"sha256:1f817b2cfbbb661d430d9c823b88bb84f1a584f54c2dcf2f700e2b9b9978efa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/bundle.json","state_url":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/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-30T15:58:03Z","links":{"resolver":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5","bundle":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/bundle.json","state":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YGZ3JOW6MHI7AMUNPN2K2FOFQ5","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":"63c8aa5c644bb15b29c137005fe612d714763f8f1ffdea26497a268fd6107b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T18:34:59Z","title_canon_sha256":"bc83515d87cb7dc82cf11f0629e214f6445cf401eb6148c4a2d9bc1f5459da19"},"schema_version":"1.0","source":{"id":"1510.09187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09187","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09187v2","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09187","created_at":"2026-05-18T01:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"YGZ3JOW6MHI7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YGZ3JOW6MHI7AMUN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YGZ3JOW6","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:1f817b2cfbbb661d430d9c823b88bb84f1a584f54c2dcf2f700e2b9b9978efa8","target":"graph","created_at":"2026-05-18T01:17:11Z","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":"A graph $H$ is $K_s$-saturated if it is a maximal $K_s$-free graph, i.e., $H$ contains no clique on $s$ vertices, but the addition of any missing edge creates one. The minimum number of edges in a $K_s$-saturated graph was determined over 50 years ago by Zykov and independently by Erd\\H{o}s, Hajnal and Moon. In this paper, we study the random analog of this problem: minimizing the number of edges in a maximal $K_s$-free subgraph of the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$. We give asymptotically tight estimates on this minimum, and also provide exact bounds for the related notion of weak sa","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T18:34:59Z","title":"Saturation in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09187","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:0dc940a38b612d56c2792e62042ed7f25761124695c59f4caf6db15a34b69192","target":"record","created_at":"2026-05-18T01:17:11Z","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":"63c8aa5c644bb15b29c137005fe612d714763f8f1ffdea26497a268fd6107b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-30T18:34:59Z","title_canon_sha256":"bc83515d87cb7dc82cf11f0629e214f6445cf401eb6148c4a2d9bc1f5459da19"},"schema_version":"1.0","source":{"id":"1510.09187","kind":"arxiv","version":2}},"canonical_sha256":"c1b3b4bade61d1f0328d7b74ad15c587414ccd3dbd2cd4106c4cee102c45dfd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1b3b4bade61d1f0328d7b74ad15c587414ccd3dbd2cd4106c4cee102c45dfd0","first_computed_at":"2026-05-18T01:17:11.513564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:11.513564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GAdTVuZqkkdQh79Rv9zWk2nAFWOFXXdz6hMhZLDJaaeQ8Ose0Qwh5Dz1P88nre6eaKX2LWfLEt7g+uqepmdHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:11.514338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.09187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dc940a38b612d56c2792e62042ed7f25761124695c59f4caf6db15a34b69192","sha256:1f817b2cfbbb661d430d9c823b88bb84f1a584f54c2dcf2f700e2b9b9978efa8"],"state_sha256":"a708864dd578153f2ccf998d58e8f557f468dde191a5aec9bd166c30fb6fdfc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxtsGaFWnETweb9WH8PATvgsV5m4tYXRhqSnMemn6Z5XUtXqOzcAoidnLLKRuyv5b6uNDSRLI5JOejzeeK+pAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:58:03.509950Z","bundle_sha256":"1a42b05e445ac608c06fb5f86ff4b71e5f05caefc682ee0dc632a00971a04093"}}