{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D3QQRCVC2V4HDOFTJRJSVSAQQU","short_pith_number":"pith:D3QQRCVC","schema_version":"1.0","canonical_sha256":"1ee1088aa2d57871b8b34c532ac810852aee7a0af164be8f589a8ad64451d19b","source":{"kind":"arxiv","id":"1510.03578","version":2},"attestation_state":"computed","paper":{"title":"List coloring digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Julien Bensmail, Ngoc Khang Le","submitted_at":"2015-10-13T08:56:30Z","abstract_excerpt":"The dichromatic number $\\vec{\\chi}(D)$ of a digraph $D$ is the least number $k$ such that the vertex set of $D$ can be partitioned into $k$ parts each of which induces an acyclic subdigraph. Introduced by Neumann-Lara in 1982, this digraph invariant shares many properties with the usual chromatic number of graphs and can be seen as the natural analog of the graph chromatic number. In this paper, we study the list dichromatic number of digraphs, giving evidence that this notion generalizes the list chromatic number of graphs. We first prove that the list dichromatic number and the dichromatic n"},"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":"1510.03578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-13T08:56:30Z","cross_cats_sorted":[],"title_canon_sha256":"329c11b0701efd5287e75f73242b75fc01633e4c57610b02a6140668c6414598","abstract_canon_sha256":"5aa200312d4404f23d13fa9330a286e60e555b6ce4160348b5bc796bdb630b64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:29.096926Z","signature_b64":"joTUmbzlhW0L0EUEdIRsRkx8LQyuWLQDCibxh/eo+NXvdv0w+yF9CuU06yqoSgo9DF4PTNtuNeQaPU9fTvSfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee1088aa2d57871b8b34c532ac810852aee7a0af164be8f589a8ad64451d19b","last_reissued_at":"2026-05-18T01:29:29.096272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:29.096272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List coloring digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Julien Bensmail, Ngoc Khang Le","submitted_at":"2015-10-13T08:56:30Z","abstract_excerpt":"The dichromatic number $\\vec{\\chi}(D)$ of a digraph $D$ is the least number $k$ such that the vertex set of $D$ can be partitioned into $k$ parts each of which induces an acyclic subdigraph. Introduced by Neumann-Lara in 1982, this digraph invariant shares many properties with the usual chromatic number of graphs and can be seen as the natural analog of the graph chromatic number. In this paper, we study the list dichromatic number of digraphs, giving evidence that this notion generalizes the list chromatic number of graphs. We first prove that the list dichromatic number and the dichromatic n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03578","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":""},"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":"1510.03578","created_at":"2026-05-18T01:29:29.096358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03578v2","created_at":"2026-05-18T01:29:29.096358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03578","created_at":"2026-05-18T01:29:29.096358+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3QQRCVC2V4H","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3QQRCVC2V4HDOFT","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3QQRCVC","created_at":"2026-05-18T12:29:17.054201+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/D3QQRCVC2V4HDOFTJRJSVSAQQU","json":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU.json","graph_json":"https://pith.science/api/pith-number/D3QQRCVC2V4HDOFTJRJSVSAQQU/graph.json","events_json":"https://pith.science/api/pith-number/D3QQRCVC2V4HDOFTJRJSVSAQQU/events.json","paper":"https://pith.science/paper/D3QQRCVC"},"agent_actions":{"view_html":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU","download_json":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU.json","view_paper":"https://pith.science/paper/D3QQRCVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03578&json=true","fetch_graph":"https://pith.science/api/pith-number/D3QQRCVC2V4HDOFTJRJSVSAQQU/graph.json","fetch_events":"https://pith.science/api/pith-number/D3QQRCVC2V4HDOFTJRJSVSAQQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU/action/storage_attestation","attest_author":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU/action/author_attestation","sign_citation":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU/action/citation_signature","submit_replication":"https://pith.science/pith/D3QQRCVC2V4HDOFTJRJSVSAQQU/action/replication_record"}},"created_at":"2026-05-18T01:29:29.096358+00:00","updated_at":"2026-05-18T01:29:29.096358+00:00"}