{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YBDJ6RT37CFK4K7WINKCN3DIKQ","short_pith_number":"pith:YBDJ6RT3","canonical_record":{"source":{"id":"1603.01758","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-05T20:52:24Z","cross_cats_sorted":[],"title_canon_sha256":"c2df286b0eb7aad27bc34e931dc572272b9216bb0c9f698090016f65f316c496","abstract_canon_sha256":"649690ef26c602d6e72e587a353aa61933510c65f90a4b719bd4f1af0116099b"},"schema_version":"1.0"},"canonical_sha256":"c0469f467bf88aae2bf6435426ec685406c696dbb966282351ce648fb78a77be","source":{"kind":"arxiv","id":"1603.01758","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01758","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01758v3","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01758","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"YBDJ6RT37CFK","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YBDJ6RT37CFK4K7W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YBDJ6RT3","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YBDJ6RT37CFK4K7WINKCN3DIKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01758","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-05T20:52:24Z","cross_cats_sorted":[],"title_canon_sha256":"c2df286b0eb7aad27bc34e931dc572272b9216bb0c9f698090016f65f316c496","abstract_canon_sha256":"649690ef26c602d6e72e587a353aa61933510c65f90a4b719bd4f1af0116099b"},"schema_version":"1.0"},"canonical_sha256":"c0469f467bf88aae2bf6435426ec685406c696dbb966282351ce648fb78a77be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:04.621672Z","signature_b64":"cu6qJp7eHciEhCuSDbsXxgpVDbmqFeoJAolvNPkKKU0xCtgLIey6BwF9TBuT9sliqbOpWtPaMW3O5jRBRmQDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0469f467bf88aae2bf6435426ec685406c696dbb966282351ce648fb78a77be","last_reissued_at":"2026-05-18T01:13:04.621288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:04.621288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01758","source_version":3,"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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rf5NDCKVT5z8f7/jEzw8m6kICzbKBGplKIgD8iy54ZC2p348Du52rIkBmHqwU74JtYjp5bkuYN7iYeVgah7MCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:51:28.518296Z"},"content_sha256":"510c5417338a8379e3ce6b1a1896d112e00ca1bd1e0c5df38e86cf601eb71b04","schema_version":"1.0","event_id":"sha256:510c5417338a8379e3ce6b1a1896d112e00ca1bd1e0c5df38e86cf601eb71b04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YBDJ6RT37CFK4K7WINKCN3DIKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Normal-order reduction grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Maciej Bendkowski","submitted_at":"2016-03-05T20:52:24Z","abstract_excerpt":"We present an algorithm which, for given $n$, generates an unambiguous regular tree grammar defining the set of combinatory logic terms, over the set $\\{S,K\\}$ of primitive combinators, requiring exactly $n$ normal-order reduction steps to normalize. As a consequence of Curry and Feys's standardization theorem, our reduction grammars form a complete syntactic characterization of normalizing combinatory logic terms. Using them, we provide a recursive method of constructing ordinary generating functions counting the number of $S K$-combinators reducing in $n$ normal-order reduction steps. Finall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01758","kind":"arxiv","version":3},"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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rjekTCYz63W6ekhYfpSf/IbmXjVKQ9A4l3NigPSet6rMuUgxxn2HEsBA6IjUZhDmwCkR80TmC6Xme932wZMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:51:28.518654Z"},"content_sha256":"93ea57fca6f5a3376f6a6033bd6e0c1432e4fe75c3dc21c59ed96792c2b9044b","schema_version":"1.0","event_id":"sha256:93ea57fca6f5a3376f6a6033bd6e0c1432e4fe75c3dc21c59ed96792c2b9044b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/bundle.json","state_url":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/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-06-25T10:51:28Z","links":{"resolver":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ","bundle":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/bundle.json","state":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YBDJ6RT37CFK4K7WINKCN3DIKQ","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":"649690ef26c602d6e72e587a353aa61933510c65f90a4b719bd4f1af0116099b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-05T20:52:24Z","title_canon_sha256":"c2df286b0eb7aad27bc34e931dc572272b9216bb0c9f698090016f65f316c496"},"schema_version":"1.0","source":{"id":"1603.01758","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01758","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01758v3","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01758","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"YBDJ6RT37CFK","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YBDJ6RT37CFK4K7W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YBDJ6RT3","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:93ea57fca6f5a3376f6a6033bd6e0c1432e4fe75c3dc21c59ed96792c2b9044b","target":"graph","created_at":"2026-05-18T01:13: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 present an algorithm which, for given $n$, generates an unambiguous regular tree grammar defining the set of combinatory logic terms, over the set $\\{S,K\\}$ of primitive combinators, requiring exactly $n$ normal-order reduction steps to normalize. As a consequence of Curry and Feys's standardization theorem, our reduction grammars form a complete syntactic characterization of normalizing combinatory logic terms. Using them, we provide a recursive method of constructing ordinary generating functions counting the number of $S K$-combinators reducing in $n$ normal-order reduction steps. Finall","authors_text":"Maciej Bendkowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-05T20:52:24Z","title":"Normal-order reduction grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01758","kind":"arxiv","version":3},"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:510c5417338a8379e3ce6b1a1896d112e00ca1bd1e0c5df38e86cf601eb71b04","target":"record","created_at":"2026-05-18T01:13: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":"649690ef26c602d6e72e587a353aa61933510c65f90a4b719bd4f1af0116099b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-05T20:52:24Z","title_canon_sha256":"c2df286b0eb7aad27bc34e931dc572272b9216bb0c9f698090016f65f316c496"},"schema_version":"1.0","source":{"id":"1603.01758","kind":"arxiv","version":3}},"canonical_sha256":"c0469f467bf88aae2bf6435426ec685406c696dbb966282351ce648fb78a77be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0469f467bf88aae2bf6435426ec685406c696dbb966282351ce648fb78a77be","first_computed_at":"2026-05-18T01:13:04.621288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:04.621288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cu6qJp7eHciEhCuSDbsXxgpVDbmqFeoJAolvNPkKKU0xCtgLIey6BwF9TBuT9sliqbOpWtPaMW3O5jRBRmQDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:04.621672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01758","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:510c5417338a8379e3ce6b1a1896d112e00ca1bd1e0c5df38e86cf601eb71b04","sha256:93ea57fca6f5a3376f6a6033bd6e0c1432e4fe75c3dc21c59ed96792c2b9044b"],"state_sha256":"5cdbd8a0c92c40dd6c1aa3a62ffa2cd5b872c5141f8bf28eda6a79a295a193fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yL6r4dz5eQ5QXk4yvxoxpEHtdPrqdjsNHTBRXSNZmsnCaPTdKPwJI4Et43Mpp0/52++jJvN8mN32BVFK32NDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:51:28.520473Z","bundle_sha256":"89fb819854f775a2a9552c0ce3510bfc61a02c2d42cb24096f174b4fe1b5b5e4"}}