{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FMFIPKQS2TKTFY5XYTB5SYSFXE","short_pith_number":"pith:FMFIPKQS","canonical_record":{"source":{"id":"1406.3229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-12T13:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"133fba4db89118c8fe97e761c1c2c5c63241dd5aaa4b7f61cae30fac101548b4","abstract_canon_sha256":"f63abc5308b5ad4940ddd1b90e050e031b3ace6a8aff78e10f184f36bc0f9e03"},"schema_version":"1.0"},"canonical_sha256":"2b0a87aa12d4d532e3b7c4c3d96245b91263ecf1e3ec04581156141c6f5bc4e0","source":{"kind":"arxiv","id":"1406.3229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3229","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3229v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3229","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"FMFIPKQS2TKT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FMFIPKQS2TKTFY5X","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FMFIPKQS","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FMFIPKQS2TKTFY5XYTB5SYSFXE","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-12T13:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"133fba4db89118c8fe97e761c1c2c5c63241dd5aaa4b7f61cae30fac101548b4","abstract_canon_sha256":"f63abc5308b5ad4940ddd1b90e050e031b3ace6a8aff78e10f184f36bc0f9e03"},"schema_version":"1.0"},"canonical_sha256":"2b0a87aa12d4d532e3b7c4c3d96245b91263ecf1e3ec04581156141c6f5bc4e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.811783Z","signature_b64":"FNd+AntOIH/BLH4/2YCZv6dh1XV7oFmzX2715wv10B7/3mL7Jwj65/3egfoZkWdqxcA8hmChW50ulAYfUJXZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b0a87aa12d4d532e3b7c4c3d96245b91263ecf1e3ec04581156141c6f5bc4e0","last_reissued_at":"2026-05-18T02:28:47.811041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.811041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3229","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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SU+8BHxpBAoKgbJqdypVUNZhzTQQhowwJ+R/aLwOreNWkbcWlBOqmtKg67C8gNlbyugHUaiGEc+tN42UM3gGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:13:10.422225Z"},"content_sha256":"ecf18c42a52280c00151f6ea86ddef6bb0f587279426c72e4566da582fadfa3b","schema_version":"1.0","event_id":"sha256:ecf18c42a52280c00151f6ea86ddef6bb0f587279426c72e4566da582fadfa3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FMFIPKQS2TKTFY5XYTB5SYSFXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On directed versions of the Hajnal--Szemer\\'edi theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown","submitted_at":"2014-06-12T13:11:38Z","abstract_excerpt":"We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\\'edi theorem characterises the minimum degree that ensures a graph $G$ contains a perfect $K_r$-packing. In this paper we prove the following analogue for directed graphs: Suppose that $T$ is a tournament on $r$ vertices and $G$ is a digraph of sufficiently large order $n$ where $r$ divides $n$. If $G$ has minimum in- and outdegree at least $ (1-1/r)n$ then $G$ contains a perfect $T$-packing. In the case when $T$ is a cycli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3229","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":""},"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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4ibJ07IzcOvkKjJz2Ys4mlXCDwcZUY4tNv0hJM8h5UvgaI/+XxNuhHuigBW7boQB0WUYEI4z1IkSkck5X2UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:13:10.422594Z"},"content_sha256":"106353e3459ba42d242a1645ba3e34e9c1e8bed8d6240943016ae73499e9857b","schema_version":"1.0","event_id":"sha256:106353e3459ba42d242a1645ba3e34e9c1e8bed8d6240943016ae73499e9857b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/bundle.json","state_url":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/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-23T04:13:10Z","links":{"resolver":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE","bundle":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/bundle.json","state":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FMFIPKQS2TKTFY5XYTB5SYSFXE","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":"f63abc5308b5ad4940ddd1b90e050e031b3ace6a8aff78e10f184f36bc0f9e03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-12T13:11:38Z","title_canon_sha256":"133fba4db89118c8fe97e761c1c2c5c63241dd5aaa4b7f61cae30fac101548b4"},"schema_version":"1.0","source":{"id":"1406.3229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3229","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3229v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3229","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"FMFIPKQS2TKT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FMFIPKQS2TKTFY5X","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FMFIPKQS","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:106353e3459ba42d242a1645ba3e34e9c1e8bed8d6240943016ae73499e9857b","target":"graph","created_at":"2026-05-18T02:28: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":"We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\\'edi theorem characterises the minimum degree that ensures a graph $G$ contains a perfect $K_r$-packing. In this paper we prove the following analogue for directed graphs: Suppose that $T$ is a tournament on $r$ vertices and $G$ is a digraph of sufficiently large order $n$ where $r$ divides $n$. If $G$ has minimum in- and outdegree at least $ (1-1/r)n$ then $G$ contains a perfect $T$-packing. In the case when $T$ is a cycli","authors_text":"Andrew Treglown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-12T13:11:38Z","title":"On directed versions of the Hajnal--Szemer\\'edi theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3229","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:ecf18c42a52280c00151f6ea86ddef6bb0f587279426c72e4566da582fadfa3b","target":"record","created_at":"2026-05-18T02:28: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":"f63abc5308b5ad4940ddd1b90e050e031b3ace6a8aff78e10f184f36bc0f9e03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-12T13:11:38Z","title_canon_sha256":"133fba4db89118c8fe97e761c1c2c5c63241dd5aaa4b7f61cae30fac101548b4"},"schema_version":"1.0","source":{"id":"1406.3229","kind":"arxiv","version":2}},"canonical_sha256":"2b0a87aa12d4d532e3b7c4c3d96245b91263ecf1e3ec04581156141c6f5bc4e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b0a87aa12d4d532e3b7c4c3d96245b91263ecf1e3ec04581156141c6f5bc4e0","first_computed_at":"2026-05-18T02:28:47.811041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.811041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FNd+AntOIH/BLH4/2YCZv6dh1XV7oFmzX2715wv10B7/3mL7Jwj65/3egfoZkWdqxcA8hmChW50ulAYfUJXZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.811783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecf18c42a52280c00151f6ea86ddef6bb0f587279426c72e4566da582fadfa3b","sha256:106353e3459ba42d242a1645ba3e34e9c1e8bed8d6240943016ae73499e9857b"],"state_sha256":"9e4fa52026a0e7f5708be46dc06dcf7d2e4184aa054e446a6ad6c497567b5d82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrWdLAHQWgoYIbMkDRW2QKg+0jbOhGKPzcFkDsXHeG2qfMhH7TGLxzGnrf37W/x5iF2F/HUV1yRDMx4QmyqsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:13:10.424582Z","bundle_sha256":"f97dd2e35063cad5b8be636566a33576fcaf8af3590a6ff7636166b6975bc269"}}