{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YFN3BPGAIDIAKQWAHGHKTXDED2","short_pith_number":"pith:YFN3BPGA","schema_version":"1.0","canonical_sha256":"c15bb0bcc040d00542c0398ea9dc641e9359c7bf9e2c56b6efa32345ab08ce4d","source":{"kind":"arxiv","id":"1304.0081","version":1},"attestation_state":"computed","paper":{"title":"Coloring of a Digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Sampathkumar","submitted_at":"2013-03-30T10:06:37Z","abstract_excerpt":"\\qquad A \\emph{coloring} of a digraph $D=(V,E)$ is a coloring of its vertices following the rule: Let $uv$ be an arc in $D$. If the tail $u$ is colored first, then the head $v$ should receive a color different from that of $u$. The \\emph{dichromatic number} $\\chi_d(D)$ of $D$ is the minimum number of colors needed in a coloring of $D$. Besides obtaining many results and bounds for $\\chi_d(D)$ analogous to that of chromatic number of a graph, we prove $\\chi_d(D)=1$ if $D$ is acyclic. New notions of sequential colorings of graphs/digraphs are introduced. A characterization of acyclic digraph is "},"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":"1304.0081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-30T10:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"c198129842a239c530dd359620118437471afe3db90e24b5550481b126bd5b3e","abstract_canon_sha256":"f653fb76a26a9f007e648dd9bc681536edef589b2d7c422482bf25d1eb20f094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:26.041967Z","signature_b64":"mjBddPeNVdrH9Elat2c1h/oc1TVDgUsnKcTpqr1IlViDDa97LAYsBa3ZrPawJINYprN7ptilkMLAv888jB50Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c15bb0bcc040d00542c0398ea9dc641e9359c7bf9e2c56b6efa32345ab08ce4d","last_reissued_at":"2026-05-18T03:29:26.041011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:26.041011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring of a Digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Sampathkumar","submitted_at":"2013-03-30T10:06:37Z","abstract_excerpt":"\\qquad A \\emph{coloring} of a digraph $D=(V,E)$ is a coloring of its vertices following the rule: Let $uv$ be an arc in $D$. If the tail $u$ is colored first, then the head $v$ should receive a color different from that of $u$. The \\emph{dichromatic number} $\\chi_d(D)$ of $D$ is the minimum number of colors needed in a coloring of $D$. Besides obtaining many results and bounds for $\\chi_d(D)$ analogous to that of chromatic number of a graph, we prove $\\chi_d(D)=1$ if $D$ is acyclic. New notions of sequential colorings of graphs/digraphs are introduced. A characterization of acyclic digraph is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0081","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":""},"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":"1304.0081","created_at":"2026-05-18T03:29:26.041171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0081v1","created_at":"2026-05-18T03:29:26.041171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0081","created_at":"2026-05-18T03:29:26.041171+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFN3BPGAIDIA","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFN3BPGAIDIAKQWA","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFN3BPGA","created_at":"2026-05-18T12:28:06.772260+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/YFN3BPGAIDIAKQWAHGHKTXDED2","json":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2.json","graph_json":"https://pith.science/api/pith-number/YFN3BPGAIDIAKQWAHGHKTXDED2/graph.json","events_json":"https://pith.science/api/pith-number/YFN3BPGAIDIAKQWAHGHKTXDED2/events.json","paper":"https://pith.science/paper/YFN3BPGA"},"agent_actions":{"view_html":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2","download_json":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2.json","view_paper":"https://pith.science/paper/YFN3BPGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0081&json=true","fetch_graph":"https://pith.science/api/pith-number/YFN3BPGAIDIAKQWAHGHKTXDED2/graph.json","fetch_events":"https://pith.science/api/pith-number/YFN3BPGAIDIAKQWAHGHKTXDED2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2/action/storage_attestation","attest_author":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2/action/author_attestation","sign_citation":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2/action/citation_signature","submit_replication":"https://pith.science/pith/YFN3BPGAIDIAKQWAHGHKTXDED2/action/replication_record"}},"created_at":"2026-05-18T03:29:26.041171+00:00","updated_at":"2026-05-18T03:29:26.041171+00:00"}