{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SCV4EEE3RNGWJVGKDHOL7JMOY6","short_pith_number":"pith:SCV4EEE3","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"},"canonical_sha256":"90abc2109b8b4d64d4ca19dcbfa58ec79b16b30b56335fa2871e042484d33658","source":{"kind":"arxiv","id":"2012.09201","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09201","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09201v2","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09201","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"SCV4EEE3RNGW","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"SCV4EEE3RNGWJVGK","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"SCV4EEE3","created_at":"2026-05-20T02:05:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SCV4EEE3RNGWJVGKDHOL7JMOY6","target":"record","payload":{"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"},"canonical_sha256":"90abc2109b8b4d64d4ca19dcbfa58ec79b16b30b56335fa2871e042484d33658","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"},"source_kind":"arxiv","source_id":"2012.09201","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T02:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HK3/PiA4K1d1RyYgjuGzQpiBkA/OWgzb0gQWGtBUpa3RGPRDJBStL/+WVvhlqhG9H4QY0mbW36heTOMz83D1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:36:36.736692Z"},"content_sha256":"a749394d42f1657b6e9b5451f0685b60c5f6d0aec73790611d42f285ed6f4deb","schema_version":"1.0","event_id":"sha256:a749394d42f1657b6e9b5451f0685b60c5f6d0aec73790611d42f285ed6f4deb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SCV4EEE3RNGWJVGKDHOL7JMOY6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T02:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WGZXEv0ohXkLjfvayDXS732PiQV5AqMpb7iBHYeRnC4uKhCic5fFOufqgavzvytaQButL0ad3EZdjG5L/5YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:36:36.737582Z"},"content_sha256":"9b33d9386e1444593518b4944b53e5cd39e4e2128b9da71249b1934b50decabb","schema_version":"1.0","event_id":"sha256:9b33d9386e1444593518b4944b53e5cd39e4e2128b9da71249b1934b50decabb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/bundle.json","state_url":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T14:36:36Z","links":{"resolver":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6","bundle":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/bundle.json","state":"https://pith.science/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCV4EEE3RNGWJVGKDHOL7JMOY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SCV4EEE3RNGWJVGKDHOL7JMOY6","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":"4faeaef0e89f2236a1579954185fe96b28e2bc3c6703828f53f00fd7c68e3e12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-16T19:01:11Z","title_canon_sha256":"cee71727512bd9fa1063414f0714c2bd7d5af631ab7c585b1581a905d73e5232"},"schema_version":"1.0","source":{"id":"2012.09201","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09201","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09201v2","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09201","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"SCV4EEE3RNGW","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"SCV4EEE3RNGWJVGK","created_at":"2026-05-20T02:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"SCV4EEE3","created_at":"2026-05-20T02:05:30Z"}],"graph_snapshots":[{"event_id":"sha256:9b33d9386e1444593518b4944b53e5cd39e4e2128b9da71249b1934b50decabb","target":"graph","created_at":"2026-05-20T02:05:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.09201/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 (","authors_text":"Richard Mycroft, T\\'assio Naia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-16T19:01:11Z","title":"Trees and treelike structures in dense digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09201","kind":"arxiv","version":2},"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:a749394d42f1657b6e9b5451f0685b60c5f6d0aec73790611d42f285ed6f4deb","target":"record","created_at":"2026-05-20T02:05:30Z","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":"4faeaef0e89f2236a1579954185fe96b28e2bc3c6703828f53f00fd7c68e3e12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-16T19:01:11Z","title_canon_sha256":"cee71727512bd9fa1063414f0714c2bd7d5af631ab7c585b1581a905d73e5232"},"schema_version":"1.0","source":{"id":"2012.09201","kind":"arxiv","version":2}},"canonical_sha256":"90abc2109b8b4d64d4ca19dcbfa58ec79b16b30b56335fa2871e042484d33658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90abc2109b8b4d64d4ca19dcbfa58ec79b16b30b56335fa2871e042484d33658","first_computed_at":"2026-05-20T02:05:30.859942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T02:05:30.859942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wlCEu72ruo+iau3nyZg92EahLY+Rs9rGDWYbHxcXV4YKcYSEzRO+Rr/DRaYOyvTwfJXsxXL21uKS3zQ0k8onCQ==","signature_status":"signed_v1","signed_at":"2026-05-20T02:05:30.862300Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.09201","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a749394d42f1657b6e9b5451f0685b60c5f6d0aec73790611d42f285ed6f4deb","sha256:9b33d9386e1444593518b4944b53e5cd39e4e2128b9da71249b1934b50decabb"],"state_sha256":"83e8fd9c3497cdb0d5c6bf122ac2bdabd7c8616fc579c1e84f8742f6512684b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQEsfO/xJgnZd5+mXQyU+LLWASUqyQ+3JsBaUzpN+cpwIlqTtwzaVMByQRFViXGGkpKUXZT9/JloFbFZKk07CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:36:36.741106Z","bundle_sha256":"f4de55d46b082bc0e8b0234f429153fb7434a1d74ffe5adc6dc0730aa1e1e750"}}