{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NZACJRLHZ54ZT6X5326T42UGAM","short_pith_number":"pith:NZACJRLH","schema_version":"1.0","canonical_sha256":"6e4024c567cf7999fafddebd3e6a86032c9b07b53c42a0245f348b47d15cb061","source":{"kind":"arxiv","id":"1406.6961","version":2},"attestation_state":"computed","paper":{"title":"The typical structure of graphs with no large cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh, Maur\\'icio Collares Neto, Neal Bushaw, Robert Morris","submitted_at":"2014-06-26T17:56:49Z","abstract_excerpt":"In 1987, Kolaitis, Pr\\\"omel and Rothschild proved that, for every fixed $r \\in \\mathbb{N}$, almost every $n$-vertex $K_{r+1}$-free graph is $r$-partite. In this paper we extend this result to all functions $r = r(n)$ with $r \\leqslant (\\log n)^{1/4}$. The proof combines a new (close to sharp) supersaturation version of the Erd\\H{o}s-Simonovits stability theorem, the hypergraph container method, and a counting technique developed by Balogh, Bollob\\'as and Simonovits."},"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":"1406.6961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-26T17:56:49Z","cross_cats_sorted":[],"title_canon_sha256":"491182bc70e1f6afca5ebd4da4d2412d960dbffd0033360d258ef0b9c8a7fe12","abstract_canon_sha256":"b99efacfd8d154698d24d3582e19e5f5f64d02c16e9cddc8d0a379463abbb804"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:24.593086Z","signature_b64":"BncMA2LUtJYUcJW335qBlH79K15kgbPgVl1AzzmeWC3ZAbbj9dTWLkXfzOol/xBU6Y3FZFAENoNGVf4GF1u+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e4024c567cf7999fafddebd3e6a86032c9b07b53c42a0245f348b47d15cb061","last_reissued_at":"2026-05-18T02:17:24.592368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:24.592368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The typical structure of graphs with no large cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh, Maur\\'icio Collares Neto, Neal Bushaw, Robert Morris","submitted_at":"2014-06-26T17:56:49Z","abstract_excerpt":"In 1987, Kolaitis, Pr\\\"omel and Rothschild proved that, for every fixed $r \\in \\mathbb{N}$, almost every $n$-vertex $K_{r+1}$-free graph is $r$-partite. In this paper we extend this result to all functions $r = r(n)$ with $r \\leqslant (\\log n)^{1/4}$. The proof combines a new (close to sharp) supersaturation version of the Erd\\H{o}s-Simonovits stability theorem, the hypergraph container method, and a counting technique developed by Balogh, Bollob\\'as and Simonovits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6961","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":"1406.6961","created_at":"2026-05-18T02:17:24.592488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6961v2","created_at":"2026-05-18T02:17:24.592488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6961","created_at":"2026-05-18T02:17:24.592488+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZACJRLHZ54Z","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZACJRLHZ54ZT6X5","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZACJRLH","created_at":"2026-05-18T12:28:41.024544+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/NZACJRLHZ54ZT6X5326T42UGAM","json":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM.json","graph_json":"https://pith.science/api/pith-number/NZACJRLHZ54ZT6X5326T42UGAM/graph.json","events_json":"https://pith.science/api/pith-number/NZACJRLHZ54ZT6X5326T42UGAM/events.json","paper":"https://pith.science/paper/NZACJRLH"},"agent_actions":{"view_html":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM","download_json":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM.json","view_paper":"https://pith.science/paper/NZACJRLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6961&json=true","fetch_graph":"https://pith.science/api/pith-number/NZACJRLHZ54ZT6X5326T42UGAM/graph.json","fetch_events":"https://pith.science/api/pith-number/NZACJRLHZ54ZT6X5326T42UGAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM/action/storage_attestation","attest_author":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM/action/author_attestation","sign_citation":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM/action/citation_signature","submit_replication":"https://pith.science/pith/NZACJRLHZ54ZT6X5326T42UGAM/action/replication_record"}},"created_at":"2026-05-18T02:17:24.592488+00:00","updated_at":"2026-05-18T02:17:24.592488+00:00"}