{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KTIX75QAD5WJUUJ5Q7MNJ6JWBC","short_pith_number":"pith:KTIX75QA","schema_version":"1.0","canonical_sha256":"54d17ff6001f6c9a513d87d8d4f93608a9a23c220a18490a757be29703c69c4e","source":{"kind":"arxiv","id":"2509.07760","version":1},"attestation_state":"computed","paper":{"title":"A directed Andr\\'asfai-Erd\\H{o}s-S\\'os theorem and chromatic profiles of oriented cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yisai Xue","submitted_at":"2025-09-09T13:58:07Z","abstract_excerpt":"The chromatic profile of a digraph $H$, denoted by $\\delta_{\\chi}^{+}(H,k)$, is the infimum $d$ such that any $H$-free digraph $D$ on $n$ vertices with minimum out-degree $\\delta^{+}(D) \\ge dn$ must be $k$-colorable. We determine the exact chromatic profile for several fundamental classes of digraphs. Our main result is a directed analogue of the Andr\\'asfai-Erd\\H{o}s-S\\'os theorem, stating that $\\delta_\\chi^{+}(T_r, r-1)=\\frac{3 r-7}{3 r-4}$, where $T_r$ is the transitive tournament on $r$ vertices. We then determine the chromatic profile for directed odd cycles, showing that $\\delta^+_\\chi(\\"},"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":"2509.07760","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-09T13:58:07Z","cross_cats_sorted":[],"title_canon_sha256":"45eef8e539d5114d01c796e6de2ee3a66d89681427fa800c7eae615c85daeade","abstract_canon_sha256":"6d70822a42f9b2d035bc742930fe47a0ad9922a48e4d92a86301494c883d5cf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:27.634230Z","signature_b64":"kmLZ+uc25DJ2KM/qimeAS1SMu6Q7j7+hwxTadyeJrlYIjviobiRWXQbp0Mjey+lRcB5abqQ8ohfHfeuFR29BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d17ff6001f6c9a513d87d8d4f93608a9a23c220a18490a757be29703c69c4e","last_reissued_at":"2026-07-05T12:07:27.633692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:27.633692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A directed Andr\\'asfai-Erd\\H{o}s-S\\'os theorem and chromatic profiles of oriented cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yisai Xue","submitted_at":"2025-09-09T13:58:07Z","abstract_excerpt":"The chromatic profile of a digraph $H$, denoted by $\\delta_{\\chi}^{+}(H,k)$, is the infimum $d$ such that any $H$-free digraph $D$ on $n$ vertices with minimum out-degree $\\delta^{+}(D) \\ge dn$ must be $k$-colorable. We determine the exact chromatic profile for several fundamental classes of digraphs. Our main result is a directed analogue of the Andr\\'asfai-Erd\\H{o}s-S\\'os theorem, stating that $\\delta_\\chi^{+}(T_r, r-1)=\\frac{3 r-7}{3 r-4}$, where $T_r$ is the transitive tournament on $r$ vertices. We then determine the chromatic profile for directed odd cycles, showing that $\\delta^+_\\chi(\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07760","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/2509.07760/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":"2509.07760","created_at":"2026-07-05T12:07:27.633772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07760v1","created_at":"2026-07-05T12:07:27.633772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07760","created_at":"2026-07-05T12:07:27.633772+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTIX75QAD5WJ","created_at":"2026-07-05T12:07:27.633772+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTIX75QAD5WJUUJ5","created_at":"2026-07-05T12:07:27.633772+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTIX75QA","created_at":"2026-07-05T12:07:27.633772+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09394","citing_title":"On the chromatic profile for tripartite graphs and beyond","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09394","citing_title":"On the chromatic profile for tripartite graphs and beyond","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC","json":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC.json","graph_json":"https://pith.science/api/pith-number/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/graph.json","events_json":"https://pith.science/api/pith-number/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/events.json","paper":"https://pith.science/paper/KTIX75QA"},"agent_actions":{"view_html":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC","download_json":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC.json","view_paper":"https://pith.science/paper/KTIX75QA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07760&json=true","fetch_graph":"https://pith.science/api/pith-number/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/graph.json","fetch_events":"https://pith.science/api/pith-number/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/action/storage_attestation","attest_author":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/action/author_attestation","sign_citation":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/action/citation_signature","submit_replication":"https://pith.science/pith/KTIX75QAD5WJUUJ5Q7MNJ6JWBC/action/replication_record"}},"created_at":"2026-07-05T12:07:27.633772+00:00","updated_at":"2026-07-05T12:07:27.633772+00:00"}