{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AFLS57KDW6OKMT2VOO2S65VUA7","short_pith_number":"pith:AFLS57KD","canonical_record":{"source":{"id":"1701.02527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-10T11:46:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"845989bd5b5666606fc4d4d37e04ccb060fd4a4060d1b65346eabbc714fd6f60","abstract_canon_sha256":"5bfa0c2aeb2199cd795c274971f7f70eb0d961c9196ca1c1727f15c873ab124e"},"schema_version":"1.0"},"canonical_sha256":"01572efd43b79ca64f5573b52f76b407d8b0a7135f7601936c094fedb2d71d7b","source":{"kind":"arxiv","id":"1701.02527","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02527","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02527v1","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02527","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"AFLS57KDW6OK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AFLS57KDW6OKMT2V","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AFLS57KD","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AFLS57KDW6OKMT2VOO2S65VUA7","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-10T11:46:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"845989bd5b5666606fc4d4d37e04ccb060fd4a4060d1b65346eabbc714fd6f60","abstract_canon_sha256":"5bfa0c2aeb2199cd795c274971f7f70eb0d961c9196ca1c1727f15c873ab124e"},"schema_version":"1.0"},"canonical_sha256":"01572efd43b79ca64f5573b52f76b407d8b0a7135f7601936c094fedb2d71d7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:04.061348Z","signature_b64":"iNW5pwAANC/3D7+XS8BbdBol26f5l5PY72vw3sEwUOOmfHlaYUFj6x5R2bpzropTZ7YjPB7pP0/bjPQgUarDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01572efd43b79ca64f5573b52f76b407d8b0a7135f7601936c094fedb2d71d7b","last_reissued_at":"2026-05-18T00:53:04.060832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:04.060832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02527","source_version":1,"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:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/rttjWmpsKlVbxoG+n9eF1qDWFLO2ludbN6mjhExMA7hnfNNm6i4TLoCNSrCxr0O3H+Nq/VxBhmIhFTwOPUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:47:20.093612Z"},"content_sha256":"d3347b53de81ad6216aa0196cb466640d90774dcc0060a29c2d4eb0a9a6366ef","schema_version":"1.0","event_id":"sha256:d3347b53de81ad6216aa0196cb466640d90774dcc0060a29c2d4eb0a9a6366ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AFLS57KDW6OKMT2VOO2S65VUA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The heavy path approach to Galton-Watson trees with an application to Apollonian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Henning Sulzbach, Luc Devroye","submitted_at":"2017-01-10T11:46:38Z","abstract_excerpt":"We study the heavy path decomposition of conditional Galton-Watson trees. In a standard Galton-Watson tree conditional on its size $n$, we order all children by their subtree sizes, from large (heavy) to small. A node is marked if it is among the $k$ heaviest nodes among its siblings. Unmarked nodes and their subtrees are removed, leaving only a tree of marked nodes, which we call the $k$-heavy tree. We study various properties of these trees, including their size and the maximal distance from any original node to the $k$-heavy tree. In particular, under some moment condition, the $2$-heavy tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02527","kind":"arxiv","version":1},"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:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1kCXjYdGuZZp2rZ/FRnZuZ52GoSJwRMBHni4N9rjMpSWIhbI/QoiWOA6sdON6BNZ/vfADbZmsIikPURDTFeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:47:20.094221Z"},"content_sha256":"ba8e538a4f795ee3cbe23c7cdb7a56d472f22e8b61583ccb9588dbe69a900dd2","schema_version":"1.0","event_id":"sha256:ba8e538a4f795ee3cbe23c7cdb7a56d472f22e8b61583ccb9588dbe69a900dd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFLS57KDW6OKMT2VOO2S65VUA7/bundle.json","state_url":"https://pith.science/pith/AFLS57KDW6OKMT2VOO2S65VUA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFLS57KDW6OKMT2VOO2S65VUA7/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-27T14:47:20Z","links":{"resolver":"https://pith.science/pith/AFLS57KDW6OKMT2VOO2S65VUA7","bundle":"https://pith.science/pith/AFLS57KDW6OKMT2VOO2S65VUA7/bundle.json","state":"https://pith.science/pith/AFLS57KDW6OKMT2VOO2S65VUA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFLS57KDW6OKMT2VOO2S65VUA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AFLS57KDW6OKMT2VOO2S65VUA7","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":"5bfa0c2aeb2199cd795c274971f7f70eb0d961c9196ca1c1727f15c873ab124e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-10T11:46:38Z","title_canon_sha256":"845989bd5b5666606fc4d4d37e04ccb060fd4a4060d1b65346eabbc714fd6f60"},"schema_version":"1.0","source":{"id":"1701.02527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02527","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02527v1","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02527","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"AFLS57KDW6OK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AFLS57KDW6OKMT2V","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AFLS57KD","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:ba8e538a4f795ee3cbe23c7cdb7a56d472f22e8b61583ccb9588dbe69a900dd2","target":"graph","created_at":"2026-05-18T00:53:04Z","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 heavy path decomposition of conditional Galton-Watson trees. In a standard Galton-Watson tree conditional on its size $n$, we order all children by their subtree sizes, from large (heavy) to small. A node is marked if it is among the $k$ heaviest nodes among its siblings. Unmarked nodes and their subtrees are removed, leaving only a tree of marked nodes, which we call the $k$-heavy tree. We study various properties of these trees, including their size and the maximal distance from any original node to the $k$-heavy tree. In particular, under some moment condition, the $2$-heavy tr","authors_text":"Cecilia Holmgren, Henning Sulzbach, Luc Devroye","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-10T11:46:38Z","title":"The heavy path approach to Galton-Watson trees with an application to Apollonian networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02527","kind":"arxiv","version":1},"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:d3347b53de81ad6216aa0196cb466640d90774dcc0060a29c2d4eb0a9a6366ef","target":"record","created_at":"2026-05-18T00:53:04Z","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":"5bfa0c2aeb2199cd795c274971f7f70eb0d961c9196ca1c1727f15c873ab124e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-10T11:46:38Z","title_canon_sha256":"845989bd5b5666606fc4d4d37e04ccb060fd4a4060d1b65346eabbc714fd6f60"},"schema_version":"1.0","source":{"id":"1701.02527","kind":"arxiv","version":1}},"canonical_sha256":"01572efd43b79ca64f5573b52f76b407d8b0a7135f7601936c094fedb2d71d7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01572efd43b79ca64f5573b52f76b407d8b0a7135f7601936c094fedb2d71d7b","first_computed_at":"2026-05-18T00:53:04.060832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:04.060832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iNW5pwAANC/3D7+XS8BbdBol26f5l5PY72vw3sEwUOOmfHlaYUFj6x5R2bpzropTZ7YjPB7pP0/bjPQgUarDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:04.061348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3347b53de81ad6216aa0196cb466640d90774dcc0060a29c2d4eb0a9a6366ef","sha256:ba8e538a4f795ee3cbe23c7cdb7a56d472f22e8b61583ccb9588dbe69a900dd2"],"state_sha256":"98ea0564be8264a55f8631ae83b6f9b692d39c45564ac322102d9913f47e76d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8ZtrlaxMCkXP8+HZXUK+IX+m/Kqkwp1CyP+k1WTJMToADjNFd+l+umduWeFQcn518Voy8cMAkL+v4M8LIWuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:47:20.097394Z","bundle_sha256":"a29ee7b93e560d6ef05c0920a9a74619d4176d397c5b2abff92eb56e0ffeb813"}}