{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D6VMR5EHS3IBOB7STQ3HQKUPU6","short_pith_number":"pith:D6VMR5EH","canonical_record":{"source":{"id":"1510.01167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-05T14:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"68ba6a05770084b7b1bf39b1093bf394eaf081814b07d48f0e099d236bea3745","abstract_canon_sha256":"476f5374eb364713f28e7637629812e778881b18fa6de99fbce8b108511d6c9b"},"schema_version":"1.0"},"canonical_sha256":"1faac8f48796d01707f29c36782a8fa78f40f770a02d3c05694d21c58c30edf6","source":{"kind":"arxiv","id":"1510.01167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01167","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01167v1","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01167","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"D6VMR5EHS3IB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D6VMR5EHS3IBOB7S","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D6VMR5EH","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D6VMR5EHS3IBOB7STQ3HQKUPU6","target":"record","payload":{"canonical_record":{"source":{"id":"1510.01167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-05T14:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"68ba6a05770084b7b1bf39b1093bf394eaf081814b07d48f0e099d236bea3745","abstract_canon_sha256":"476f5374eb364713f28e7637629812e778881b18fa6de99fbce8b108511d6c9b"},"schema_version":"1.0"},"canonical_sha256":"1faac8f48796d01707f29c36782a8fa78f40f770a02d3c05694d21c58c30edf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:04.631435Z","signature_b64":"PGRZNPjUyTz06nsQra7cEL7GudnuP/TEgF7BqhxghnuxAH+fMRXEF2nc3lwlGGw/aZAqFTtTq+53krykrK4RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1faac8f48796d01707f29c36782a8fa78f40f770a02d3c05694d21c58c30edf6","last_reissued_at":"2026-05-18T01:31:04.630868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:04.630868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.01167","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-05-18T01:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oN86Q5oYtuM3/jVxynUmoYoKNrQ8aWLZYwpH7gmtsrKTMHloX7ol9TsJFWGTa3Rmk3C0yzbp+ozAoEICoE0rBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:27:56.775218Z"},"content_sha256":"9c1210d0a1f8c568706fcf731400566af23e9e9b672e253cbb6030fdf4e7eab5","schema_version":"1.0","event_id":"sha256:9c1210d0a1f8c568706fcf731400566af23e9e9b672e253cbb6030fdf4e7eab5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D6VMR5EHS3IBOB7STQ3HQKUPU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of unary-binary tree-like structures with restrictions on the unary height","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernhard Gittenberger, Dani\\`ele Gardy, Olivier Bodini, Zbigniew Go{\\l}\\k{e}biewski","submitted_at":"2015-10-05T14:36:55Z","abstract_excerpt":"We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We either bound their number or the allowed levels of nesting. The enumeration is done by means of a generating function approach and singularity analysis. The generating functions are composed of nested square roots and exhibit unexpected phenomena in some of the cases. Furthermore, we present some observations obtained from generating such terms randomly and exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01167","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":""},"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-05-18T01:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGBHs5YXFejHDLDUGhGpUQDb3ULrHUiSgVDqqQ5t3auhJf6FIA7+enaH4vwLFnMS9pZBZ0FzxtVx5QsnCtr9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:27:56.775887Z"},"content_sha256":"ef30454c3f2fac1bdacd06fce41599db15a63f979fb3a86edb5a70ec525f6067","schema_version":"1.0","event_id":"sha256:ef30454c3f2fac1bdacd06fce41599db15a63f979fb3a86edb5a70ec525f6067"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6VMR5EHS3IBOB7STQ3HQKUPU6/bundle.json","state_url":"https://pith.science/pith/D6VMR5EHS3IBOB7STQ3HQKUPU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6VMR5EHS3IBOB7STQ3HQKUPU6/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-05-27T13:27:56Z","links":{"resolver":"https://pith.science/pith/D6VMR5EHS3IBOB7STQ3HQKUPU6","bundle":"https://pith.science/pith/D6VMR5EHS3IBOB7STQ3HQKUPU6/bundle.json","state":"https://pith.science/pith/D6VMR5EHS3IBOB7STQ3HQKUPU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6VMR5EHS3IBOB7STQ3HQKUPU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D6VMR5EHS3IBOB7STQ3HQKUPU6","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":"476f5374eb364713f28e7637629812e778881b18fa6de99fbce8b108511d6c9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-05T14:36:55Z","title_canon_sha256":"68ba6a05770084b7b1bf39b1093bf394eaf081814b07d48f0e099d236bea3745"},"schema_version":"1.0","source":{"id":"1510.01167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01167","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01167v1","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01167","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"D6VMR5EHS3IB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D6VMR5EHS3IBOB7S","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D6VMR5EH","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:ef30454c3f2fac1bdacd06fce41599db15a63f979fb3a86edb5a70ec525f6067","target":"graph","created_at":"2026-05-18T01:31:04Z","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":"We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We either bound their number or the allowed levels of nesting. The enumeration is done by means of a generating function approach and singularity analysis. The generating functions are composed of nested square roots and exhibit unexpected phenomena in some of the cases. Furthermore, we present some observations obtained from generating such terms randomly and exp","authors_text":"Bernhard Gittenberger, Dani\\`ele Gardy, Olivier Bodini, Zbigniew Go{\\l}\\k{e}biewski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-05T14:36:55Z","title":"On the number of unary-binary tree-like structures with restrictions on the unary height"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01167","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:9c1210d0a1f8c568706fcf731400566af23e9e9b672e253cbb6030fdf4e7eab5","target":"record","created_at":"2026-05-18T01:31:04Z","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":"476f5374eb364713f28e7637629812e778881b18fa6de99fbce8b108511d6c9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-05T14:36:55Z","title_canon_sha256":"68ba6a05770084b7b1bf39b1093bf394eaf081814b07d48f0e099d236bea3745"},"schema_version":"1.0","source":{"id":"1510.01167","kind":"arxiv","version":1}},"canonical_sha256":"1faac8f48796d01707f29c36782a8fa78f40f770a02d3c05694d21c58c30edf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1faac8f48796d01707f29c36782a8fa78f40f770a02d3c05694d21c58c30edf6","first_computed_at":"2026-05-18T01:31:04.630868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:04.630868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PGRZNPjUyTz06nsQra7cEL7GudnuP/TEgF7BqhxghnuxAH+fMRXEF2nc3lwlGGw/aZAqFTtTq+53krykrK4RDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:04.631435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c1210d0a1f8c568706fcf731400566af23e9e9b672e253cbb6030fdf4e7eab5","sha256:ef30454c3f2fac1bdacd06fce41599db15a63f979fb3a86edb5a70ec525f6067"],"state_sha256":"74eb12b7fd342e15f6d6b9457e295d1feeb6ecb70396690017eec7f72ae14910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PCszuH5A5yhyyrfhDuurZHlPwwUgeotIObeVSZCdU1b3b5XejCK36mi6yYzrvalAdQYlA14qAstfUSUdVeWvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:27:56.779666Z","bundle_sha256":"89aa2e2bcf1e3abc5c553d70fd92b7f598e21f2bf0bac470d53f2350dd5a21e9"}}