{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2Q5IGWZBEKMV5YM7U5UI7IQHC2","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":"92d17f32f9d8822b751ad6c841cde36e5ec909e9f56d7943ea1e98b707879212","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-10T11:09:18Z","title_canon_sha256":"4c0d445a339d524d7ba8a437cf26625e63201fd752bbe4d326f97a89fe9af369"},"schema_version":"1.0","source":{"id":"1908.03733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03733","created_at":"2026-07-04T23:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03733v1","created_at":"2026-07-04T23:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03733","created_at":"2026-07-04T23:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"2Q5IGWZBEKMV","created_at":"2026-07-04T23:53:17Z"},{"alias_kind":"pith_short_16","alias_value":"2Q5IGWZBEKMV5YM7","created_at":"2026-07-04T23:53:17Z"},{"alias_kind":"pith_short_8","alias_value":"2Q5IGWZB","created_at":"2026-07-04T23:53:17Z"}],"graph_snapshots":[{"event_id":"sha256:f7b5342d9f92b4f3501919f9545b70a6e5e1ff9ef86a199722763f1c3eb62b92","target":"graph","created_at":"2026-07-04T23:53:17Z","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/1908.03733/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that for every positive integer $k$, any tournament with minimum out-degree at least $(2+o(1))k^2$ contains a subdivision of the complete directed graph on $k$ vertices, which is best possible up to a factor of $8$. This may be viewed as a directed analogue of a theorem proved by Bollob\\'as and Thomason, and independently by Koml\\'os and Szemer\\'edi, concerning subdivisions of cliques in graphs with sufficiently high average degree. We also consider the following problem: given $k$, what is the smallest positive integer $f(k)$ such that any $f(k)$-vertex tournament contains a $1$-subdi","authors_text":"Ant\\'onio Gir\\~ao, Kamil Popielarz, Richard Snyder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-10T11:09:18Z","title":"Subdivisions of digraphs in tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03733","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:03df5877ce03db94c603e85dbedebda48cb43e858d5551f2d911ca1e6b598915","target":"record","created_at":"2026-07-04T23:53:17Z","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":"92d17f32f9d8822b751ad6c841cde36e5ec909e9f56d7943ea1e98b707879212","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-10T11:09:18Z","title_canon_sha256":"4c0d445a339d524d7ba8a437cf26625e63201fd752bbe4d326f97a89fe9af369"},"schema_version":"1.0","source":{"id":"1908.03733","kind":"arxiv","version":1}},"canonical_sha256":"d43a835b2122995ee19fa7688fa207169d2e7202520c3d0cc688601474ce25b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d43a835b2122995ee19fa7688fa207169d2e7202520c3d0cc688601474ce25b1","first_computed_at":"2026-07-04T23:53:17.821756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:53:17.821756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6HNBN1GYggkdP1F3sAkVrIGjQU62UvFq1ntdWdvbDPlzb92zkWyfZipzZ21QP6BaP4evtw87q0ea9wsw8o0KAw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:53:17.822091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03df5877ce03db94c603e85dbedebda48cb43e858d5551f2d911ca1e6b598915","sha256:f7b5342d9f92b4f3501919f9545b70a6e5e1ff9ef86a199722763f1c3eb62b92"],"state_sha256":"b66812a4a25374743a467929d8ed8a8810c38c6debcd4ac5ff7f523af02f8b27"}