{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YGZ3JOW6MHI7AMUNPN2K2FOFQ5","short_pith_number":"pith:YGZ3JOW6","schema_version":"1.0","canonical_sha256":"c1b3b4bade61d1f0328d7b74ad15c587414ccd3dbd2cd4106c4cee102c45dfd0","source":{"kind":"arxiv","id":"1510.09187","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.09187","created_at":"2026-05-18T01:17:11.513683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.09187v2","created_at":"2026-05-18T01:17:11.513683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09187","created_at":"2026-05-18T01:17:11.513683+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGZ3JOW6MHI7","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGZ3JOW6MHI7AMUN","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGZ3JOW6","created_at":"2026-05-18T12:29:50.041715+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/YGZ3JOW6MHI7AMUNPN2K2FOFQ5","json":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5.json","graph_json":"https://pith.science/api/pith-number/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/graph.json","events_json":"https://pith.science/api/pith-number/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/events.json","paper":"https://pith.science/paper/YGZ3JOW6"},"agent_actions":{"view_html":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5","download_json":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5.json","view_paper":"https://pith.science/paper/YGZ3JOW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.09187&json=true","fetch_graph":"https://pith.science/api/pith-number/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/action/storage_attestation","attest_author":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/action/author_attestation","sign_citation":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/action/citation_signature","submit_replication":"https://pith.science/pith/YGZ3JOW6MHI7AMUNPN2K2FOFQ5/action/replication_record"}},"created_at":"2026-05-18T01:17:11.513683+00:00","updated_at":"2026-05-18T01:17:11.513683+00:00"}