{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BA3MIEAIZAULLRXZYLQWI2ONYH","short_pith_number":"pith:BA3MIEAI","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"},"canonical_sha256":"0836c41008c828b5c6f9c2e16469cdc1cc0e881ec31341a046036843b79c9a78","source":{"kind":"arxiv","id":"1102.1634","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1634","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1634v4","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1634","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"BA3MIEAIZAUL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BA3MIEAIZAULLRXZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BA3MIEAI","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BA3MIEAIZAULLRXZYLQWI2ONYH","target":"record","payload":{"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"},"canonical_sha256":"0836c41008c828b5c6f9c2e16469cdc1cc0e881ec31341a046036843b79c9a78","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"},"source_kind":"arxiv","source_id":"1102.1634","source_version":4,"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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2TxdB8IJAU8LM7cVqR8iyjUoTn+XuqEsKZkLKaoXMWmdK36UeAC3YOQUgm3qkwG33VFer1AO9zrun5eRAY9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:49:17.357013Z"},"content_sha256":"68457c32c28005639aa13d33bc819ccfe93646e508b64e4976797e2bd58a9628","schema_version":"1.0","event_id":"sha256:68457c32c28005639aa13d33bc819ccfe93646e508b64e4976797e2bd58a9628"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BA3MIEAIZAULLRXZYLQWI2ONYH","target":"graph","payload":{"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"},"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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/RDL/FcTsZsxErjODKPJSBt9c4q6nojwPcTwAA+PnThUkGpmNpoiZave5TWV49axtPaohmxU8m/Fds43AxhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:49:17.357377Z"},"content_sha256":"9d6151fec152668d3cf0420e075d80f2ef931ffda6a8cac40e593d73850ecd29","schema_version":"1.0","event_id":"sha256:9d6151fec152668d3cf0420e075d80f2ef931ffda6a8cac40e593d73850ecd29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/bundle.json","state_url":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/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-30T00:49:17Z","links":{"resolver":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH","bundle":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/bundle.json","state":"https://pith.science/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BA3MIEAIZAULLRXZYLQWI2ONYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BA3MIEAIZAULLRXZYLQWI2ONYH","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":"a84023885a4508f1101c9056c2bf6518352bb910f21b9dbe14baa237bf930bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T16:03:59Z","title_canon_sha256":"027c3f660855e331b2b196f8a111fb2f6066664770528cb982bef3d61aa93fd6"},"schema_version":"1.0","source":{"id":"1102.1634","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1634","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1634v4","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1634","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"BA3MIEAIZAUL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BA3MIEAIZAULLRXZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BA3MIEAI","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:9d6151fec152668d3cf0420e075d80f2ef931ffda6a8cac40e593d73850ecd29","target":"graph","created_at":"2026-05-18T00:39:18Z","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":"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.","authors_text":"Alexander Razborov, Daniel Kr\\'al, Hamed Hatami, Jan Hladk\\'y, Serguei Norine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T16:03:59Z","title":"On the Number of Pentagons in Triangle-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1634","kind":"arxiv","version":4},"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:68457c32c28005639aa13d33bc819ccfe93646e508b64e4976797e2bd58a9628","target":"record","created_at":"2026-05-18T00:39:18Z","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":"a84023885a4508f1101c9056c2bf6518352bb910f21b9dbe14baa237bf930bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T16:03:59Z","title_canon_sha256":"027c3f660855e331b2b196f8a111fb2f6066664770528cb982bef3d61aa93fd6"},"schema_version":"1.0","source":{"id":"1102.1634","kind":"arxiv","version":4}},"canonical_sha256":"0836c41008c828b5c6f9c2e16469cdc1cc0e881ec31341a046036843b79c9a78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0836c41008c828b5c6f9c2e16469cdc1cc0e881ec31341a046036843b79c9a78","first_computed_at":"2026-05-18T00:39:18.796739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:18.796739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rv++SlV4AQPDEQRovEKArQBQBbhGBnXn3w2L/q8bRB3+ruI7SsQ2aLVATCZ2GbddnavGTtam83rVP5hY8GqCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:18.797490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1634","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68457c32c28005639aa13d33bc819ccfe93646e508b64e4976797e2bd58a9628","sha256:9d6151fec152668d3cf0420e075d80f2ef931ffda6a8cac40e593d73850ecd29"],"state_sha256":"6605a5367da0bff9649e06893de7f9d95a0bd8adff8328536f714fe83b1595bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BirHGWaM4gr9SjlStsRU2ocJ4YO6YJwp/EJWP8PVkHQ2EKh6QA4lBTTTi6vTIrGzbf0njZ4+QydxAxGyinyyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:49:17.359710Z","bundle_sha256":"1baacba3e0d34e254aeb8112cc13f780db897aea64320b0318bd8fdc68932a5e"}}