[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-quanta-library-combines-vector-search-lexical-search-and-graphs":10,"sections":35},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},6608,"quanta-library-combines-vector-search-lexical-search-and-graphs","Quanta Library Combines Vector Search Lexical Search and Graphs","Quanta stitches vector search, full-text search, and graph traversal into one Python library, betting that rank fusion beats fragile score normalization.","Quanta wants to replace the pile of separate databases behind most retrieval-augmented generation systems with a single API.\n\nQuanta is an open-source Python library detailed in a research paper published September 17, 2026. It merges three retrieval methods that developers typically wire together by hand: dense vector search over 4-bit quantized embeddings, BM25 keyword search, and knowledge-graph traversal. Rather than blending results by normalizing scores from each system onto a shared scale, Quanta uses weighted reciprocal rank fusion, arguing that score normalization is query-dependent and therefore unreliable. The graph component does not score relevance itself; it only widens the candidate pool, and those newly surfaced documents get re-ranked by the same dense retrieval logic under an identifier allowlist.\n\nMost production RAG pipelines run a vector database, a full-text search engine, and sometimes a graph database side by side, stitched together with custom integration code that gets rebuilt for every project. Quanta's bet is that this glue code is a solved problem, not something every team should reinvent from scratch. If the rank-fusion approach generalizes beyond the paper's own tests, it could remove a real chunk of plumbing work from building retrieval systems.\n\nOne library, one paper, zero production war stories yet - the real test is whether it survives contact with messy, real-world document collections.","[\"rag\",\"vector-search\",\"open-source\",\"python\"]","2026-09-17T04:00:00.000Z","2026-09-18T02:26:14.240Z","2026-09-18T02:26:26.154Z","published",null,[],"dev-tools",[26,27,28,29],"rag","vector-search","open-source","python",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.18248",0,{"sections":36},[37,42,46,51,56,60,64,69,74,77,82,87,92,97],{"name":38,"slug":39,"count":40,"latest_published_at":41},"AI","ai",3853,"2026-09-17T08:27:09.000Z",{"name":43,"slug":44,"count":45,"latest_published_at":18},"Security","security",648,{"name":47,"slug":48,"count":49,"latest_published_at":50},"Policy","policy",338,"2026-09-11T04:00:00.000Z",{"name":52,"slug":53,"count":54,"latest_published_at":55},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":57,"slug":58,"count":59,"latest_published_at":18},"Hardware","hardware",154,{"name":61,"slug":62,"count":63,"latest_published_at":18},"Science","science",114,{"name":65,"slug":66,"count":67,"latest_published_at":68},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":70,"slug":71,"count":72,"latest_published_at":73},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":75,"slug":24,"count":76,"latest_published_at":18},"Dev Tools",73,{"name":78,"slug":79,"count":80,"latest_published_at":81},"Startups","startups",55,"2026-09-09T23:14:29.000Z",{"name":83,"slug":84,"count":85,"latest_published_at":86},"Gaming","gaming",43,"2026-09-10T12:18:06.000Z",{"name":88,"slug":89,"count":90,"latest_published_at":91},"General","general",41,"2026-09-08T01:57:23.000Z",{"name":93,"slug":94,"count":95,"latest_published_at":96},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":98,"slug":99,"count":100,"latest_published_at":101},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]