{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5ISVCRRA66OR5F4CLZREMGLRSL","short_pith_number":"pith:5ISVCRRA","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"},"canonical_sha256":"ea25514620f79d1e97825e6246197192c145240a41e9082077757d9878039bfd","source":{"kind":"arxiv","id":"2608.06698","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5ISVCRRA66OR5F4CLZREMGLRSL","target":"record","payload":{"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"},"canonical_sha256":"ea25514620f79d1e97825e6246197192c145240a41e9082077757d9878039bfd","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"},"source_kind":"arxiv","source_id":"2608.06698","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-10T01:11:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXKO+dmmnxAFZF/Jb9k0R1VF4TKaP4vVIpZnL5N5W5y70Qbv12TFb9F8k05os1cWGEnnAEnAtQsaRed09TdHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:14:54.943979Z"},"content_sha256":"50f3de6115bf9f4985c3382581a073138d3217c00a410586a1e422d8aa69ca39","schema_version":"1.0","event_id":"sha256:50f3de6115bf9f4985c3382581a073138d3217c00a410586a1e422d8aa69ca39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5ISVCRRA66OR5F4CLZREMGLRSL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-10T01:11:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LxUoPrZtR+484pfnIIiHpY7O98yAwtcn4HSB/UWHwgE0IAVzj/vGXU3cqv2E3oMbo+uKvutqtRVSPdvv5AIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:14:54.944472Z"},"content_sha256":"da5d39749e62f32ea8a049c391bb7f728647441140b369f1c97989d76b8697cf","schema_version":"1.0","event_id":"sha256:da5d39749e62f32ea8a049c391bb7f728647441140b369f1c97989d76b8697cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/bundle.json","state_url":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ISVCRRA66OR5F4CLZREMGLRSL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T08:14:54Z","links":{"resolver":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL","bundle":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/bundle.json","state":"https://pith.science/pith/5ISVCRRA66OR5F4CLZREMGLRSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ISVCRRA66OR5F4CLZREMGLRSL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LM6NyLIqiCWA2qdZLqMIcc5xvprlPGRIQClRtPXyrcrwaShzMr43YtgT/5O5qri4r7bDkMs2njtWWFG9N8x2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:14:54.948802Z","bundle_sha256":"5dd1c6e40ea5d97662a94984a1c1a42285b946c3c47d9423742983d19111957c"}}