{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MG3MOWD2RY4I5MNB7AV4FPDO67","short_pith_number":"pith:MG3MOWD2","schema_version":"1.0","canonical_sha256":"61b6c7587a8e388eb1a1f82bc2bc6ef7c83d16c0af66c34f28e87c04559c96d1","source":{"kind":"arxiv","id":"1605.07411","version":1},"attestation_state":"computed","paper":{"title":"$\\chi$-bounded families of oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Havet, Fr\\'ed\\'eric Maffray, J{\\o}rgen Bang-Jensen, Jose Zamora, Nicolas Bousquet, Pierre Aboulker, Pierre Charbit","submitted_at":"2016-05-24T12:28:54Z","abstract_excerpt":"A famous conjecture of Gy\\'arf\\'as and Sumner states for any tree $T$ and integer $k$, if the chromatic number of a graph is large enough, either the graph contains a clique of size $k$ or it contains $T$ as an induced subgraph. We discuss some results and open problems about extensions of this conjecture to oriented graphs. We conjecture that for every oriented star $S$ and integer $k$, if the chromatic number of a digraph is large enough, either the digraph contains a clique of size $k$ or it contains $S$ as an induced subgraph. As an evidence, we prove that for any oriented star $S$, every "},"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":"1605.07411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-24T12:28:54Z","cross_cats_sorted":[],"title_canon_sha256":"7fe8b1b8eef87c1feb4a89eab561c14c5eba5b32e73cbb3b82bdc4364495958d","abstract_canon_sha256":"684f6474b486c41137416be17231e454f26eb95aafa41c5fd8d647dc9056f227"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:46.143369Z","signature_b64":"gpYdSlAcQ/NvKiFcSOi331VCCiy37JDIS/yZQWhNfVu6pOkBLp8SUAaV76jtOUstnahLTAm+RdGRTF0Ddq3tAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b6c7587a8e388eb1a1f82bc2bc6ef7c83d16c0af66c34f28e87c04559c96d1","last_reissued_at":"2026-05-18T01:13:46.142729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:46.142729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\chi$-bounded families of oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Havet, Fr\\'ed\\'eric Maffray, J{\\o}rgen Bang-Jensen, Jose Zamora, Nicolas Bousquet, Pierre Aboulker, Pierre Charbit","submitted_at":"2016-05-24T12:28:54Z","abstract_excerpt":"A famous conjecture of Gy\\'arf\\'as and Sumner states for any tree $T$ and integer $k$, if the chromatic number of a graph is large enough, either the graph contains a clique of size $k$ or it contains $T$ as an induced subgraph. We discuss some results and open problems about extensions of this conjecture to oriented graphs. We conjecture that for every oriented star $S$ and integer $k$, if the chromatic number of a digraph is large enough, either the digraph contains a clique of size $k$ or it contains $S$ as an induced subgraph. As an evidence, we prove that for any oriented star $S$, every "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07411","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":""},"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":"1605.07411","created_at":"2026-05-18T01:13:46.142819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07411v1","created_at":"2026-05-18T01:13:46.142819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07411","created_at":"2026-05-18T01:13:46.142819+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG3MOWD2RY4I","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG3MOWD2RY4I5MNB","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG3MOWD2","created_at":"2026-05-18T12:30:32.724797+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/MG3MOWD2RY4I5MNB7AV4FPDO67","json":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67.json","graph_json":"https://pith.science/api/pith-number/MG3MOWD2RY4I5MNB7AV4FPDO67/graph.json","events_json":"https://pith.science/api/pith-number/MG3MOWD2RY4I5MNB7AV4FPDO67/events.json","paper":"https://pith.science/paper/MG3MOWD2"},"agent_actions":{"view_html":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67","download_json":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67.json","view_paper":"https://pith.science/paper/MG3MOWD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07411&json=true","fetch_graph":"https://pith.science/api/pith-number/MG3MOWD2RY4I5MNB7AV4FPDO67/graph.json","fetch_events":"https://pith.science/api/pith-number/MG3MOWD2RY4I5MNB7AV4FPDO67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67/action/storage_attestation","attest_author":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67/action/author_attestation","sign_citation":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67/action/citation_signature","submit_replication":"https://pith.science/pith/MG3MOWD2RY4I5MNB7AV4FPDO67/action/replication_record"}},"created_at":"2026-05-18T01:13:46.142819+00:00","updated_at":"2026-05-18T01:13:46.142819+00:00"}