{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2SJZSS7BB5UKFCPOGYOJL5KXHK","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":"b653b164c822a67143936932bd30eb3ecd7b6794904e2536ff9f5e1ad4a0eedf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T13:42:27Z","title_canon_sha256":"eb71c0b84cdc39bc4b92009d9ef8e57eb8047cc4ad745ed512f8e9bd859d6631"},"schema_version":"1.0","source":{"id":"1603.09187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09187","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09187v1","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09187","created_at":"2026-05-18T01:18:01Z"},{"alias_kind":"pith_short_12","alias_value":"2SJZSS7BB5UK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2SJZSS7BB5UKFCPO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2SJZSS7B","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:f1788723ba4fdd06b1c695f1da52233eedcbae0bb52806e8ae3d625f526d5a10","target":"graph","created_at":"2026-05-18T01:18:01Z","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"},"paper":{"abstract_excerpt":"For a graph $G$, let $\\cn(G)$ and $\\la(G)$ denote the chromatic number of $G$ and the maximum local edge connectivity of $G$, respectively. A result of Dirac \\cite{Dirac53} implies that every graph $G$ satisfies $\\cn(G)\\leq \\la(G)+1$. In this paper we characterize the graphs $G$ for which $\\cn(G)=\\la(G)+1$. The case $\\la(G)=3$ was already solved by Alboulker {\\em et al.\\,} \\cite{AlboukerV2016}. We show that a graph $G$ with $\\la(G)=k\\geq 4$ satisfies $\\cn(G)=k+1$ if and only if $G$ contains a block which can be obtained from copies of $K_{k+1}$ by repeated applications of the Haj\\'os join.","authors_text":"Bjarne Toft, Michael Stiebitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T13:42:27Z","title":"A Brooks type theorem for the maximum local edge connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09187","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:7bc86aad508e8d749cbbecb88a676c544dbd6e764db57b57b091127a76d8430c","target":"record","created_at":"2026-05-18T01:18:01Z","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":"b653b164c822a67143936932bd30eb3ecd7b6794904e2536ff9f5e1ad4a0eedf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T13:42:27Z","title_canon_sha256":"eb71c0b84cdc39bc4b92009d9ef8e57eb8047cc4ad745ed512f8e9bd859d6631"},"schema_version":"1.0","source":{"id":"1603.09187","kind":"arxiv","version":1}},"canonical_sha256":"d493994be10f68a289ee361c95f5573aa95c86cbe85813b816f4aa0c290efd56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d493994be10f68a289ee361c95f5573aa95c86cbe85813b816f4aa0c290efd56","first_computed_at":"2026-05-18T01:18:01.216657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:01.216657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03AQZTxDUFogzqu9Gi77mJqrKpmTwOX2JPyZdj8lzRjOmG+r9ukupSLNhoMe1sHtqNaiiIo/RZ3eMePZxoSNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:01.217291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bc86aad508e8d749cbbecb88a676c544dbd6e764db57b57b091127a76d8430c","sha256:f1788723ba4fdd06b1c695f1da52233eedcbae0bb52806e8ae3d625f526d5a10"],"state_sha256":"0b727eac6eaa170485b7f535b89098d59b10e3abf8c30736cc13dbfd873c9add"}