{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:X4BBXKFXPMTU6QLVBXWPLHKEOX","short_pith_number":"pith:X4BBXKFX","canonical_record":{"source":{"id":"1503.04749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T17:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"7e7c91570176c302494bcfc6aecb41c3ddbabe599fd4ec48de39963a3a8280db","abstract_canon_sha256":"2b4981f3ff39ce5554a6af1dc652f333815bfa07303d184a58f4d9ea1ec64cc2"},"schema_version":"1.0"},"canonical_sha256":"bf021ba8b77b274f41750decf59d4475fb4af4d4b29775809fdf7cb492dff2a5","source":{"kind":"arxiv","id":"1503.04749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04749","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04749v1","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04749","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"X4BBXKFXPMTU","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X4BBXKFXPMTU6QLV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X4BBXKFX","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:X4BBXKFXPMTU6QLVBXWPLHKEOX","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T17:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"7e7c91570176c302494bcfc6aecb41c3ddbabe599fd4ec48de39963a3a8280db","abstract_canon_sha256":"2b4981f3ff39ce5554a6af1dc652f333815bfa07303d184a58f4d9ea1ec64cc2"},"schema_version":"1.0"},"canonical_sha256":"bf021ba8b77b274f41750decf59d4475fb4af4d4b29775809fdf7cb492dff2a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:45.490172Z","signature_b64":"ef76v+4YLR2hN0BxmQ/McscWKF8UpMc+zxlQ+n6csGUE6KN6tiEgAoTVg6cSpMtKqopAOr4fWDEDN8GXz0/pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf021ba8b77b274f41750decf59d4475fb4af4d4b29775809fdf7cb492dff2a5","last_reissued_at":"2026-05-18T01:14:45.489467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:45.489467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04749","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-18T01:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBu99ma3yNNjgu0UaYK4AWdedyMZkXclVseetTfYfxlFqd9EtNI8fJ/1b58BrxLU0axWVxiwsb3f8AlNHKvIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:49:16.982772Z"},"content_sha256":"11e85bc7c8edfb9e767d23a3758a8a6c07109489d654fef1a206d4fb7506aae8","schema_version":"1.0","event_id":"sha256:11e85bc7c8edfb9e767d23a3758a8a6c07109489d654fef1a206d4fb7506aae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:X4BBXKFXPMTU6QLVBXWPLHKEOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The height of multiple edge plane trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clemens Heuberger, Helmut Prodinger, Stephan Wagner","submitted_at":"2015-03-16T17:52:41Z","abstract_excerpt":"Multi-edge trees as introduced in a recent paper of Dziemia\\'nczuk are plane trees where multiple edges are allowed. We first show that $d$-ary multi-edge trees where the out-degrees are bounded by $d$ are in bijection with classical $d$-ary trees. This allows us to analyse parameters such as the height.\n  The main part of this paper is concerned with multi-edge trees counted by their number of edges. The distribution of the number of vertices as well as the height are analysed asymptotically."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04749","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-18T01:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnFBBsTnCIhmUckZWDOGXcXd6JG0MgJPD0LPsi0u7xdoFvAg0iiFZjasK75eLqhO8ZW+i/fr60QAeUlZxpTXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:49:16.983105Z"},"content_sha256":"d37041ca2b3f7c505a56ca4a872d70b440af9da221eac0cf1136546e77097c6c","schema_version":"1.0","event_id":"sha256:d37041ca2b3f7c505a56ca4a872d70b440af9da221eac0cf1136546e77097c6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4BBXKFXPMTU6QLVBXWPLHKEOX/bundle.json","state_url":"https://pith.science/pith/X4BBXKFXPMTU6QLVBXWPLHKEOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4BBXKFXPMTU6QLVBXWPLHKEOX/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-06-24T12:49:16Z","links":{"resolver":"https://pith.science/pith/X4BBXKFXPMTU6QLVBXWPLHKEOX","bundle":"https://pith.science/pith/X4BBXKFXPMTU6QLVBXWPLHKEOX/bundle.json","state":"https://pith.science/pith/X4BBXKFXPMTU6QLVBXWPLHKEOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4BBXKFXPMTU6QLVBXWPLHKEOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X4BBXKFXPMTU6QLVBXWPLHKEOX","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":"2b4981f3ff39ce5554a6af1dc652f333815bfa07303d184a58f4d9ea1ec64cc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T17:52:41Z","title_canon_sha256":"7e7c91570176c302494bcfc6aecb41c3ddbabe599fd4ec48de39963a3a8280db"},"schema_version":"1.0","source":{"id":"1503.04749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04749","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04749v1","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04749","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"X4BBXKFXPMTU","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X4BBXKFXPMTU6QLV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X4BBXKFX","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:d37041ca2b3f7c505a56ca4a872d70b440af9da221eac0cf1136546e77097c6c","target":"graph","created_at":"2026-05-18T01:14:45Z","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":"Multi-edge trees as introduced in a recent paper of Dziemia\\'nczuk are plane trees where multiple edges are allowed. We first show that $d$-ary multi-edge trees where the out-degrees are bounded by $d$ are in bijection with classical $d$-ary trees. This allows us to analyse parameters such as the height.\n  The main part of this paper is concerned with multi-edge trees counted by their number of edges. The distribution of the number of vertices as well as the height are analysed asymptotically.","authors_text":"Clemens Heuberger, Helmut Prodinger, Stephan Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T17:52:41Z","title":"The height of multiple edge plane trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04749","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:11e85bc7c8edfb9e767d23a3758a8a6c07109489d654fef1a206d4fb7506aae8","target":"record","created_at":"2026-05-18T01:14:45Z","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":"2b4981f3ff39ce5554a6af1dc652f333815bfa07303d184a58f4d9ea1ec64cc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T17:52:41Z","title_canon_sha256":"7e7c91570176c302494bcfc6aecb41c3ddbabe599fd4ec48de39963a3a8280db"},"schema_version":"1.0","source":{"id":"1503.04749","kind":"arxiv","version":1}},"canonical_sha256":"bf021ba8b77b274f41750decf59d4475fb4af4d4b29775809fdf7cb492dff2a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf021ba8b77b274f41750decf59d4475fb4af4d4b29775809fdf7cb492dff2a5","first_computed_at":"2026-05-18T01:14:45.489467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:45.489467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ef76v+4YLR2hN0BxmQ/McscWKF8UpMc+zxlQ+n6csGUE6KN6tiEgAoTVg6cSpMtKqopAOr4fWDEDN8GXz0/pCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:45.490172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11e85bc7c8edfb9e767d23a3758a8a6c07109489d654fef1a206d4fb7506aae8","sha256:d37041ca2b3f7c505a56ca4a872d70b440af9da221eac0cf1136546e77097c6c"],"state_sha256":"32e4f6f96aeff01c067bc42d520a38aa44bafca882dc7e78dee8f2568d7cd19f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1c1z6EFB55/u0jsNaGgW0LUOzzPRcMneP7GM2Hc7RLssHtRAKWao4Ctu7YcJj83z2c6BKrjxMNwv2Y6da3aCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:49:16.984989Z","bundle_sha256":"7ba6fbe9432c839a63d5f769ccd7c2579683a7ac84b2b0b0e70d03c7666db0d8"}}