{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZBLM464Z5VBBUK5F6QZASHL4BB","short_pith_number":"pith:ZBLM464Z","schema_version":"1.0","canonical_sha256":"c856ce7b99ed421a2ba5f432091d7c08792c6a05bee2f89328ad8841cfe92cc2","source":{"kind":"arxiv","id":"2505.19529","version":2},"attestation_state":"computed","paper":{"title":"Small Language Models: Architectures, Techniques, Evaluation, Problems and Future Adaptation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Md. Kishor Morol, Md. Tanzib Hosain, Tanjil Hasan Sakib","submitted_at":"2025-05-26T05:29:47Z","abstract_excerpt":"Small Language Models (SLMs) have gained substantial attention due to their ability to execute diverse language tasks successfully while using fewer computer resources. These models are particularly ideal for deployment in limited environments, such as mobile devices, on-device processing, and edge systems. In this study, we present a complete assessment of SLMs, focussing on their design frameworks, training approaches, and techniques for lowering model size and complexity. We offer a novel classification system to organize the optimization approaches applied for SLMs, encompassing strategies"},"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":"2505.19529","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-26T05:29:47Z","cross_cats_sorted":[],"title_canon_sha256":"ac01770d815084c0a99fe6590f5630510c3cf2c852265e00944a4336ffaaf64c","abstract_canon_sha256":"3a1da83f143b66f67095dcb31b1e5f6078dcff52259c165c8ed30281aa86b3b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:46.682782Z","signature_b64":"082aU4Avm6yv/JIV9vXI5wfECnDeQ9mXTerUxIIt8Varz4OmYgi8aS+Mm5uqe4x6TI9Jde6kSsAnoE8P34EIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c856ce7b99ed421a2ba5f432091d7c08792c6a05bee2f89328ad8841cfe92cc2","last_reissued_at":"2026-07-05T11:11:46.680786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:46.680786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small Language Models: Architectures, Techniques, Evaluation, Problems and Future Adaptation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Md. Kishor Morol, Md. Tanzib Hosain, Tanjil Hasan Sakib","submitted_at":"2025-05-26T05:29:47Z","abstract_excerpt":"Small Language Models (SLMs) have gained substantial attention due to their ability to execute diverse language tasks successfully while using fewer computer resources. These models are particularly ideal for deployment in limited environments, such as mobile devices, on-device processing, and edge systems. In this study, we present a complete assessment of SLMs, focussing on their design frameworks, training approaches, and techniques for lowering model size and complexity. We offer a novel classification system to organize the optimization approaches applied for SLMs, encompassing strategies"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19529","kind":"arxiv","version":2},"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/2505.19529/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":"2505.19529","created_at":"2026-07-05T11:11:46.680845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.19529v2","created_at":"2026-07-05T11:11:46.680845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19529","created_at":"2026-07-05T11:11:46.680845+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBLM464Z5VBB","created_at":"2026-07-05T11:11:46.680845+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBLM464Z5VBBUK5F","created_at":"2026-07-05T11:11:46.680845+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBLM464Z","created_at":"2026-07-05T11:11:46.680845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16991","citing_title":"Response-free item difficulty modelling for multiple-choice items with fine-tuned transformers: Component-wise representation and multi-task learning","ref_index":155,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB","json":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB.json","graph_json":"https://pith.science/api/pith-number/ZBLM464Z5VBBUK5F6QZASHL4BB/graph.json","events_json":"https://pith.science/api/pith-number/ZBLM464Z5VBBUK5F6QZASHL4BB/events.json","paper":"https://pith.science/paper/ZBLM464Z"},"agent_actions":{"view_html":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB","download_json":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB.json","view_paper":"https://pith.science/paper/ZBLM464Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.19529&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBLM464Z5VBBUK5F6QZASHL4BB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBLM464Z5VBBUK5F6QZASHL4BB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB/action/storage_attestation","attest_author":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB/action/author_attestation","sign_citation":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB/action/citation_signature","submit_replication":"https://pith.science/pith/ZBLM464Z5VBBUK5F6QZASHL4BB/action/replication_record"}},"created_at":"2026-07-05T11:11:46.680845+00:00","updated_at":"2026-07-05T11:11:46.680845+00:00"}