{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5ISVCRRA66OR5F4CLZREMGLRSL","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":"974f8eb4478efc873d81f3df6dfcf603993504ca0a136fae62bcbc6a754aa3a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T01:52:08Z","title_canon_sha256":"44c3faec7b8440de52c58b69de55c2e7cbc914b561ffd2d4e1497707f2b5e041"},"schema_version":"1.0","source":{"id":"2608.06698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06698","created_at":"2026-08-10T01:11:44Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06698v1","created_at":"2026-08-10T01:11:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06698","created_at":"2026-08-10T01:11:44Z"},{"alias_kind":"pith_short_12","alias_value":"5ISVCRRA66OR","created_at":"2026-08-10T01:11:44Z"},{"alias_kind":"pith_short_16","alias_value":"5ISVCRRA66OR5F4C","created_at":"2026-08-10T01:11:44Z"},{"alias_kind":"pith_short_8","alias_value":"5ISVCRRA","created_at":"2026-08-10T01:11:44Z"}],"graph_snapshots":[{"event_id":"sha256:da5d39749e62f32ea8a049c391bb7f728647441140b369f1c97989d76b8697cf","target":"graph","created_at":"2026-08-10T01:11:44Z","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.06698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study graphs containing no cycle whose length is divisible by $3$ or congruent to $4$ modulo $6$. We prove that every such $n$-vertex graph $G$, where $n \\ge 2$, satisfies $e(G) \\le (11/8)n-7/4$. Moreover, equality holds if and only if $n=8k+2$ for some nonnegative integer $k$ and $G$ is isomorphic to the explicitly constructed graph $H_k$. We also construct, for every $n\\geq2$, an $n$-vertex graph with $\\left\\lfloor (11/8)n-7/4 \\right\\rfloor$ edges satisfying the same cycle restriction. Consequently, this is the exact maximum number of edges for every $n \\ge 2$.","authors_text":"Takahiro Ueoro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06698","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:50f3de6115bf9f4985c3382581a073138d3217c00a410586a1e422d8aa69ca39","target":"record","created_at":"2026-08-10T01:11:44Z","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":"974f8eb4478efc873d81f3df6dfcf603993504ca0a136fae62bcbc6a754aa3a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T01:52:08Z","title_canon_sha256":"44c3faec7b8440de52c58b69de55c2e7cbc914b561ffd2d4e1497707f2b5e041"},"schema_version":"1.0","source":{"id":"2608.06698","kind":"arxiv","version":1}},"canonical_sha256":"ea25514620f79d1e97825e6246197192c145240a41e9082077757d9878039bfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea25514620f79d1e97825e6246197192c145240a41e9082077757d9878039bfd","first_computed_at":"2026-08-10T01:11:44.632580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:11:44.632580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4LVvSeus1QYa1Z48Vwdd2dtk1eWQ65w4v/u+hmHiBreEfiyiXywhnhewbByXxwMmPx5e1/Rct8Kfqw9od3p4Cg==","signature_status":"signed_v1","signed_at":"2026-08-10T01:11:44.635014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.06698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50f3de6115bf9f4985c3382581a073138d3217c00a410586a1e422d8aa69ca39","sha256:da5d39749e62f32ea8a049c391bb7f728647441140b369f1c97989d76b8697cf"],"state_sha256":"79eaeb66fc8ac78b02430e01ad32c7ab6e8991984e63341c585ef08bce353971"}