{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YBDJ6RT37CFK4K7WINKCN3DIKQ","short_pith_number":"pith:YBDJ6RT3","schema_version":"1.0","canonical_sha256":"c0469f467bf88aae2bf6435426ec685406c696dbb966282351ce648fb78a77be","source":{"kind":"arxiv","id":"1603.01758","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.01758","created_at":"2026-05-18T01:13:04.621352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01758v3","created_at":"2026-05-18T01:13:04.621352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01758","created_at":"2026-05-18T01:13:04.621352+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBDJ6RT37CFK","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBDJ6RT37CFK4K7W","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBDJ6RT3","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ","json":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ.json","graph_json":"https://pith.science/api/pith-number/YBDJ6RT37CFK4K7WINKCN3DIKQ/graph.json","events_json":"https://pith.science/api/pith-number/YBDJ6RT37CFK4K7WINKCN3DIKQ/events.json","paper":"https://pith.science/paper/YBDJ6RT3"},"agent_actions":{"view_html":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ","download_json":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ.json","view_paper":"https://pith.science/paper/YBDJ6RT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01758&json=true","fetch_graph":"https://pith.science/api/pith-number/YBDJ6RT37CFK4K7WINKCN3DIKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YBDJ6RT37CFK4K7WINKCN3DIKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/action/storage_attestation","attest_author":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/action/author_attestation","sign_citation":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/action/citation_signature","submit_replication":"https://pith.science/pith/YBDJ6RT37CFK4K7WINKCN3DIKQ/action/replication_record"}},"created_at":"2026-05-18T01:13:04.621352+00:00","updated_at":"2026-05-18T01:13:04.621352+00:00"}