{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AC4UUCXIDF6IMZXN3XT2F56IQA","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":"8ecc1d8b9ad2d9e3a060688b6b5490a362838901c8f6e3ef93e105ba15f98854","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T17:07:29Z","title_canon_sha256":"f0bf0a3028cf266c9741640a1ab7b455f8c0a8874d6a889b6a921fecbafb43a1"},"schema_version":"1.0","source":{"id":"2411.12659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12659","created_at":"2026-07-05T09:37:46Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12659v1","created_at":"2026-07-05T09:37:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12659","created_at":"2026-07-05T09:37:46Z"},{"alias_kind":"pith_short_12","alias_value":"AC4UUCXIDF6I","created_at":"2026-07-05T09:37:46Z"},{"alias_kind":"pith_short_16","alias_value":"AC4UUCXIDF6IMZXN","created_at":"2026-07-05T09:37:46Z"},{"alias_kind":"pith_short_8","alias_value":"AC4UUCXI","created_at":"2026-07-05T09:37:46Z"}],"graph_snapshots":[{"event_id":"sha256:94c15e1013076fbd75ed16836fab246e4f5779a4a5bbf325a6b594ddcd9d503d","target":"graph","created_at":"2026-07-05T09:37:46Z","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/2411.12659/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Bingyu Luan, Hong Liu, Jun Gao, Laihao Ding, Shumin Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T17:07:29Z","title":"Induced even cycles in locally sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12659","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:0cf579e772018f7370a711fc3e873b5fb3ee8273f53384ef0783812b18bccf0a","target":"record","created_at":"2026-07-05T09:37:46Z","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":"8ecc1d8b9ad2d9e3a060688b6b5490a362838901c8f6e3ef93e105ba15f98854","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-19T17:07:29Z","title_canon_sha256":"f0bf0a3028cf266c9741640a1ab7b455f8c0a8874d6a889b6a921fecbafb43a1"},"schema_version":"1.0","source":{"id":"2411.12659","kind":"arxiv","version":1}},"canonical_sha256":"00b94a0ae8197c8666eddde7a2f7c8803dc0f48d7cbd47fd304c654df4724802","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00b94a0ae8197c8666eddde7a2f7c8803dc0f48d7cbd47fd304c654df4724802","first_computed_at":"2026-07-05T09:37:46.255144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:46.255144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ik68pJ6clxb58k2hQypmyNyWK+V1JBBh22hgSrXe4uM/ofZk7uGo/EdbiW8OtAHPFvTgedwM4XB6xju2/f8WBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:46.255658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.12659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cf579e772018f7370a711fc3e873b5fb3ee8273f53384ef0783812b18bccf0a","sha256:94c15e1013076fbd75ed16836fab246e4f5779a4a5bbf325a6b594ddcd9d503d"],"state_sha256":"8cd74cc67c6ed2d7bceb2b5c16bd7a9afaff94a5e61058ac3e755c771d8709b0"}