{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PCRTE4LNTMPGFKZPLMDLQKSZDU","short_pith_number":"pith:PCRTE4LN","schema_version":"1.0","canonical_sha256":"78a332716d9b1e62ab2f5b06b82a591d0825a1b7c3a6eebb1e5f4fddec8bc051","source":{"kind":"arxiv","id":"1907.00467","version":1},"attestation_state":"computed","paper":{"title":"Typed lambda-calculi and superclasses of regular functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"L\\^e Th\\`anh D\\~ung Nguy\\^en","submitted_at":"2019-06-30T21:24:59Z","abstract_excerpt":"We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive complexity. Specifically, we look at transductions i.e. string-to-string (or tree-to-tree) functions - in particular those with superlinear growth, such as polyregular functions, HDT0L transductions and S\\'enizergues's \"k-computable mappings\".\n  Our first results towards this aim consist showing the inclusion of some transduction classes in some classes defined by"},"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":"1907.00467","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2019-06-30T21:24:59Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"2452932b757a4a783e668b9946f8be983d37df1405baf31a3281f3822622f219","abstract_canon_sha256":"1f3bd09ec71ef7cdf03e5e8b044a9674d78a2aa35ab0d68fa3649d2f1f4b7b47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:51.585865Z","signature_b64":"6o5cmCsnCzsoNAAV+Yr0lTCTLKQe+FYJFDTEvhOKUm92c+jBTk10l9MrLZ4vKfNebY/dOnid21TbiMoqc1YWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a332716d9b1e62ab2f5b06b82a591d0825a1b7c3a6eebb1e5f4fddec8bc051","last_reissued_at":"2026-05-17T23:41:51.584977Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:51.584977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typed lambda-calculi and superclasses of regular functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"L\\^e Th\\`anh D\\~ung Nguy\\^en","submitted_at":"2019-06-30T21:24:59Z","abstract_excerpt":"We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive complexity. Specifically, we look at transductions i.e. string-to-string (or tree-to-tree) functions - in particular those with superlinear growth, such as polyregular functions, HDT0L transductions and S\\'enizergues's \"k-computable mappings\".\n  Our first results towards this aim consist showing the inclusion of some transduction classes in some classes defined by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00467","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":"1907.00467","created_at":"2026-05-17T23:41:51.585103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00467v1","created_at":"2026-05-17T23:41:51.585103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00467","created_at":"2026-05-17T23:41:51.585103+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCRTE4LNTMPG","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCRTE4LNTMPGFKZP","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCRTE4LN","created_at":"2026-05-18T12:33:24.271573+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/PCRTE4LNTMPGFKZPLMDLQKSZDU","json":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU.json","graph_json":"https://pith.science/api/pith-number/PCRTE4LNTMPGFKZPLMDLQKSZDU/graph.json","events_json":"https://pith.science/api/pith-number/PCRTE4LNTMPGFKZPLMDLQKSZDU/events.json","paper":"https://pith.science/paper/PCRTE4LN"},"agent_actions":{"view_html":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU","download_json":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU.json","view_paper":"https://pith.science/paper/PCRTE4LN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00467&json=true","fetch_graph":"https://pith.science/api/pith-number/PCRTE4LNTMPGFKZPLMDLQKSZDU/graph.json","fetch_events":"https://pith.science/api/pith-number/PCRTE4LNTMPGFKZPLMDLQKSZDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU/action/storage_attestation","attest_author":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU/action/author_attestation","sign_citation":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU/action/citation_signature","submit_replication":"https://pith.science/pith/PCRTE4LNTMPGFKZPLMDLQKSZDU/action/replication_record"}},"created_at":"2026-05-17T23:41:51.585103+00:00","updated_at":"2026-05-17T23:41:51.585103+00:00"}