{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4JCFJF5QWB3L7OM7BOVSKJJDSS","short_pith_number":"pith:4JCFJF5Q","schema_version":"1.0","canonical_sha256":"e2445497b0b076bfb99f0bab25252394bc96a533c337b5231d94f4d02d41da21","source":{"kind":"arxiv","id":"2606.07748","version":1},"attestation_state":"computed","paper":{"title":"Decomposing tournaments into comparability graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benjamin Moore, Hidde Koerts, Hugo Jacob, Julien Duron, Logan Crew, Pierre Aboulker, R\\'emy Kimbrough, Sophie Spirkl, St\\'ephan Thomass\\'e, Xinyue Fan","submitted_at":"2026-06-05T18:00:36Z","abstract_excerpt":"In this note, we introduce the \\emph{partial order decomposition number} of a digraph $D$, denoted $pod(D)$, defined as the minimum integer $k$ such that $A(D)=A(P_1)\\cup\\cdots\\cup A(P_k)$, where $P_1,\\ldots,P_k$ are partial orders on $V(D)$. We prove that $\\dic(D)\\le \\diomega(D)^{pod(D)}$ for every digraph $D$. In particular, every class of digraphs with bounded $pod$ is polynomially $\\dic$-bounded. We apply this to tournaments, showing that if $\\mathcal C$ is a class of tournaments with bounded dichromatic number, then the closure of $\\mathcal C$ under substitution is polynomially $\\dic$-bou"},"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":"2606.07748","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T18:00:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ef4dd08584f7d84fe34d04cb73e5f729f7a1be297e1eb78f2f98983d3386ebc5","abstract_canon_sha256":"aa3901caa6b492b5e303b86f63dd14c3114c205ed8e3a15da275cf3f807de20f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:51.026766Z","signature_b64":"Nw1NqmQBNNoQAOzfLzhwcko5kT7yY1Wa14lFezggf/KqDfMx+aE2/AKzu8xg71NoQrVUYEWYnMOJW5pV7podDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2445497b0b076bfb99f0bab25252394bc96a533c337b5231d94f4d02d41da21","last_reissued_at":"2026-06-09T01:04:51.026350Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:51.026350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing tournaments into comparability graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benjamin Moore, Hidde Koerts, Hugo Jacob, Julien Duron, Logan Crew, Pierre Aboulker, R\\'emy Kimbrough, Sophie Spirkl, St\\'ephan Thomass\\'e, Xinyue Fan","submitted_at":"2026-06-05T18:00:36Z","abstract_excerpt":"In this note, we introduce the \\emph{partial order decomposition number} of a digraph $D$, denoted $pod(D)$, defined as the minimum integer $k$ such that $A(D)=A(P_1)\\cup\\cdots\\cup A(P_k)$, where $P_1,\\ldots,P_k$ are partial orders on $V(D)$. We prove that $\\dic(D)\\le \\diomega(D)^{pod(D)}$ for every digraph $D$. In particular, every class of digraphs with bounded $pod$ is polynomially $\\dic$-bounded. We apply this to tournaments, showing that if $\\mathcal C$ is a class of tournaments with bounded dichromatic number, then the closure of $\\mathcal C$ under substitution is polynomially $\\dic$-bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07748","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/2606.07748/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":"2606.07748","created_at":"2026-06-09T01:04:51.026414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07748v1","created_at":"2026-06-09T01:04:51.026414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07748","created_at":"2026-06-09T01:04:51.026414+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JCFJF5QWB3L","created_at":"2026-06-09T01:04:51.026414+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JCFJF5QWB3L7OM7","created_at":"2026-06-09T01:04:51.026414+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JCFJF5Q","created_at":"2026-06-09T01:04:51.026414+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/4JCFJF5QWB3L7OM7BOVSKJJDSS","json":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS.json","graph_json":"https://pith.science/api/pith-number/4JCFJF5QWB3L7OM7BOVSKJJDSS/graph.json","events_json":"https://pith.science/api/pith-number/4JCFJF5QWB3L7OM7BOVSKJJDSS/events.json","paper":"https://pith.science/paper/4JCFJF5Q"},"agent_actions":{"view_html":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS","download_json":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS.json","view_paper":"https://pith.science/paper/4JCFJF5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07748&json=true","fetch_graph":"https://pith.science/api/pith-number/4JCFJF5QWB3L7OM7BOVSKJJDSS/graph.json","fetch_events":"https://pith.science/api/pith-number/4JCFJF5QWB3L7OM7BOVSKJJDSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS/action/storage_attestation","attest_author":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS/action/author_attestation","sign_citation":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS/action/citation_signature","submit_replication":"https://pith.science/pith/4JCFJF5QWB3L7OM7BOVSKJJDSS/action/replication_record"}},"created_at":"2026-06-09T01:04:51.026414+00:00","updated_at":"2026-06-09T01:04:51.026414+00:00"}