{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SO2EBJQK2ZIYQOLFQC7DYPO5VG","short_pith_number":"pith:SO2EBJQK","schema_version":"1.0","canonical_sha256":"93b440a60ad65188396580be3c3ddda9b198a2d1632c0cf7807304ca63442be4","source":{"kind":"arxiv","id":"2504.09685","version":1},"attestation_state":"computed","paper":{"title":"Can LLMs Revolutionize the Design of Explainable and Efficient TinyML Models?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Christophe El Zeinaty, Daniel Menard, Glenn Herrou, Merouane Debbah, Wassim Hamidouche","submitted_at":"2025-04-13T18:36:03Z","abstract_excerpt":"This paper introduces a novel framework for designing efficient neural network architectures specifically tailored to tiny machine learning (TinyML) platforms. By leveraging large language models (LLMs) for neural architecture search (NAS), a vision transformer (ViT)-based knowledge distillation (KD) strategy, and an explainability module, the approach strikes an optimal balance between accuracy, computational efficiency, and memory usage. The LLM-guided search explores a hierarchical search space, refining candidate architectures through Pareto optimization based on accuracy, multiply-accumul"},"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":"2504.09685","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-13T18:36:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"be9afe11fdaba109b3037d956213b6bf51db458aca6ab6a535687fe108dc8362","abstract_canon_sha256":"a4b9426706b18e47f0378408262f9573465ba80c8a10080bf970393d3619834b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:41.241988Z","signature_b64":"qF7sEbfdHSld6ihQVb0JEugCWesU/AuyWJSceRgXxnBdtFfiMqSfo3PAmR1n0wzIf9MfMCxTWqKHc0WioLAlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93b440a60ad65188396580be3c3ddda9b198a2d1632c0cf7807304ca63442be4","last_reissued_at":"2026-07-05T10:48:41.241532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:41.241532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can LLMs Revolutionize the Design of Explainable and Efficient TinyML Models?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Christophe El Zeinaty, Daniel Menard, Glenn Herrou, Merouane Debbah, Wassim Hamidouche","submitted_at":"2025-04-13T18:36:03Z","abstract_excerpt":"This paper introduces a novel framework for designing efficient neural network architectures specifically tailored to tiny machine learning (TinyML) platforms. By leveraging large language models (LLMs) for neural architecture search (NAS), a vision transformer (ViT)-based knowledge distillation (KD) strategy, and an explainability module, the approach strikes an optimal balance between accuracy, computational efficiency, and memory usage. The LLM-guided search explores a hierarchical search space, refining candidate architectures through Pareto optimization based on accuracy, multiply-accumul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09685","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/2504.09685/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":"2504.09685","created_at":"2026-07-05T10:48:41.241594+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.09685v1","created_at":"2026-07-05T10:48:41.241594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09685","created_at":"2026-07-05T10:48:41.241594+00:00"},{"alias_kind":"pith_short_12","alias_value":"SO2EBJQK2ZIY","created_at":"2026-07-05T10:48:41.241594+00:00"},{"alias_kind":"pith_short_16","alias_value":"SO2EBJQK2ZIYQOLF","created_at":"2026-07-05T10:48:41.241594+00:00"},{"alias_kind":"pith_short_8","alias_value":"SO2EBJQK","created_at":"2026-07-05T10:48:41.241594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.08339","citing_title":"SHeRL-FL: When Representation Learning Meets Split Learning in Hierarchical Federated Learning","ref_index":164,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG","json":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG.json","graph_json":"https://pith.science/api/pith-number/SO2EBJQK2ZIYQOLFQC7DYPO5VG/graph.json","events_json":"https://pith.science/api/pith-number/SO2EBJQK2ZIYQOLFQC7DYPO5VG/events.json","paper":"https://pith.science/paper/SO2EBJQK"},"agent_actions":{"view_html":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG","download_json":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG.json","view_paper":"https://pith.science/paper/SO2EBJQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.09685&json=true","fetch_graph":"https://pith.science/api/pith-number/SO2EBJQK2ZIYQOLFQC7DYPO5VG/graph.json","fetch_events":"https://pith.science/api/pith-number/SO2EBJQK2ZIYQOLFQC7DYPO5VG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG/action/storage_attestation","attest_author":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG/action/author_attestation","sign_citation":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG/action/citation_signature","submit_replication":"https://pith.science/pith/SO2EBJQK2ZIYQOLFQC7DYPO5VG/action/replication_record"}},"created_at":"2026-07-05T10:48:41.241594+00:00","updated_at":"2026-07-05T10:48:41.241594+00:00"}