{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XN4I2SA4QPS66N6Z2ITFFIQKPE","short_pith_number":"pith:XN4I2SA4","canonical_record":{"source":{"id":"2608.04985","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T15:57:19Z","cross_cats_sorted":[],"title_canon_sha256":"b3f4ea0cc39bda1354c4e40787f21407143b5a6a1e99ea3166fd50bbac587328","abstract_canon_sha256":"5badd655a73b6acd9d291107a102db61d173ccf64f8379dbaa048727c609214b"},"schema_version":"1.0"},"canonical_sha256":"bb788d481c83e5ef37d9d22652a20a79129ee091e5eafd58e474d0c406d2863a","source":{"kind":"arxiv","id":"2608.04985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04985","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04985v1","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04985","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"XN4I2SA4QPS6","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"pith_short_16","alias_value":"XN4I2SA4QPS66N6Z","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"pith_short_8","alias_value":"XN4I2SA4","created_at":"2026-08-06T01:47:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XN4I2SA4QPS66N6Z2ITFFIQKPE","target":"record","payload":{"canonical_record":{"source":{"id":"2608.04985","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T15:57:19Z","cross_cats_sorted":[],"title_canon_sha256":"b3f4ea0cc39bda1354c4e40787f21407143b5a6a1e99ea3166fd50bbac587328","abstract_canon_sha256":"5badd655a73b6acd9d291107a102db61d173ccf64f8379dbaa048727c609214b"},"schema_version":"1.0"},"canonical_sha256":"bb788d481c83e5ef37d9d22652a20a79129ee091e5eafd58e474d0c406d2863a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:47:59.901865Z","signature_b64":"f+zmqKHGxHMsMYMg/rcFicYj5yoUI9oTYqrN71jUdWDcgy35Ma66poLAd4XWIG8+EACS9yPmKRZxNphj3hiwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb788d481c83e5ef37d9d22652a20a79129ee091e5eafd58e474d0c406d2863a","last_reissued_at":"2026-08-06T01:47:59.900398Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:47:59.900398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.04985","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-06T01:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMSmlqOCslZahrP+ME7Ufe+DqtNSzHFqC6qjRXQLvcHP/u6k2BV8BUEmfARqwsH8o9etJvXm315Msg9f0qdOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:00:12.760872Z"},"content_sha256":"cc5387c6bd389d083ee642ce4ab39374eef94e2ae404035c7f93ce1771c3a1c9","schema_version":"1.0","event_id":"sha256:cc5387c6bd389d083ee642ce4ab39374eef94e2ae404035c7f93ce1771c3a1c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XN4I2SA4QPS66N6Z2ITFFIQKPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supersaturation of induced even cycles in locally sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam D\\v{z}avoronok, Alexander Mylet, Maria-Cristina Popa, Ole Gabsdil, Yinghan Andie Shao","submitted_at":"2026-08-05T15:57:19Z","abstract_excerpt":"A graph $\\Gamma$ is $(c,t)$-sparse for $c > 0$ and $t \\ge 1$ if for every pair of vertex subsets $A, B \\subseteq V(\\Gamma)$ with $|A|, |B| \\ge t$, the number of edges $e(A,B)$ between them satisfies $ e(A,B) \\le (1 - c)|A||B|$. In this paper, we prove that for every integer $\\ell\\ge2$, there are $\\varepsilon > 0, C, C' > 0$ such that if an $n$-vertex graph $\\Gamma$ is $(1-\\varepsilon,t)$-sparse for some $t$, and has at least $Ct^{1-1/\\ell}n^{1+1/\\ell}$ edges, then $\\Gamma$ contains at least $C'n^2t^{2\\ell-2}$ induced copies of $C_{2\\ell}$. This partially resolves a problem of Ding, Gao, Liu, L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04985","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/2608.04985/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-06T01:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCOw9NzPhJ8VAhom7a1OJ4AEEl0ezjhELXxKYt0+Kbhrc1HdRLpvRTv9Pv51sSoJ8mn1WLtk3piZUecFGRidAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:00:12.761376Z"},"content_sha256":"946b4af18eccbf37cd11a7cf206ca7e69c6b4dac47b959568037e78a32471051","schema_version":"1.0","event_id":"sha256:946b4af18eccbf37cd11a7cf206ca7e69c6b4dac47b959568037e78a32471051"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XN4I2SA4QPS66N6Z2ITFFIQKPE/bundle.json","state_url":"https://pith.science/pith/XN4I2SA4QPS66N6Z2ITFFIQKPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XN4I2SA4QPS66N6Z2ITFFIQKPE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T07:00:12Z","links":{"resolver":"https://pith.science/pith/XN4I2SA4QPS66N6Z2ITFFIQKPE","bundle":"https://pith.science/pith/XN4I2SA4QPS66N6Z2ITFFIQKPE/bundle.json","state":"https://pith.science/pith/XN4I2SA4QPS66N6Z2ITFFIQKPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XN4I2SA4QPS66N6Z2ITFFIQKPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XN4I2SA4QPS66N6Z2ITFFIQKPE","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":"5badd655a73b6acd9d291107a102db61d173ccf64f8379dbaa048727c609214b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T15:57:19Z","title_canon_sha256":"b3f4ea0cc39bda1354c4e40787f21407143b5a6a1e99ea3166fd50bbac587328"},"schema_version":"1.0","source":{"id":"2608.04985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04985","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04985v1","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04985","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"XN4I2SA4QPS6","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"pith_short_16","alias_value":"XN4I2SA4QPS66N6Z","created_at":"2026-08-06T01:47:59Z"},{"alias_kind":"pith_short_8","alias_value":"XN4I2SA4","created_at":"2026-08-06T01:47:59Z"}],"graph_snapshots":[{"event_id":"sha256:946b4af18eccbf37cd11a7cf206ca7e69c6b4dac47b959568037e78a32471051","target":"graph","created_at":"2026-08-06T01:47:59Z","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/2608.04985/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $\\Gamma$ is $(c,t)$-sparse for $c > 0$ and $t \\ge 1$ if for every pair of vertex subsets $A, B \\subseteq V(\\Gamma)$ with $|A|, |B| \\ge t$, the number of edges $e(A,B)$ between them satisfies $ e(A,B) \\le (1 - c)|A||B|$. In this paper, we prove that for every integer $\\ell\\ge2$, there are $\\varepsilon > 0, C, C' > 0$ such that if an $n$-vertex graph $\\Gamma$ is $(1-\\varepsilon,t)$-sparse for some $t$, and has at least $Ct^{1-1/\\ell}n^{1+1/\\ell}$ edges, then $\\Gamma$ contains at least $C'n^2t^{2\\ell-2}$ induced copies of $C_{2\\ell}$. This partially resolves a problem of Ding, Gao, Liu, L","authors_text":"Adam D\\v{z}avoronok, Alexander Mylet, Maria-Cristina Popa, Ole Gabsdil, Yinghan Andie Shao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T15:57:19Z","title":"Supersaturation of induced even cycles in locally sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04985","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:cc5387c6bd389d083ee642ce4ab39374eef94e2ae404035c7f93ce1771c3a1c9","target":"record","created_at":"2026-08-06T01:47:59Z","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":"5badd655a73b6acd9d291107a102db61d173ccf64f8379dbaa048727c609214b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T15:57:19Z","title_canon_sha256":"b3f4ea0cc39bda1354c4e40787f21407143b5a6a1e99ea3166fd50bbac587328"},"schema_version":"1.0","source":{"id":"2608.04985","kind":"arxiv","version":1}},"canonical_sha256":"bb788d481c83e5ef37d9d22652a20a79129ee091e5eafd58e474d0c406d2863a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb788d481c83e5ef37d9d22652a20a79129ee091e5eafd58e474d0c406d2863a","first_computed_at":"2026-08-06T01:47:59.900398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:47:59.900398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f+zmqKHGxHMsMYMg/rcFicYj5yoUI9oTYqrN71jUdWDcgy35Ma66poLAd4XWIG8+EACS9yPmKRZxNphj3hiwCA==","signature_status":"signed_v1","signed_at":"2026-08-06T01:47:59.901865Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc5387c6bd389d083ee642ce4ab39374eef94e2ae404035c7f93ce1771c3a1c9","sha256:946b4af18eccbf37cd11a7cf206ca7e69c6b4dac47b959568037e78a32471051"],"state_sha256":"d3a8fdec33f6a81894e2950e774b9df535bed07534c1f46501b80c81a835df69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqCfF/YgoHaohMUMNN7mjany6A4qmIzSBC10M6UI7j0O7fzwUnIALgp/MM3iPRfjjsIYMRyiCH/gbKBRFeWdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:00:12.764810Z","bundle_sha256":"5984704b1ba5b343ffd2bc1c228c4f94b4152e70d453885672eb74aafbfbcc31"}}