{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3SJW7TUBRQEUDJN5ENQD2FYRCC","short_pith_number":"pith:3SJW7TUB","schema_version":"1.0","canonical_sha256":"dc936fce818c0941a5bd23603d1711109ebe38c058364db7480b916da0421c96","source":{"kind":"arxiv","id":"2402.12061","version":2},"attestation_state":"computed","paper":{"title":"All Language Models Large and Small","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"David Mguni, Yali Du, Zhixun Chen","submitted_at":"2024-02-19T11:28:20Z","abstract_excerpt":"Many leading language models (LMs) use high-intensity computational resources both during training and execution. This poses the challenge of lowering resource costs for deployment and faster execution of decision-making tasks among others. We introduce a novel plug-and-play LM framework named Language Optimising Network Distribution (LONDI) framework. LONDI learns to selectively employ large LMs only where complex decision-making and reasoning are required while using low-resource LMs (i.e. LMs require less GPU usage, but may not be able to solve the problem alone) everywhere else. LONDI cons"},"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":"2402.12061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-19T11:28:20Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"5defd2539777779ab50ea9f88638e0424b21addb3bd8030e84a01c5603d51432","abstract_canon_sha256":"7b4d37554a5e3f7528ea49d4d7d1c109149b256789a47e39dd72fe351f799f07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:46.339364Z","signature_b64":"hpeSDlEWHEFGSpSdmYslJEGgkP36Y22NLc3nhbwuR/W+0eJss03ZZ9PkZlBKy0ksf6wotqiL1EH7R2ctfVeiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc936fce818c0941a5bd23603d1711109ebe38c058364db7480b916da0421c96","last_reissued_at":"2026-07-05T08:27:46.338807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:46.338807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All Language Models Large and Small","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"David Mguni, Yali Du, Zhixun Chen","submitted_at":"2024-02-19T11:28:20Z","abstract_excerpt":"Many leading language models (LMs) use high-intensity computational resources both during training and execution. This poses the challenge of lowering resource costs for deployment and faster execution of decision-making tasks among others. We introduce a novel plug-and-play LM framework named Language Optimising Network Distribution (LONDI) framework. LONDI learns to selectively employ large LMs only where complex decision-making and reasoning are required while using low-resource LMs (i.e. LMs require less GPU usage, but may not be able to solve the problem alone) everywhere else. LONDI cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12061","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/2402.12061/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":"2402.12061","created_at":"2026-07-05T08:27:46.338886+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12061v2","created_at":"2026-07-05T08:27:46.338886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12061","created_at":"2026-07-05T08:27:46.338886+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SJW7TUBRQEU","created_at":"2026-07-05T08:27:46.338886+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SJW7TUBRQEUDJN5","created_at":"2026-07-05T08:27:46.338886+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SJW7TUB","created_at":"2026-07-05T08:27:46.338886+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.00861","citing_title":"Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC","json":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC.json","graph_json":"https://pith.science/api/pith-number/3SJW7TUBRQEUDJN5ENQD2FYRCC/graph.json","events_json":"https://pith.science/api/pith-number/3SJW7TUBRQEUDJN5ENQD2FYRCC/events.json","paper":"https://pith.science/paper/3SJW7TUB"},"agent_actions":{"view_html":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC","download_json":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC.json","view_paper":"https://pith.science/paper/3SJW7TUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12061&json=true","fetch_graph":"https://pith.science/api/pith-number/3SJW7TUBRQEUDJN5ENQD2FYRCC/graph.json","fetch_events":"https://pith.science/api/pith-number/3SJW7TUBRQEUDJN5ENQD2FYRCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC/action/storage_attestation","attest_author":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC/action/author_attestation","sign_citation":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC/action/citation_signature","submit_replication":"https://pith.science/pith/3SJW7TUBRQEUDJN5ENQD2FYRCC/action/replication_record"}},"created_at":"2026-07-05T08:27:46.338886+00:00","updated_at":"2026-07-05T08:27:46.338886+00:00"}