{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K6YCY6FZSMJ2X4DFZFAPB4U2OB","short_pith_number":"pith:K6YCY6FZ","schema_version":"1.0","canonical_sha256":"57b02c78b99313abf065c940f0f29a7079e0539404be6289b2201a101007543d","source":{"kind":"arxiv","id":"2406.03025","version":1},"attestation_state":"computed","paper":{"title":"Refined Horton-Strahler numbers I: a discrete bijection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Louigi Addario-Berry, Marie Albenque, Robin Khanfir, Serte Donderwinkel","submitted_at":"2024-06-05T07:48:07Z","abstract_excerpt":"The Horton-Strahler number of a rooted tree $T$ is the height of the tallest complete binary tree that can be homeomorphically embedded in $T$. The number of full binary trees with $n$ internal vertices and Horton-Strahler number $s$ is known to be the same as the number of Dyck paths of length $2n$ whose height $h$ satisfies $\\lfloor \\log_2(1+h)\\rfloor=s$.\n  In this paper, we present a new bijective proof of the above result, that in fact strengthens and refines it as follows. We introduce a sequence of trees $(\\tau_i,i \\ge 0)$ which \"interpolates\" the complete binary trees, in the sense that"},"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":"2406.03025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-05T07:48:07Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4ad2063c5bc443abf286405be6137da93a6721fd62b0cdb51d6803ca672a5991","abstract_canon_sha256":"a39424c3564ae1070d7c2c75f50722c72b4fdb681429c494f444309a3557ccd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:50.471922Z","signature_b64":"898jfKl2CFWn1ZvJbdYqB6VTA+wkYYjQ+cj6rotYTPVb68uaMwBtytzASkD2VMY1dAwbwl+ATRGM5rfWGr83Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57b02c78b99313abf065c940f0f29a7079e0539404be6289b2201a101007543d","last_reissued_at":"2026-07-05T08:27:50.471403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:50.471403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refined Horton-Strahler numbers I: a discrete bijection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Louigi Addario-Berry, Marie Albenque, Robin Khanfir, Serte Donderwinkel","submitted_at":"2024-06-05T07:48:07Z","abstract_excerpt":"The Horton-Strahler number of a rooted tree $T$ is the height of the tallest complete binary tree that can be homeomorphically embedded in $T$. The number of full binary trees with $n$ internal vertices and Horton-Strahler number $s$ is known to be the same as the number of Dyck paths of length $2n$ whose height $h$ satisfies $\\lfloor \\log_2(1+h)\\rfloor=s$.\n  In this paper, we present a new bijective proof of the above result, that in fact strengthens and refines it as follows. We introduce a sequence of trees $(\\tau_i,i \\ge 0)$ which \"interpolates\" the complete binary trees, in the sense that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03025","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.03025/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.03025","created_at":"2026-07-05T08:27:50.471462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.03025v1","created_at":"2026-07-05T08:27:50.471462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03025","created_at":"2026-07-05T08:27:50.471462+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6YCY6FZSMJ2","created_at":"2026-07-05T08:27:50.471462+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6YCY6FZSMJ2X4DF","created_at":"2026-07-05T08:27:50.471462+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6YCY6FZ","created_at":"2026-07-05T08:27:50.471462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.11384","citing_title":"The Horton-Strahler number of butterfly trees","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB","json":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB.json","graph_json":"https://pith.science/api/pith-number/K6YCY6FZSMJ2X4DFZFAPB4U2OB/graph.json","events_json":"https://pith.science/api/pith-number/K6YCY6FZSMJ2X4DFZFAPB4U2OB/events.json","paper":"https://pith.science/paper/K6YCY6FZ"},"agent_actions":{"view_html":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB","download_json":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB.json","view_paper":"https://pith.science/paper/K6YCY6FZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.03025&json=true","fetch_graph":"https://pith.science/api/pith-number/K6YCY6FZSMJ2X4DFZFAPB4U2OB/graph.json","fetch_events":"https://pith.science/api/pith-number/K6YCY6FZSMJ2X4DFZFAPB4U2OB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/action/storage_attestation","attest_author":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/action/author_attestation","sign_citation":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/action/citation_signature","submit_replication":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/action/replication_record"}},"created_at":"2026-07-05T08:27:50.471462+00:00","updated_at":"2026-07-05T08:27:50.471462+00:00"}