{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IVO5GEZYIQLE4FJKLYVXEO4WSL","short_pith_number":"pith:IVO5GEZY","schema_version":"1.0","canonical_sha256":"455dd3133844164e152a5e2b723b9692c36a17e22b7489cc316501b0b77ee087","source":{"kind":"arxiv","id":"2308.16163","version":1},"attestation_state":"computed","paper":{"title":"The extremal number of cycles with all diagonals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Benny Sudakov, Domagoj Brada\\v{c}","submitted_at":"2023-08-30T17:32:57Z","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"},"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":"2308.16163","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T17:32:57Z","cross_cats_sorted":[],"title_canon_sha256":"483229bcea40e6d4874a74a6affaec19804a2279dc2a19d3d6cdf4afe660bfa9","abstract_canon_sha256":"7bd005f83fd29f9c5e688fa2d99bcc4525474ca701f57ca42b3a59a3836054ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:19.090474Z","signature_b64":"iinszE7W7sgk4RcvlgfSeAJtk2LMtZL7N4IA87J+abpKWRfC21ykwq3epYdBlEp9EnVAgJz8+Oyj6kC+UV3WDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455dd3133844164e152a5e2b723b9692c36a17e22b7489cc316501b0b77ee087","last_reissued_at":"2026-07-05T06:46:19.089875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:19.089875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The extremal number of cycles with all diagonals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Benny Sudakov, Domagoj Brada\\v{c}","submitted_at":"2023-08-30T17:32:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16163","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.16163/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.16163","created_at":"2026-07-05T06:46:19.089954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.16163v1","created_at":"2026-07-05T06:46:19.089954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16163","created_at":"2026-07-05T06:46:19.089954+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVO5GEZYIQLE","created_at":"2026-07-05T06:46:19.089954+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVO5GEZYIQLE4FJK","created_at":"2026-07-05T06:46:19.089954+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVO5GEZY","created_at":"2026-07-05T06:46:19.089954+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/IVO5GEZYIQLE4FJKLYVXEO4WSL","json":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL.json","graph_json":"https://pith.science/api/pith-number/IVO5GEZYIQLE4FJKLYVXEO4WSL/graph.json","events_json":"https://pith.science/api/pith-number/IVO5GEZYIQLE4FJKLYVXEO4WSL/events.json","paper":"https://pith.science/paper/IVO5GEZY"},"agent_actions":{"view_html":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL","download_json":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL.json","view_paper":"https://pith.science/paper/IVO5GEZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.16163&json=true","fetch_graph":"https://pith.science/api/pith-number/IVO5GEZYIQLE4FJKLYVXEO4WSL/graph.json","fetch_events":"https://pith.science/api/pith-number/IVO5GEZYIQLE4FJKLYVXEO4WSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL/action/storage_attestation","attest_author":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL/action/author_attestation","sign_citation":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL/action/citation_signature","submit_replication":"https://pith.science/pith/IVO5GEZYIQLE4FJKLYVXEO4WSL/action/replication_record"}},"created_at":"2026-07-05T06:46:19.089954+00:00","updated_at":"2026-07-05T06:46:19.089954+00:00"}