{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E2JWU3DMOWRXDCV55QC5XRINGO","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"80b24e8f6e21c221ec2045ed29e64c740796c3ecb031d671f9fa278e3029194d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T00:01:19Z","title_canon_sha256":"b2b91fc7a4472c2af210cf73364ba738cde069bbefdec83d3dfa54bcd9089cd8"},"schema_version":"1.0","source":{"id":"2607.06869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06869","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06869v1","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06869","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"E2JWU3DMOWRX","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"E2JWU3DMOWRXDCV5","created_at":"2026-07-09T00:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"E2JWU3DM","created_at":"2026-07-09T00:19:31Z"}],"graph_snapshots":[{"event_id":"sha256:d2c8649b5504ef14aa570cdb6095abb17e0bdc2408a30bbf6e6ffc8d88567879","target":"graph","created_at":"2026-07-09T00:19:31Z","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.06869/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that for every $k \\in \\mathbb{N}$, every graph $G$ contains $k$ vertex-disjoint cycles of different lengths, or there exists a set $X \\subseteq V(G)$ with $|X| \\in \\mathcal{O}(k^6\\mathsf{polylog}(k))$ such that $G-X$ has at most $k-1$ cycle lengths.\n  We also prove analogous results for facial lengths of embedded graphs. Let $G$ be a graph with a closed 2-cell embedding $\\psi$ on a surface $\\Sigma$ of Euler genus $g$, let $c$ be a colouring of the faces $\\mathcal{F}(\\psi)$ of $\\psi$, and let $R(G,\\psi)$ be the radial graph of $(G, \\psi)$. Then there exist $k$ faces $F_1, \\ldots , F_k \\","authors_text":"Caleb McFarland, J. Pascal Gollin, Kevin Hendrey, Marek Soko{\\l}owski, Maximilian Gorsky, Meike Hatzel, Paul Wollan, Sebastian Wiederrecht, Tony Huynh","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T00:01:19Z","title":"An Erd\\H{o}s-P\\'osa theorem for cycles and faces of distinct lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06869","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:a068f10a779d1a545bb18631529df0966eaf4ca5ae0c8bcee8b97069961ae116","target":"record","created_at":"2026-07-09T00:19:31Z","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":"80b24e8f6e21c221ec2045ed29e64c740796c3ecb031d671f9fa278e3029194d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T00:01:19Z","title_canon_sha256":"b2b91fc7a4472c2af210cf73364ba738cde069bbefdec83d3dfa54bcd9089cd8"},"schema_version":"1.0","source":{"id":"2607.06869","kind":"arxiv","version":1}},"canonical_sha256":"26936a6c6c75a3718abdec05dbc50d33ae5619c561e1bea1c15b1954654e036c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26936a6c6c75a3718abdec05dbc50d33ae5619c561e1bea1c15b1954654e036c","first_computed_at":"2026-07-09T00:19:31.983299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T00:19:31.983299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1mD9eUHHIPqBiCHwdvp0BZuCyM1SnY9MiMZ2RFru0Zd2KR7zZm0klPeCsFC8C4xcZgXGbe2maXnGZIMwI2lMCg==","signature_status":"signed_v1","signed_at":"2026-07-09T00:19:31.983729Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.06869","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:5588ebfddaaa39a1dd786827d4c33b831538f27ab002b5dc32b974065639f1aa","sha256:5c2cdad198725249edf2956e08050e55578d6290b8376cbef929b4d912799648"]}],"invalid_events":[],"applied_event_ids":["sha256:a068f10a779d1a545bb18631529df0966eaf4ca5ae0c8bcee8b97069961ae116","sha256:d2c8649b5504ef14aa570cdb6095abb17e0bdc2408a30bbf6e6ffc8d88567879"],"state_sha256":"fb9c4399807ff61a417bae545c6c24ed3383e30f350d6c465bd185329757b36e"}