{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T3JAQRSSC3FRXGRTSK4KANU2BE","short_pith_number":"pith:T3JAQRSS","canonical_record":{"source":{"id":"1603.08198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-27T10:19:25Z","cross_cats_sorted":[],"title_canon_sha256":"7ee066a3eb4158dcbec93c8bfdaa2e2c8c0d3df753597853b741c113be3a628d","abstract_canon_sha256":"5ec2e213b0cd06f4d20c5766ffd5088fa3391e8f1b4cbb6b4edac5eab53babe8"},"schema_version":"1.0"},"canonical_sha256":"9ed208465216cb1b9a3392b8a0369a0925ff84767f9e9b76e05529de8b4795d2","source":{"kind":"arxiv","id":"1603.08198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08198","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08198v1","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08198","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"T3JAQRSSC3FR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3JAQRSSC3FRXGRT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3JAQRSS","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T3JAQRSSC3FRXGRTSK4KANU2BE","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-27T10:19:25Z","cross_cats_sorted":[],"title_canon_sha256":"7ee066a3eb4158dcbec93c8bfdaa2e2c8c0d3df753597853b741c113be3a628d","abstract_canon_sha256":"5ec2e213b0cd06f4d20c5766ffd5088fa3391e8f1b4cbb6b4edac5eab53babe8"},"schema_version":"1.0"},"canonical_sha256":"9ed208465216cb1b9a3392b8a0369a0925ff84767f9e9b76e05529de8b4795d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:12.953840Z","signature_b64":"GlZKuvrhGSB/DoXRTJCgLW5sFhCuyT1EOTOdH+3BtcekQWZJaKC59pSi/WlmE028zCVA3l6+T9XRKh0MvKl5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed208465216cb1b9a3392b8a0369a0925ff84767f9e9b76e05529de8b4795d2","last_reissued_at":"2026-05-18T01:18:12.953137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:12.953137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08198","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:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EroR1tnm+dyc1YSMvBizeFTvL6jgMhiGTsff0kAbhUUS3C40anCE92x44DX197YXJhS7wQ2enFmqYDQwzyI/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:58:53.858495Z"},"content_sha256":"49cf92679fbd7412155d17fa8b4510752e58988d5b16ec520bac8baeedfcf2a4","schema_version":"1.0","event_id":"sha256:49cf92679fbd7412155d17fa8b4510752e58988d5b16ec520bac8baeedfcf2a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T3JAQRSSC3FRXGRTSK4KANU2BE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tiling directed graphs with tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Andrzej Czygrinow, Louis DeBiasio, Theodore Molla","submitted_at":"2016-03-27T10:19:25Z","abstract_excerpt":"The Hajnal--Szemer\\'edi theorem states that for any integer $r \\ge 1$ and any multiple $n$ of $r$, if $G$ is a graph on $n$ vertices and $\\delta(G) \\ge (1 - 1/r)n$, then $G$ can be partitioned into $n/r$ vertex-disjoint copies of the complete graph on $r$ vertices. We prove a very general analogue of this result for directed graphs: for any integer $r \\ge 4$ and any sufficiently large multiple $n$ of $r$, if $G$ is a directed graph on $n$ vertices and every vertex is incident to at least $2(1 - 1/r)n - 1$ directed edges, then $G$ can be partitioned into $n/r$ vertex-disjoint subgraphs of size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08198","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:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r89YOZ7AJHej0gQ6/TKqCj2xUWiRcMKwIKnBYsrcBR43x7umtSdGuqxc+nqRqDxeILq7FZwlVo3XActVWrebAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:58:53.859223Z"},"content_sha256":"b1a018aaad70e19fd23636c42d3e497aef272a6ad784e33f48bfb093c730bd44","schema_version":"1.0","event_id":"sha256:b1a018aaad70e19fd23636c42d3e497aef272a6ad784e33f48bfb093c730bd44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3JAQRSSC3FRXGRTSK4KANU2BE/bundle.json","state_url":"https://pith.science/pith/T3JAQRSSC3FRXGRTSK4KANU2BE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3JAQRSSC3FRXGRTSK4KANU2BE/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-06-10T22:58:53Z","links":{"resolver":"https://pith.science/pith/T3JAQRSSC3FRXGRTSK4KANU2BE","bundle":"https://pith.science/pith/T3JAQRSSC3FRXGRTSK4KANU2BE/bundle.json","state":"https://pith.science/pith/T3JAQRSSC3FRXGRTSK4KANU2BE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3JAQRSSC3FRXGRTSK4KANU2BE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T3JAQRSSC3FRXGRTSK4KANU2BE","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":"5ec2e213b0cd06f4d20c5766ffd5088fa3391e8f1b4cbb6b4edac5eab53babe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-27T10:19:25Z","title_canon_sha256":"7ee066a3eb4158dcbec93c8bfdaa2e2c8c0d3df753597853b741c113be3a628d"},"schema_version":"1.0","source":{"id":"1603.08198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08198","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08198v1","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08198","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"T3JAQRSSC3FR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3JAQRSSC3FRXGRT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3JAQRSS","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:b1a018aaad70e19fd23636c42d3e497aef272a6ad784e33f48bfb093c730bd44","target":"graph","created_at":"2026-05-18T01:18:12Z","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":"The Hajnal--Szemer\\'edi theorem states that for any integer $r \\ge 1$ and any multiple $n$ of $r$, if $G$ is a graph on $n$ vertices and $\\delta(G) \\ge (1 - 1/r)n$, then $G$ can be partitioned into $n/r$ vertex-disjoint copies of the complete graph on $r$ vertices. We prove a very general analogue of this result for directed graphs: for any integer $r \\ge 4$ and any sufficiently large multiple $n$ of $r$, if $G$ is a directed graph on $n$ vertices and every vertex is incident to at least $2(1 - 1/r)n - 1$ directed edges, then $G$ can be partitioned into $n/r$ vertex-disjoint subgraphs of size ","authors_text":"Andrew Treglown, Andrzej Czygrinow, Louis DeBiasio, Theodore Molla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-27T10:19:25Z","title":"Tiling directed graphs with tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08198","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:49cf92679fbd7412155d17fa8b4510752e58988d5b16ec520bac8baeedfcf2a4","target":"record","created_at":"2026-05-18T01:18:12Z","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":"5ec2e213b0cd06f4d20c5766ffd5088fa3391e8f1b4cbb6b4edac5eab53babe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-27T10:19:25Z","title_canon_sha256":"7ee066a3eb4158dcbec93c8bfdaa2e2c8c0d3df753597853b741c113be3a628d"},"schema_version":"1.0","source":{"id":"1603.08198","kind":"arxiv","version":1}},"canonical_sha256":"9ed208465216cb1b9a3392b8a0369a0925ff84767f9e9b76e05529de8b4795d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ed208465216cb1b9a3392b8a0369a0925ff84767f9e9b76e05529de8b4795d2","first_computed_at":"2026-05-18T01:18:12.953137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:12.953137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GlZKuvrhGSB/DoXRTJCgLW5sFhCuyT1EOTOdH+3BtcekQWZJaKC59pSi/WlmE028zCVA3l6+T9XRKh0MvKl5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:12.953840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49cf92679fbd7412155d17fa8b4510752e58988d5b16ec520bac8baeedfcf2a4","sha256:b1a018aaad70e19fd23636c42d3e497aef272a6ad784e33f48bfb093c730bd44"],"state_sha256":"c5e032037343e8b42f09cbaa92428b9bd948f2efa1e979461ccffb6d38d28e27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ut8dhWiHdhwPxKhzhaC5tgbmBq9XByT7eywsZSJ9Cx2xhfKKLGz1aiykJSLs5BzFq0FMCA4fAJ4L3OVP9AtOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:58:53.863425Z","bundle_sha256":"a8f90afd2095b7f4c07c1ee2e92ff24d0e06c7e87cb2f30012df3164077379e1"}}