{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4VFE2ILL4PJG3DQCV4M4WWH75R","short_pith_number":"pith:4VFE2ILL","schema_version":"1.0","canonical_sha256":"e54a4d216be3d26d8e02af19cb58ffec73ae1081cf3bf46f7ee2d27137bcd023","source":{"kind":"arxiv","id":"1702.01607","version":3},"attestation_state":"computed","paper":{"title":"Coloring tournaments: from local to global","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Hehui Wu, St\\'ephan Thomass\\'e, Tien-Nam Le","submitted_at":"2017-02-06T13:20:44Z","abstract_excerpt":"The \\emph{chromatic number} of a directed graph $D$ is the minimum number of colors needed to color the vertices of $D$ such that each color class of $D$ induces an acyclic subdigraph. Thus, the chromatic number of a tournament $T$ is the minimum number of transitive subtournaments which cover the vertex set of $T$. We show in this paper that tournaments are significantly simpler than graphs with respect to coloring. Indeed, while undirected graphs can be altogether \"locally simple\" (every neighborhood is a stable set) and have large chromatic number, we show that locally simple tournaments ar"},"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":"1702.01607","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-06T13:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"3d3135a5c2ba3a9731bd6b86aad1e231a64ef0a1f14c24c5678f00274b2cfaf5","abstract_canon_sha256":"88ab29761366ec5608df5f96b6ac4c8704f29187a609fe7ff2744e0406deea17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:41.816978Z","signature_b64":"yqT/HXQHKN7tsG/6d241l1iCHgN3YWzzT70YpsuUkka76NnXUbAcIsoZa8157IJ42K5/Uh4x/ycbmpICkF9dAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e54a4d216be3d26d8e02af19cb58ffec73ae1081cf3bf46f7ee2d27137bcd023","last_reissued_at":"2026-05-18T00:48:41.816405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:41.816405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring tournaments: from local to global","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Hehui Wu, St\\'ephan Thomass\\'e, Tien-Nam Le","submitted_at":"2017-02-06T13:20:44Z","abstract_excerpt":"The \\emph{chromatic number} of a directed graph $D$ is the minimum number of colors needed to color the vertices of $D$ such that each color class of $D$ induces an acyclic subdigraph. Thus, the chromatic number of a tournament $T$ is the minimum number of transitive subtournaments which cover the vertex set of $T$. We show in this paper that tournaments are significantly simpler than graphs with respect to coloring. Indeed, while undirected graphs can be altogether \"locally simple\" (every neighborhood is a stable set) and have large chromatic number, we show that locally simple tournaments ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01607","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":"1702.01607","created_at":"2026-05-18T00:48:41.816477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01607v3","created_at":"2026-05-18T00:48:41.816477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01607","created_at":"2026-05-18T00:48:41.816477+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VFE2ILL4PJG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VFE2ILL4PJG3DQC","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VFE2ILL","created_at":"2026-05-18T12:31:00.734936+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/4VFE2ILL4PJG3DQCV4M4WWH75R","json":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R.json","graph_json":"https://pith.science/api/pith-number/4VFE2ILL4PJG3DQCV4M4WWH75R/graph.json","events_json":"https://pith.science/api/pith-number/4VFE2ILL4PJG3DQCV4M4WWH75R/events.json","paper":"https://pith.science/paper/4VFE2ILL"},"agent_actions":{"view_html":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R","download_json":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R.json","view_paper":"https://pith.science/paper/4VFE2ILL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01607&json=true","fetch_graph":"https://pith.science/api/pith-number/4VFE2ILL4PJG3DQCV4M4WWH75R/graph.json","fetch_events":"https://pith.science/api/pith-number/4VFE2ILL4PJG3DQCV4M4WWH75R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R/action/storage_attestation","attest_author":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R/action/author_attestation","sign_citation":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R/action/citation_signature","submit_replication":"https://pith.science/pith/4VFE2ILL4PJG3DQCV4M4WWH75R/action/replication_record"}},"created_at":"2026-05-18T00:48:41.816477+00:00","updated_at":"2026-05-18T00:48:41.816477+00:00"}