{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:USZEWWFPXNTX73FPVHLD7Z5GOL","short_pith_number":"pith:USZEWWFP","schema_version":"1.0","canonical_sha256":"a4b24b58afbb677fecafa9d63fe7a672dc62e3f92059cc298b701a5755d344e9","source":{"kind":"arxiv","id":"2310.04265","version":2},"attestation_state":"computed","paper":{"title":"Clique number of tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume Aubian, Pierre Aboulker, Pierre Charbit, Raul Lopes","submitted_at":"2023-10-06T14:11:26Z","abstract_excerpt":"Given a digraph $D$ together with an ordering $\\prec$ of its vertices, the \\emph{backedge graph} of $D$ with respect to $\\prec$ is the undirected graph $D^{\\prec}$ with the same vertex set as $D$, where $xy \\in E(D^{\\prec})$ if $xy \\in A(D)$ and $y \\prec x$. We introduce the notion of the \\emph{clique number of a digraph} $D$, defined as the minimum clique number over all backedge graphs of $D$. We investigate its relationship with the dichromatic number. In particular, this concept allows us to define $\\dic$-bounded classes of digraphs, which constitute the main topic of this paper, with a pr"},"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":"2310.04265","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-06T14:11:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4dac8f01ce9b1422e949148f4be0a625a0ce18a6aef7d074a10d335375de135c","abstract_canon_sha256":"978728c3c0e82bb9e94633dfe7ba3a032850a7c571e718b806fb30c0be9b4a36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:42.882846Z","signature_b64":"hJsZc3Yxiul0zkQeqc0VHZ6j9x7coHaEjrmkRLK+Yq6KWRwwUt8RG+MuVP+x5s3HlRkOBZhp+v5guup/jC0kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4b24b58afbb677fecafa9d63fe7a672dc62e3f92059cc298b701a5755d344e9","last_reissued_at":"2026-06-23T03:13:42.882409Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:42.882409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique number of tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume Aubian, Pierre Aboulker, Pierre Charbit, Raul Lopes","submitted_at":"2023-10-06T14:11:26Z","abstract_excerpt":"Given a digraph $D$ together with an ordering $\\prec$ of its vertices, the \\emph{backedge graph} of $D$ with respect to $\\prec$ is the undirected graph $D^{\\prec}$ with the same vertex set as $D$, where $xy \\in E(D^{\\prec})$ if $xy \\in A(D)$ and $y \\prec x$. We introduce the notion of the \\emph{clique number of a digraph} $D$, defined as the minimum clique number over all backedge graphs of $D$. We investigate its relationship with the dichromatic number. In particular, this concept allows us to define $\\dic$-bounded classes of digraphs, which constitute the main topic of this paper, with a pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04265","kind":"arxiv","version":2},"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/2310.04265/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":"2310.04265","created_at":"2026-06-23T03:13:42.882467+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04265v2","created_at":"2026-06-23T03:13:42.882467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04265","created_at":"2026-06-23T03:13:42.882467+00:00"},{"alias_kind":"pith_short_12","alias_value":"USZEWWFPXNTX","created_at":"2026-06-23T03:13:42.882467+00:00"},{"alias_kind":"pith_short_16","alias_value":"USZEWWFPXNTX73FP","created_at":"2026-06-23T03:13:42.882467+00:00"},{"alias_kind":"pith_short_8","alias_value":"USZEWWFP","created_at":"2026-06-23T03:13:42.882467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2407.19270","citing_title":"Computing the degreewidth of a digraph is hard","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL","json":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL.json","graph_json":"https://pith.science/api/pith-number/USZEWWFPXNTX73FPVHLD7Z5GOL/graph.json","events_json":"https://pith.science/api/pith-number/USZEWWFPXNTX73FPVHLD7Z5GOL/events.json","paper":"https://pith.science/paper/USZEWWFP"},"agent_actions":{"view_html":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL","download_json":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL.json","view_paper":"https://pith.science/paper/USZEWWFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04265&json=true","fetch_graph":"https://pith.science/api/pith-number/USZEWWFPXNTX73FPVHLD7Z5GOL/graph.json","fetch_events":"https://pith.science/api/pith-number/USZEWWFPXNTX73FPVHLD7Z5GOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL/action/storage_attestation","attest_author":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL/action/author_attestation","sign_citation":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL/action/citation_signature","submit_replication":"https://pith.science/pith/USZEWWFPXNTX73FPVHLD7Z5GOL/action/replication_record"}},"created_at":"2026-06-23T03:13:42.882467+00:00","updated_at":"2026-06-23T03:13:42.882467+00:00"}