{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GZBUJ5NTZIANMBUTB7ZWQ45C6J","short_pith_number":"pith:GZBUJ5NT","schema_version":"1.0","canonical_sha256":"364344f5b3ca00d606930ff36873a2f26a5bb0d68b58f61986f182375f5a8be4","source":{"kind":"arxiv","id":"1905.12484","version":1},"attestation_state":"computed","paper":{"title":"Oriented coloring of graphs with low maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Pascal Ochem","submitted_at":"2019-05-29T14:19:13Z","abstract_excerpt":"Duffy et al. [C. Duffy, G. MacGillivray, and \\'E. Sopena, Oriented colourings of graphs with maximum degree three and four, Discrete Mathematics, 342(4), p. 959--974, 2019] recently considered the oriented chromatic number of connected oriented graphs with maximum degree $3$ and $4$, proving it is at most $9$ and $69$, respectively. In this paper, we improve these results by showing that the oriented chromatic number of non-necessarily connected oriented graphs with maximum degree $3$ (resp. $4$) is at most $9$ (resp. $26$). The bound of $26$ actually follows from a general result which determ"},"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":"1905.12484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-29T14:19:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"332c2ce01a98739a6547d9ecf0191ef14b8f222eeb63d1b0e420f283b9125d54","abstract_canon_sha256":"eb8654487e36fdf4b907e15518a093deb9f518835fbb30290ed2868e3345a5bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:44.124734Z","signature_b64":"1Tth7xrMD1sFQWnVJ6RIwBZmeYVvtZgBTwjJ/O4nXMFkqhVR6W51vCU9bFdhKJClioma7GcNYqmmWU5hmJOEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"364344f5b3ca00d606930ff36873a2f26a5bb0d68b58f61986f182375f5a8be4","last_reissued_at":"2026-05-17T23:44:44.124179Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:44.124179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oriented coloring of graphs with low maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Pascal Ochem","submitted_at":"2019-05-29T14:19:13Z","abstract_excerpt":"Duffy et al. [C. Duffy, G. MacGillivray, and \\'E. Sopena, Oriented colourings of graphs with maximum degree three and four, Discrete Mathematics, 342(4), p. 959--974, 2019] recently considered the oriented chromatic number of connected oriented graphs with maximum degree $3$ and $4$, proving it is at most $9$ and $69$, respectively. In this paper, we improve these results by showing that the oriented chromatic number of non-necessarily connected oriented graphs with maximum degree $3$ (resp. $4$) is at most $9$ (resp. $26$). The bound of $26$ actually follows from a general result which determ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12484","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":"1905.12484","created_at":"2026-05-17T23:44:44.124261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12484v1","created_at":"2026-05-17T23:44:44.124261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12484","created_at":"2026-05-17T23:44:44.124261+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZBUJ5NTZIAN","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZBUJ5NTZIANMBUT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZBUJ5NT","created_at":"2026-05-18T12:33:18.533446+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/GZBUJ5NTZIANMBUTB7ZWQ45C6J","json":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J.json","graph_json":"https://pith.science/api/pith-number/GZBUJ5NTZIANMBUTB7ZWQ45C6J/graph.json","events_json":"https://pith.science/api/pith-number/GZBUJ5NTZIANMBUTB7ZWQ45C6J/events.json","paper":"https://pith.science/paper/GZBUJ5NT"},"agent_actions":{"view_html":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J","download_json":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J.json","view_paper":"https://pith.science/paper/GZBUJ5NT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12484&json=true","fetch_graph":"https://pith.science/api/pith-number/GZBUJ5NTZIANMBUTB7ZWQ45C6J/graph.json","fetch_events":"https://pith.science/api/pith-number/GZBUJ5NTZIANMBUTB7ZWQ45C6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J/action/storage_attestation","attest_author":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J/action/author_attestation","sign_citation":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J/action/citation_signature","submit_replication":"https://pith.science/pith/GZBUJ5NTZIANMBUTB7ZWQ45C6J/action/replication_record"}},"created_at":"2026-05-17T23:44:44.124261+00:00","updated_at":"2026-05-17T23:44:44.124261+00:00"}