{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FLGSHIT4XZTFMX26YEJLQPKC3G","short_pith_number":"pith:FLGSHIT4","schema_version":"1.0","canonical_sha256":"2acd23a27cbe66565f5ec112b83d42d980d511357ef696131f2d038c68c0236a","source":{"kind":"arxiv","id":"1709.04302","version":1},"attestation_state":"computed","paper":{"title":"On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Olivier Bodini, Paul Tarau","submitted_at":"2017-09-13T12:57:20Z","abstract_excerpt":"Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices.\n  We derive, through a sequence of logic program transformations, efficient code for their combinatorial generation and study their statistical properties.\n  As a result, we obtain context-free grammars describing closable and uniquely closa"},"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":"1709.04302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-13T12:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"7cda887c93fb3d04a098d1c69aca07312935af7cf12d2cafd975c2070799079f","abstract_canon_sha256":"059f650ac2b0afc611de6a5eb17d41d47996de06c220f7789e2727831b8fd90e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:14.760625Z","signature_b64":"vFBYKS+XwCvJTw8oDa4lVNyykvhnb02sW8IByCsKh5Ek0hd+ju0Q13qbF6IjY7iJUvIEqrqFVfCE3U3MA6FmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2acd23a27cbe66565f5ec112b83d42d980d511357ef696131f2d038c68c0236a","last_reissued_at":"2026-05-18T00:35:14.760009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:14.760009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Olivier Bodini, Paul Tarau","submitted_at":"2017-09-13T12:57:20Z","abstract_excerpt":"Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices.\n  We derive, through a sequence of logic program transformations, efficient code for their combinatorial generation and study their statistical properties.\n  As a result, we obtain context-free grammars describing closable and uniquely closa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04302","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":"1709.04302","created_at":"2026-05-18T00:35:14.760104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04302v1","created_at":"2026-05-18T00:35:14.760104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04302","created_at":"2026-05-18T00:35:14.760104+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLGSHIT4XZTF","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLGSHIT4XZTFMX26","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLGSHIT4","created_at":"2026-05-18T12:31:15.632608+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/FLGSHIT4XZTFMX26YEJLQPKC3G","json":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G.json","graph_json":"https://pith.science/api/pith-number/FLGSHIT4XZTFMX26YEJLQPKC3G/graph.json","events_json":"https://pith.science/api/pith-number/FLGSHIT4XZTFMX26YEJLQPKC3G/events.json","paper":"https://pith.science/paper/FLGSHIT4"},"agent_actions":{"view_html":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G","download_json":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G.json","view_paper":"https://pith.science/paper/FLGSHIT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04302&json=true","fetch_graph":"https://pith.science/api/pith-number/FLGSHIT4XZTFMX26YEJLQPKC3G/graph.json","fetch_events":"https://pith.science/api/pith-number/FLGSHIT4XZTFMX26YEJLQPKC3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G/action/storage_attestation","attest_author":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G/action/author_attestation","sign_citation":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G/action/citation_signature","submit_replication":"https://pith.science/pith/FLGSHIT4XZTFMX26YEJLQPKC3G/action/replication_record"}},"created_at":"2026-05-18T00:35:14.760104+00:00","updated_at":"2026-05-18T00:35:14.760104+00:00"}