{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BOMY57OTBXOFS5I4GOPQGEVPXO","short_pith_number":"pith:BOMY57OT","canonical_record":{"source":{"id":"1701.08335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T00:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"051f3dcb7fd1b1be2fe351129e551627326dc9e86098ecfb22ccf59c5b589fa9","abstract_canon_sha256":"92ee88d6beeaeae7df6fcad7e8726b7f14d9ebe81bf15e4d5133b84e4dbaa255"},"schema_version":"1.0"},"canonical_sha256":"0b998efdd30ddc59751c339f0312afbb9cf276226db0e665619e2f899e3de3b6","source":{"kind":"arxiv","id":"1701.08335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08335","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08335v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08335","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"BOMY57OTBXOF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BOMY57OTBXOFS5I4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BOMY57OT","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BOMY57OTBXOFS5I4GOPQGEVPXO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T00:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"051f3dcb7fd1b1be2fe351129e551627326dc9e86098ecfb22ccf59c5b589fa9","abstract_canon_sha256":"92ee88d6beeaeae7df6fcad7e8726b7f14d9ebe81bf15e4d5133b84e4dbaa255"},"schema_version":"1.0"},"canonical_sha256":"0b998efdd30ddc59751c339f0312afbb9cf276226db0e665619e2f899e3de3b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:54.498599Z","signature_b64":"MNL9LY41lYtnZ9PoHEN9vV26FF6kNxhHdspHgYS3iXcCUKvwvsmkxuB/oO6W2vCUCU3QcL1ZRweNugAVHRgKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b998efdd30ddc59751c339f0312afbb9cf276226db0e665619e2f899e3de3b6","last_reissued_at":"2026-05-18T00:51:54.497766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:54.497766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08335","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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mq0opD5nQxrB9HG01j4emjMBgixpRQuJNKkLhac/H+x0KdAXuaAArmcXQ0ITjSZvjmQQxogMIKBPn0C5HqO8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:58:59.432417Z"},"content_sha256":"3d27c93944917670aca0fba3f781e1b5d4ae89bfe6e205d37af4c742b03a3366","schema_version":"1.0","event_id":"sha256:3d27c93944917670aca0fba3f781e1b5d4ae89bfe6e205d37af4c742b03a3366"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BOMY57OTBXOFS5I4GOPQGEVPXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing the Complete $r$-Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, Luka Mili\\'cevi\\'c, Ta Sheng Tan","submitted_at":"2017-01-29T00:02:48Z","abstract_excerpt":"Let $f_r(n)$ be the minimum number of complete $r$-partite $r$-graphs needed to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. Graham and Pollak showed that $f_2(n) = n-1$. An easy construction shows that $f_r(n)\\le (1-o(1))\\binom{n}{\\lfloor r/2\\rfloor}$ and it has been unknown if this upper bound is asymptotically sharp. In this paper we show that $f_r(n)\\le (\\frac{14}{15}+o(1))\\binom{n}{r/2}$ for each even $r\\ge 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08335","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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIq2njILgoOMPMeq12RGD0+nG+KpsPOgvr7QATl0ZSgoYzrrnVI159B+O5pyjCA1N2+/5FlBik9BHKiBv1yRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:58:59.432762Z"},"content_sha256":"258f24b8cbea48d2b8c8de90e6f6f98b7078218e5c1fcc847ef7a9be6e7558a9","schema_version":"1.0","event_id":"sha256:258f24b8cbea48d2b8c8de90e6f6f98b7078218e5c1fcc847ef7a9be6e7558a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOMY57OTBXOFS5I4GOPQGEVPXO/bundle.json","state_url":"https://pith.science/pith/BOMY57OTBXOFS5I4GOPQGEVPXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOMY57OTBXOFS5I4GOPQGEVPXO/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-02T15:58:59Z","links":{"resolver":"https://pith.science/pith/BOMY57OTBXOFS5I4GOPQGEVPXO","bundle":"https://pith.science/pith/BOMY57OTBXOFS5I4GOPQGEVPXO/bundle.json","state":"https://pith.science/pith/BOMY57OTBXOFS5I4GOPQGEVPXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOMY57OTBXOFS5I4GOPQGEVPXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BOMY57OTBXOFS5I4GOPQGEVPXO","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":"92ee88d6beeaeae7df6fcad7e8726b7f14d9ebe81bf15e4d5133b84e4dbaa255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T00:02:48Z","title_canon_sha256":"051f3dcb7fd1b1be2fe351129e551627326dc9e86098ecfb22ccf59c5b589fa9"},"schema_version":"1.0","source":{"id":"1701.08335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08335","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08335v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08335","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"BOMY57OTBXOF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BOMY57OTBXOFS5I4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BOMY57OT","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:258f24b8cbea48d2b8c8de90e6f6f98b7078218e5c1fcc847ef7a9be6e7558a9","target":"graph","created_at":"2026-05-18T00:51:54Z","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":"Let $f_r(n)$ be the minimum number of complete $r$-partite $r$-graphs needed to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. Graham and Pollak showed that $f_2(n) = n-1$. An easy construction shows that $f_r(n)\\le (1-o(1))\\binom{n}{\\lfloor r/2\\rfloor}$ and it has been unknown if this upper bound is asymptotically sharp. In this paper we show that $f_r(n)\\le (\\frac{14}{15}+o(1))\\binom{n}{r/2}$ for each even $r\\ge 4$.","authors_text":"Imre Leader, Luka Mili\\'cevi\\'c, Ta Sheng Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T00:02:48Z","title":"Decomposing the Complete $r$-Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08335","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:3d27c93944917670aca0fba3f781e1b5d4ae89bfe6e205d37af4c742b03a3366","target":"record","created_at":"2026-05-18T00:51:54Z","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":"92ee88d6beeaeae7df6fcad7e8726b7f14d9ebe81bf15e4d5133b84e4dbaa255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T00:02:48Z","title_canon_sha256":"051f3dcb7fd1b1be2fe351129e551627326dc9e86098ecfb22ccf59c5b589fa9"},"schema_version":"1.0","source":{"id":"1701.08335","kind":"arxiv","version":1}},"canonical_sha256":"0b998efdd30ddc59751c339f0312afbb9cf276226db0e665619e2f899e3de3b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b998efdd30ddc59751c339f0312afbb9cf276226db0e665619e2f899e3de3b6","first_computed_at":"2026-05-18T00:51:54.497766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:54.497766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MNL9LY41lYtnZ9PoHEN9vV26FF6kNxhHdspHgYS3iXcCUKvwvsmkxuB/oO6W2vCUCU3QcL1ZRweNugAVHRgKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:54.498599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d27c93944917670aca0fba3f781e1b5d4ae89bfe6e205d37af4c742b03a3366","sha256:258f24b8cbea48d2b8c8de90e6f6f98b7078218e5c1fcc847ef7a9be6e7558a9"],"state_sha256":"6a41a1e2eadff327b08ef485c7462772cf18a877f65d05a01d5accde404d4ae3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nd2Sf3NTRWf6mCXnqaufVNos4vNk62ysYfxDaeuzQwMyI7Ye0izC5P1m/vySIjbJaJ38SMY7vMYkYK+UNMvwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:58:59.434754Z","bundle_sha256":"227493050cb4927489ffb6c29f6de76704cb837c748550138ae6fe99af74ed90"}}