{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:H3OFER6SLN3TYTWEUN2N47SZHL","short_pith_number":"pith:H3OFER6S","schema_version":"1.0","canonical_sha256":"3edc5247d25b773c4ec4a374de7e593af95d66c62dfc3dc35c2464326fe69853","source":{"kind":"arxiv","id":"1911.01954","version":1},"attestation_state":"computed","paper":{"title":"Majority Colorings of Sparse Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison, Michael Anastos, Raphael Steiner, Tibor Szab\\'o","submitted_at":"2019-11-05T17:23:54Z","abstract_excerpt":"A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen and Wood proved that every digraph has a majority 4-coloring and conjectured that every digraph admits a majority 3-coloring. We verify this conjecture for digraphs with chromatic number at most 6 or dichromatic number at most 3. We obtain analogous results for list coloring: We show that every digraph with list chromatic number at most 6 or list dichromatic number at most 3 is majority 3-choosable. We deduce that digr"},"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":"1911.01954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-05T17:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"468a6dae339438ac9ca0a7783bab96e95f34cdf101fe131a1e3c858dc8436acf","abstract_canon_sha256":"8a91acb16ea782b2924e80a4ace6bd1e55985b1a627e3704d19f1918d864fe43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:23.268748Z","signature_b64":"Ik0XnBzNmM1CVM5D4QaZmFW7Hh7N7U35bDotn8ZZ8PZDJheoucZWm27m/a1XE2jiHIGiC6cE3nlvFSJJk6twBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3edc5247d25b773c4ec4a374de7e593af95d66c62dfc3dc35c2464326fe69853","last_reissued_at":"2026-07-05T00:17:23.268358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:23.268358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Majority Colorings of Sparse Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison, Michael Anastos, Raphael Steiner, Tibor Szab\\'o","submitted_at":"2019-11-05T17:23:54Z","abstract_excerpt":"A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen and Wood proved that every digraph has a majority 4-coloring and conjectured that every digraph admits a majority 3-coloring. We verify this conjecture for digraphs with chromatic number at most 6 or dichromatic number at most 3. We obtain analogous results for list coloring: We show that every digraph with list chromatic number at most 6 or list dichromatic number at most 3 is majority 3-choosable. We deduce that digr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01954","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.01954/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":"1911.01954","created_at":"2026-07-05T00:17:23.268440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01954v1","created_at":"2026-07-05T00:17:23.268440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01954","created_at":"2026-07-05T00:17:23.268440+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3OFER6SLN3T","created_at":"2026-07-05T00:17:23.268440+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3OFER6SLN3TYTWE","created_at":"2026-07-05T00:17:23.268440+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3OFER6S","created_at":"2026-07-05T00:17:23.268440+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/H3OFER6SLN3TYTWEUN2N47SZHL","json":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL.json","graph_json":"https://pith.science/api/pith-number/H3OFER6SLN3TYTWEUN2N47SZHL/graph.json","events_json":"https://pith.science/api/pith-number/H3OFER6SLN3TYTWEUN2N47SZHL/events.json","paper":"https://pith.science/paper/H3OFER6S"},"agent_actions":{"view_html":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL","download_json":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL.json","view_paper":"https://pith.science/paper/H3OFER6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01954&json=true","fetch_graph":"https://pith.science/api/pith-number/H3OFER6SLN3TYTWEUN2N47SZHL/graph.json","fetch_events":"https://pith.science/api/pith-number/H3OFER6SLN3TYTWEUN2N47SZHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL/action/storage_attestation","attest_author":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL/action/author_attestation","sign_citation":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL/action/citation_signature","submit_replication":"https://pith.science/pith/H3OFER6SLN3TYTWEUN2N47SZHL/action/replication_record"}},"created_at":"2026-07-05T00:17:23.268440+00:00","updated_at":"2026-07-05T00:17:23.268440+00:00"}