{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XR2FVP4JQFR753FHFN54LEEBEG","short_pith_number":"pith:XR2FVP4J","schema_version":"1.0","canonical_sha256":"bc745abf898163feeca72b7bc5908121a805c661d145d33f9783632fcc85669a","source":{"kind":"arxiv","id":"2312.09999","version":1},"attestation_state":"computed","paper":{"title":"On graphs without cycles of length 0 modulo 4","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Casey Tompkins, Ervin Gy\\H{o}ri, Kitti Varga, Manran Zhu, Nika Salia","submitted_at":"2023-12-15T18:16:59Z","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$."},"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":"2312.09999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-15T18:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"dfa48e9e2a94b6ce9611add0573725830fe613176885ebb350545e8589cbd7a5","abstract_canon_sha256":"f212b2bcb1e8c265aa7f2a6105483af576c3cbe27e960f9ac4c077b63f0b82a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:24:43.466258Z","signature_b64":"1GiRXKx/G1b4/zZ09BY9MXyDse6EsQNAhMoH+6uPtJZxhj34rxUun4BF+yPivFd0lAvmWjJhOSa+6I2OZO2jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc745abf898163feeca72b7bc5908121a805c661d145d33f9783632fcc85669a","last_reissued_at":"2026-07-05T07:24:43.465717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:24:43.465717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs without cycles of length 0 modulo 4","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Casey Tompkins, Ervin Gy\\H{o}ri, Kitti Varga, Manran Zhu, Nika Salia","submitted_at":"2023-12-15T18:16:59Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.09999","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/2312.09999/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":"2312.09999","created_at":"2026-07-05T07:24:43.465775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.09999v1","created_at":"2026-07-05T07:24:43.465775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.09999","created_at":"2026-07-05T07:24:43.465775+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR2FVP4JQFR7","created_at":"2026-07-05T07:24:43.465775+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR2FVP4JQFR753FH","created_at":"2026-07-05T07:24:43.465775+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR2FVP4J","created_at":"2026-07-05T07:24:43.465775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12798","citing_title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG","json":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG.json","graph_json":"https://pith.science/api/pith-number/XR2FVP4JQFR753FHFN54LEEBEG/graph.json","events_json":"https://pith.science/api/pith-number/XR2FVP4JQFR753FHFN54LEEBEG/events.json","paper":"https://pith.science/paper/XR2FVP4J"},"agent_actions":{"view_html":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG","download_json":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG.json","view_paper":"https://pith.science/paper/XR2FVP4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.09999&json=true","fetch_graph":"https://pith.science/api/pith-number/XR2FVP4JQFR753FHFN54LEEBEG/graph.json","fetch_events":"https://pith.science/api/pith-number/XR2FVP4JQFR753FHFN54LEEBEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG/action/storage_attestation","attest_author":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG/action/author_attestation","sign_citation":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG/action/citation_signature","submit_replication":"https://pith.science/pith/XR2FVP4JQFR753FHFN54LEEBEG/action/replication_record"}},"created_at":"2026-07-05T07:24:43.465775+00:00","updated_at":"2026-07-05T07:24:43.465775+00:00"}