{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZILP2IAGAZYRMK6QQRFZALKGZQ","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":"8a6090bebea1d3faeaa4321be70c7ee3581dd6f5b68d8d8c99d07692d646804e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-05-30T17:23:55Z","title_canon_sha256":"09e0f3996c67c6fc6542e9bb2d7093f8da1897344d446b1468b6ef812ea936d3"},"schema_version":"1.0","source":{"id":"2505.24821","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24821","created_at":"2026-07-05T11:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24821v2","created_at":"2026-07-05T11:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24821","created_at":"2026-07-05T11:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZILP2IAGAZYR","created_at":"2026-07-05T11:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ZILP2IAGAZYRMK6Q","created_at":"2026-07-05T11:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ZILP2IAG","created_at":"2026-07-05T11:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:7655fd3e2ef1bbc9059b1509b0b221ad40a32b699f4bd28c2cb2a27f19b61ae3","target":"graph","created_at":"2026-07-05T11:33:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.24821/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by the connection to a probabilistic model of phylogenetic trees introduced by Aldous, we study the recursive sequence governed by the rule $x_n = \\sum_{i=1}^{n-1} \\frac{1}{h_{n-1}(n-i)} x_i$ where $h_{n-1} = \\sum_{j=1}^{n-1} 1/j$, known as the harmonic descent chain. While it is known that this sequence converges to an explicit limit $x$, not much is known about the rate of convergence. We first show that a class of recursive sequences including the above are decreasing and use this to bound the rate of convergence. Moreover, for the harmonic descent chain we prove the asymptotic $x","authors_text":"Anna Brandenberger, Byron Chin, Elchanan Mossel","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-05-30T17:23:55Z","title":"Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24821","kind":"arxiv","version":2},"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:624619f154640625ca9aae5c5d18bcc4a86d047d9f57cb974decfd5213dee6d4","target":"record","created_at":"2026-07-05T11:33:24Z","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":"8a6090bebea1d3faeaa4321be70c7ee3581dd6f5b68d8d8c99d07692d646804e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-05-30T17:23:55Z","title_canon_sha256":"09e0f3996c67c6fc6542e9bb2d7093f8da1897344d446b1468b6ef812ea936d3"},"schema_version":"1.0","source":{"id":"2505.24821","kind":"arxiv","version":2}},"canonical_sha256":"ca16fd20060671162bd0844b902d46cc175b1b33008aed6641e486cb91c5e6cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca16fd20060671162bd0844b902d46cc175b1b33008aed6641e486cb91c5e6cd","first_computed_at":"2026-07-05T11:33:24.271775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:24.271775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p/9tN6HaRdcd6622DXxnmZ+vFEHybyTDUaYjYdv3fig5aHaVMRK2pA+k0q+Trp5/j4qjMfMor/lzFTqsw7N8CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:24.272251Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24821","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:624619f154640625ca9aae5c5d18bcc4a86d047d9f57cb974decfd5213dee6d4","sha256:7655fd3e2ef1bbc9059b1509b0b221ad40a32b699f4bd28c2cb2a27f19b61ae3"],"state_sha256":"a7e543a7942a503b0110e0e8ac7e712020dbd7951fda0a5d7bbd64c303d9e4a0"}