{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BKXW43TEOSTFWTFYTTHP5BEBP3","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":"e296dd70dbf3ce24c29e15e8db151d349aba212c0b35aef9eadd7e0cd3e931f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T23:06:39Z","title_canon_sha256":"21d8cebcc82aa58d10655a5fae620a97b23594671707343ddbca62797b69a122"},"schema_version":"1.0","source":{"id":"1811.11873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11873","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11873v1","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11873","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"BKXW43TEOSTF","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BKXW43TEOSTFWTFY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BKXW43TE","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:7d69a9ace1bfcaad8df378dd5d53944d57617a9676847961205eaf93fca52103","target":"graph","created_at":"2026-05-17T23:59:37Z","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":"We introduce a new approach and prove that the maximum number of triangles in a $C_5$-free graph on $n$ vertices is at most $$(1 + o(1)) \\frac{1}{3 \\sqrt 2} n^{3/2}.$$ We also show a connection to $r$-uniform hypergraphs without (Berge) cycles of length less than six, and estimate their maximum possible size.","authors_text":"Abhishek Methuku, Beka Ergemlidze","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T23:06:39Z","title":"Triangles in $C_5$-free graphs and Hypergraphs of Girth Six"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11873","kind":"arxiv","version":1},"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:ae52806bc071900cfe822d17ae3f4a2718a8a0f2c0d266c3d545b94332553fa0","target":"record","created_at":"2026-05-17T23:59:37Z","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":"e296dd70dbf3ce24c29e15e8db151d349aba212c0b35aef9eadd7e0cd3e931f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T23:06:39Z","title_canon_sha256":"21d8cebcc82aa58d10655a5fae620a97b23594671707343ddbca62797b69a122"},"schema_version":"1.0","source":{"id":"1811.11873","kind":"arxiv","version":1}},"canonical_sha256":"0aaf6e6e6474a65b4cb89ccefe84817ef0f83c92941ec1030460c2fa4645090d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0aaf6e6e6474a65b4cb89ccefe84817ef0f83c92941ec1030460c2fa4645090d","first_computed_at":"2026-05-17T23:59:37.354215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:37.354215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbvS1blQ97mgfoXBG91Z4lG1nxzkDAyGlB2ZiVp01biYG7TIbbsrvO9Jrj3cVjDnlH+KZU/2H1Y5T1vPutDCDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:37.354916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae52806bc071900cfe822d17ae3f4a2718a8a0f2c0d266c3d545b94332553fa0","sha256:7d69a9ace1bfcaad8df378dd5d53944d57617a9676847961205eaf93fca52103"],"state_sha256":"af15fdf053b65d399f82d8b2e21d0f7db85639fd3c3ca9206621906f931523b9"}