{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:X3JC64ASYRLPMMN4XIJCZCZ2Z7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8886f67a67aecd07adfb707313cfa51995b02364b9bbee8a66f7140e6921edb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-02T18:35:16Z","title_canon_sha256":"0f7eb6283ded3977bbf0e5bc2f853c3034c617bbbf507a95be609e5198cdd54a"},"schema_version":"1.0","source":{"id":"2506.02153","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02153","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02153v2","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02153","created_at":"2026-05-17T23:38:47Z"},{"alias_kind":"pith_short_12","alias_value":"X3JC64ASYRLP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"X3JC64ASYRLPMMN4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"X3JC64AS","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:9998e7c7105b89d76ee27827ce9aced19f18bb349f728b6a3977b1342fa05af2","target":"graph","created_at":"2026-05-17T23:38:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"SLMs are sufficiently powerful, inherently more suitable, and necessarily more economical for many invocations in agentic systems, and are therefore the future of agentic AI."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the specialized, low-variation tasks in current and near-future agentic systems do not require the full general capabilities that only large models currently provide."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Small language models are sufficiently capable, more suitable, and far more economical than large models for the repetitive tasks that dominate agentic AI systems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Small language models will replace large ones in most agentic AI applications due to better suitability and economy for specialized tasks."}],"snapshot_sha256":"0d7eb9264358986f9ccfbb837486d5d2217e199db4b9a472a1f337ea5d711595"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6bb4fe5856ab8924b6beaaaee9b6cb991fc6c2964366cd853b8135f3348bf364"},"paper":{"abstract_excerpt":"Large language models (LLMs) are often praised for exhibiting near-human performance on a wide range of tasks and valued for their ability to hold a general conversation. The rise of agentic AI systems is, however, ushering in a mass of applications in which language models perform a small number of specialized tasks repetitively and with little variation.\n  Here we lay out the position that small language models (SLMs) are sufficiently powerful, inherently more suitable, and necessarily more economical for many invocations in agentic systems, and are therefore the future of agentic AI. Our ar","authors_text":"Greg Heinrich, Pavlo Molchanov, Peter Belcak, Saurav Muralidharan, Shizhe Diao, Xin Dong, Yingyan Celine Lin, Yonggan Fu","cross_cats":[],"headline":"Small language models will replace large ones in most agentic AI applications due to better suitability and economy for specialized tasks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-02T18:35:16Z","title":"Small Language Models are the Future of Agentic AI"},"references":{"count":87,"internal_anchors":11,"resolved_work":87,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Small language models vs","work_id":"be3a86fd-412c-4a1d-ac03-6bb039283277","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Small language models vs","work_id":"451b6b21-a6ba-4be2-a46b-2866282909a5","year":2024},{"cited_arxiv_id":"2404.14219","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone","work_id":"feef9556-a016-493c-abd2-0c97a23a7ebf","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The economics of ai training and inference: How deepseek broke the cost curve, February 2025","work_id":"f32ce730-def0-4ffc-b22b-20e835db4927","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Delift: Data efficient language model instruction fine tuning.arXiv preprint arXiv:2411.04425, 2024","work_id":"89e0eb30-f21e-4d31-8234-4766ca73a3e8","year":2024}],"snapshot_sha256":"effa9e39be785856559f97913d36c416ee3b3462e5c52921ab7ec4bb36270593"},"source":{"id":"2506.02153","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T11:50:04.174682Z","id":"7fab1e1b-8402-464f-a9fe-38ec28a46a70","model_set":{"reader":"grok-4.3"},"one_line_summary":"Small language models are sufficiently capable, more suitable, and far more economical than large models for the repetitive tasks that dominate agentic AI systems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Small language models will replace large ones in most agentic AI applications due to better suitability and economy for specialized tasks.","strongest_claim":"SLMs are sufficiently powerful, inherently more suitable, and necessarily more economical for many invocations in agentic systems, and are therefore the future of agentic AI.","weakest_assumption":"That the specialized, low-variation tasks in current and near-future agentic systems do not require the full general capabilities that only large models currently provide."}},"verdict_id":"7fab1e1b-8402-464f-a9fe-38ec28a46a70"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:99e710bd8f0a627efed2f456852c39347fb726259a19d2cc06ab76e07c94eb73","target":"record","created_at":"2026-05-17T23:38:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8886f67a67aecd07adfb707313cfa51995b02364b9bbee8a66f7140e6921edb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-02T18:35:16Z","title_canon_sha256":"0f7eb6283ded3977bbf0e5bc2f853c3034c617bbbf507a95be609e5198cdd54a"},"schema_version":"1.0","source":{"id":"2506.02153","kind":"arxiv","version":2}},"canonical_sha256":"bed22f7012c456f631bcba122c8b3acfd91202c709f2f8a95fe690a779293b1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bed22f7012c456f631bcba122c8b3acfd91202c709f2f8a95fe690a779293b1b","first_computed_at":"2026-05-17T23:38:47.966178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:47.966178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zm4ON+qMhqVFj7xDEpuXxKuzzh2t9lFFOsY67YfViXQ/WI/a059Fe2+PWqucVyzIZ7m1xDEJVBRDpWLj1K7QAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:47.967001Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02153","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99e710bd8f0a627efed2f456852c39347fb726259a19d2cc06ab76e07c94eb73","sha256:9998e7c7105b89d76ee27827ce9aced19f18bb349f728b6a3977b1342fa05af2"],"state_sha256":"d0715878038f211f4e99d6571475747f7b33e3bddeaefa95e88f73b1f3702925"}