{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RQEHQA5MOBXGIQQRTYTN2PZEE4","short_pith_number":"pith:RQEHQA5M","schema_version":"1.0","canonical_sha256":"8c087803ac706e6442119e26dd3f24273ab0ebd6a1fbf96057253ba27a7ef4fb","source":{"kind":"arxiv","id":"2304.04690","version":2},"attestation_state":"computed","paper":{"title":"Digraph Colouring and Arc-Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume Aubian, Pierre Aboulker, Pierre Charbit","submitted_at":"2023-04-10T16:11:23Z","abstract_excerpt":"The dichromatic number $\\vec\\chi(D)$ of a digraph $D$ is the minimum size of a partition of its vertices into acyclic induced subgraphs. We denote by $\\lambda(D)$ the maximum local edge connectivity of a digraph $D$. Neumann-Lara proved that for every digraph $D$, $\\vec\\chi(D) \\leq \\lambda(D) + 1$. In this paper, we characterize the digraphs $D$ for which $\\vec\\chi(D) = \\lambda(D) + 1$. This generalizes an analogue result for undirected graph proved by Stiebitz and Toft as well as the directed version of Brooks' Theorem proved by Mohar. Along the way, we introduce a generalization of Haj\\'os j"},"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":"2304.04690","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-04-10T16:11:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5fb61ed95a5e32fe0121fd15c5f7393d6cf45cf03b59cb22a675dd85d97279ce","abstract_canon_sha256":"c345ac5b792440ed072513bf933863ba20b66e174554fe4336bdd94df3f6e021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:13.826055Z","signature_b64":"daJzuPPRt9umSPuKtFAIDq+D8hcS/eVVqwnOzWDyUUF3/BlIfgnsPqpDdvhsXb636rSz9SM1kddYlle/1YjZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c087803ac706e6442119e26dd3f24273ab0ebd6a1fbf96057253ba27a7ef4fb","last_reissued_at":"2026-07-05T06:50:13.825523Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:13.825523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Digraph Colouring and Arc-Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume Aubian, Pierre Aboulker, Pierre Charbit","submitted_at":"2023-04-10T16:11:23Z","abstract_excerpt":"The dichromatic number $\\vec\\chi(D)$ of a digraph $D$ is the minimum size of a partition of its vertices into acyclic induced subgraphs. We denote by $\\lambda(D)$ the maximum local edge connectivity of a digraph $D$. Neumann-Lara proved that for every digraph $D$, $\\vec\\chi(D) \\leq \\lambda(D) + 1$. In this paper, we characterize the digraphs $D$ for which $\\vec\\chi(D) = \\lambda(D) + 1$. This generalizes an analogue result for undirected graph proved by Stiebitz and Toft as well as the directed version of Brooks' Theorem proved by Mohar. Along the way, we introduce a generalization of Haj\\'os j"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04690","kind":"arxiv","version":2},"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/2304.04690/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":"2304.04690","created_at":"2026-07-05T06:50:13.825579+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.04690v2","created_at":"2026-07-05T06:50:13.825579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04690","created_at":"2026-07-05T06:50:13.825579+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQEHQA5MOBXG","created_at":"2026-07-05T06:50:13.825579+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQEHQA5MOBXGIQQR","created_at":"2026-07-05T06:50:13.825579+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQEHQA5M","created_at":"2026-07-05T06:50:13.825579+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06928","citing_title":"Coloring digraphs with $\\Delta-b$ colors","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4","json":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4.json","graph_json":"https://pith.science/api/pith-number/RQEHQA5MOBXGIQQRTYTN2PZEE4/graph.json","events_json":"https://pith.science/api/pith-number/RQEHQA5MOBXGIQQRTYTN2PZEE4/events.json","paper":"https://pith.science/paper/RQEHQA5M"},"agent_actions":{"view_html":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4","download_json":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4.json","view_paper":"https://pith.science/paper/RQEHQA5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.04690&json=true","fetch_graph":"https://pith.science/api/pith-number/RQEHQA5MOBXGIQQRTYTN2PZEE4/graph.json","fetch_events":"https://pith.science/api/pith-number/RQEHQA5MOBXGIQQRTYTN2PZEE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4/action/storage_attestation","attest_author":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4/action/author_attestation","sign_citation":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4/action/citation_signature","submit_replication":"https://pith.science/pith/RQEHQA5MOBXGIQQRTYTN2PZEE4/action/replication_record"}},"created_at":"2026-07-05T06:50:13.825579+00:00","updated_at":"2026-07-05T06:50:13.825579+00:00"}