{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SCV4EEE3RNGWJVGKDHOL7JMOY6","short_pith_number":"pith:SCV4EEE3","schema_version":"1.0","canonical_sha256":"90abc2109b8b4d64d4ca19dcbfa58ec79b16b30b56335fa2871e042484d33658","source":{"kind":"arxiv","id":"2012.09201","version":2},"attestation_state":"computed","paper":{"title":"Trees and treelike structures in dense digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Mycroft, T\\'assio Naia","submitted_at":"2020-12-16T19:01:11Z","abstract_excerpt":"We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph analogue of a well-known theorem of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi. Our result for trees follows from a more general result, allowing the embedding of arbitrary orientations of a much wider class of spanning ``tree-like'' structures, such as collections of at most $O(n^{0.99})$ pairwise vertex-disjoint cycles and subdivisions of graphs $H$ with $|H| < \\exp ("},"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":"2012.09201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-16T19:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"cee71727512bd9fa1063414f0714c2bd7d5af631ab7c585b1581a905d73e5232","abstract_canon_sha256":"4faeaef0e89f2236a1579954185fe96b28e2bc3c6703828f53f00fd7c68e3e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:30.862300Z","signature_b64":"wlCEu72ruo+iau3nyZg92EahLY+Rs9rGDWYbHxcXV4YKcYSEzRO+Rr/DRaYOyvTwfJXsxXL21uKS3zQ0k8onCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90abc2109b8b4d64d4ca19dcbfa58ec79b16b30b56335fa2871e042484d33658","last_reissued_at":"2026-05-20T02:05:30.859942Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:30.859942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees and treelike structures in dense digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Mycroft, T\\'assio Naia","submitted_at":"2020-12-16T19:01:11Z","abstract_excerpt":"We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph analogue of a well-known theorem of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi. Our result for trees follows from a more general result, allowing the embedding of arbitrary orientations of a much wider class of spanning ``tree-like'' structures, such as collections of at most $O(n^{0.99})$ pairwise vertex-disjoint cycles and subdivisions of graphs $H$ with $|H| < \\exp ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09201","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/2012.09201/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":"2012.09201","created_at":"2026-05-20T02:05:30.860068+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.09201v2","created_at":"2026-05-20T02:05:30.860068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09201","created_at":"2026-05-20T02:05:30.860068+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCV4EEE3RNGW","created_at":"2026-05-20T02:05:30.860068+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCV4EEE3RNGWJVGK","created_at":"2026-05-20T02:05:30.860068+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCV4EEE3","created_at":"2026-05-20T02:05:30.860068+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/SCV4EEE3RNGWJVGKDHOL7JMOY6","json":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6.json","graph_json":"https://pith.science/api/pith-number/SCV4EEE3RNGWJVGKDHOL7JMOY6/graph.json","events_json":"https://pith.science/api/pith-number/SCV4EEE3RNGWJVGKDHOL7JMOY6/events.json","paper":"https://pith.science/paper/SCV4EEE3"},"agent_actions":{"view_html":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6","download_json":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6.json","view_paper":"https://pith.science/paper/SCV4EEE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.09201&json=true","fetch_graph":"https://pith.science/api/pith-number/SCV4EEE3RNGWJVGKDHOL7JMOY6/graph.json","fetch_events":"https://pith.science/api/pith-number/SCV4EEE3RNGWJVGKDHOL7JMOY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/action/storage_attestation","attest_author":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/action/author_attestation","sign_citation":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/action/citation_signature","submit_replication":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/action/replication_record"}},"created_at":"2026-05-20T02:05:30.860068+00:00","updated_at":"2026-05-20T02:05:30.860068+00:00"}