{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4JCFJF5QWB3L7OM7BOVSKJJDSS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa3901caa6b492b5e303b86f63dd14c3114c205ed8e3a15da275cf3f807de20f","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T18:00:36Z","title_canon_sha256":"ef4dd08584f7d84fe34d04cb73e5f729f7a1be297e1eb78f2f98983d3386ebc5"},"schema_version":"1.0","source":{"id":"2606.07748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.07748","created_at":"2026-06-09T01:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2606.07748v1","created_at":"2026-06-09T01:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07748","created_at":"2026-06-09T01:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"4JCFJF5QWB3L","created_at":"2026-06-09T01:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"4JCFJF5QWB3L7OM7","created_at":"2026-06-09T01:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"4JCFJF5Q","created_at":"2026-06-09T01:04:51Z"}],"graph_snapshots":[{"event_id":"sha256:c46bcd0b534bd7754fba8585f573e0c7ad94318443598e8d88341932ae6fa3af","target":"graph","created_at":"2026-06-09T01:04:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.07748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T18:00:36Z","title":"Decomposing tournaments into comparability graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07748","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8cf15351318dba14ba0f66c800cadebd190b7391f1175ce9144807d5fbbedf50","target":"record","created_at":"2026-06-09T01:04:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa3901caa6b492b5e303b86f63dd14c3114c205ed8e3a15da275cf3f807de20f","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T18:00:36Z","title_canon_sha256":"ef4dd08584f7d84fe34d04cb73e5f729f7a1be297e1eb78f2f98983d3386ebc5"},"schema_version":"1.0","source":{"id":"2606.07748","kind":"arxiv","version":1}},"canonical_sha256":"e2445497b0b076bfb99f0bab25252394bc96a533c337b5231d94f4d02d41da21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2445497b0b076bfb99f0bab25252394bc96a533c337b5231d94f4d02d41da21","first_computed_at":"2026-06-09T01:04:51.026350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:04:51.026350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nw1NqmQBNNoQAOzfLzhwcko5kT7yY1Wa14lFezggf/KqDfMx+aE2/AKzu8xg71NoQrVUYEWYnMOJW5pV7podDQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:04:51.026766Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.07748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cf15351318dba14ba0f66c800cadebd190b7391f1175ce9144807d5fbbedf50","sha256:c46bcd0b534bd7754fba8585f573e0c7ad94318443598e8d88341932ae6fa3af"],"state_sha256":"f53a2f91b9a9cd2b0b3b6ef8214794068d343d64c25b68754b3eb61917396a31"}