{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IW54LDEFPEZOKDNXHNSXHD4LDN","short_pith_number":"pith:IW54LDEF","schema_version":"1.0","canonical_sha256":"45bbc58c857932e50db73b65738f8b1b6377a060577e3d1c69526e579c2b89e1","source":{"kind":"arxiv","id":"1801.04617","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.04617","created_at":"2026-05-18T00:26:03.834054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04617v1","created_at":"2026-05-18T00:26:03.834054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04617","created_at":"2026-05-18T00:26:03.834054+00:00"},{"alias_kind":"pith_short_12","alias_value":"IW54LDEFPEZO","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IW54LDEFPEZOKDNX","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IW54LDEF","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN","json":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN.json","graph_json":"https://pith.science/api/pith-number/IW54LDEFPEZOKDNXHNSXHD4LDN/graph.json","events_json":"https://pith.science/api/pith-number/IW54LDEFPEZOKDNXHNSXHD4LDN/events.json","paper":"https://pith.science/paper/IW54LDEF"},"agent_actions":{"view_html":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN","download_json":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN.json","view_paper":"https://pith.science/paper/IW54LDEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04617&json=true","fetch_graph":"https://pith.science/api/pith-number/IW54LDEFPEZOKDNXHNSXHD4LDN/graph.json","fetch_events":"https://pith.science/api/pith-number/IW54LDEFPEZOKDNXHNSXHD4LDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/action/storage_attestation","attest_author":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/action/author_attestation","sign_citation":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/action/citation_signature","submit_replication":"https://pith.science/pith/IW54LDEFPEZOKDNXHNSXHD4LDN/action/replication_record"}},"created_at":"2026-05-18T00:26:03.834054+00:00","updated_at":"2026-05-18T00:26:03.834054+00:00"}