{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XR2FVP4JQFR753FHFN54LEEBEG","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":"f212b2bcb1e8c265aa7f2a6105483af576c3cbe27e960f9ac4c077b63f0b82a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-15T18:16:59Z","title_canon_sha256":"dfa48e9e2a94b6ce9611add0573725830fe613176885ebb350545e8589cbd7a5"},"schema_version":"1.0","source":{"id":"2312.09999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.09999","created_at":"2026-07-05T07:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"2312.09999v1","created_at":"2026-07-05T07:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.09999","created_at":"2026-07-05T07:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"XR2FVP4JQFR7","created_at":"2026-07-05T07:24:43Z"},{"alias_kind":"pith_short_16","alias_value":"XR2FVP4JQFR753FH","created_at":"2026-07-05T07:24:43Z"},{"alias_kind":"pith_short_8","alias_value":"XR2FVP4J","created_at":"2026-07-05T07:24:43Z"}],"graph_snapshots":[{"event_id":"sha256:ee853485f572d6a5257e1223932bb03420e9db94ce9213456d35a6f153fa2fc6","target":"graph","created_at":"2026-07-05T07:24:43Z","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/2312.09999/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bollob\\'as proved that for every $k$ and $\\ell$ such that $k\\mathbb{Z}+\\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\\ell \\bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of the maximum number of edges in such a graph is known for very few pairs $\\ell$ and $k$. In this work we precisely determine the maximum number of edges in a graph containing no cycle of length $0 \\bmod 4$.","authors_text":"Binlong Li, Casey Tompkins, Ervin Gy\\H{o}ri, Kitti Varga, Manran Zhu, Nika Salia","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-15T18:16:59Z","title":"On graphs without cycles of length 0 modulo 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.09999","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:bc6fcbc7916a4268417088a6d05e2630c03e0d754e5d060bba0f86e4ecd27722","target":"record","created_at":"2026-07-05T07:24:43Z","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":"f212b2bcb1e8c265aa7f2a6105483af576c3cbe27e960f9ac4c077b63f0b82a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-15T18:16:59Z","title_canon_sha256":"dfa48e9e2a94b6ce9611add0573725830fe613176885ebb350545e8589cbd7a5"},"schema_version":"1.0","source":{"id":"2312.09999","kind":"arxiv","version":1}},"canonical_sha256":"bc745abf898163feeca72b7bc5908121a805c661d145d33f9783632fcc85669a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc745abf898163feeca72b7bc5908121a805c661d145d33f9783632fcc85669a","first_computed_at":"2026-07-05T07:24:43.465717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:24:43.465717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1GiRXKx/G1b4/zZ09BY9MXyDse6EsQNAhMoH+6uPtJZxhj34rxUun4BF+yPivFd0lAvmWjJhOSa+6I2OZO2jBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:24:43.466258Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.09999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc6fcbc7916a4268417088a6d05e2630c03e0d754e5d060bba0f86e4ecd27722","sha256:ee853485f572d6a5257e1223932bb03420e9db94ce9213456d35a6f153fa2fc6"],"state_sha256":"8337879089ef1a5f618a7fd07deacd2cc1288142c777c1af63e84ef1c8411f52"}