{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2MZO56M25OUSDNDEA7H2SUAIXY","short_pith_number":"pith:2MZO56M2","schema_version":"1.0","canonical_sha256":"d332eef99aeba921b46407cfa95008be2cf44015f96b7d0071ca9c672f40d441","source":{"kind":"arxiv","id":"1406.4079","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.4079","created_at":"2026-05-18T01:30:43.371410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4079v2","created_at":"2026-05-18T01:30:43.371410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4079","created_at":"2026-05-18T01:30:43.371410+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MZO56M25OUS","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MZO56M25OUSDNDE","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MZO56M2","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY","json":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY.json","graph_json":"https://pith.science/api/pith-number/2MZO56M25OUSDNDEA7H2SUAIXY/graph.json","events_json":"https://pith.science/api/pith-number/2MZO56M25OUSDNDEA7H2SUAIXY/events.json","paper":"https://pith.science/paper/2MZO56M2"},"agent_actions":{"view_html":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY","download_json":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY.json","view_paper":"https://pith.science/paper/2MZO56M2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4079&json=true","fetch_graph":"https://pith.science/api/pith-number/2MZO56M25OUSDNDEA7H2SUAIXY/graph.json","fetch_events":"https://pith.science/api/pith-number/2MZO56M25OUSDNDEA7H2SUAIXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/action/storage_attestation","attest_author":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/action/author_attestation","sign_citation":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/action/citation_signature","submit_replication":"https://pith.science/pith/2MZO56M25OUSDNDEA7H2SUAIXY/action/replication_record"}},"created_at":"2026-05-18T01:30:43.371410+00:00","updated_at":"2026-05-18T01:30:43.371410+00:00"}