{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SZWGY5KXITOWR67WZSNHRNK5HP","short_pith_number":"pith:SZWGY5KX","schema_version":"1.0","canonical_sha256":"966c6c755744dd68fbf6cc9a78b55d3bde315c22c87d7d5f10f74ad041f2c746","source":{"kind":"arxiv","id":"2507.12798","version":1},"attestation_state":"computed","paper":{"title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Hojin Chu, Homoon Ryu","submitted_at":"2025-07-17T05:32:45Z","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 $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.12798","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T05:32:45Z","cross_cats_sorted":[],"title_canon_sha256":"2ad96fdef11f30cb55668c25a4aed248ad35daec4176a4e0a3c7a6787e1a8ae2","abstract_canon_sha256":"bcf1fe5a074d9513ccfafffd77ed3a6a55b2a5e98190f7e5a86951ecdfb009b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:39.403903Z","signature_b64":"q9rHQThKZTmA+NMIVE1/J7TUIaHx/gI5CffB5dbLeyfWnCQNVUL47U/2VKxcPQQSTapkP9w2j3xuCd1jY/PfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"966c6c755744dd68fbf6cc9a78b55d3bde315c22c87d7d5f10f74ad041f2c746","last_reissued_at":"2026-07-05T11:38:39.403382Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:39.403382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Hojin Chu, Homoon Ryu","submitted_at":"2025-07-17T05:32:45Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12798","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/2507.12798/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.12798","created_at":"2026-07-05T11:38:39.403440+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12798v1","created_at":"2026-07-05T11:38:39.403440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12798","created_at":"2026-07-05T11:38:39.403440+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZWGY5KXITOW","created_at":"2026-07-05T11:38:39.403440+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZWGY5KXITOWR67W","created_at":"2026-07-05T11:38:39.403440+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZWGY5KX","created_at":"2026-07-05T11:38:39.403440+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02356","citing_title":"On 2-connected graphs without cycles of length 1 modulo 3","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02731","citing_title":"Existence of cycles of length divisible by 3 or 4","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP","json":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP.json","graph_json":"https://pith.science/api/pith-number/SZWGY5KXITOWR67WZSNHRNK5HP/graph.json","events_json":"https://pith.science/api/pith-number/SZWGY5KXITOWR67WZSNHRNK5HP/events.json","paper":"https://pith.science/paper/SZWGY5KX"},"agent_actions":{"view_html":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP","download_json":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP.json","view_paper":"https://pith.science/paper/SZWGY5KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12798&json=true","fetch_graph":"https://pith.science/api/pith-number/SZWGY5KXITOWR67WZSNHRNK5HP/graph.json","fetch_events":"https://pith.science/api/pith-number/SZWGY5KXITOWR67WZSNHRNK5HP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP/action/storage_attestation","attest_author":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP/action/author_attestation","sign_citation":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP/action/citation_signature","submit_replication":"https://pith.science/pith/SZWGY5KXITOWR67WZSNHRNK5HP/action/replication_record"}},"created_at":"2026-07-05T11:38:39.403440+00:00","updated_at":"2026-07-05T11:38:39.403440+00:00"}