{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OSNLNSCJWURO6EOKWMZMRALB2E","short_pith_number":"pith:OSNLNSCJ","schema_version":"1.0","canonical_sha256":"749ab6c849b522ef11cab332c88161d12ed7ae5ae2892986d8f7e808191f7340","source":{"kind":"arxiv","id":"2605.19654","version":1},"attestation_state":"computed","paper":{"title":"Hardness and Approximation for Coloring Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alantha Newman, Chaoliang Tang, Felix Klingelhoefer, Harmender Gahlawat, Parinya Chalermsook","submitted_at":"2026-05-19T10:44:44Z","abstract_excerpt":"The dichromatic number $\\vec\\chi(D)$ of a digraph is the minimum number $k$ such that $V(D)$ can be partitioned into $k$ subsets, each inducing an acyclic digraph. The acyclic number $\\vec\\alpha(D)$ is the cardinality of a largest induced acyclic subdigraph of $D$.\n  We study these problems from an approximation point of view. We begin with establishing that even when restricted to tournaments, approximating $\\vec\\chi$ and $\\vec\\alpha$ remain as challenging as their undirected counterparts on general graphs. Specifically, we establish that for every $\\epsilon >0$, it is hard to approximate bot"},"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":"2605.19654","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T10:44:44Z","cross_cats_sorted":[],"title_canon_sha256":"6ea7c1685376684588b3c83577b4c71b18152b3cfb0a83e3c72fa8fc3ff6bbd3","abstract_canon_sha256":"dc0947923ca8e7dac163ca753000a76c66406f0b85e8c0475740e55a4d116d5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:56.094042Z","signature_b64":"5khO3Fz7F6Pq/FMEYD+MuzCDfHx9kBpE7qgWZtE+nFXqbBT/YQkZHlmE8faCFpLZ1u+cfRVb5s0aoLHLLMKzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"749ab6c849b522ef11cab332c88161d12ed7ae5ae2892986d8f7e808191f7340","last_reissued_at":"2026-05-20T01:05:56.093389Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:56.093389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness and Approximation for Coloring Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alantha Newman, Chaoliang Tang, Felix Klingelhoefer, Harmender Gahlawat, Parinya Chalermsook","submitted_at":"2026-05-19T10:44:44Z","abstract_excerpt":"The dichromatic number $\\vec\\chi(D)$ of a digraph is the minimum number $k$ such that $V(D)$ can be partitioned into $k$ subsets, each inducing an acyclic digraph. The acyclic number $\\vec\\alpha(D)$ is the cardinality of a largest induced acyclic subdigraph of $D$.\n  We study these problems from an approximation point of view. We begin with establishing that even when restricted to tournaments, approximating $\\vec\\chi$ and $\\vec\\alpha$ remain as challenging as their undirected counterparts on general graphs. Specifically, we establish that for every $\\epsilon >0$, it is hard to approximate bot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19654","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/2605.19654/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":"2605.19654","created_at":"2026-05-20T01:05:56.093505+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19654v1","created_at":"2026-05-20T01:05:56.093505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19654","created_at":"2026-05-20T01:05:56.093505+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSNLNSCJWURO","created_at":"2026-05-20T01:05:56.093505+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSNLNSCJWURO6EOK","created_at":"2026-05-20T01:05:56.093505+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSNLNSCJ","created_at":"2026-05-20T01:05:56.093505+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/OSNLNSCJWURO6EOKWMZMRALB2E","json":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E.json","graph_json":"https://pith.science/api/pith-number/OSNLNSCJWURO6EOKWMZMRALB2E/graph.json","events_json":"https://pith.science/api/pith-number/OSNLNSCJWURO6EOKWMZMRALB2E/events.json","paper":"https://pith.science/paper/OSNLNSCJ"},"agent_actions":{"view_html":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E","download_json":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E.json","view_paper":"https://pith.science/paper/OSNLNSCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19654&json=true","fetch_graph":"https://pith.science/api/pith-number/OSNLNSCJWURO6EOKWMZMRALB2E/graph.json","fetch_events":"https://pith.science/api/pith-number/OSNLNSCJWURO6EOKWMZMRALB2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E/action/storage_attestation","attest_author":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E/action/author_attestation","sign_citation":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E/action/citation_signature","submit_replication":"https://pith.science/pith/OSNLNSCJWURO6EOKWMZMRALB2E/action/replication_record"}},"created_at":"2026-05-20T01:05:56.093505+00:00","updated_at":"2026-05-20T01:05:56.093505+00:00"}