{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BA3MIEAIZAULLRXZYLQWI2ONYH","short_pith_number":"pith:BA3MIEAI","schema_version":"1.0","canonical_sha256":"0836c41008c828b5c6f9c2e16469cdc1cc0e881ec31341a046036843b79c9a78","source":{"kind":"arxiv","id":"1102.1634","version":4},"attestation_state":"computed","paper":{"title":"On the Number of Pentagons in Triangle-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Razborov, Daniel Kr\\'al, Hamed Hatami, Jan Hladk\\'y, Serguei Norine","submitted_at":"2011-02-08T16:03:59Z","abstract_excerpt":"Using the formalism of flag algebras, we prove that every triangle-free graph $G$ with $n$ vertices contains at most $(n/5)^5$ cycles of length five. Moreover, the equality is attained only when $n$ is divisible by five and $G$ is the balanced blow-up of the pentagon. We also compute the maximal number of pentagons and characterize extremal graphs in the non-divisible case provided $n$ is sufficiently large. This settles a conjecture made by Erd\\H{o}s in 1984."},"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":"1102.1634","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T16:03:59Z","cross_cats_sorted":[],"title_canon_sha256":"027c3f660855e331b2b196f8a111fb2f6066664770528cb982bef3d61aa93fd6","abstract_canon_sha256":"a84023885a4508f1101c9056c2bf6518352bb910f21b9dbe14baa237bf930bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.797490Z","signature_b64":"Rv++SlV4AQPDEQRovEKArQBQBbhGBnXn3w2L/q8bRB3+ruI7SsQ2aLVATCZ2GbddnavGTtam83rVP5hY8GqCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0836c41008c828b5c6f9c2e16469cdc1cc0e881ec31341a046036843b79c9a78","last_reissued_at":"2026-05-18T00:39:18.796739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.796739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Number of Pentagons in Triangle-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Razborov, Daniel Kr\\'al, Hamed Hatami, Jan Hladk\\'y, Serguei Norine","submitted_at":"2011-02-08T16:03:59Z","abstract_excerpt":"Using the formalism of flag algebras, we prove that every triangle-free graph $G$ with $n$ vertices contains at most $(n/5)^5$ cycles of length five. Moreover, the equality is attained only when $n$ is divisible by five and $G$ is the balanced blow-up of the pentagon. We also compute the maximal number of pentagons and characterize extremal graphs in the non-divisible case provided $n$ is sufficiently large. This settles a conjecture made by Erd\\H{o}s in 1984."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1634","kind":"arxiv","version":4},"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":"1102.1634","created_at":"2026-05-18T00:39:18.796912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1634v4","created_at":"2026-05-18T00:39:18.796912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1634","created_at":"2026-05-18T00:39:18.796912+00:00"},{"alias_kind":"pith_short_12","alias_value":"BA3MIEAIZAUL","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BA3MIEAIZAULLRXZ","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BA3MIEAI","created_at":"2026-05-18T12:26:24.575870+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/BA3MIEAIZAULLRXZYLQWI2ONYH","json":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH.json","graph_json":"https://pith.science/api/pith-number/BA3MIEAIZAULLRXZYLQWI2ONYH/graph.json","events_json":"https://pith.science/api/pith-number/BA3MIEAIZAULLRXZYLQWI2ONYH/events.json","paper":"https://pith.science/paper/BA3MIEAI"},"agent_actions":{"view_html":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH","download_json":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH.json","view_paper":"https://pith.science/paper/BA3MIEAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1634&json=true","fetch_graph":"https://pith.science/api/pith-number/BA3MIEAIZAULLRXZYLQWI2ONYH/graph.json","fetch_events":"https://pith.science/api/pith-number/BA3MIEAIZAULLRXZYLQWI2ONYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/action/storage_attestation","attest_author":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/action/author_attestation","sign_citation":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/action/citation_signature","submit_replication":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/action/replication_record"}},"created_at":"2026-05-18T00:39:18.796912+00:00","updated_at":"2026-05-18T00:39:18.796912+00:00"}