{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2MZO56M25OUSDNDEA7H2SUAIXY","short_pith_number":"pith:2MZO56M2","canonical_record":{"source":{"id":"1406.4079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-06-16T17:39:27Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"f97be539f2aed44dcf5ca0fd3d5646ccb7e4eb32cd1d49e3a6d2a11de04b6e13","abstract_canon_sha256":"002af62b37d87f92eccb710e1f5cdfc095cbfb6cad73000e391db348ffdf43e2"},"schema_version":"1.0"},"canonical_sha256":"d332eef99aeba921b46407cfa95008be2cf44015f96b7d0071ca9c672f40d441","source":{"kind":"arxiv","id":"1406.4079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4079","created_at":"2026-05-18T01:30:43Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4079v2","created_at":"2026-05-18T01:30:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4079","created_at":"2026-05-18T01:30:43Z"},{"alias_kind":"pith_short_12","alias_value":"2MZO56M25OUS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MZO56M25OUSDNDE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MZO56M2","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2MZO56M25OUSDNDEA7H2SUAIXY","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-06-16T17:39:27Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"f97be539f2aed44dcf5ca0fd3d5646ccb7e4eb32cd1d49e3a6d2a11de04b6e13","abstract_canon_sha256":"002af62b37d87f92eccb710e1f5cdfc095cbfb6cad73000e391db348ffdf43e2"},"schema_version":"1.0"},"canonical_sha256":"d332eef99aeba921b46407cfa95008be2cf44015f96b7d0071ca9c672f40d441","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:43.371904Z","signature_b64":"e1M+pgPmWYQqp/Ag/SGjIxc6hJbcvWWB/tFxs7MZ4GzsooQrCD5cEs5NO1p9QxNmEgjlQEiOyKu99VBzmvnMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d332eef99aeba921b46407cfa95008be2cf44015f96b7d0071ca9c672f40d441","last_reissued_at":"2026-05-18T01:30:43.371323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:43.371323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4079","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-18T01:30:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTG0Dceg/cbzwh/iABA6t18wgoHyODqQunvfMGHuYg7YgSxpL0+4WRBEVERnQQ1G3uJpJWNetRdnlLIGnkRUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:35:46.703034Z"},"content_sha256":"2808078fe71e7f6b306082225f17e40b8bb65809e4074b3739358b2b0f176f2a","schema_version":"1.0","event_id":"sha256:2808078fe71e7f6b306082225f17e40b8bb65809e4074b3739358b2b0f176f2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2MZO56M25OUSDNDEA7H2SUAIXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leaf-to-leaf distances and their moments in finite and infinite m-ary tree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Andrew M. Goldsborough, Rudolf A. R\\\"omer, S. Alex Rautu","submitted_at":"2014-06-16T17:39:27Z","abstract_excerpt":"We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf distance r as well as the average path lengths and the moments thereof. We show that the resulting explicit expressions can be recast in terms of Hurwitz-Lerch transcendants. Results for periodic trees are also given. For incomplete random binary trees, we provide first results by numerical techniques; we find a rapid drop of leaf-to-leaf distances for large"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4079","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-18T01:30:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkT5QwT6kPslqcS5lzle3GhVX+4TzQWL6BdYNUFAsYFV4tBFEF/VqbefnJwwbIUh9zRmRuyMkZslhEFy1uz3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:35:46.703707Z"},"content_sha256":"fdef199bf1cb1238d11e4162435df7c4e5748ef39a5f6f921d8daca3434ae636","schema_version":"1.0","event_id":"sha256:fdef199bf1cb1238d11e4162435df7c4e5748ef39a5f6f921d8daca3434ae636"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/bundle.json","state_url":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MZO56M25OUSDNDEA7H2SUAIXY/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-05-26T16:35:46Z","links":{"resolver":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY","bundle":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/bundle.json","state":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MZO56M25OUSDNDEA7H2SUAIXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2MZO56M25OUSDNDEA7H2SUAIXY","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":"002af62b37d87f92eccb710e1f5cdfc095cbfb6cad73000e391db348ffdf43e2","cross_cats_sorted":["math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-06-16T17:39:27Z","title_canon_sha256":"f97be539f2aed44dcf5ca0fd3d5646ccb7e4eb32cd1d49e3a6d2a11de04b6e13"},"schema_version":"1.0","source":{"id":"1406.4079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4079","created_at":"2026-05-18T01:30:43Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4079v2","created_at":"2026-05-18T01:30:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4079","created_at":"2026-05-18T01:30:43Z"},{"alias_kind":"pith_short_12","alias_value":"2MZO56M25OUS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MZO56M25OUSDNDE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MZO56M2","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:fdef199bf1cb1238d11e4162435df7c4e5748ef39a5f6f921d8daca3434ae636","target":"graph","created_at":"2026-05-18T01:30:43Z","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 study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf distance r as well as the average path lengths and the moments thereof. We show that the resulting explicit expressions can be recast in terms of Hurwitz-Lerch transcendants. Results for periodic trees are also given. For incomplete random binary trees, we provide first results by numerical techniques; we find a rapid drop of leaf-to-leaf distances for large","authors_text":"Andrew M. Goldsborough, Rudolf A. R\\\"omer, S. Alex Rautu","cross_cats":["math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-06-16T17:39:27Z","title":"Leaf-to-leaf distances and their moments in finite and infinite m-ary tree graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4079","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:2808078fe71e7f6b306082225f17e40b8bb65809e4074b3739358b2b0f176f2a","target":"record","created_at":"2026-05-18T01:30:43Z","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":"002af62b37d87f92eccb710e1f5cdfc095cbfb6cad73000e391db348ffdf43e2","cross_cats_sorted":["math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-06-16T17:39:27Z","title_canon_sha256":"f97be539f2aed44dcf5ca0fd3d5646ccb7e4eb32cd1d49e3a6d2a11de04b6e13"},"schema_version":"1.0","source":{"id":"1406.4079","kind":"arxiv","version":2}},"canonical_sha256":"d332eef99aeba921b46407cfa95008be2cf44015f96b7d0071ca9c672f40d441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d332eef99aeba921b46407cfa95008be2cf44015f96b7d0071ca9c672f40d441","first_computed_at":"2026-05-18T01:30:43.371323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:43.371323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e1M+pgPmWYQqp/Ag/SGjIxc6hJbcvWWB/tFxs7MZ4GzsooQrCD5cEs5NO1p9QxNmEgjlQEiOyKu99VBzmvnMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:43.371904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2808078fe71e7f6b306082225f17e40b8bb65809e4074b3739358b2b0f176f2a","sha256:fdef199bf1cb1238d11e4162435df7c4e5748ef39a5f6f921d8daca3434ae636"],"state_sha256":"d44f50cd339ee91915b49496a1fe57cf12b3c5e537f06ce7fe753dcc8d77c0f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwwBOoUn3PVxpuAtI+ZFI3yQa8gjwz2hP6MQDySnopVDPOeIm1oU5Apa9WlvYVMb72ICtQAb5i71p3KZm15/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:35:46.707128Z","bundle_sha256":"a888f52e5d50aeeecd41e415bb11b24eade6c1c0d31449ac8531cce7dce33eb8"}}