{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZTU3VR2IDGP7AO3WCPVQQUX6CS","short_pith_number":"pith:ZTU3VR2I","schema_version":"1.0","canonical_sha256":"cce9bac748199ff03b7613eb0852fe14b28e9a45f00a5c876ca1ba018c2a9c54","source":{"kind":"arxiv","id":"2402.02338","version":3},"attestation_state":"computed","paper":{"title":"NetLLM: Adapting Large Language Models for Networking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Duo Wu, Fangxin Wang, Junchen Jiang, Shuguang Cui, Xianda Wang, Yaqi Qiao, Zhi Wang","submitted_at":"2024-02-04T04:21:34Z","abstract_excerpt":"Many networking tasks now employ deep learning (DL) to solve complex prediction and optimization problems. However, current design philosophy of DL-based algorithms entails intensive engineering overhead due to the manual design of deep neural networks (DNNs) for different networking tasks. Besides, DNNs tend to achieve poor generalization performance on unseen data distributions/environments.\n  Motivated by the recent success of large language models (LLMs), this work studies the LLM adaptation for networking to explore a more sustainable design philosophy. With the powerful pre-trained knowl"},"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.02338","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2024-02-04T04:21:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"11ab8429287fa980add99058959a82f8b6f084a8417b9914879ff4603b7a703d","abstract_canon_sha256":"dd59e1778658c6eecfe9c0c9a580aa6683b831e07c11a1b890bd6cd2baed1130"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:52:28.959847Z","signature_b64":"K0YSPVpgfz+GoyNNyl9lVtaKrrIKJ/J5WG2X6ohO0K3H9OcVU/kAr8Wr7nfrBKJ/nFxrpEXiThNQhV/5g7M1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce9bac748199ff03b7613eb0852fe14b28e9a45f00a5c876ca1ba018c2a9c54","last_reissued_at":"2026-07-05T08:52:28.959424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:52:28.959424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NetLLM: Adapting Large Language Models for Networking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Duo Wu, Fangxin Wang, Junchen Jiang, Shuguang Cui, Xianda Wang, Yaqi Qiao, Zhi Wang","submitted_at":"2024-02-04T04:21:34Z","abstract_excerpt":"Many networking tasks now employ deep learning (DL) to solve complex prediction and optimization problems. However, current design philosophy of DL-based algorithms entails intensive engineering overhead due to the manual design of deep neural networks (DNNs) for different networking tasks. Besides, DNNs tend to achieve poor generalization performance on unseen data distributions/environments.\n  Motivated by the recent success of large language models (LLMs), this work studies the LLM adaptation for networking to explore a more sustainable design philosophy. With the powerful pre-trained knowl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02338","kind":"arxiv","version":3},"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.02338/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.02338","created_at":"2026-07-05T08:52:28.959482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.02338v3","created_at":"2026-07-05T08:52:28.959482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02338","created_at":"2026-07-05T08:52:28.959482+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTU3VR2IDGP7","created_at":"2026-07-05T08:52:28.959482+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTU3VR2IDGP7AO3W","created_at":"2026-07-05T08:52:28.959482+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTU3VR2I","created_at":"2026-07-05T08:52:28.959482+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18656","citing_title":"LLM-QFL: Distilling Large Language Model for Quantum Federated Learning","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS","json":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS.json","graph_json":"https://pith.science/api/pith-number/ZTU3VR2IDGP7AO3WCPVQQUX6CS/graph.json","events_json":"https://pith.science/api/pith-number/ZTU3VR2IDGP7AO3WCPVQQUX6CS/events.json","paper":"https://pith.science/paper/ZTU3VR2I"},"agent_actions":{"view_html":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS","download_json":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS.json","view_paper":"https://pith.science/paper/ZTU3VR2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.02338&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTU3VR2IDGP7AO3WCPVQQUX6CS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTU3VR2IDGP7AO3WCPVQQUX6CS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS/action/storage_attestation","attest_author":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS/action/author_attestation","sign_citation":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS/action/citation_signature","submit_replication":"https://pith.science/pith/ZTU3VR2IDGP7AO3WCPVQQUX6CS/action/replication_record"}},"created_at":"2026-07-05T08:52:28.959482+00:00","updated_at":"2026-07-05T08:52:28.959482+00:00"}