{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FXMPMBLGAHOPZIA2JXVILBU4PT","short_pith_number":"pith:FXMPMBLG","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"},"canonical_sha256":"2dd8f6056601dcfca01a4dea85869c7ccc459653910594c38e676c6a6538ef1b","source":{"kind":"arxiv","id":"1309.4342","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4342","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4342v3","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4342","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"FXMPMBLGAHOP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FXMPMBLGAHOPZIA2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FXMPMBLG","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FXMPMBLGAHOPZIA2JXVILBU4PT","target":"record","payload":{"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"},"canonical_sha256":"2dd8f6056601dcfca01a4dea85869c7ccc459653910594c38e676c6a6538ef1b","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"},"source_kind":"arxiv","source_id":"1309.4342","source_version":3,"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-18T02:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcxmMUWg1FkngkW8r99TSPY7mRX5Jd/R9obWk2Kgbz45pNOqbX0ow8aPgZFNn9Wn+a/6wFqTJMOTc//ZX4R7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:10:02.561083Z"},"content_sha256":"801eea6c15cf302d58b47a1e9f88ff532884531693fed9c6aaf946e1da64a2ca","schema_version":"1.0","event_id":"sha256:801eea6c15cf302d58b47a1e9f88ff532884531693fed9c6aaf946e1da64a2ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FXMPMBLGAHOPZIA2JXVILBU4PT","target":"graph","payload":{"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"},"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-18T02:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZWP2+E4cwy8encwDUkpvC2revYUxG4scBy4o8kaIYEe9dBDtK3ekc4hSKsaPdL/OoyoLSFZYYYyg7QquIUBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:10:02.561602Z"},"content_sha256":"ffccae3fb671e3485bb1d3fdffcdd5bfa393f6e635875745bd791ef11c261976","schema_version":"1.0","event_id":"sha256:ffccae3fb671e3485bb1d3fdffcdd5bfa393f6e635875745bd791ef11c261976"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/bundle.json","state_url":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/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-22T15:10:02Z","links":{"resolver":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT","bundle":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/bundle.json","state":"https://pith.science/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXMPMBLGAHOPZIA2JXVILBU4PT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FXMPMBLGAHOPZIA2JXVILBU4PT","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":"f4c8e2e1f8472551ccefdfa9019b09fe107dc48e619e13ab9fc28d95c14a24d2","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:58:22Z","title_canon_sha256":"4d0159bc876f1b8e3384a35d53cfffe73a75a77b23af6b7a4ead2577117e51bb"},"schema_version":"1.0","source":{"id":"1309.4342","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4342","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4342v3","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4342","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"FXMPMBLGAHOP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FXMPMBLGAHOPZIA2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FXMPMBLG","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:ffccae3fb671e3485bb1d3fdffcdd5bfa393f6e635875745bd791ef11c261976","target":"graph","created_at":"2026-05-18T02:42:14Z","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 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).","authors_text":"Alan Frieze, Colin Cooper, Ryuhei Uehara","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:58:22Z","title":"The height of random $k$-trees and related branching processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4342","kind":"arxiv","version":3},"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:801eea6c15cf302d58b47a1e9f88ff532884531693fed9c6aaf946e1da64a2ca","target":"record","created_at":"2026-05-18T02:42:14Z","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":"f4c8e2e1f8472551ccefdfa9019b09fe107dc48e619e13ab9fc28d95c14a24d2","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:58:22Z","title_canon_sha256":"4d0159bc876f1b8e3384a35d53cfffe73a75a77b23af6b7a4ead2577117e51bb"},"schema_version":"1.0","source":{"id":"1309.4342","kind":"arxiv","version":3}},"canonical_sha256":"2dd8f6056601dcfca01a4dea85869c7ccc459653910594c38e676c6a6538ef1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dd8f6056601dcfca01a4dea85869c7ccc459653910594c38e676c6a6538ef1b","first_computed_at":"2026-05-18T02:42:14.907473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:14.907473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rKpF8VqcfbGqdPDDcWXFhpBRp+f1wt1qjb4UsHWqpDTMig74IFGrhTXHVJjBOYw3A7end6X7wCDPxfWQZveeAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:14.908342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4342","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:801eea6c15cf302d58b47a1e9f88ff532884531693fed9c6aaf946e1da64a2ca","sha256:ffccae3fb671e3485bb1d3fdffcdd5bfa393f6e635875745bd791ef11c261976"],"state_sha256":"b1ec82f1b3345fd5773db92815e5f8f60b8d04e2c7adac409bef712bee1ff7cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnXyEoXH34VcDm15r77YTmjy1MX6yZ3XLxIyHm6rXOkXBT0jha0mcw1j1n3tViEo74BWqRQHBqgwA01syvQ/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:10:02.565041Z","bundle_sha256":"4dfac1591d2094dbcab0068816552c53a9d990ab454442189a86436ca7dfe69a"}}