{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CWU47BIVWUNMUHSCXS2MPBJ3TE","short_pith_number":"pith:CWU47BIV","canonical_record":{"source":{"id":"1708.01898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T14:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"3dbd07ad9ff989c5a5da951f01d516023e92b0d8cf68ed9e0ed2d73aed74e34f","abstract_canon_sha256":"487b19d21ef10f33e78e2a201edd33a63bc73ba00829bc8b4ceaa7975ba8e9b7"},"schema_version":"1.0"},"canonical_sha256":"15a9cf8515b51aca1e42bcb4c7853b9932c56bf5c3dd3cd91b8f85b2093f36e0","source":{"kind":"arxiv","id":"1708.01898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01898","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01898v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01898","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"CWU47BIVWUNM","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWU47BIVWUNMUHSC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWU47BIV","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CWU47BIVWUNMUHSCXS2MPBJ3TE","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T14:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"3dbd07ad9ff989c5a5da951f01d516023e92b0d8cf68ed9e0ed2d73aed74e34f","abstract_canon_sha256":"487b19d21ef10f33e78e2a201edd33a63bc73ba00829bc8b4ceaa7975ba8e9b7"},"schema_version":"1.0"},"canonical_sha256":"15a9cf8515b51aca1e42bcb4c7853b9932c56bf5c3dd3cd91b8f85b2093f36e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.825494Z","signature_b64":"STgzd5jhkpMya7c2sY+yddWxH/1ZsebdmHW6MLtotbu3iNSTgy/A75YzRwotRpwbmhYTwvCjHaQYLItGz40zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15a9cf8515b51aca1e42bcb4c7853b9932c56bf5c3dd3cd91b8f85b2093f36e0","last_reissued_at":"2026-05-18T00:38:32.824836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.824836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01898","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:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYFBah2HqAIEZJRSqqt5xgZPfqZxMspYkb79JpebpbBwQEJxpUdznDU65Sv3p1QXg0OjS+/7Mpc8yAeSukarAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:22:33.322627Z"},"content_sha256":"8fbda5fb69ee72ad3d9909218df55d49a087cbbd38a5b360b383d0f5f6bc8c0b","schema_version":"1.0","event_id":"sha256:8fbda5fb69ee72ad3d9909218df55d49a087cbbd38a5b360b383d0f5f6bc8c0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CWU47BIVWUNMUHSCXS2MPBJ3TE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Bounds for the Graham-Pollak Problem for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, Ta Sheng Tan","submitted_at":"2017-08-06T14:49:00Z","abstract_excerpt":"For a fixed $r$, let $f_r(n)$ denote the minimum number of complete $r$-partite $r$-graphs needed to partition the complete $r$-graph on $n$ vertices. The Graham-Pollak theorem asserts that $f_2(n)=n-1$. An easy construction shows that $f_r(n) \\leq (1+o(1))\\binom{n}{\\lfloor r/2 \\rfloor}$, and we write $c_r$ for the least number such that $f_r(n) \\leq c_r (1+o(1))\\binom{n}{\\lfloor r/2 \\rfloor}$.\n  It was known that $c_r < 1$ for each even $r \\geq 4$, but this was not known for any odd value of $r$. In this short note, we prove that $c_{295}<1$. Our method also shows that $c_r \\rightarrow 0$, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01898","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:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0lz++N9gEJCIRVRy84Gb8sFo+bswXuSuZK3uuDyksTzwUt6WsK3TABUTPs+4+pDBHrXB+MNJt8sNZTpZl5uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:22:33.323243Z"},"content_sha256":"cf9c67c7d05d50190acc618a5750160bd34e79e3fbaa9b023370690372a3863f","schema_version":"1.0","event_id":"sha256:cf9c67c7d05d50190acc618a5750160bd34e79e3fbaa9b023370690372a3863f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWU47BIVWUNMUHSCXS2MPBJ3TE/bundle.json","state_url":"https://pith.science/pith/CWU47BIVWUNMUHSCXS2MPBJ3TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWU47BIVWUNMUHSCXS2MPBJ3TE/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-02T10:22:33Z","links":{"resolver":"https://pith.science/pith/CWU47BIVWUNMUHSCXS2MPBJ3TE","bundle":"https://pith.science/pith/CWU47BIVWUNMUHSCXS2MPBJ3TE/bundle.json","state":"https://pith.science/pith/CWU47BIVWUNMUHSCXS2MPBJ3TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWU47BIVWUNMUHSCXS2MPBJ3TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CWU47BIVWUNMUHSCXS2MPBJ3TE","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":"487b19d21ef10f33e78e2a201edd33a63bc73ba00829bc8b4ceaa7975ba8e9b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T14:49:00Z","title_canon_sha256":"3dbd07ad9ff989c5a5da951f01d516023e92b0d8cf68ed9e0ed2d73aed74e34f"},"schema_version":"1.0","source":{"id":"1708.01898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01898","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01898v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01898","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"CWU47BIVWUNM","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWU47BIVWUNMUHSC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWU47BIV","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:cf9c67c7d05d50190acc618a5750160bd34e79e3fbaa9b023370690372a3863f","target":"graph","created_at":"2026-05-18T00:38:32Z","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":"For a fixed $r$, let $f_r(n)$ denote the minimum number of complete $r$-partite $r$-graphs needed to partition the complete $r$-graph on $n$ vertices. The Graham-Pollak theorem asserts that $f_2(n)=n-1$. An easy construction shows that $f_r(n) \\leq (1+o(1))\\binom{n}{\\lfloor r/2 \\rfloor}$, and we write $c_r$ for the least number such that $f_r(n) \\leq c_r (1+o(1))\\binom{n}{\\lfloor r/2 \\rfloor}$.\n  It was known that $c_r < 1$ for each even $r \\geq 4$, but this was not known for any odd value of $r$. In this short note, we prove that $c_{295}<1$. Our method also shows that $c_r \\rightarrow 0$, an","authors_text":"Imre Leader, Ta Sheng Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T14:49:00Z","title":"Improved Bounds for the Graham-Pollak Problem for Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01898","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:8fbda5fb69ee72ad3d9909218df55d49a087cbbd38a5b360b383d0f5f6bc8c0b","target":"record","created_at":"2026-05-18T00:38:32Z","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":"487b19d21ef10f33e78e2a201edd33a63bc73ba00829bc8b4ceaa7975ba8e9b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T14:49:00Z","title_canon_sha256":"3dbd07ad9ff989c5a5da951f01d516023e92b0d8cf68ed9e0ed2d73aed74e34f"},"schema_version":"1.0","source":{"id":"1708.01898","kind":"arxiv","version":1}},"canonical_sha256":"15a9cf8515b51aca1e42bcb4c7853b9932c56bf5c3dd3cd91b8f85b2093f36e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15a9cf8515b51aca1e42bcb4c7853b9932c56bf5c3dd3cd91b8f85b2093f36e0","first_computed_at":"2026-05-18T00:38:32.824836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:32.824836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"STgzd5jhkpMya7c2sY+yddWxH/1ZsebdmHW6MLtotbu3iNSTgy/A75YzRwotRpwbmhYTwvCjHaQYLItGz40zBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:32.825494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fbda5fb69ee72ad3d9909218df55d49a087cbbd38a5b360b383d0f5f6bc8c0b","sha256:cf9c67c7d05d50190acc618a5750160bd34e79e3fbaa9b023370690372a3863f"],"state_sha256":"0bc4ec6e76532c3e6c27aea8c81f0cb37e078190f3f454691c17e9d5c3c9e27b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CxWXi1Hb5XFehc76fMDAZe2p8aUmmoBh20HjuAx3tmsnfAXdG7d/dJITVD1VNxnx6OAjb5Kkoe2NJLp2ovTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:22:33.325962Z","bundle_sha256":"4786689cddd3a03bf35a1b99649976d5f796d961ff6e9e5d573e5b912ae7cefb"}}