{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JQXWV2I5RNZVTHRH6ZSSUG5AHZ","short_pith_number":"pith:JQXWV2I5","schema_version":"1.0","canonical_sha256":"4c2f6ae91d8b73599e27f6652a1ba03e5d66adeab549caf163beaedb07d2eb46","source":{"kind":"arxiv","id":"1305.0814","version":2},"attestation_state":"computed","paper":{"title":"Increasing paths in regular trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"math.PR","authors_text":"Lee Zhuo Zhao, Matthew I. Roberts","submitted_at":"2013-05-03T19:56:07Z","abstract_excerpt":"We consider a regular $n$-ary tree of height $h$, for which every vertex except the root is labelled with an independent and identically distributed continuous random variable. Taking motivation from a question in evolutionary biology, we consider the number of simple paths from the root to a leaf along vertices with increasing labels. We show that if $\\alpha = n/h$ is fixed and $\\alpha > 1/e$, the probability there exists such a path converges to 1 as $h \\to \\infty$. This complements a previously known result that the probability converges to 0 if $\\alpha \\leq 1/e$."},"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":"1305.0814","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-05-03T19:56:07Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"1704e1f905e49cb52b992cac7db3282a1832a24e925e0caab92bca0809c75aa0","abstract_canon_sha256":"561b5549e4df0f49d816c0285825c60679a1eded0c2b0cc13db9c76d5c44a66b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:20.868236Z","signature_b64":"5iMWhoyIqEtXc459svzeg2OSStFWCPRYXcX2qizDHEHOWu5LrTnCUMP380PijV7HOqpIqjMk7sCVi5G8JKzvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2f6ae91d8b73599e27f6652a1ba03e5d66adeab549caf163beaedb07d2eb46","last_reissued_at":"2026-05-18T03:07:20.867851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:20.867851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Increasing paths in regular trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"math.PR","authors_text":"Lee Zhuo Zhao, Matthew I. Roberts","submitted_at":"2013-05-03T19:56:07Z","abstract_excerpt":"We consider a regular $n$-ary tree of height $h$, for which every vertex except the root is labelled with an independent and identically distributed continuous random variable. Taking motivation from a question in evolutionary biology, we consider the number of simple paths from the root to a leaf along vertices with increasing labels. We show that if $\\alpha = n/h$ is fixed and $\\alpha > 1/e$, the probability there exists such a path converges to 1 as $h \\to \\infty$. This complements a previously known result that the probability converges to 0 if $\\alpha \\leq 1/e$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0814","kind":"arxiv","version":2},"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":"1305.0814","created_at":"2026-05-18T03:07:20.867912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0814v2","created_at":"2026-05-18T03:07:20.867912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0814","created_at":"2026-05-18T03:07:20.867912+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQXWV2I5RNZV","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQXWV2I5RNZVTHRH","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQXWV2I5","created_at":"2026-05-18T12:27:49.015174+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/JQXWV2I5RNZVTHRH6ZSSUG5AHZ","json":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ.json","graph_json":"https://pith.science/api/pith-number/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/graph.json","events_json":"https://pith.science/api/pith-number/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/events.json","paper":"https://pith.science/paper/JQXWV2I5"},"agent_actions":{"view_html":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ","download_json":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ.json","view_paper":"https://pith.science/paper/JQXWV2I5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0814&json=true","fetch_graph":"https://pith.science/api/pith-number/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/action/storage_attestation","attest_author":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/action/author_attestation","sign_citation":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/action/citation_signature","submit_replication":"https://pith.science/pith/JQXWV2I5RNZVTHRH6ZSSUG5AHZ/action/replication_record"}},"created_at":"2026-05-18T03:07:20.867912+00:00","updated_at":"2026-05-18T03:07:20.867912+00:00"}