{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5ISVCRRA66OR5F4CLZREMGLRSL","short_pith_number":"pith:5ISVCRRA","schema_version":"1.0","canonical_sha256":"ea25514620f79d1e97825e6246197192c145240a41e9082077757d9878039bfd","source":{"kind":"arxiv","id":"2608.06698","version":1},"attestation_state":"computed","paper":{"title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Takahiro Ueoro","submitted_at":"2026-08-07T01:52:08Z","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$."},"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":"2608.06698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-07T01:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"44c3faec7b8440de52c58b69de55c2e7cbc914b561ffd2d4e1497707f2b5e041","abstract_canon_sha256":"974f8eb4478efc873d81f3df6dfcf603993504ca0a136fae62bcbc6a754aa3a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:11:44.635014Z","signature_b64":"4LVvSeus1QYa1Z48Vwdd2dtk1eWQ65w4v/u+hmHiBreEfiyiXywhnhewbByXxwMmPx5e1/Rct8Kfqw9od3p4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea25514620f79d1e97825e6246197192c145240a41e9082077757d9878039bfd","last_reissued_at":"2026-08-10T01:11:44.632580Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:11:44.632580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Takahiro Ueoro","submitted_at":"2026-08-07T01:52:08Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06698","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/2608.06698/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":"2608.06698","created_at":"2026-08-10T01:11:44.633539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.06698v1","created_at":"2026-08-10T01:11:44.633539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06698","created_at":"2026-08-10T01:11:44.633539+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ISVCRRA66OR","created_at":"2026-08-10T01:11:44.633539+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ISVCRRA66OR5F4C","created_at":"2026-08-10T01:11:44.633539+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ISVCRRA","created_at":"2026-08-10T01:11:44.633539+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL","json":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL.json","graph_json":"https://pith.science/api/pith-number/5ISVCRRA66OR5F4CLZREMGLRSL/graph.json","events_json":"https://pith.science/api/pith-number/5ISVCRRA66OR5F4CLZREMGLRSL/events.json","paper":"https://pith.science/paper/5ISVCRRA"},"agent_actions":{"view_html":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL","download_json":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL.json","view_paper":"https://pith.science/paper/5ISVCRRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.06698&json=true","fetch_graph":"https://pith.science/api/pith-number/5ISVCRRA66OR5F4CLZREMGLRSL/graph.json","fetch_events":"https://pith.science/api/pith-number/5ISVCRRA66OR5F4CLZREMGLRSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/action/storage_attestation","attest_author":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/action/author_attestation","sign_citation":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/action/citation_signature","submit_replication":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/action/replication_record"}},"created_at":"2026-08-10T01:11:44.633539+00:00","updated_at":"2026-08-10T01:11:44.633539+00:00"}