{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AC4UUCXIDF6IMZXN3XT2F56IQA","short_pith_number":"pith:AC4UUCXI","schema_version":"1.0","canonical_sha256":"00b94a0ae8197c8666eddde7a2f7c8803dc0f48d7cbd47fd304c654df4724802","source":{"kind":"arxiv","id":"2411.12659","version":1},"attestation_state":"computed","paper":{"title":"Induced even cycles in locally sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bingyu Luan, Hong Liu, Jun Gao, Laihao Ding, Shumin Sun","submitted_at":"2024-11-19T17:07:29Z","abstract_excerpt":"A graph $G$ is $(c,t)$-sparse if for every pair of vertex subsets $A,B\\subset V(G)$ with $|A|,|B|\\geq t$, $e(A,B)\\leq (1-c)|A||B|$. In this paper we prove that for every $c>0$ and integer $\\ell$, there exists $C>1$ such that if an $n$-vertex graph $G$ is $(c,t)$-sparse for some $t$, and has at least $C t^{1-1/\\ell}n^{1+1/\\ell}$ edges, then $G$ contains an induced copy of $C_{2\\ell}$. This resolves a conjecture of Fox, Nenadov and Pham."},"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":"2411.12659","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T17:07:29Z","cross_cats_sorted":[],"title_canon_sha256":"f0bf0a3028cf266c9741640a1ab7b455f8c0a8874d6a889b6a921fecbafb43a1","abstract_canon_sha256":"8ecc1d8b9ad2d9e3a060688b6b5490a362838901c8f6e3ef93e105ba15f98854"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:46.255658Z","signature_b64":"ik68pJ6clxb58k2hQypmyNyWK+V1JBBh22hgSrXe4uM/ofZk7uGo/EdbiW8OtAHPFvTgedwM4XB6xju2/f8WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00b94a0ae8197c8666eddde7a2f7c8803dc0f48d7cbd47fd304c654df4724802","last_reissued_at":"2026-07-05T09:37:46.255144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:46.255144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced even cycles in locally sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bingyu Luan, Hong Liu, Jun Gao, Laihao Ding, Shumin Sun","submitted_at":"2024-11-19T17:07:29Z","abstract_excerpt":"A graph $G$ is $(c,t)$-sparse if for every pair of vertex subsets $A,B\\subset V(G)$ with $|A|,|B|\\geq t$, $e(A,B)\\leq (1-c)|A||B|$. In this paper we prove that for every $c>0$ and integer $\\ell$, there exists $C>1$ such that if an $n$-vertex graph $G$ is $(c,t)$-sparse for some $t$, and has at least $C t^{1-1/\\ell}n^{1+1/\\ell}$ edges, then $G$ contains an induced copy of $C_{2\\ell}$. This resolves a conjecture of Fox, Nenadov and Pham."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12659","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/2411.12659/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":"2411.12659","created_at":"2026-07-05T09:37:46.255208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.12659v1","created_at":"2026-07-05T09:37:46.255208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12659","created_at":"2026-07-05T09:37:46.255208+00:00"},{"alias_kind":"pith_short_12","alias_value":"AC4UUCXIDF6I","created_at":"2026-07-05T09:37:46.255208+00:00"},{"alias_kind":"pith_short_16","alias_value":"AC4UUCXIDF6IMZXN","created_at":"2026-07-05T09:37:46.255208+00:00"},{"alias_kind":"pith_short_8","alias_value":"AC4UUCXI","created_at":"2026-07-05T09:37:46.255208+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/AC4UUCXIDF6IMZXN3XT2F56IQA","json":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA.json","graph_json":"https://pith.science/api/pith-number/AC4UUCXIDF6IMZXN3XT2F56IQA/graph.json","events_json":"https://pith.science/api/pith-number/AC4UUCXIDF6IMZXN3XT2F56IQA/events.json","paper":"https://pith.science/paper/AC4UUCXI"},"agent_actions":{"view_html":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA","download_json":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA.json","view_paper":"https://pith.science/paper/AC4UUCXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.12659&json=true","fetch_graph":"https://pith.science/api/pith-number/AC4UUCXIDF6IMZXN3XT2F56IQA/graph.json","fetch_events":"https://pith.science/api/pith-number/AC4UUCXIDF6IMZXN3XT2F56IQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA/action/storage_attestation","attest_author":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA/action/author_attestation","sign_citation":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA/action/citation_signature","submit_replication":"https://pith.science/pith/AC4UUCXIDF6IMZXN3XT2F56IQA/action/replication_record"}},"created_at":"2026-07-05T09:37:46.255208+00:00","updated_at":"2026-07-05T09:37:46.255208+00:00"}