News

Perelyn's paper on TripartiteGraphRAG published

June 7, 2026
News
Perelyn's paper on TripartiteGraphRAG published

For an AI to work reliably with a company's own data such as contracts, records, or policies, it needs a method that finds the relevant passages for each question and provides them to the model.

The problem: conventional methods select these passages based only on superficial similarity, often resulting in incomplete or bloated inputs.

Building on a novel tripartite knowledge graph, Perelyn has developed a method that instead anchors the search to clearly defined domain concepts, enabling it to generate shorter, more precise, and traceable inputs, which directly translates into fewer errors, lower costs, and verifiable sources.

The method was presented at the "Knowledge Management" workshop at KI 2025 in Potsdam and has now been published in the proceedings.

Research at heart. Business in mind.

Here the link to the proceedings.

Other news

Event

Perelyn at Conf42 Large Language Models 2026

Liliya Imasheva presented a validation pipeline for evaluating AI summaries at Conf42 Large Language Models 2026.

June 18, 2026
Read

Event

Perelyn at IOCMA 2026

At the IOCMA 2026 conference, Perelyn presented our method, which transforms graph data such as supply chains or networks so that AI models can learn more reliably from it, even over long distances.

June 10, 2026
Read

Event

Perelyn at Helmholtz AI Conference 2026

Perelyn presented a method at Helmholtz AI Conference for researching cultural values in Large Language Models, which not only reads the models' responses but directly examines their internal representations.

June 8, 2026
Read

Contact us

Name*
Email*
message*
Thank you! Your submission has been received!
Oops! Something went wrong while submitting the form.
Help us improve our website. By “Accept” click, do you agree that we store a cookie on your device to analyse the use of the website. Read our Privacy statement for more information.
Something went wrong. Please try again.