{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NORQ3DORLDISRLXHAUFJJA7ZEN","short_pith_number":"pith:NORQ3DOR","schema_version":"1.0","canonical_sha256":"6ba30d8dd158d128aee7050a9483f9235a40074e4340c2c55fa076de07d57d1f","source":{"kind":"arxiv","id":"1401.0379","version":1},"attestation_state":"computed","paper":{"title":"Counting Terms in the Binary Lambda Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.LO","authors_text":"Katarzyna Grygiel, Pierre Lescanne (LIP)","submitted_at":"2014-01-02T07:43:54Z","abstract_excerpt":"In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent lambda terms and derive results from their generating functions, especially that the number of terms of size n grows roughly like 1.963447954^n."},"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":"1401.0379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-02T07:43:54Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"2e38a8e4d0115192f030a62e572f38e0e5e157d0a910e5e3d814c52e824cfae8","abstract_canon_sha256":"0583730d3e8d7285ed2d5eb4535cc67fee77f39fd2b93b381ecc84119ce6ddfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:23.364597Z","signature_b64":"nZt6jWUOQUmGFJIWfctBDE1dtKzrALtN5deS0LpRh8ViFmqf2Ll568425TDSIjMrh2eXoAOn5N/txKivjjMGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ba30d8dd158d128aee7050a9483f9235a40074e4340c2c55fa076de07d57d1f","last_reissued_at":"2026-05-18T03:03:23.363904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:23.363904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Terms in the Binary Lambda Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.LO","authors_text":"Katarzyna Grygiel, Pierre Lescanne (LIP)","submitted_at":"2014-01-02T07:43:54Z","abstract_excerpt":"In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent lambda terms and derive results from their generating functions, especially that the number of terms of size n grows roughly like 1.963447954^n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0379","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.0379","created_at":"2026-05-18T03:03:23.364007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0379v1","created_at":"2026-05-18T03:03:23.364007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0379","created_at":"2026-05-18T03:03:23.364007+00:00"},{"alias_kind":"pith_short_12","alias_value":"NORQ3DORLDIS","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NORQ3DORLDISRLXH","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NORQ3DOR","created_at":"2026-05-18T12:28:41.024544+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/NORQ3DORLDISRLXHAUFJJA7ZEN","json":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN.json","graph_json":"https://pith.science/api/pith-number/NORQ3DORLDISRLXHAUFJJA7ZEN/graph.json","events_json":"https://pith.science/api/pith-number/NORQ3DORLDISRLXHAUFJJA7ZEN/events.json","paper":"https://pith.science/paper/NORQ3DOR"},"agent_actions":{"view_html":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN","download_json":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN.json","view_paper":"https://pith.science/paper/NORQ3DOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0379&json=true","fetch_graph":"https://pith.science/api/pith-number/NORQ3DORLDISRLXHAUFJJA7ZEN/graph.json","fetch_events":"https://pith.science/api/pith-number/NORQ3DORLDISRLXHAUFJJA7ZEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN/action/storage_attestation","attest_author":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN/action/author_attestation","sign_citation":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN/action/citation_signature","submit_replication":"https://pith.science/pith/NORQ3DORLDISRLXHAUFJJA7ZEN/action/replication_record"}},"created_at":"2026-05-18T03:03:23.364007+00:00","updated_at":"2026-05-18T03:03:23.364007+00:00"}