<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: prasmuss15</title><link>https://news.ycombinator.com/user?id=prasmuss15</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 29 Aug 2026 11:09:26 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=prasmuss15" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by prasmuss15 in "Show HN: Graphiti – LLM-Powered Temporal Knowledge Graphs"]]></title><description><![CDATA[
<p>I'm not quite sure I follow. Today, graphiti extracts entities as nodes and facts between those nodes as edges. The nodes and edges store semantic data, like summaries of entities and facts representing the relationships between them (in addition to other metadata). Our searches are also based on this semantic data, and we aren't intending the extracted edge names to be used as filters as we are not doing any taxonomical classifications of nodes and edges.<p>In the near future, we intend to allow users of graphiti to input a custom schema (ontology), and we would use that to enforce a classifications of the extracted nodes and edges. In this case we are un-opinionated on what custom schema is being provided. You would be able to use an ontology that is made in-house or one of the many open source ones that exist in whatever field you are working in.<p>In neither case are we trying to recreate our own custom ontology or reinventing the wheel on how things are being classified.</p>
]]></description><pubDate>Thu, 05 Sep 2024 21:30:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=41460559</link><dc:creator>prasmuss15</dc:creator><comments>https://news.ycombinator.com/item?id=41460559</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41460559</guid></item><item><title><![CDATA[New comment by prasmuss15 in "Show HN: Graphiti – LLM-Powered Temporal Knowledge Graphs"]]></title><description><![CDATA[
<p>Hey! Do you mean tips for implementing a similar project in TS? Or do you want to make a project in TS using graphiti?<p>If you want to use graphiti in a TS project you can wrap the graphiti library in a Python server (using fastAPI, Flask or Django) and then in TS you can call the Python endpoints with something like express. We will have an example of a fastAPI implementation in our repo soon.<p>If instead you want to build a similar project in TS, I would say it is certainly very doable. We will be releasing blog posts on some of the challenges we ran into when building the project, but the main thing I would say is to focus on having a robust data structure before you start that handles all of your use cases, fundamentally changing the basic building blocks of your library half way through will be really tough.</p>
]]></description><pubDate>Thu, 05 Sep 2024 17:07:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=41458544</link><dc:creator>prasmuss15</dc:creator><comments>https://news.ycombinator.com/item?id=41458544</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41458544</guid></item><item><title><![CDATA[New comment by prasmuss15 in "Show HN: Graphiti – LLM-Powered Temporal Knowledge Graphs"]]></title><description><![CDATA[
<p>Thanks for the follow-up and the in depth example and explanation. Like you said, supporting ontologies is definitely a core use-case of KG's and there are also many standard preexisting taxonomies for different things (Google and Amazon both famously have taxonomies that try to cover everything, and there are many other specialized ones as well).<p>I don't think I was clear enough when I mentioned our plans to add custom schema. The way we are thinking of implementing this idea is by allowing end users to provide specific node types and edge types between those nodes. Then we can pass that information on to the LLM and instruct it to extract only nodes and edges that conform to the provided schema. We would also have methods to verify the output before adding it to the graph.<p>So in this scenario you could input something like:
{ NodeType: Person, EdgeTypes: [IS_PARENT_OF, IS_CHILD_OF] }<p>Always extracting creating inverse relationships as well isn't something we've discussed yet but I think it's a great idea. Happy to hear any other thoughts you have or if you think there is a flaw in our approach to the custom schema to begin to solve the issue you've raised.<p>Edit: I think part of what you are saying just clicked for me. I think you're suggesting that the graphiti team chooses some open source taxonomy (like Google or Amazon) that we determine as our core taxonomy, and then fine tune an LLM on that data and open-source it? Then users can choose to use that fine-tuned LLM and get consistent schema relationships across the board? I think that is a really cool idea, but probably not something we would be able to do in the foreseeable future. We want the graphiti open source project to not be that opinionated, and we want to allow users to choose or fine tune their own LLMs for their specific use cases.</p>
]]></description><pubDate>Wed, 04 Sep 2024 21:17:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=41450939</link><dc:creator>prasmuss15</dc:creator><comments>https://news.ycombinator.com/item?id=41450939</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41450939</guid></item><item><title><![CDATA[New comment by prasmuss15 in "Show HN: Graphiti – LLM-Powered Temporal Knowledge Graphs"]]></title><description><![CDATA[
<p>Yes, that is in the works and is a high priority for us. The major discussion point internally around implementing this feature has been on the retrieval portion. In general we want to provide many flexible search strategies that return a variety of different information. We want to organize search in such a way that it is flexible enough to meet a variety of demands, while also being ergonomic enough to be usable and understandable. We want to make sure that we update our retrieval approach at the same time as adding the community summaries so that it is easy to make use of this additional information.<p>Our implementation will likely involve us adding community nodes that will contain a summary of the nodes in that community. Did you have any perspective or opinions on best ways to implement the graphRAG style summarizations?</p>
]]></description><pubDate>Wed, 04 Sep 2024 19:53:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=41449968</link><dc:creator>prasmuss15</dc:creator><comments>https://news.ycombinator.com/item?id=41449968</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41449968</guid></item><item><title><![CDATA[New comment by prasmuss15 in "Show HN: Graphiti – LLM-Powered Temporal Knowledge Graphs"]]></title><description><![CDATA[
<p>Hey, thanks for the feedback! I'm one of the devs on graphiti and adding support for custom schema is high on our to-do list. I agree that this is an important step in helping to bridge the gap between structured and unstructured data, as well as for refining the graph on specific use cases.<p>Currently, we do have some ways of helping the graph to understand what nodes and edges "really mean." In addition to the name of the relationship our edges also store a "hydrated" version of the fact triple. For example, if Alice and Bob are siblings you might see an edge with the name IS_SIBLING_OF between the two. In addition to this, the edge also stores the fact: "Alice is the sibling of Bob". This way we are storing much of the semantic context on the nodes and edges themselves in addition to the graph structure.<p>We also support ingesting structured JSON, and I those cases the edges will be exactly the properties in the JSON doc.</p>
]]></description><pubDate>Wed, 04 Sep 2024 19:01:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=41449307</link><dc:creator>prasmuss15</dc:creator><comments>https://news.ycombinator.com/item?id=41449307</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41449307</guid></item></channel></rss>