{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L7WFPKSX3LM2VBBUC7XXS4PZ3V","short_pith_number":"pith:L7WFPKSX","schema_version":"1.0","canonical_sha256":"5fec57aa57dad9aa843417ef7971f9dd4db15d598045fed01982309e9c8d3551","source":{"kind":"arxiv","id":"2505.23844","version":1},"attestation_state":"computed","paper":{"title":"Enabling Flexible Multi-LLM Integration for Scalable Knowledge Aggregation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hao Tang, Peiyan Dong, Pengwei Sui, Pu Zhao, Shiyue Hou, Stratis Ioannidis, Xin Meng, Xuan Shen, Yanzhi Wang, Yifan Gong, Zhenglun Kong, Zheng Zhan, Zifeng Wang","submitted_at":"2025-05-28T16:24:50Z","abstract_excerpt":"Large language models (LLMs) have shown remarkable promise but remain challenging to continually improve through traditional finetuning, particularly when integrating capabilities from other specialized LLMs. Popular methods like ensemble and weight merging require substantial memory and struggle to adapt to changing data environments. Recent efforts have transferred knowledge from multiple LLMs into a single target model; however, they suffer from interference and degraded performance among tasks, largely due to limited flexibility in candidate selection and training pipelines. To address the"},"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.23844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-28T16:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"1b034c4a17b9e6fde3ba44b069e96087543135fae081c975acee088b48745269","abstract_canon_sha256":"e55eb0119b9de984dd3c211fe4f6579f5e1463c9db278ba6b63195e8fd0ea8d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:36.600771Z","signature_b64":"mBe6h1Kuuhr0BbQD4OKF4JDda7KkZxkIj66F8sXOE/yrRvv/PhxU1gub9SvWzZlmc64mtpePPj5nT2PndrQeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fec57aa57dad9aa843417ef7971f9dd4db15d598045fed01982309e9c8d3551","last_reissued_at":"2026-07-05T11:12:36.600196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:36.600196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enabling Flexible Multi-LLM Integration for Scalable Knowledge Aggregation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hao Tang, Peiyan Dong, Pengwei Sui, Pu Zhao, Shiyue Hou, Stratis Ioannidis, Xin Meng, Xuan Shen, Yanzhi Wang, Yifan Gong, Zhenglun Kong, Zheng Zhan, Zifeng Wang","submitted_at":"2025-05-28T16:24:50Z","abstract_excerpt":"Large language models (LLMs) have shown remarkable promise but remain challenging to continually improve through traditional finetuning, particularly when integrating capabilities from other specialized LLMs. Popular methods like ensemble and weight merging require substantial memory and struggle to adapt to changing data environments. Recent efforts have transferred knowledge from multiple LLMs into a single target model; however, they suffer from interference and degraded performance among tasks, largely due to limited flexibility in candidate selection and training pipelines. To address the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23844","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/2505.23844/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.23844","created_at":"2026-07-05T11:12:36.600260+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23844v1","created_at":"2026-07-05T11:12:36.600260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23844","created_at":"2026-07-05T11:12:36.600260+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7WFPKSX3LM2","created_at":"2026-07-05T11:12:36.600260+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7WFPKSX3LM2VBBU","created_at":"2026-07-05T11:12:36.600260+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7WFPKSX","created_at":"2026-07-05T11:12:36.600260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06845","citing_title":"7B Fully Open Source Moxin-LLM/VLM -- From Pretraining to GRPO-based Reinforcement Learning Enhancement","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V","json":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V.json","graph_json":"https://pith.science/api/pith-number/L7WFPKSX3LM2VBBUC7XXS4PZ3V/graph.json","events_json":"https://pith.science/api/pith-number/L7WFPKSX3LM2VBBUC7XXS4PZ3V/events.json","paper":"https://pith.science/paper/L7WFPKSX"},"agent_actions":{"view_html":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V","download_json":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V.json","view_paper":"https://pith.science/paper/L7WFPKSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23844&json=true","fetch_graph":"https://pith.science/api/pith-number/L7WFPKSX3LM2VBBUC7XXS4PZ3V/graph.json","fetch_events":"https://pith.science/api/pith-number/L7WFPKSX3LM2VBBUC7XXS4PZ3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V/action/storage_attestation","attest_author":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V/action/author_attestation","sign_citation":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V/action/citation_signature","submit_replication":"https://pith.science/pith/L7WFPKSX3LM2VBBUC7XXS4PZ3V/action/replication_record"}},"created_at":"2026-07-05T11:12:36.600260+00:00","updated_at":"2026-07-05T11:12:36.600260+00:00"}