{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Y4OWMAHL25CWDOQWD2OA5VBMR3","short_pith_number":"pith:Y4OWMAHL","canonical_record":{"source":{"id":"1609.03393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-12T13:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"8e94bcc3b2e35b500b333e4643675992eed9e295f07a22915b428cc28d5a6d8b","abstract_canon_sha256":"a778b2a1ad3dc6b524de21b79ea37a2e488a2d2bceeb3049db0c88192ab9e0ee"},"schema_version":"1.0"},"canonical_sha256":"c71d6600ebd74561ba161e9c0ed42c8ed62e99f6b512ceb86caa5595392ddb7e","source":{"kind":"arxiv","id":"1609.03393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03393","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03393v1","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03393","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"Y4OWMAHL25CW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y4OWMAHL25CWDOQW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y4OWMAHL","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Y4OWMAHL25CWDOQWD2OA5VBMR3","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-12T13:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"8e94bcc3b2e35b500b333e4643675992eed9e295f07a22915b428cc28d5a6d8b","abstract_canon_sha256":"a778b2a1ad3dc6b524de21b79ea37a2e488a2d2bceeb3049db0c88192ab9e0ee"},"schema_version":"1.0"},"canonical_sha256":"c71d6600ebd74561ba161e9c0ed42c8ed62e99f6b512ceb86caa5595392ddb7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:47.051161Z","signature_b64":"mUvW2maWkmyT9Jv47mV3SIymBGGM5MJMWoyM/gBQhTS8BZJOX4I/7vzkKYto/8SsJbNnarvxnABGY3nY1E8bCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c71d6600ebd74561ba161e9c0ed42c8ed62e99f6b512ceb86caa5595392ddb7e","last_reissued_at":"2026-05-18T01:04:47.050620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:47.050620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03393","source_version":1,"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-18T01:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/G1Ar1AL0UxFbg91p96ag1RCsalYV7jC7YkzUEsV5YbWt77V5aGqpJ7aBmF0iFRKz0AOdLsGhRsD9RGrHdPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:34:11.883419Z"},"content_sha256":"d8270782ac800f2a7f0bced3bb31dcd5e73b547fbe2dce037e59a58f54f6b54b","schema_version":"1.0","event_id":"sha256:d8270782ac800f2a7f0bced3bb31dcd5e73b547fbe2dce037e59a58f54f6b54b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Y4OWMAHL25CWDOQWD2OA5VBMR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unavoidable trees in tournaments","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":"2016-09-12T13:37:14Z","abstract_excerpt":"An oriented tree $T$ on $n$ vertices is unavoidable if every tournament on $n$ vertices contains a copy of $T$. In this paper we give a sufficient condition for $T$ to be unavoidable, and use this to prove that almost all labelled oriented trees are unavoidable, verifying a conjecture of Bender and Wormald. We additionally prove that every tournament on $n + o(n)$ vertices contains a copy of every oriented tree $T$ on $n$ vertices with polylogarithmic maximum degree, improving a result of K\\\"uhn, Mycroft and Osthus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03393","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"},"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-18T01:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWnMwlX0CcFoELGF9mcLvnuHbMiXg/DzRp8MBB30qFY1RY3qH/8eJPlsYdzttKgwqbeOEmylAS7KI/Lowc49AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:34:11.883755Z"},"content_sha256":"f048f4729ba5400c9dca3e922899d57c9c5f4435d81077c63c0daa3707035045","schema_version":"1.0","event_id":"sha256:f048f4729ba5400c9dca3e922899d57c9c5f4435d81077c63c0daa3707035045"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4OWMAHL25CWDOQWD2OA5VBMR3/bundle.json","state_url":"https://pith.science/pith/Y4OWMAHL25CWDOQWD2OA5VBMR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4OWMAHL25CWDOQWD2OA5VBMR3/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-05T08:34:11Z","links":{"resolver":"https://pith.science/pith/Y4OWMAHL25CWDOQWD2OA5VBMR3","bundle":"https://pith.science/pith/Y4OWMAHL25CWDOQWD2OA5VBMR3/bundle.json","state":"https://pith.science/pith/Y4OWMAHL25CWDOQWD2OA5VBMR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4OWMAHL25CWDOQWD2OA5VBMR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y4OWMAHL25CWDOQWD2OA5VBMR3","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":"a778b2a1ad3dc6b524de21b79ea37a2e488a2d2bceeb3049db0c88192ab9e0ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-12T13:37:14Z","title_canon_sha256":"8e94bcc3b2e35b500b333e4643675992eed9e295f07a22915b428cc28d5a6d8b"},"schema_version":"1.0","source":{"id":"1609.03393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03393","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03393v1","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03393","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"Y4OWMAHL25CW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y4OWMAHL25CWDOQW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y4OWMAHL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:f048f4729ba5400c9dca3e922899d57c9c5f4435d81077c63c0daa3707035045","target":"graph","created_at":"2026-05-18T01:04:47Z","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":"An oriented tree $T$ on $n$ vertices is unavoidable if every tournament on $n$ vertices contains a copy of $T$. In this paper we give a sufficient condition for $T$ to be unavoidable, and use this to prove that almost all labelled oriented trees are unavoidable, verifying a conjecture of Bender and Wormald. We additionally prove that every tournament on $n + o(n)$ vertices contains a copy of every oriented tree $T$ on $n$ vertices with polylogarithmic maximum degree, improving a result of K\\\"uhn, Mycroft and Osthus.","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":"2016-09-12T13:37:14Z","title":"Unavoidable trees in tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03393","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:d8270782ac800f2a7f0bced3bb31dcd5e73b547fbe2dce037e59a58f54f6b54b","target":"record","created_at":"2026-05-18T01:04:47Z","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":"a778b2a1ad3dc6b524de21b79ea37a2e488a2d2bceeb3049db0c88192ab9e0ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-12T13:37:14Z","title_canon_sha256":"8e94bcc3b2e35b500b333e4643675992eed9e295f07a22915b428cc28d5a6d8b"},"schema_version":"1.0","source":{"id":"1609.03393","kind":"arxiv","version":1}},"canonical_sha256":"c71d6600ebd74561ba161e9c0ed42c8ed62e99f6b512ceb86caa5595392ddb7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c71d6600ebd74561ba161e9c0ed42c8ed62e99f6b512ceb86caa5595392ddb7e","first_computed_at":"2026-05-18T01:04:47.050620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:47.050620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mUvW2maWkmyT9Jv47mV3SIymBGGM5MJMWoyM/gBQhTS8BZJOX4I/7vzkKYto/8SsJbNnarvxnABGY3nY1E8bCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:47.051161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8270782ac800f2a7f0bced3bb31dcd5e73b547fbe2dce037e59a58f54f6b54b","sha256:f048f4729ba5400c9dca3e922899d57c9c5f4435d81077c63c0daa3707035045"],"state_sha256":"569ccec0512df4bb152488694276bae02d4345f573c77f88c6f2e0b8783fa991"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4Q1AoPKURnzrY01rUwCok9+fYGREDtPaqV+S5j3Zntc9MHQcqQAsqjDIu/aReKsgfvd6b6WYnBX2wIos5npAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:34:11.885632Z","bundle_sha256":"6c759a5496b8cfb66fc01c274996bca848fd11eb86ed21f7801b99f6e9e392ed"}}