{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AYTYBPKCR3U4PPSM33DN7OBCWC","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":"a364b7762567b3d36085846fc134af1799ecf967272e50dd78b4965d3fb04ba2","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T21:41:13Z","title_canon_sha256":"92e2ea5c3615c3f62af1929c34d184dfef4b0e44a68c296a41e6beae0e1bbb02"},"schema_version":"1.0","source":{"id":"1812.05167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05167","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05167v1","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05167","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"AYTYBPKCR3U4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AYTYBPKCR3U4PPSM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AYTYBPKC","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:de8cf86642bb4caf5fc41dcba4fd83f74562a5d61e21b5eb07914fc4990d6192","target":"graph","created_at":"2026-05-17T23:58:24Z","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"},"paper":{"abstract_excerpt":"A digraph is {\\it $n$-unavoidable} if it is contained in every tournament of order $n$. We first prove that every arborescence of order $n$ with $k$ leaves is $(n+k-1)$-unavoidable. We then prove that every oriented tree of order $n$ ($n\\geq 2$) with $k$ leaves is $(\\frac{3}{2}n+\\frac{3}{2}k -2)$-unavoidable and $(\\frac{9}{2}n -\\frac{5}{2}k -\\frac{9}{2})$-unavoidable, and thus $(\\frac{21}{8} n- \\frac{47}{16})$-unavoidable. Finally, we prove that every oriented tree of order $n$ with $k$ leaves is $(n+ 144k^2 - 280k + 124)$-unavoidable.","authors_text":"Fran\\c{c}ois Dross, Fr\\'ed\\'eric Havet","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T21:41:13Z","title":"On the unavoidability of oriented trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05167","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:d39c0e2752a0f63b353829c246c08a3b8dce09d5cde7acc50b655c54891da909","target":"record","created_at":"2026-05-17T23:58:24Z","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":"a364b7762567b3d36085846fc134af1799ecf967272e50dd78b4965d3fb04ba2","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-12-12T21:41:13Z","title_canon_sha256":"92e2ea5c3615c3f62af1929c34d184dfef4b0e44a68c296a41e6beae0e1bbb02"},"schema_version":"1.0","source":{"id":"1812.05167","kind":"arxiv","version":1}},"canonical_sha256":"062780bd428ee9c7be4cdec6dfb822b0ad387a92ea36756a3a26da761d5584d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"062780bd428ee9c7be4cdec6dfb822b0ad387a92ea36756a3a26da761d5584d6","first_computed_at":"2026-05-17T23:58:24.294484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:24.294484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tn0SRgb4F4FEX+TewCC1cOMn0asj3H6n2f7zNwQA4tDmngubgWpXS7forE/H92EOMQR6OnAZjtwr8GE2KAgCDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:24.295070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d39c0e2752a0f63b353829c246c08a3b8dce09d5cde7acc50b655c54891da909","sha256:de8cf86642bb4caf5fc41dcba4fd83f74562a5d61e21b5eb07914fc4990d6192"],"state_sha256":"c061e7708d4262e58f4d06eb2dece4bf9e30b88bee44343453beb7e6b135e81a"}