{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GFGPYHQ3GQM4LE6DDSGEEQ3OLV","short_pith_number":"pith:GFGPYHQ3","schema_version":"1.0","canonical_sha256":"314cfc1e1b3419c593c31c8c42436e5d429699dd648cfc2cbb7b785541d9c142","source":{"kind":"arxiv","id":"2410.10450","version":2},"attestation_state":"computed","paper":{"title":"KBLaM: Knowledge Base augmented Language Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"James Hensman, Liana Mikaelyan, Taketomo Isazawa, Xi Wang","submitted_at":"2024-10-14T12:45:10Z","abstract_excerpt":"In this paper, we propose Knowledge Base augmented Language Model (KBLaM), a new method for augmenting Large Language Models (LLMs) with external knowledge. KBLaM works with a knowledge base (KB) constructed from a corpus of documents, transforming each piece of knowledge in the KB into continuous key-value vector pairs via pre-trained sentence encoders with linear adapters and integrating them into pre-trained LLMs via a specialized rectangular attention mechanism. Unlike Retrieval-Augmented Generation, KBLaM eliminates external retrieval modules, and unlike in-context learning, its computati"},"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":"2410.10450","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-14T12:45:10Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"db3d156176baafd69e5aba892a31c6cb62c6bba77630dfe419eaacff851a79f1","abstract_canon_sha256":"c0acd75f39f181abcccfdd4bbd8fb053e5257f3eb509ac64818c0e0f287f459b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:25.796005Z","signature_b64":"sNQEQscL4beb5IiQCwxn0SFsfBk8dZHdHg4HCDDsxbjL+cCUU60ARhxmqFNEzzGrhz7hB5cFdi4I1Lg2rE/NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"314cfc1e1b3419c593c31c8c42436e5d429699dd648cfc2cbb7b785541d9c142","last_reissued_at":"2026-07-05T10:11:25.795410Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:25.795410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KBLaM: Knowledge Base augmented Language Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"James Hensman, Liana Mikaelyan, Taketomo Isazawa, Xi Wang","submitted_at":"2024-10-14T12:45:10Z","abstract_excerpt":"In this paper, we propose Knowledge Base augmented Language Model (KBLaM), a new method for augmenting Large Language Models (LLMs) with external knowledge. KBLaM works with a knowledge base (KB) constructed from a corpus of documents, transforming each piece of knowledge in the KB into continuous key-value vector pairs via pre-trained sentence encoders with linear adapters and integrating them into pre-trained LLMs via a specialized rectangular attention mechanism. Unlike Retrieval-Augmented Generation, KBLaM eliminates external retrieval modules, and unlike in-context learning, its computati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10450","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/2410.10450/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":"2410.10450","created_at":"2026-07-05T10:11:25.795481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.10450v2","created_at":"2026-07-05T10:11:25.795481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10450","created_at":"2026-07-05T10:11:25.795481+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFGPYHQ3GQM4","created_at":"2026-07-05T10:11:25.795481+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFGPYHQ3GQM4LE6D","created_at":"2026-07-05T10:11:25.795481+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFGPYHQ3","created_at":"2026-07-05T10:11:25.795481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09666","citing_title":"Do We Still Need GraphRAG? Benchmarking RAG and GraphRAG for Agentic Search Systems","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV","json":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV.json","graph_json":"https://pith.science/api/pith-number/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/graph.json","events_json":"https://pith.science/api/pith-number/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/events.json","paper":"https://pith.science/paper/GFGPYHQ3"},"agent_actions":{"view_html":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV","download_json":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV.json","view_paper":"https://pith.science/paper/GFGPYHQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.10450&json=true","fetch_graph":"https://pith.science/api/pith-number/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/graph.json","fetch_events":"https://pith.science/api/pith-number/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/action/storage_attestation","attest_author":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/action/author_attestation","sign_citation":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/action/citation_signature","submit_replication":"https://pith.science/pith/GFGPYHQ3GQM4LE6DDSGEEQ3OLV/action/replication_record"}},"created_at":"2026-07-05T10:11:25.795481+00:00","updated_at":"2026-07-05T10:11:25.795481+00:00"}