{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZHM64CXIKV5WAYNVVA6AAFZQBQ","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":"05801502db769fd95ea255f8b5c70baadb5b4e585bdddbbf17d723a31f542d4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-05T15:05:12Z","title_canon_sha256":"38ceeafe7481747a72cc3760d89a46a52ae1354bd4c1d8a979ac86ea72d9d968"},"schema_version":"1.0","source":{"id":"2607.04347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04347","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04347v1","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04347","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZHM64CXIKV5W","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"ZHM64CXIKV5WAYNV","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"ZHM64CXI","created_at":"2026-07-07T02:19:10Z"}],"graph_snapshots":[{"event_id":"sha256:5f76dfb85a4d31073103701f1131af8f7e22b314e88eb9c2640fbce992fe8548","target":"graph","created_at":"2026-07-07T02:19:10Z","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/2607.04347/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Starting from the stability theorem of Erd\\H{o}s and Simonovits, stability problems for graphs forbidding a fixed subgraph have been studied in terms of edge numbers, spectral radii and subgraph counts. Let $\\mathcal{N}(F,G)$ denote the number of unlabeled copies of $F$ in $G$. It is known that, for every fixed path $P_t$ and even cycle $C_{2a}$, the maximum number of copies in an $n$-vertex $C_{2\\ell+1}$-free graph is attained by the bipartite Tur\\'an graph $T_{n,2}$.\n  In this paper we obtain strong structural stability for $C_{2\\ell+1}$-free graphs in terms of copies of paths and even cycle","authors_text":"Xiamiao Zhao, Yuanpei Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04347","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:68dbfd3942a35e6b4025914b1ab5ee515c26f674cab0eb15107699a80a67b4fb","target":"record","created_at":"2026-07-07T02:19:10Z","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":"05801502db769fd95ea255f8b5c70baadb5b4e585bdddbbf17d723a31f542d4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-05T15:05:12Z","title_canon_sha256":"38ceeafe7481747a72cc3760d89a46a52ae1354bd4c1d8a979ac86ea72d9d968"},"schema_version":"1.0","source":{"id":"2607.04347","kind":"arxiv","version":1}},"canonical_sha256":"c9d9ee0ae8557b6061b5a83c0017300c3e3b0c2aed67c4fb0621cc5e72d77a37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9d9ee0ae8557b6061b5a83c0017300c3e3b0c2aed67c4fb0621cc5e72d77a37","first_computed_at":"2026-07-07T02:19:10.143873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:10.143873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o/tDO3tksgqQbKBX1OJCelD35E9f6eoLSmWvyHEtn0rFRY9Frh6te+PsLCpDvAk8jE1D9yVVfL2jc/G10VwKBg==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:10.144618Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68dbfd3942a35e6b4025914b1ab5ee515c26f674cab0eb15107699a80a67b4fb","sha256:5f76dfb85a4d31073103701f1131af8f7e22b314e88eb9c2640fbce992fe8548"],"state_sha256":"c691ae5fe768b07daa66de17c6ff5ddbfe6abd1b37a1babdf689dca265d5cc1a"}