{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IVO5GEZYIQLE4FJKLYVXEO4WSL","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":"7bd005f83fd29f9c5e688fa2d99bcc4525474ca701f57ca42b3a59a3836054ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T17:32:57Z","title_canon_sha256":"483229bcea40e6d4874a74a6affaec19804a2279dc2a19d3d6cdf4afe660bfa9"},"schema_version":"1.0","source":{"id":"2308.16163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.16163","created_at":"2026-07-05T06:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"2308.16163v1","created_at":"2026-07-05T06:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16163","created_at":"2026-07-05T06:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"IVO5GEZYIQLE","created_at":"2026-07-05T06:46:19Z"},{"alias_kind":"pith_short_16","alias_value":"IVO5GEZYIQLE4FJK","created_at":"2026-07-05T06:46:19Z"},{"alias_kind":"pith_short_8","alias_value":"IVO5GEZY","created_at":"2026-07-05T06:46:19Z"}],"graph_snapshots":[{"event_id":"sha256:24a772f9f29c1a9c98703164202bb46e5ac6b1e772c98cf144f0e80ae990c093","target":"graph","created_at":"2026-07-05T06:46:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.16163/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1975, Erd\\H{o}s asked the following natural question: What is the maximum number of edges that an $n$-vertex graph can have without containing a cycle with all diagonals? Erd\\H{o}s observed that the upper bound $O(n^{5/3})$ holds since the complete bipartite graph $K_{3,3}$ can be viewed as a cycle of length six with all diagonals.\n  In this paper, we resolve this old problem. We prove that there exists a constant $C$ such that every $n$-vertex with $Cn^{3/2}$ edges contains a cycle with all diagonals. Since any cycle with all diagonals contains cycles of length four, this bound is best pos","authors_text":"Abhishek Methuku, Benny Sudakov, Domagoj Brada\\v{c}","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T17:32:57Z","title":"The extremal number of cycles with all diagonals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16163","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:ea9219ebc0557fc9409149d7629c7d981370e140d8f7ff6dae06e1f1f427aab0","target":"record","created_at":"2026-07-05T06:46:19Z","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":"7bd005f83fd29f9c5e688fa2d99bcc4525474ca701f57ca42b3a59a3836054ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T17:32:57Z","title_canon_sha256":"483229bcea40e6d4874a74a6affaec19804a2279dc2a19d3d6cdf4afe660bfa9"},"schema_version":"1.0","source":{"id":"2308.16163","kind":"arxiv","version":1}},"canonical_sha256":"455dd3133844164e152a5e2b723b9692c36a17e22b7489cc316501b0b77ee087","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"455dd3133844164e152a5e2b723b9692c36a17e22b7489cc316501b0b77ee087","first_computed_at":"2026-07-05T06:46:19.089875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:46:19.089875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iinszE7W7sgk4RcvlgfSeAJtk2LMtZL7N4IA87J+abpKWRfC21ykwq3epYdBlEp9EnVAgJz8+Oyj6kC+UV3WDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:46:19.090474Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.16163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea9219ebc0557fc9409149d7629c7d981370e140d8f7ff6dae06e1f1f427aab0","sha256:24a772f9f29c1a9c98703164202bb46e5ac6b1e772c98cf144f0e80ae990c093"],"state_sha256":"c8b6966a058294dab684a4bda825a55ffc48be767c58c29459ec592eb858ab9c"}