{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FFZGDYWY4JHZ4VGLZUV4RMZWRR","short_pith_number":"pith:FFZGDYWY","schema_version":"1.0","canonical_sha256":"297261e2d8e24f9e54cbcd2bc8b3368c6160e06a9a6718d28ec71244e01371de","source":{"kind":"arxiv","id":"2606.23179","version":1},"attestation_state":"computed","paper":{"title":"EML Trees Are Universal Approximators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","cs.NE","cs.SC","math.NA"],"primary_cat":"cs.LG","authors_text":"Elie Abdo, Joe Germany, Joseph Bakarji","submitted_at":"2026-06-22T11:17:09Z","abstract_excerpt":"The recently introduced EML (Exp-Minus-Log) function acts as continuous analogue of NAND gates, providing a compositional building block capable of representing elementary functions. In this work, we study the expressive power of tree-structured compositions of EML functions. We show that such trees enjoy a universal approximation property for functions in $W^{k, \\infty}$ for $k \\in \\mathbb N$, drawing on classical neural network approximation arguments while exploiting the ability to explicitly construct EML trees that mimic polynomial representations. We further propose a learning algorithm "},"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":"2606.23179","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T11:17:09Z","cross_cats_sorted":["cs.NA","cs.NE","cs.SC","math.NA"],"title_canon_sha256":"40b0617d552c3214e32495ca6c5d8e006d7b631ff76a1d2420d5353d571d5139","abstract_canon_sha256":"85821418b45f1ee2204cbf287e6e7c67aa5a3ae56d37ad8c98b4928ccfb152fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:12.290075Z","signature_b64":"SH2jkM4SftXywPQ5OBpuL7hqlFp1Pkqgo+Sr2E1yQHTpYJy8GfMRAytyumXk707TlPlKfV+TzHV+Xl5mbSGsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297261e2d8e24f9e54cbcd2bc8b3368c6160e06a9a6718d28ec71244e01371de","last_reissued_at":"2026-06-23T03:14:12.289743Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:12.289743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EML Trees Are Universal Approximators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","cs.NE","cs.SC","math.NA"],"primary_cat":"cs.LG","authors_text":"Elie Abdo, Joe Germany, Joseph Bakarji","submitted_at":"2026-06-22T11:17:09Z","abstract_excerpt":"The recently introduced EML (Exp-Minus-Log) function acts as continuous analogue of NAND gates, providing a compositional building block capable of representing elementary functions. In this work, we study the expressive power of tree-structured compositions of EML functions. We show that such trees enjoy a universal approximation property for functions in $W^{k, \\infty}$ for $k \\in \\mathbb N$, drawing on classical neural network approximation arguments while exploiting the ability to explicitly construct EML trees that mimic polynomial representations. We further propose a learning algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23179","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23179/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.23179","created_at":"2026-06-23T03:14:12.289797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23179v1","created_at":"2026-06-23T03:14:12.289797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23179","created_at":"2026-06-23T03:14:12.289797+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFZGDYWY4JHZ","created_at":"2026-06-23T03:14:12.289797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFZGDYWY4JHZ4VGL","created_at":"2026-06-23T03:14:12.289797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFZGDYWY","created_at":"2026-06-23T03:14:12.289797+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/FFZGDYWY4JHZ4VGLZUV4RMZWRR","json":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR.json","graph_json":"https://pith.science/api/pith-number/FFZGDYWY4JHZ4VGLZUV4RMZWRR/graph.json","events_json":"https://pith.science/api/pith-number/FFZGDYWY4JHZ4VGLZUV4RMZWRR/events.json","paper":"https://pith.science/paper/FFZGDYWY"},"agent_actions":{"view_html":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR","download_json":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR.json","view_paper":"https://pith.science/paper/FFZGDYWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23179&json=true","fetch_graph":"https://pith.science/api/pith-number/FFZGDYWY4JHZ4VGLZUV4RMZWRR/graph.json","fetch_events":"https://pith.science/api/pith-number/FFZGDYWY4JHZ4VGLZUV4RMZWRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR/action/storage_attestation","attest_author":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR/action/author_attestation","sign_citation":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR/action/citation_signature","submit_replication":"https://pith.science/pith/FFZGDYWY4JHZ4VGLZUV4RMZWRR/action/replication_record"}},"created_at":"2026-06-23T03:14:12.289797+00:00","updated_at":"2026-06-23T03:14:12.289797+00:00"}