{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IW54LDEFPEZOKDNXHNSXHD4LDN","short_pith_number":"pith:IW54LDEF","canonical_record":{"source":{"id":"1801.04617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T22:25:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"19f0932e54a51a027540afffc610d74e33a1da90667c2fbd5ff81ba685ede99c","abstract_canon_sha256":"8fcfd5718e2937e3b3e7b830909e7b1fc756f7af7b7021d6a6215630cbb650a9"},"schema_version":"1.0"},"canonical_sha256":"45bbc58c857932e50db73b65738f8b1b6377a060577e3d1c69526e579c2b89e1","source":{"kind":"arxiv","id":"1801.04617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04617","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04617v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04617","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"IW54LDEFPEZO","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IW54LDEFPEZOKDNX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IW54LDEF","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IW54LDEFPEZOKDNXHNSXHD4LDN","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T22:25:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"19f0932e54a51a027540afffc610d74e33a1da90667c2fbd5ff81ba685ede99c","abstract_canon_sha256":"8fcfd5718e2937e3b3e7b830909e7b1fc756f7af7b7021d6a6215630cbb650a9"},"schema_version":"1.0"},"canonical_sha256":"45bbc58c857932e50db73b65738f8b1b6377a060577e3d1c69526e579c2b89e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.834683Z","signature_b64":"JSknI1y9OlpXwPK94qymZ0bBMivymJZuwUFARSuTacqLXv92qzQmPq8hIZnWoVZvKwP17mKgHLbIh0Fh5kprDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45bbc58c857932e50db73b65738f8b1b6377a060577e3d1c69526e579c2b89e1","last_reissued_at":"2026-05-18T00:26:03.833946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.833946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04617","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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1DmG/5EL+/ew++OXhdhgVPK/sWnuWjJAn2zzMZBDpcQQz4COi0C2aManMdD40uD4crU48RA+7QxWtOwZTLJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:05:51.833127Z"},"content_sha256":"3c83bd61d0adeb76fa2d9bedbdc23de9f7659bbc80923ec652c4a4977dcb8007","schema_version":"1.0","event_id":"sha256:3c83bd61d0adeb76fa2d9bedbdc23de9f7659bbc80923ec652c4a4977dcb8007"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IW54LDEFPEZOKDNXHNSXHD4LDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some remarks on biased recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Ella Hiesmayr, \\\"Umit I\\c{s}lak","submitted_at":"2018-01-14T22:25:36Z","abstract_excerpt":"The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform permutations, biased riffle shuffles. The statistics that are treated include the number of nodes with a given number of descendants, the depth of the tree, and the number of branches. The model yields the uniform recursive trees as a certain limit, some new results for the uniform case are obtained as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04617","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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTY/yLxcIJnSq9x1mtZLpZWKtr3hUPfj7jj0kzmTUHTsbEjN8ifloDP2JcCw8r8lJ9Zznvzx+7f2PWuIMjp0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:05:51.833861Z"},"content_sha256":"a2569d1f5093ae72f297b0b32ab1222dfe8068869f26565287ec9d27126f9964","schema_version":"1.0","event_id":"sha256:a2569d1f5093ae72f297b0b32ab1222dfe8068869f26565287ec9d27126f9964"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/bundle.json","state_url":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/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-07T00:05:51Z","links":{"resolver":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN","bundle":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/bundle.json","state":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IW54LDEFPEZOKDNXHNSXHD4LDN","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":"8fcfd5718e2937e3b3e7b830909e7b1fc756f7af7b7021d6a6215630cbb650a9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T22:25:36Z","title_canon_sha256":"19f0932e54a51a027540afffc610d74e33a1da90667c2fbd5ff81ba685ede99c"},"schema_version":"1.0","source":{"id":"1801.04617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04617","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04617v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04617","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"IW54LDEFPEZO","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IW54LDEFPEZOKDNX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IW54LDEF","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:a2569d1f5093ae72f297b0b32ab1222dfe8068869f26565287ec9d27126f9964","target":"graph","created_at":"2026-05-18T00:26:03Z","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":"The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform permutations, biased riffle shuffles. The statistics that are treated include the number of nodes with a given number of descendants, the depth of the tree, and the number of branches. The model yields the uniform recursive trees as a certain limit, some new results for the uniform case are obtained as well.","authors_text":"Ella Hiesmayr, \\\"Umit I\\c{s}lak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T22:25:36Z","title":"Some remarks on biased recursive trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04617","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:3c83bd61d0adeb76fa2d9bedbdc23de9f7659bbc80923ec652c4a4977dcb8007","target":"record","created_at":"2026-05-18T00:26:03Z","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":"8fcfd5718e2937e3b3e7b830909e7b1fc756f7af7b7021d6a6215630cbb650a9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T22:25:36Z","title_canon_sha256":"19f0932e54a51a027540afffc610d74e33a1da90667c2fbd5ff81ba685ede99c"},"schema_version":"1.0","source":{"id":"1801.04617","kind":"arxiv","version":1}},"canonical_sha256":"45bbc58c857932e50db73b65738f8b1b6377a060577e3d1c69526e579c2b89e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45bbc58c857932e50db73b65738f8b1b6377a060577e3d1c69526e579c2b89e1","first_computed_at":"2026-05-18T00:26:03.833946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:03.833946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JSknI1y9OlpXwPK94qymZ0bBMivymJZuwUFARSuTacqLXv92qzQmPq8hIZnWoVZvKwP17mKgHLbIh0Fh5kprDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:03.834683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c83bd61d0adeb76fa2d9bedbdc23de9f7659bbc80923ec652c4a4977dcb8007","sha256:a2569d1f5093ae72f297b0b32ab1222dfe8068869f26565287ec9d27126f9964"],"state_sha256":"340200ba024a411ce2b53b81f358becf948d601c33e78c1e0e46a8af55faff01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lCiDtPTzFt/8It+EwjSJAV5wQJNAAo/UsmrYh9wQYZOe5hUDkY7q5GJthAq84QLbdBfPGRr/3lnFA+KO5V+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:05:51.837557Z","bundle_sha256":"62142a6bb8d2ca0b197432f9d5e1b28112a40f1ee233dc99a37987b6a0f3cead"}}