{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N7R53ECCUIQ4EJLSKXIDWWG6LU","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":"41f9c56b8ad87e9001f9dedf2e9a6b0ceb6d66345a05faffd5fa263e5e49fad3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-19T16:06:28Z","title_canon_sha256":"9c324537cc7aa54af915b8c6a6211a70b16041ab2f3fc542df0f760826d9313a"},"schema_version":"1.0","source":{"id":"1602.06200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06200","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06200v2","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06200","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"N7R53ECCUIQ4","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N7R53ECCUIQ4EJLS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N7R53ECC","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:d37e141dc5dbf6c40dcb5a58aad69778afa89a8bd65e10a0a4a34ccdcd6c0761","target":"graph","created_at":"2026-05-18T01:15:06Z","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"},"paper":{"abstract_excerpt":"The register function (or Horton-Strahler number) of a binary tree is a well-known combinatorial parameter. We study a reduction procedure for binary trees which offers a new interpretation for the register function as the maximal number of reductions that can be applied to a given tree. In particular, the precise asymptotic behavior of the number of certain substructures (\"branches\") that occur when reducing a tree repeatedly is determined. In the same manner we introduce a reduction for simple two-dimensional lattice paths from which a complexity measure similar to the register function can ","authors_text":"Benjamin Hackl, Clemens Heuberger, Helmut Prodinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-19T16:06:28Z","title":"The Register Function and Reductions of Binary Trees and Lattice Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06200","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:79c1ecfb21b35faf01aafa0fa63793a64facb60efe1bb345df6a9addb0d6da16","target":"record","created_at":"2026-05-18T01:15:06Z","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":"41f9c56b8ad87e9001f9dedf2e9a6b0ceb6d66345a05faffd5fa263e5e49fad3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-19T16:06:28Z","title_canon_sha256":"9c324537cc7aa54af915b8c6a6211a70b16041ab2f3fc542df0f760826d9313a"},"schema_version":"1.0","source":{"id":"1602.06200","kind":"arxiv","version":2}},"canonical_sha256":"6fe3dd9042a221c2257255d03b58de5d24dbe10acb6ae8bbd63c6ce68359516e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fe3dd9042a221c2257255d03b58de5d24dbe10acb6ae8bbd63c6ce68359516e","first_computed_at":"2026-05-18T01:15:06.284764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:06.284764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jIBuLGNKshe7yoVIXipE0oYJtjAcaNmfG5/GdfsLxwG67H0u+cr8yq5yyIsB4iPJcy9XJ2oxFHw6vRGBubgxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:06.285258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79c1ecfb21b35faf01aafa0fa63793a64facb60efe1bb345df6a9addb0d6da16","sha256:d37e141dc5dbf6c40dcb5a58aad69778afa89a8bd65e10a0a4a34ccdcd6c0761"],"state_sha256":"bb5c24a33ce3efe00eac1a1cfa9682d472db807afe7473e49c5ba4fcbeeffa3b"}