{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SZWGY5KXITOWR67WZSNHRNK5HP","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":"bcf1fe5a074d9513ccfafffd77ed3a6a55b2a5e98190f7e5a86951ecdfb009b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T05:32:45Z","title_canon_sha256":"2ad96fdef11f30cb55668c25a4aed248ad35daec4176a4e0a3c7a6787e1a8ae2"},"schema_version":"1.0","source":{"id":"2507.12798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12798","created_at":"2026-07-05T11:38:39Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12798v1","created_at":"2026-07-05T11:38:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12798","created_at":"2026-07-05T11:38:39Z"},{"alias_kind":"pith_short_12","alias_value":"SZWGY5KXITOW","created_at":"2026-07-05T11:38:39Z"},{"alias_kind":"pith_short_16","alias_value":"SZWGY5KXITOWR67W","created_at":"2026-07-05T11:38:39Z"},{"alias_kind":"pith_short_8","alias_value":"SZWGY5KX","created_at":"2026-07-05T11:38:39Z"}],"graph_snapshots":[{"event_id":"sha256:247de83ed5105a1bc0def6a7c3634076795809b3d467094cb9ff5022f5fe554c","target":"graph","created_at":"2026-07-05T11:38:39Z","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/2507.12798/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For two integers $k$ and $\\ell$, an $(\\ell \\text{ mod }k)$-cycle means a cycle of length $m$ such that $m\\equiv \\ell\\pmod{k}$. In 1977, Bollob\\'{a}s proved a conjecture of Burr and Erd\\H{o}s by showing that if $\\ell$ is even or $k$ is odd, then every $n$-vertex graph containing no $(\\ell \\text{ mod }k)$-cycles has at most a linear number of edges in terms of $n$. Since then, determining the exact extremal bounds for graphs without $(\\ell \\text{ mod }k)$-cycles has emerged as an interesting question in extremal graph theory, though the exact values are known only for a few integers $\\ell$ and $","authors_text":"Boram Park, Hojin Chu, Homoon Ryu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12798","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:752fe8bbcf55b7200871845259446ae181796b56b264052b1c27a5dc9458053a","target":"record","created_at":"2026-07-05T11:38:39Z","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":"bcf1fe5a074d9513ccfafffd77ed3a6a55b2a5e98190f7e5a86951ecdfb009b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T05:32:45Z","title_canon_sha256":"2ad96fdef11f30cb55668c25a4aed248ad35daec4176a4e0a3c7a6787e1a8ae2"},"schema_version":"1.0","source":{"id":"2507.12798","kind":"arxiv","version":1}},"canonical_sha256":"966c6c755744dd68fbf6cc9a78b55d3bde315c22c87d7d5f10f74ad041f2c746","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"966c6c755744dd68fbf6cc9a78b55d3bde315c22c87d7d5f10f74ad041f2c746","first_computed_at":"2026-07-05T11:38:39.403382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:39.403382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q9rHQThKZTmA+NMIVE1/J7TUIaHx/gI5CffB5dbLeyfWnCQNVUL47U/2VKxcPQQSTapkP9w2j3xuCd1jY/PfAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:39.403903Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.12798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:752fe8bbcf55b7200871845259446ae181796b56b264052b1c27a5dc9458053a","sha256:247de83ed5105a1bc0def6a7c3634076795809b3d467094cb9ff5022f5fe554c"],"state_sha256":"663984a167beedbfe24d8e4e29b054ef4398da5f6de27e919cdfdfbfabf6ccc8"}