{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UW5SIA4J2HHK7PFODBKPAKOXAU","short_pith_number":"pith:UW5SIA4J","canonical_record":{"source":{"id":"1712.06403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T13:56:30Z","cross_cats_sorted":[],"title_canon_sha256":"9d028da81e84a38e0fd23c29156e91e6ecf0afb3f5cbd82651e918b551d24323","abstract_canon_sha256":"87e8d5f1daadf6b2ed5ea6b3978962bde9d563f0917b78da8f6623feb6f1fb53"},"schema_version":"1.0"},"canonical_sha256":"a5bb240389d1ceafbcae1854f029d7053f0cb1fe40b08f8f4ed753152829abdf","source":{"kind":"arxiv","id":"1712.06403","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06403","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06403v2","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06403","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"UW5SIA4J2HHK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UW5SIA4J2HHK7PFO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UW5SIA4J","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UW5SIA4J2HHK7PFODBKPAKOXAU","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T13:56:30Z","cross_cats_sorted":[],"title_canon_sha256":"9d028da81e84a38e0fd23c29156e91e6ecf0afb3f5cbd82651e918b551d24323","abstract_canon_sha256":"87e8d5f1daadf6b2ed5ea6b3978962bde9d563f0917b78da8f6623feb6f1fb53"},"schema_version":"1.0"},"canonical_sha256":"a5bb240389d1ceafbcae1854f029d7053f0cb1fe40b08f8f4ed753152829abdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:35.549252Z","signature_b64":"V2kJF6L000I8RExUoARnM0ywyUqIZydiZIMPcXuYH/WGrI7hk3rdRUiyUugged9BZOsNH5Vg9kkyzxC2Y89zAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5bb240389d1ceafbcae1854f029d7053f0cb1fe40b08f8f4ed753152829abdf","last_reissued_at":"2026-05-18T00:27:35.548682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:35.548682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06403","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-18T00:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CyR3tdY0NtPZj/YgPjFE4VXsNcbVM5zQZLLG9/jH01fe5y0t2pnZNfn7RXMYcXtaK1cnxIHFPivdIx+x85EhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:51:28.409697Z"},"content_sha256":"ef8af689667957ff0644ff208988894817ed04935ca628a31b2c81196ce11dbf","schema_version":"1.0","event_id":"sha256:ef8af689667957ff0644ff208988894817ed04935ca628a31b2c81196ce11dbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UW5SIA4J2HHK7PFODBKPAKOXAU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for the Graham-Pollak Theorem for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anand Babu, Sundar Vishwanathan","submitted_at":"2017-12-18T13:56:30Z","abstract_excerpt":"Let $f_r(n)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-Pollak theorem states that $f_2(n)=n-1$. An upper bound of $(1+o(1)){n \\choose \\lfloor{\\frac{r}{2}}\\rfloor}$ was known. Recently this was improved to $\\frac{14}{15}(1+o(1)){n \\choose \\lfloor{\\frac{r}{2}}\\rfloor}$ for even $r \\geq 4$. A bound of $\\bigg[\\frac{r}{2}(\\frac{14}{15})^{\\frac{r}{4}}+o(1)\\bigg](1+o(1)){n \\choose \\lfloor{\\frac{r}{2}}\\rfloor}$ was also proved recently. The smallest odd $r$ for which $c_r < 1$ th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06403","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-18T00:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mivy1SmlMvEcagNdlJJn9kciwcinq/UA9jmTtMHBhhPCbFty+TfeVXIzWlMZwePEOK4Hzbs0ECZYzYzJQToUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:51:28.410256Z"},"content_sha256":"fe522444af5e34772ad33cee19e070b14f05c7fdec33542d11444b07aa0bc2e5","schema_version":"1.0","event_id":"sha256:fe522444af5e34772ad33cee19e070b14f05c7fdec33542d11444b07aa0bc2e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UW5SIA4J2HHK7PFODBKPAKOXAU/bundle.json","state_url":"https://pith.science/pith/UW5SIA4J2HHK7PFODBKPAKOXAU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UW5SIA4J2HHK7PFODBKPAKOXAU/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-22T07:51:28Z","links":{"resolver":"https://pith.science/pith/UW5SIA4J2HHK7PFODBKPAKOXAU","bundle":"https://pith.science/pith/UW5SIA4J2HHK7PFODBKPAKOXAU/bundle.json","state":"https://pith.science/pith/UW5SIA4J2HHK7PFODBKPAKOXAU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UW5SIA4J2HHK7PFODBKPAKOXAU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UW5SIA4J2HHK7PFODBKPAKOXAU","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":"87e8d5f1daadf6b2ed5ea6b3978962bde9d563f0917b78da8f6623feb6f1fb53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T13:56:30Z","title_canon_sha256":"9d028da81e84a38e0fd23c29156e91e6ecf0afb3f5cbd82651e918b551d24323"},"schema_version":"1.0","source":{"id":"1712.06403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06403","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06403v2","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06403","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"UW5SIA4J2HHK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UW5SIA4J2HHK7PFO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UW5SIA4J","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:fe522444af5e34772ad33cee19e070b14f05c7fdec33542d11444b07aa0bc2e5","target":"graph","created_at":"2026-05-18T00:27:35Z","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)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-Pollak theorem states that $f_2(n)=n-1$. An upper bound of $(1+o(1)){n \\choose \\lfloor{\\frac{r}{2}}\\rfloor}$ was known. Recently this was improved to $\\frac{14}{15}(1+o(1)){n \\choose \\lfloor{\\frac{r}{2}}\\rfloor}$ for even $r \\geq 4$. A bound of $\\bigg[\\frac{r}{2}(\\frac{14}{15})^{\\frac{r}{4}}+o(1)\\bigg](1+o(1)){n \\choose \\lfloor{\\frac{r}{2}}\\rfloor}$ was also proved recently. The smallest odd $r$ for which $c_r < 1$ th","authors_text":"Anand Babu, Sundar Vishwanathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T13:56:30Z","title":"Bounds for the Graham-Pollak Theorem for Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06403","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:ef8af689667957ff0644ff208988894817ed04935ca628a31b2c81196ce11dbf","target":"record","created_at":"2026-05-18T00:27:35Z","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":"87e8d5f1daadf6b2ed5ea6b3978962bde9d563f0917b78da8f6623feb6f1fb53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T13:56:30Z","title_canon_sha256":"9d028da81e84a38e0fd23c29156e91e6ecf0afb3f5cbd82651e918b551d24323"},"schema_version":"1.0","source":{"id":"1712.06403","kind":"arxiv","version":2}},"canonical_sha256":"a5bb240389d1ceafbcae1854f029d7053f0cb1fe40b08f8f4ed753152829abdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5bb240389d1ceafbcae1854f029d7053f0cb1fe40b08f8f4ed753152829abdf","first_computed_at":"2026-05-18T00:27:35.548682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:35.548682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V2kJF6L000I8RExUoARnM0ywyUqIZydiZIMPcXuYH/WGrI7hk3rdRUiyUugged9BZOsNH5Vg9kkyzxC2Y89zAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:35.549252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef8af689667957ff0644ff208988894817ed04935ca628a31b2c81196ce11dbf","sha256:fe522444af5e34772ad33cee19e070b14f05c7fdec33542d11444b07aa0bc2e5"],"state_sha256":"60fe76fa2925a616166c8208e27184a7a2ec67ded58260b35a74f9a554869eaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18aftEEZDvCBO831Qy0J591sTGK4uPcRRsyPkSW8Cuigv7tWD0RVlxPpyEULrTq2lyrskdZ4nZegYM98gvXdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:51:28.413036Z","bundle_sha256":"838fb476e7f30405eeb6a9f19606dc8c5afaae1113524e6346ff7898c1a80feb"}}