Knowledge Graphs are repositories of information that gather data from a multitude of domains and sources in the form of semantic triples, serving as a source of structured data for various crucial applications in the modern web landscape, from Wikipedia infoboxes to search engines. Such graphs mainly serve as secondary sources of information and depend on well-documented and verifiable provenance to ensure their trustworthiness and usability. However, their ability to systematically assess and assure the quality of this provenance, most crucially whether it properly supports the graph's information, relies mainly on manual processes that do not scale with size. ProVe aims at remedying this, consisting of a pipelined approach that automatically verifies whether a Knowledge Graph triple is supported by text extracted from its documented provenance. ProVe is intended to assist information curators and consists of four main steps involving rule-based methods and machine learning models: text extraction, triple verbalisation, sentence selection, and claim verification. ProVe is evaluated on a Wikidata dataset, achieving promising results overall and excellent performance on the binary classification task of detecting support from provenance, with 87.5% accuracy and 82.9% F1-macro on text-rich sources. The evaluation data and scripts used in this paper are available on GitHub and Figshare.
ProvenanceGuard: Source-Aware Factuality Verification for MCP-Based LLM Agents
Multiverse Computing;Parque Cientifico y Tecnológico de Gipuzkoa(吉普斯夸科技园);Centre for Social Innovation(社会创新中心);Donostia International Physics Center(多诺斯蒂亚国际物理中心);Ikerbasque Foundation for Science(伊克尔巴斯克科学基金会)
MEVER: Multi-Modal and Explainable Claim Verification with Graph-based Evidence Retrieval
University of Sheffield(谢菲尔德大学);University of Science and Technology Beijing(北京科技大学);University of California San Diego(加州大学圣地亚哥分校);The Pennsylvania State University(宾夕法尼亚州立大学)
Implicit Identity Technologies for LLMs: Fingerprinting and Watermarking across Datasets, Models, and Generated Content
School of Cyber Science and Engineering, Xi’an Jiaotong University, Xi’an, China(西安交通大学计算机科学与工程学院);State Grid Henan Marketing Service Center, Henan, China(国网河南营销服务中心);Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China(中国科学院信息工程研究所);School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China(中国科学院大学网络安全学院);School of Information Technology, Deakin University, Geelong, Australia(迪金大学信息技术学院)
Verifiable Fine-Tuning for LLMs: Zero-Knowledge Training Proofs Bound to Data Provenance and Policy
1 Department of Computer Engineering, Istanbul Technical University (ITU), 34469 Istanbul, Turkey Email;2 Department of Computer Science, University of Malta, MSD 2080 Msida, Malta Email;3 Faculty of Electrical \& Computer Engineering, University of Prishtina ``Hasan Prishtina'', 10000 Prishtina, Kosovo Email;4 School of IT \& Engineering, ADA University, AZ1008 Baku, Azerbaijan Email;5 Faculty of Mathematics, Natural Sciences;Information Technologies (FAMNIT), University of Primorska, 6000 Koper, Slovenia Email;6 Faculty of Computer Science \& Engineering (FINKI), Ss.\ Cyril;Methodius University in Skopje, 1000 Skopje, North Macedonia Email
Mention Memory: incorporating textual knowledge into Transformers through entity mention attention
University of Southern California(南加利福尼亚大学);Google(谷歌);Google Research(谷歌研究院)
诸如开放域问答之类的自然语言理解任务通常需要从多个源检索和吸收事实信息。我们建议通过将大型文本语料库的半参数表示集成到Transformer模型中作为事实知识的来源来解决这个问题。具体来说,我们的方法表示知识与“提及记忆”,一个表的密集向量表示的每一个实体中提到的语料库。所提出的模型- TOME -是一个Transformer,它通过内部记忆层访问信息,其中输入通道中提到的每个实体都参与提到记忆。这种方法支持在单个Transformer模型中对许多不同的信息源进行合成和推理。在使用1.5亿次维基百科提及的记忆的实验中,TOME在几个开放领域知识密集型任务上实现了强大的性能,包括声明验证基准HoVer和FEVER以及几个基于实体的QA基准。我们还表明,该模型学习参加信息提及没有任何直接的监督。最后,我们证明了该模型可以推广到新的看不见的实体更新的内存,而无需再训练。