{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LMAQZH7Y64G3JAQJNB4PTV7A4D","short_pith_number":"pith:LMAQZH7Y","canonical_record":{"source":{"id":"1710.01402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T22:06:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"807a171deecb4dcfc31ed20b2fb008b864e1bcd49983f26b0c0f67e3b7ad67bd","abstract_canon_sha256":"6d5272d9fb9f992ece107c5aac8bf89b0a5b3559538346c3e3c60aefd004e319"},"schema_version":"1.0"},"canonical_sha256":"5b010c9ff8f70db482096878f9d7e0e0c1b7ded91357becee91f063d867339fa","source":{"kind":"arxiv","id":"1710.01402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01402","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01402v1","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01402","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"pith_short_12","alias_value":"LMAQZH7Y64G3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LMAQZH7Y64G3JAQJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LMAQZH7Y","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LMAQZH7Y64G3JAQJNB4PTV7A4D","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T22:06:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"807a171deecb4dcfc31ed20b2fb008b864e1bcd49983f26b0c0f67e3b7ad67bd","abstract_canon_sha256":"6d5272d9fb9f992ece107c5aac8bf89b0a5b3559538346c3e3c60aefd004e319"},"schema_version":"1.0"},"canonical_sha256":"5b010c9ff8f70db482096878f9d7e0e0c1b7ded91357becee91f063d867339fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:42.918104Z","signature_b64":"jvzVpONSzIZseeD6Uh4Ufz6R2fasfwPqjqP2QMm0ZXRslJaCoOwXXBdrytlCrfHw2Fcjs+QP+8xNYLUvNK3ODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b010c9ff8f70db482096878f9d7e0e0c1b7ded91357becee91f063d867339fa","last_reissued_at":"2026-05-18T00:33:42.917628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:42.917628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01402","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:33:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeFJT1mRj1rSfTiGOXS1VDxI10HzWkUsZ5copYQIzfQF9P/Xd6ekrJNPdUGhnWPB0mtnVbbDGnk1j3QkKbSDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:05.499980Z"},"content_sha256":"4473ee0d493e1dbd8fd72a4a252b624cc7923086776c4506eaffead043453dee","schema_version":"1.0","event_id":"sha256:4473ee0d493e1dbd8fd72a4a252b624cc7923086776c4506eaffead043453dee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LMAQZH7Y64G3JAQJNB4PTV7A4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On asymptotics of two non-uniform recursive tree models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Ella Hiesmayr","submitted_at":"2017-10-03T22:06:50Z","abstract_excerpt":"In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive trees. In the second model a different distribution rather than the uniform one is chosen on the symmetric group, namely a riffle shuffle distribution. These trees will be called biased recursive trees. For both of these models the number of branches, the number of leaves, the depth of nodes and some other properties are studied. The focus is on asymptotic resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01402","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:33:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mo0qmU5hpPhNT7UisxPFRyQygIdwuz0vtziu6KvH7Z86SX+xJcMTMVF9es9O0nXf8/iyeuUgyinevWmNtOUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:05.500347Z"},"content_sha256":"a5721eeca7619a876c5b962803fa3549c7a759e226bffd001107e2522fe01e50","schema_version":"1.0","event_id":"sha256:a5721eeca7619a876c5b962803fa3549c7a759e226bffd001107e2522fe01e50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMAQZH7Y64G3JAQJNB4PTV7A4D/bundle.json","state_url":"https://pith.science/pith/LMAQZH7Y64G3JAQJNB4PTV7A4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMAQZH7Y64G3JAQJNB4PTV7A4D/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-24T05:41:05Z","links":{"resolver":"https://pith.science/pith/LMAQZH7Y64G3JAQJNB4PTV7A4D","bundle":"https://pith.science/pith/LMAQZH7Y64G3JAQJNB4PTV7A4D/bundle.json","state":"https://pith.science/pith/LMAQZH7Y64G3JAQJNB4PTV7A4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMAQZH7Y64G3JAQJNB4PTV7A4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LMAQZH7Y64G3JAQJNB4PTV7A4D","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":"6d5272d9fb9f992ece107c5aac8bf89b0a5b3559538346c3e3c60aefd004e319","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T22:06:50Z","title_canon_sha256":"807a171deecb4dcfc31ed20b2fb008b864e1bcd49983f26b0c0f67e3b7ad67bd"},"schema_version":"1.0","source":{"id":"1710.01402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01402","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01402v1","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01402","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"pith_short_12","alias_value":"LMAQZH7Y64G3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LMAQZH7Y64G3JAQJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LMAQZH7Y","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:a5721eeca7619a876c5b962803fa3549c7a759e226bffd001107e2522fe01e50","target":"graph","created_at":"2026-05-18T00:33:42Z","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":"In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive trees. In the second model a different distribution rather than the uniform one is chosen on the symmetric group, namely a riffle shuffle distribution. These trees will be called biased recursive trees. For both of these models the number of branches, the number of leaves, the depth of nodes and some other properties are studied. The focus is on asymptotic resul","authors_text":"Ella Hiesmayr","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T22:06:50Z","title":"On asymptotics of two non-uniform recursive tree models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01402","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:4473ee0d493e1dbd8fd72a4a252b624cc7923086776c4506eaffead043453dee","target":"record","created_at":"2026-05-18T00:33:42Z","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":"6d5272d9fb9f992ece107c5aac8bf89b0a5b3559538346c3e3c60aefd004e319","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-03T22:06:50Z","title_canon_sha256":"807a171deecb4dcfc31ed20b2fb008b864e1bcd49983f26b0c0f67e3b7ad67bd"},"schema_version":"1.0","source":{"id":"1710.01402","kind":"arxiv","version":1}},"canonical_sha256":"5b010c9ff8f70db482096878f9d7e0e0c1b7ded91357becee91f063d867339fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b010c9ff8f70db482096878f9d7e0e0c1b7ded91357becee91f063d867339fa","first_computed_at":"2026-05-18T00:33:42.917628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:42.917628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jvzVpONSzIZseeD6Uh4Ufz6R2fasfwPqjqP2QMm0ZXRslJaCoOwXXBdrytlCrfHw2Fcjs+QP+8xNYLUvNK3ODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:42.918104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4473ee0d493e1dbd8fd72a4a252b624cc7923086776c4506eaffead043453dee","sha256:a5721eeca7619a876c5b962803fa3549c7a759e226bffd001107e2522fe01e50"],"state_sha256":"4207292b0eb341a453f24651d12ba6778c5e3504919d25be5961f9f965c3fcb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U18NQBthxB0JsSI8XvdE/N1ALBknfZgFriei6YLnT0Dd/Y4t3150rFDxG94o7IP0NuInzbEVhhlxD9nQoyiyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:41:05.502301Z","bundle_sha256":"26e45d8d5ba81410ca9010f01011f532b9057f36214623eafb3245b97d418f80"}}