{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C6PG6P2SH5OMFE7V2LUVFZ2YC6","short_pith_number":"pith:C6PG6P2S","schema_version":"1.0","canonical_sha256":"179e6f3f523f5cc293f5d2e952e75817a447c6cf9793a0a099912572649bb315","source":{"kind":"arxiv","id":"1710.07664","version":2},"attestation_state":"computed","paper":{"title":"On the Tur\\'an number of some ordered even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Kor\\'andi, Ervin Gy\\H{o}ri, Istv\\'an Tomon, M\\'at\\'e Vizer","submitted_at":"2017-10-20T18:46:16Z","abstract_excerpt":"A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for $k=2,3,5$.\n  In this paper we study ordered variants of this problem and prove some tight estimates for a certain class of ordered cycles that we call bordered cycles. In particular, we show that the maximum number of edges in an ordered graph avoiding bordered cycles of length at most $2k$ is $\\Theta(n^{1+1/k})$.\n  Strengthening the result of Bondy and Simonovits i"},"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":"1710.07664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-20T18:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"c83fc4c79a8a0e5e89e284c16895c7fa3a4af9df86b6520b766f46669a1b45e5","abstract_canon_sha256":"600173b8d66d13b8f686a5ae7bfd215b76375198c997a52149fd47bd5c6a8e24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:39.010635Z","signature_b64":"YGaOwQCHeMAOpwoYi/qqYEx+NxC7cRPrrA0jWAvK8DSeyWS/Yh5pj/MQLRE2ngdEcyU8SdIe10RRxCH2el4IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"179e6f3f523f5cc293f5d2e952e75817a447c6cf9793a0a099912572649bb315","last_reissued_at":"2026-05-18T00:10:39.008799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:39.008799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Tur\\'an number of some ordered even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Kor\\'andi, Ervin Gy\\H{o}ri, Istv\\'an Tomon, M\\'at\\'e Vizer","submitted_at":"2017-10-20T18:46:16Z","abstract_excerpt":"A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for $k=2,3,5$.\n  In this paper we study ordered variants of this problem and prove some tight estimates for a certain class of ordered cycles that we call bordered cycles. In particular, we show that the maximum number of edges in an ordered graph avoiding bordered cycles of length at most $2k$ is $\\Theta(n^{1+1/k})$.\n  Strengthening the result of Bondy and Simonovits i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07664","kind":"arxiv","version":2},"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":"1710.07664","created_at":"2026-05-18T00:10:39.010066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07664v2","created_at":"2026-05-18T00:10:39.010066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07664","created_at":"2026-05-18T00:10:39.010066+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6PG6P2SH5OM","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6PG6P2SH5OMFE7V","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6PG6P2S","created_at":"2026-05-18T12:31:08.081275+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/C6PG6P2SH5OMFE7V2LUVFZ2YC6","json":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6.json","graph_json":"https://pith.science/api/pith-number/C6PG6P2SH5OMFE7V2LUVFZ2YC6/graph.json","events_json":"https://pith.science/api/pith-number/C6PG6P2SH5OMFE7V2LUVFZ2YC6/events.json","paper":"https://pith.science/paper/C6PG6P2S"},"agent_actions":{"view_html":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6","download_json":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6.json","view_paper":"https://pith.science/paper/C6PG6P2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07664&json=true","fetch_graph":"https://pith.science/api/pith-number/C6PG6P2SH5OMFE7V2LUVFZ2YC6/graph.json","fetch_events":"https://pith.science/api/pith-number/C6PG6P2SH5OMFE7V2LUVFZ2YC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/action/storage_attestation","attest_author":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/action/author_attestation","sign_citation":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/action/citation_signature","submit_replication":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/action/replication_record"}},"created_at":"2026-05-18T00:10:39.010066+00:00","updated_at":"2026-05-18T00:10:39.010066+00:00"}