{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X2VLF2PG6A34T2HGEDFI4JLORT","short_pith_number":"pith:X2VLF2PG","schema_version":"1.0","canonical_sha256":"beaab2e9e6f037c9e8e620ca8e256e8cd9555d78ad2f6b8950fafbdaf13c6744","source":{"kind":"arxiv","id":"1903.02872","version":3},"attestation_state":"computed","paper":{"title":"Colouring Non-Even Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht","submitted_at":"2019-03-07T12:29:41Z","abstract_excerpt":"A colouring of a digraph as defined by Erdos and Neumann-Lara in 1980 is a vertex-colouring such that no monochromatic directed cycles exist. The minimal number of colours required for such a colouring of a loopless digraph is defined to be its dichromatic number. This quantity has been widely studied in the last decades and can be considered as a natural directed analogue of the chromatic number of a graph. A digraph D is called even if for every 0-1-weighting of the edges it contains a directed cycle of even total weight. We show that every non-even digraph has dichromatic number at most 2 a"},"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":"1903.02872","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T12:29:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"24f7a1ca2895d1a0ae8ff33072ce61d820bc8d165d6cbbdb4aaa66f06d5fefcd","abstract_canon_sha256":"7b037a14be136f19bb96bf3cce877f35bc291e70567476075daeb158c66494fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:51.888511Z","signature_b64":"P0FU3+KxZ8HyhZ4Qh8Qf5IfxuawpXW2VgIAkZ1p/P2vcOq/fl1IagZgc/5xP+OojOeqC5HLonaU4i8vRLACpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beaab2e9e6f037c9e8e620ca8e256e8cd9555d78ad2f6b8950fafbdaf13c6744","last_reissued_at":"2026-05-17T23:45:51.888055Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:51.888055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colouring Non-Even Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht","submitted_at":"2019-03-07T12:29:41Z","abstract_excerpt":"A colouring of a digraph as defined by Erdos and Neumann-Lara in 1980 is a vertex-colouring such that no monochromatic directed cycles exist. The minimal number of colours required for such a colouring of a loopless digraph is defined to be its dichromatic number. This quantity has been widely studied in the last decades and can be considered as a natural directed analogue of the chromatic number of a graph. A digraph D is called even if for every 0-1-weighting of the edges it contains a directed cycle of even total weight. We show that every non-even digraph has dichromatic number at most 2 a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02872","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1903.02872","created_at":"2026-05-17T23:45:51.888128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02872v3","created_at":"2026-05-17T23:45:51.888128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02872","created_at":"2026-05-17T23:45:51.888128+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2VLF2PG6A34","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2VLF2PG6A34T2HG","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2VLF2PG","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT","json":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT.json","graph_json":"https://pith.science/api/pith-number/X2VLF2PG6A34T2HGEDFI4JLORT/graph.json","events_json":"https://pith.science/api/pith-number/X2VLF2PG6A34T2HGEDFI4JLORT/events.json","paper":"https://pith.science/paper/X2VLF2PG"},"agent_actions":{"view_html":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT","download_json":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT.json","view_paper":"https://pith.science/paper/X2VLF2PG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02872&json=true","fetch_graph":"https://pith.science/api/pith-number/X2VLF2PG6A34T2HGEDFI4JLORT/graph.json","fetch_events":"https://pith.science/api/pith-number/X2VLF2PG6A34T2HGEDFI4JLORT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT/action/storage_attestation","attest_author":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT/action/author_attestation","sign_citation":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT/action/citation_signature","submit_replication":"https://pith.science/pith/X2VLF2PG6A34T2HGEDFI4JLORT/action/replication_record"}},"created_at":"2026-05-17T23:45:51.888128+00:00","updated_at":"2026-05-17T23:45:51.888128+00:00"}