{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A6AKYNAMRZYAKOOKK3UF3VH6WR","short_pith_number":"pith:A6AKYNAM","schema_version":"1.0","canonical_sha256":"0780ac340c8e700539ca56e85dd4feb47d192d17dc204bb1d033b066fe7e7fb5","source":{"kind":"arxiv","id":"1707.06482","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'an number of an induced complete bipartite graph plus an odd cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","submitted_at":"2017-07-20T12:56:28Z","abstract_excerpt":"Let $k \\ge 2$ be an integer. We show that if $s = 2$ and $t \\ge 2$, or $s = t = 3$, then the maximum possible number of edges in a $C_{2k+1}$-free graph containing no induced copy of $K_{s,t}$ is asymptotically equal to $(t - s + 1)^{1/s}\\left(\\frac{n}{2}\\right)^{2-1/s}$ except when $k = s = t = 2$.\n  This strengthens a result of Allen, Keevash, Sudakov and Verstra\\\"{e}te and answers a question of Loh, Tait and Timmons."},"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":"1707.06482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-20T12:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"0c8ea76126b5850115c86593b52ee8b0e6f17c2c43c128e036c2f970cf9852ab","abstract_canon_sha256":"1a2a9eba713fb32660a7d0baf10d393649fe64742c5d72aabef0e3e13998fd01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:16.457870Z","signature_b64":"/r3JYKSqhH/ad5TydMAimehIpXI6EhpYo/HIpR5PWU5zz2pS94c7Gqy1FWYdgZtiIcoY5qkrD2vmj04Cshy+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0780ac340c8e700539ca56e85dd4feb47d192d17dc204bb1d033b066fe7e7fb5","last_reissued_at":"2026-05-17T23:50:16.457049Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:16.457049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an number of an induced complete bipartite graph plus an odd cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","submitted_at":"2017-07-20T12:56:28Z","abstract_excerpt":"Let $k \\ge 2$ be an integer. We show that if $s = 2$ and $t \\ge 2$, or $s = t = 3$, then the maximum possible number of edges in a $C_{2k+1}$-free graph containing no induced copy of $K_{s,t}$ is asymptotically equal to $(t - s + 1)^{1/s}\\left(\\frac{n}{2}\\right)^{2-1/s}$ except when $k = s = t = 2$.\n  This strengthens a result of Allen, Keevash, Sudakov and Verstra\\\"{e}te and answers a question of Loh, Tait and Timmons."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06482","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":""},"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":"1707.06482","created_at":"2026-05-17T23:50:16.457165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06482v1","created_at":"2026-05-17T23:50:16.457165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06482","created_at":"2026-05-17T23:50:16.457165+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6AKYNAMRZYA","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6AKYNAMRZYAKOOK","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6AKYNAM","created_at":"2026-05-18T12:31:05.417338+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/A6AKYNAMRZYAKOOKK3UF3VH6WR","json":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR.json","graph_json":"https://pith.science/api/pith-number/A6AKYNAMRZYAKOOKK3UF3VH6WR/graph.json","events_json":"https://pith.science/api/pith-number/A6AKYNAMRZYAKOOKK3UF3VH6WR/events.json","paper":"https://pith.science/paper/A6AKYNAM"},"agent_actions":{"view_html":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR","download_json":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR.json","view_paper":"https://pith.science/paper/A6AKYNAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06482&json=true","fetch_graph":"https://pith.science/api/pith-number/A6AKYNAMRZYAKOOKK3UF3VH6WR/graph.json","fetch_events":"https://pith.science/api/pith-number/A6AKYNAMRZYAKOOKK3UF3VH6WR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR/action/storage_attestation","attest_author":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR/action/author_attestation","sign_citation":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR/action/citation_signature","submit_replication":"https://pith.science/pith/A6AKYNAMRZYAKOOKK3UF3VH6WR/action/replication_record"}},"created_at":"2026-05-17T23:50:16.457165+00:00","updated_at":"2026-05-17T23:50:16.457165+00:00"}