{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:K6YCY6FZSMJ2X4DFZFAPB4U2OB","short_pith_number":"pith:K6YCY6FZ","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"},"canonical_sha256":"57b02c78b99313abf065c940f0f29a7079e0539404be6289b2201a101007543d","source":{"kind":"arxiv","id":"2406.03025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.03025","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"arxiv_version","alias_value":"2406.03025v1","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03025","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"pith_short_12","alias_value":"K6YCY6FZSMJ2","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"pith_short_16","alias_value":"K6YCY6FZSMJ2X4DF","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"pith_short_8","alias_value":"K6YCY6FZ","created_at":"2026-07-05T08:27:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:K6YCY6FZSMJ2X4DFZFAPB4U2OB","target":"record","payload":{"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"},"canonical_sha256":"57b02c78b99313abf065c940f0f29a7079e0539404be6289b2201a101007543d","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"},"source_kind":"arxiv","source_id":"2406.03025","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-07-05T08:27:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3sOvcE6LXXbK7gcC+uthENWyrKNuG3/OA1CRUl/IAVNkQmT/X7AsJTaKXpG1gw18FoGVENNuTeM+2X8HKKPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:14:14.832530Z"},"content_sha256":"29b6ac6a55344ef2087f99f4f09c54aa86f66306e04e8ba06b9e4b174461f941","schema_version":"1.0","event_id":"sha256:29b6ac6a55344ef2087f99f4f09c54aa86f66306e04e8ba06b9e4b174461f941"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:K6YCY6FZSMJ2X4DFZFAPB4U2OB","target":"graph","payload":{"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"},"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-07-05T08:27:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOQaxwlHch/IXlFGjrRwQ7G+oOuBAVdPm9+Hlaaeluw7AwuC6Ory+Ag3PvPCwif+VGAyr+YuvVa4AQrusTj5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:14:14.833064Z"},"content_sha256":"9595af354050041036fc60d4680a59a1b346c6f3408a234371fdff4a6ea0b6c6","schema_version":"1.0","event_id":"sha256:9595af354050041036fc60d4680a59a1b346c6f3408a234371fdff4a6ea0b6c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/bundle.json","state_url":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/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-08-21T21:14:14Z","links":{"resolver":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB","bundle":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/bundle.json","state":"https://pith.science/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6YCY6FZSMJ2X4DFZFAPB4U2OB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:K6YCY6FZSMJ2X4DFZFAPB4U2OB","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":"a39424c3564ae1070d7c2c75f50722c72b4fdb681429c494f444309a3557ccd6","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-05T07:48:07Z","title_canon_sha256":"4ad2063c5bc443abf286405be6137da93a6721fd62b0cdb51d6803ca672a5991"},"schema_version":"1.0","source":{"id":"2406.03025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.03025","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"arxiv_version","alias_value":"2406.03025v1","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03025","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"pith_short_12","alias_value":"K6YCY6FZSMJ2","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"pith_short_16","alias_value":"K6YCY6FZSMJ2X4DF","created_at":"2026-07-05T08:27:50Z"},{"alias_kind":"pith_short_8","alias_value":"K6YCY6FZ","created_at":"2026-07-05T08:27:50Z"}],"graph_snapshots":[{"event_id":"sha256:9595af354050041036fc60d4680a59a1b346c6f3408a234371fdff4a6ea0b6c6","target":"graph","created_at":"2026-07-05T08:27:50Z","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/2406.03025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Louigi Addario-Berry, Marie Albenque, Robin Khanfir, Serte Donderwinkel","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-05T07:48:07Z","title":"Refined Horton-Strahler numbers I: a discrete bijection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03025","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:29b6ac6a55344ef2087f99f4f09c54aa86f66306e04e8ba06b9e4b174461f941","target":"record","created_at":"2026-07-05T08:27:50Z","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":"a39424c3564ae1070d7c2c75f50722c72b4fdb681429c494f444309a3557ccd6","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-05T07:48:07Z","title_canon_sha256":"4ad2063c5bc443abf286405be6137da93a6721fd62b0cdb51d6803ca672a5991"},"schema_version":"1.0","source":{"id":"2406.03025","kind":"arxiv","version":1}},"canonical_sha256":"57b02c78b99313abf065c940f0f29a7079e0539404be6289b2201a101007543d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57b02c78b99313abf065c940f0f29a7079e0539404be6289b2201a101007543d","first_computed_at":"2026-07-05T08:27:50.471403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:50.471403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"898jfKl2CFWn1ZvJbdYqB6VTA+wkYYjQ+cj6rotYTPVb68uaMwBtytzASkD2VMY1dAwbwl+ATRGM5rfWGr83Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:50.471922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.03025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29b6ac6a55344ef2087f99f4f09c54aa86f66306e04e8ba06b9e4b174461f941","sha256:9595af354050041036fc60d4680a59a1b346c6f3408a234371fdff4a6ea0b6c6"],"state_sha256":"e99f9129b460332d25cf7623b6a87bb4a88179997a455f9de92f44fb05fb5615"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6aclmsaMbUWRrtjFkH0Gl+4Vv9E8fGqAQTCkBXzhhOBo4b9xn93nX/P7+TGx/Q0THnMZoqzvY3gDSB0ID16Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T21:14:14.838481Z","bundle_sha256":"a611f2dac6971ea0de65a56f5ae031aa70998b43038fff31ff928ae1d603fd58"}}