{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FXMPMBLGAHOPZIA2JXVILBU4PT","short_pith_number":"pith:FXMPMBLG","schema_version":"1.0","canonical_sha256":"2dd8f6056601dcfca01a4dea85869c7ccc459653910594c38e676c6a6538ef1b","source":{"kind":"arxiv","id":"1309.4342","version":3},"attestation_state":"computed","paper":{"title":"The height of random $k$-trees and related branching processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Ryuhei Uehara","submitted_at":"2013-09-16T16:58:22Z","abstract_excerpt":"We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to clog t, where t is the number of vertices, and c=c(k) is given as the solution to a transcendental equation. The equations are slightly different for the two types of process. In the limit as k-->oo the height of both processes is asymptotic to log t/(k log 2)."},"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":"1309.4342","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:58:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4d0159bc876f1b8e3384a35d53cfffe73a75a77b23af6b7a4ead2577117e51bb","abstract_canon_sha256":"f4c8e2e1f8472551ccefdfa9019b09fe107dc48e619e13ab9fc28d95c14a24d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:14.908342Z","signature_b64":"rKpF8VqcfbGqdPDDcWXFhpBRp+f1wt1qjb4UsHWqpDTMig74IFGrhTXHVJjBOYw3A7end6X7wCDPxfWQZveeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dd8f6056601dcfca01a4dea85869c7ccc459653910594c38e676c6a6538ef1b","last_reissued_at":"2026-05-18T02:42:14.907473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:14.907473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The height of random $k$-trees and related branching processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Ryuhei Uehara","submitted_at":"2013-09-16T16:58:22Z","abstract_excerpt":"We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to clog t, where t is the number of vertices, and c=c(k) is given as the solution to a transcendental equation. The equations are slightly different for the two types of process. In the limit as k-->oo the height of both processes is asymptotic to log t/(k log 2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4342","kind":"arxiv","version":3},"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":"1309.4342","created_at":"2026-05-18T02:42:14.907625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4342v3","created_at":"2026-05-18T02:42:14.907625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4342","created_at":"2026-05-18T02:42:14.907625+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXMPMBLGAHOP","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXMPMBLGAHOPZIA2","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXMPMBLG","created_at":"2026-05-18T12:27:45.050594+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/FXMPMBLGAHOPZIA2JXVILBU4PT","json":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT.json","graph_json":"https://pith.science/api/pith-number/FXMPMBLGAHOPZIA2JXVILBU4PT/graph.json","events_json":"https://pith.science/api/pith-number/FXMPMBLGAHOPZIA2JXVILBU4PT/events.json","paper":"https://pith.science/paper/FXMPMBLG"},"agent_actions":{"view_html":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT","download_json":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT.json","view_paper":"https://pith.science/paper/FXMPMBLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4342&json=true","fetch_graph":"https://pith.science/api/pith-number/FXMPMBLGAHOPZIA2JXVILBU4PT/graph.json","fetch_events":"https://pith.science/api/pith-number/FXMPMBLGAHOPZIA2JXVILBU4PT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/action/storage_attestation","attest_author":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/action/author_attestation","sign_citation":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/action/citation_signature","submit_replication":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/action/replication_record"}},"created_at":"2026-05-18T02:42:14.907625+00:00","updated_at":"2026-05-18T02:42:14.907625+00:00"}