{"as_of":"2026-08-22T02:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d2ad76f58892c39bd0c2c730cf1d4d4d75abf9090147105a3ba17d21509bc4c","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:54:23.461314Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T15:19:23.339311Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T03:27:35.702563Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2506.14707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14707","snapshot_observed_at":"2026-07-03T03:27:35.702563Z","title":"HARMONY: A scalable distributed vector database for high- throughput approximate nearest neighbor search,","venue":null,"work_id":"b7c9a616-db89-49d4-a43e-92771571b236","year":2025},"citing_paper":{"arxiv_id":"2606.08950","last_updated":"2026-06-08T02:51:40Z","snapshot_observed_at":"2026-08-15T03:18:15.847608Z","submitted_at":"2026-06-08T02:51:40Z","title":"When More Cores Hurts: The Vector Database Scaling Paradox in HPC","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-06-27T15:19:23.339311Z"},"links":{"cited_paper":"/paper/2506.14707","citing_paper":"/paper/2606.08950"},"observation_digest":"sha256:138eaa708592bc160e78709aade40beeebcfa82d0c260102e926a5780d6fa785","observation_id":"35713007-6f49-4312-a339-0defc4518f8d","resolution":{"observed_at":"2026-07-03T03:27:35.705057Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.14707/citation-record","integrity":"/paper/2506.14707/integrity","json":"/paper/2506.14707/citation-record.json","paper":"/paper/2506.14707"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.267624Z","title":"https://drill.apache.org/","venue":null,"work_id":"c704a0a7-1352-4a5b-8e57-f73ec8af186b","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.214713Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:84aa36b16ae6ced3cfa2dea7967acd9063ebd2f84cf226c75560004f72885092","observation_id":"5ae66d4e-7a1c-4568-bdf7-79bd6430f42c","resolution":{"observed_at":"2026-08-15T19:54:24.271422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.255894Z","title":"https://www.cockroachlabs.com/product/cockroachdb/","venue":null,"work_id":"b8425059-babc-44f4-ab39-fc04525bb584","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.218958Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:d73341db068790fdc8501110303cba8a22b800ffb75638e2649f94b54334ee8c","observation_id":"2eceb664-d172-477f-9efa-bc1d8c6b1fd6","resolution":{"observed_at":"2026-08-15T19:54:24.260277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.244485Z","title":"https://prestodb.io/docs/current/connector/ spark.html","venue":null,"work_id":"4c2a944c-09e0-421b-8df1-0661201f71a9","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.222599Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:8d24c1237dcbbdbad7fb68b682d19e7bc6d545b53df6a8407c836ab0d32580c2","observation_id":"49111e43-4300-4e61-94d5-d95741d23d59","resolution":{"observed_at":"2026-08-15T19:54:24.248507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.233618Z","title":"https://neo4j.com/","venue":null,"work_id":"0461c1e5-51a1-4fc7-891b-f3c32610da8c","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.226499Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:ff2fbd265c45a013732bf39df408130770d0fc9682ee4ad6229f7f388b85f8ff","observation_id":"9153dcd1-7a6c-42fe-8445-4cff111527d7","resolution":{"observed_at":"2026-08-15T19:54:24.237122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.221890Z","title":"http://pinecone.io","venue":null,"work_id":"43d93363-eb54-412e-8345-8b0ed34de9a4","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.230548Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:acd00aa1e3e1fab7718896dfd9e616386369a1fc05bac99323e0273b2fd27e57","observation_id":"f4984ecf-c6b7-4c76-80c0-187da1d6adc7","resolution":{"observed_at":"2026-08-15T19:54:24.226466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.210854Z","title":"https://prestodb.io/","venue":null,"work_id":"26a63e73-16ff-41fb-9b33-b6eb6de2845d","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.234249Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:fb5402f1b05207167bba7fd56bd75d776c348cad668b3e67b38c3464e604ace9","observation_id":"95d44531-62ea-4377-aeca-b61ec03cc3eb","resolution":{"observed_at":"2026-08-15T19:54:24.214631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.199080Z","title":"http://qdrant.tech","venue":null,"work_id":"0bf7bde2-5532-464b-a3ad-3576e0d96645","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.238265Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:8212c126156413d638842b23921719228f853083c5893b2acebf5d88b0baac01","observation_id":"ff469997-10dd-486b-ace3-a5a9580d52e2","resolution":{"observed_at":"2026-08-15T19:54:24.203223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.187374Z","title":"https://www.tigergraph.com/","venue":null,"work_id":"8931110d-ae48-4abd-9e62-6ab68fc38baa","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.241613Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:cf9718c0881f481a0dcb90f770ff277978e34397d8afa2a72cc5acf03318380e","observation_id":"df8206ea-a1a5-45b4-8b28-e811309150eb","resolution":{"observed_at":"2026-08-15T19:54:24.191048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.175807Z","title":"http://vald.vdaas.org","venue":null,"work_id":"a3e4cb58-d1fa-4d9d-bbfc-d3ebbd39f4c9","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.245009Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:afa57b0902fab071e983992367f401365ee487265e091c07b0a9858bd56a406e","observation_id":"f2b23df7-efd7-4a30-9ce2-14d42b6d3f2f","resolution":{"observed_at":"2026-08-15T19:54:24.179552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.164770Z","title":"https://vespa.ai/","venue":null,"work_id":"ee23a955-242a-42fd-bb12-a9e3da2e963d","year":2025},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.248307Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:35c319de6b0b1729304fc5703c84c4b83c639ec7b65d65673896afe9d402ab97","observation_id":"abdf3a16-5f15-4d99-b8a8-4eadc8d35ded","resolution":{"observed_at":"2026-08-15T19:54:24.168768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.152798Z","title":"https://janusgraph.org/, 2017","venue":null,"work_id":"9a8d3451-f67f-4650-8235-78071f24203b","year":2017},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.251556Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:cae1810e38dc75bbba4c06364d7a4cd1f974b5b70fe50b636a1ede6517911f38","observation_id":"b377991c-4552-4466-9d39-4e7bfba5fd2f","resolution":{"observed_at":"2026-08-15T19:54:24.156562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.141870Z","title":"https://archive.ics.uci.edu/, 2024","venue":null,"work_id":"061a16f4-1432-442a-88ae-c2b0fde6b7d0","year":2024},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.254838Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:b02c69e31e6505a485a17d6cda1c2fbf05f94f901a8ecc3dc4f687e8b7caaeb5","observation_id":"b6f147dd-43eb-4d97-97eb-6ff3b4b2bf8d","resolution":{"observed_at":"2026-08-15T19:54:24.145478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.130871Z","title":"https://www.youtube.com/, 2024","venue":null,"work_id":"3dbb4919-3cf1-4fbf-a525-2485d9267628","year":2024},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.258495Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:96ee1aef299009045200d6a7066c2c31daf7ea4cf5522c3cf54d1cddc61bbe3a","observation_id":"7f210e91-6e73-4a0d-89cd-0cdaacd0cc41","resolution":{"observed_at":"2026-08-15T19:54:24.134443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.119817Z","title":null,"venue":null,"work_id":"3fec82d4-7132-42e0-81d3-fa9c9e520c89","year":2014},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.261954Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:c980b3a56dd6a33dbd6ea0749eb34f68bcf39f9f5e07100f893d849a411b72ce","observation_id":"ab25bd28-9e67-4732-b9a8-4f4dd7ae4274","resolution":{"observed_at":"2026-08-15T19:54:24.123569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.108615Z","title":"Revisiting the inverted indices for billion-scale approximate nearest neighbors","venue":null,"work_id":"d0660d40-b9a1-48b0-8f87-7efd5c354101","year":2018},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.265524Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:a389bf2fdd2830e99685c8096a689e1a5983d3c1293904fb808a430b31b42cfc","observation_id":"0a990661-c990-4f78-a8ad-f5b4254a4439","resolution":{"observed_at":"2026-08-15T19:54:24.112597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.096881Z","title":"Multidimensional binary search trees used for associative searching.Communications ofthe ACM, 18(9):509–517, 1975","venue":null,"work_id":"ed6ea410-f131-4502-8b29-c0e8cfeda269","year":1975},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.269126Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:1e1a1a28112b2e530477da8ce78bddf0425bef175d98ef407281a0e4cf81e0c5","observation_id":"2d0c79ad-d1eb-4b10-b2e7-dcbf54966030","resolution":{"observed_at":"2026-08-15T19:54:24.100825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.084499Z","title":"Spann: Highly-efficient billion-scale approxi- mate nearest neighborhood search","venue":null,"work_id":"00701deb-aa01-4663-b915-3bc2430dce3a","year":2021},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.272657Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:e70a72a578fdb842b0b9d13b65a18f585ffdbb72dfc76c2c8599c619a4748c5b","observation_id":"2865607b-4068-45a9-9eae-d44cb7cece13","resolution":{"observed_at":"2026-08-15T19:54:24.088171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.072977Z","title":"Clarkson","venue":null,"work_id":"217b5663-de37-4f74-a86b-fe18ff19691a","year":1994},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.276366Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:8b19d06cccb937cc568a51d1d6f3e6a3180eb2fe3060a835a72ea2451d4329eb","observation_id":"be36a961-e577-4deb-bccc-5917712b8b1a","resolution":{"observed_at":"2026-08-15T19:54:24.076826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.060213Z","title":"Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J","venue":null,"work_id":"e7c8cdc3-b743-4d07-af4e-ee914835ad9e","year":2012},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.280026Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:90153f90f42e1071518bee5577defe831d17d63d6254c6d4316df8f537b71c8f","observation_id":"bbce4dcc-9797-43e2-a935-b9c2690fb9aa","resolution":{"observed_at":"2026-08-15T19:54:24.065088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.049363Z","title":"Mirrokni","venue":null,"work_id":"5306bd3e-5e02-444c-b745-93c27cf54aca","year":2004},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.283340Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:e4752c7ca78e9374f9eeb21bf6a80a16012a375d9649ca5add16a67b637cd654","observation_id":"7343ef6d-e23a-4922-a32f-86e2088ae3e1","resolution":{"observed_at":"2026-08-15T19:54:24.053075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.287085Z","title":"The tail at scale.Communications of the ACM, 56(2):74–80, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.287085Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:0ee5562b57def795ef23eacff52360aee73cebe8500e93b53ff98498fdba38d4","observation_id":"59f8e2c3-0157-4fb1-b027-e41d6957d335","resolution":{"observed_at":"2026-08-15T19:54:23.287085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.031554Z","title":"Mapreduce: Simplified data processing on large clusters","venue":null,"work_id":"4dc1eaa1-f6a3-4409-9f40-eb7652136c7c","year":2008},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.290489Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:21943883e920455c66f351948fb3ce77e96ca3e056e9c048fcf2ced68c5e41a1","observation_id":"ae6f9f99-7637-4e48-b63c-f1951bdb9351","resolution":{"observed_at":"2026-08-15T19:54:24.035353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.021125Z","title":"Delaunay","venue":null,"work_id":"66ed9edb-3c43-40a2-8f40-b644a69cf9c4","year":1934},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.293864Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:112deca1fa7f6f8773728d6504bc84a7e4175a3e5216b169bff76d6abd9d07ca","observation_id":"da1e4467-b6ce-4dfe-b5c5-5cf162e0485f","resolution":{"observed_at":"2026-08-15T19:54:24.024699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:24.009835Z","title":"Efficient k-nearest neighbor graph con- struction for generic similarity measures","venue":null,"work_id":"64ca7a49-20d1-4cb7-a02c-4137ac34c0ec","year":null},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.297405Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:2b8bd340d6683cd2cb876c0a1366414d2c748f2562d3b48ed40a2c9f5941ff2f","observation_id":"c3ecdf5c-20de-4376-a610-b07897084bde","resolution":{"observed_at":"2026-08-15T19:54:24.013801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.990680Z","title":"Faiss, 2020","venue":null,"work_id":"6cdbddec-90b8-454d-a9f4-a45b4e0112cf","year":2020},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.304457Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:39246c70e0c9ab068b93911dfc4db32d8a36284afd52bf9f1b5108da1d66ed35","observation_id":"22f738b1-37c0-464d-8bfd-4b7ac5341600","resolution":{"observed_at":"2026-08-15T19:54:23.995123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.979193Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph.Proc","venue":null,"work_id":"bdb743c1-678d-4b24-8921-601012df89dd","year":2019},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.307935Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:0d5db62a9f9e71c69627b9948dc7458875fe8839073923cf91bec54057768340","observation_id":"e1fc19f5-b154-4cb7-bccd-e1eed34c60ab","resolution":{"observed_at":"2026-08-15T19:54:23.983136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.968180Z","title":null,"venue":null,"work_id":"9cfccfd6-be9b-4aa5-827c-57ea3cf49b6d","year":1969},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.311123Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:6faf7d06f9d0a80bd3a7af0483639ec199b95f5872c3ef3bf0636e99b86d4658","observation_id":"e0501577-6c05-4820-a7b1-8dc42efb210d","resolution":{"observed_at":"2026-08-15T19:54:23.972070Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.956843Z","title":"High-dimensional approximate nearest neighbor search: with reliable and efficient distance comparison operations.Proc","venue":null,"work_id":"ec3e08b1-33cb-4880-b0c9-05d5847e8133","year":2023},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.314997Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:a947df9c9b3ef9c759f5ff52e0492e928661f4f4d1c646edf95fbcfa85ed52bc","observation_id":"1fe06e9a-3d43-4108-b36a-52e741e4ce40","resolution":{"observed_at":"2026-08-15T19:54:23.961086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.943811Z","title":"Rabitq: Quantizing high-dimensional vectors with a theoretical error bound for approximate nearest neighbor search.Proc","venue":null,"work_id":"791251dd-baa7-4b67-88e5-c4d7a7ebb459","year":2024},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.318469Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:27c3dc58c82fc4015a8d1677e30b01290340f909941db439c97f7c453539e61e","observation_id":"0a2c4d13-9597-47d1-91a4-e05387bf1d6a","resolution":{"observed_at":"2026-08-15T19:54:23.948566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.930549Z","title":"Gray and Deborah A","venue":null,"work_id":"32e12774-d27c-43a0-9c6d-c6b4b7655e8f","year":2000},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.321816Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:d302ca3409f4f63d57a9de25db0d98d4f81b7cf1788526e8908781188b3ac0e2","observation_id":"814226b3-3908-4af2-8396-7d9d7210e481","resolution":{"observed_at":"2026-08-15T19:54:23.934543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.13843","last_updated":"2022-06-28T09:20:40Z","snapshot_observed_at":"2026-08-17T05:16:29.080788Z","submitted_at":"2022-06-28T09:20:40Z","title":"Manu: A Cloud Native Vector Database Management System","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.13843","snapshot_observed_at":"2026-08-15T19:54:23.325392Z","title":"Manu: a cloud native vector database management system.arXiv preprint arXiv:2206.13843, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.325392Z"},"links":{"cited_paper":"/paper/2206.13843","citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:d79ecd1567377f385834266ffdb70c460e241e25616cb16229cd991c43099a8c","observation_id":"669a12a2-5c1d-445b-a1a3-b047053d8041","resolution":{"observed_at":"2026-08-15T19:54:23.325392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.918791Z","title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","venue":null,"work_id":"9642a6c3-5164-48df-b66b-ba0acff5813f","year":2011},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.329411Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:536f4ad9d7a3aa453622ba5e6c563dd3faf93aa0c0f39d6de4702c00fbdc5b72","observation_id":"a49dabae-85f8-4af3-be17-21bb52d4d96a","resolution":{"observed_at":"2026-08-15T19:54:23.922734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.906347Z","title":null,"venue":null,"work_id":"8a11f9af-ed39-4e36-8636-a5b835bc6377","year":2008},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.332895Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:ed0b7d31f03ecc34e4cd3434e37ea1737222e9a88cb28d13df05227654e245d7","observation_id":"84a62047-18e7-4890-ba39-cbf4bd5e17db","resolution":{"observed_at":"2026-08-15T19:54:23.910818Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.892906Z","title":"Speeding up distributed request-response workflows","venue":null,"work_id":"10ae4106-465d-4f61-9624-f31d0e30f5ca","year":2013},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.336498Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:61fe5c9a87fe7806c78f088654527f7869bb5150e51e7d3b862b4a86f71aca04","observation_id":"f77ed856-bb75-436a-ba8f-d31f5c7a829d","resolution":{"observed_at":"2026-08-15T19:54:23.897617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.878896Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"b5de0760-c975-40fd-a723-e447fe98c183","year":2019},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.339798Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:94abfe2071c562959f27bd2592caeab077f499bce614f2b4deff31e3b6e209d6","observation_id":"876d58b3-fa8d-4417-aa07-6fe86c354958","resolution":{"observed_at":"2026-08-15T19:54:23.884155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.343733Z","title":"Product quantization for nearest neighbor search.IEEE transactions on pattern analysis and machine intelligence, 33(1):117–128, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.343733Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:1f923810dce95f5692217baccc908748e754f28fc80083d2c5160850b9ed3328","observation_id":"ad27cf31-eef2-4b2a-8965-292e31700d69","resolution":{"observed_at":"2026-08-15T19:54:23.343733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.858753Z","title":"Searching in one billion vectors: rerank with source coding","venue":null,"work_id":"cde89e1b-bbf2-4e67-a313-6292e2d2d98b","year":2011},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.347308Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:0cbb92365cf27625c8ac66a6231853a1bc00daa245053a1fa38fa5c005cd60d5","observation_id":"5299af56-df4b-4aff-a6c3-5a427f99afe8","resolution":{"observed_at":"2026-08-15T19:54:23.863330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.848036Z","title":"Locally optimized product quantization for approximate nearest neighbor search","venue":null,"work_id":"03073781-43d1-433d-a7ea-8841321aefbc","year":2014},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.350834Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:2c302f0bd55c1847fb27c6648748bd08fa8e5087d02ce37972a81653b35f29af","observation_id":"bc09efd5-09b4-429f-b5f4-2e0e7aa97c2b","resolution":{"observed_at":"2026-08-15T19:54:23.851673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.837081Z","title":"Efficient retrieval of rec- ommendations in a matrix factorization framework","venue":null,"work_id":"b8527962-0f37-4010-8c79-3bcce9e18aec","year":2012},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.354107Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:6c0dc7dcc315c0019601157f387bf2e580a885dbfabe5f282794665188ed2423","observation_id":"eadffaee-5565-4f87-a176-bc7cefd53de0","resolution":{"observed_at":"2026-08-15T19:54:23.840899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.826495Z","title":"Kernelized locality-sensitive hashing for scal- able image search","venue":null,"work_id":"65219d29-b1d1-4c81-8a23-cdc357caf7b7","year":2009},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.357872Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:9fcf5d48f8231d343e700b6868141716ef96fe00c35fa4349dfede1538fcf27f","observation_id":"2fd87cc0-f9b5-409d-a815-469a4cc7c120","resolution":{"observed_at":"2026-08-15T19:54:23.830060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.815877Z","title":"Fexipro: fast and exact inner product retrieval in recommender systems","venue":null,"work_id":"644eb1b8-2419-4705-8b92-e14a33361652","year":2017},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.361314Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:8d3a6e325ef4a5384ad59889ca9e00a96f2140fba5fa4fac2834be79c6b2bd3d","observation_id":"f08cda9c-1a20-42ad-bac4-c3af54b01fff","resolution":{"observed_at":"2026-08-15T19:54:23.819650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.805029Z","title":"The design and implementation ofa real time visual search system on jd e-commerce platform","venue":null,"work_id":"e9e6b60d-74dc-4822-bb21-4620cdc347b1","year":2018},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.365078Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:318dc6e7a06ce59fee8e67d5935cf88f35c4de73f07745c954ad90ee6d040eaa","observation_id":"495359be-ce37-474a-9bc1-02dbe5b84de7","resolution":{"observed_at":"2026-08-15T19:54:23.808944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.792063Z","title":"Embedding-based product retrieval in taobao search","venue":null,"work_id":"55732e6f-ff3b-4d7d-ae78-6675f95ecd34","year":2021},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.368785Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:b56a17d8b61b29370b435c4d9a8e4cd24cd6e5ae19f93b970257d46a899c0df3","observation_id":"91fa2bdc-2711-4763-aa2b-ccce9b43553a","resolution":{"observed_at":"2026-08-15T19:54:23.796175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.781231Z","title":"Lightrec: A memory and search-efficient recommender system","venue":null,"work_id":"1ef1871a-a3a4-4ba1-a38b-35996045cb26","year":2020},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.372611Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:34e43fb953620d35b0fc42856a45a965f1e7c11cd688b73dc51139b8b5cfdaf6","observation_id":"e6d72969-ee3e-494a-a79f-14b3dd85846c","resolution":{"observed_at":"2026-08-15T19:54:23.784867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.770537Z","title":"Moore, Alexander Gray, and Ke Yang","venue":null,"work_id":"e5ddad1a-a230-4927-86d4-1a9497179e67","year":2004},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.376286Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:3e21234cde63ace8c4093ba19f03a27817dc3dc4d8f8d04b0a894021b4eaa9f2","observation_id":"15361267-6dfa-411d-9775-d261f04735eb","resolution":{"observed_at":"2026-08-15T19:54:23.774105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.759147Z","title":"Towards software-defined fpga acceleration for big data analytics","venue":null,"work_id":"55390931-9646-42cf-b23a-579a020280ee","year":2024},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.379940Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:93bf7366579423b49bf0d04ecd04019d1f8d85ae08a4281bec720a9f1597a584","observation_id":"dca1b4d1-943c-41e9-bf69-8ae889b58b6e","resolution":{"observed_at":"2026-08-15T19:54:23.762951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.746577Z","title":"Malkov and D","venue":null,"work_id":"d7dbc146-0d40-4ca0-acd2-2102711235b1","year":2020},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.383306Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:821408c097cf83ebba202e88421a9dcc4aa679ba80bfecd59aec6a16aa002018","observation_id":"ce21c2fc-f53b-4bb4-bbf3-78cd5655e9c6","resolution":{"observed_at":"2026-08-15T19:54:23.751022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-15T19:54:23.387458Z","title":"Efficient estimation of word representations in vector space, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.387458Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:d92c8ea05a484b8a9b9a9177be40477d6810beb36c13ae689e9c239d5182b1a0","observation_id":"77fb20eb-01e7-4dbf-b43b-d8a93dcfe12f","resolution":{"observed_at":"2026-08-15T19:54:23.387458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.734587Z","title":null,"venue":null,"work_id":"3183f6ca-533d-446d-8f7c-dd3a4a663d34","year":2014},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.391439Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:a655ffddb37715d6744390cb5c6ef6bbc2fc1db521a110999a45d735947c94e5","observation_id":"c9cb794f-1a9b-4144-bd3a-119720e51829","resolution":{"observed_at":"2026-08-15T19:54:23.739516Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.723620Z","title":"Li, Ryan McElroy, Mike Paleczny, Daniel Peek, and Paul Saab","venue":null,"work_id":"0e8a0855-11fd-4bce-9288-a9b47490934e","year":2013},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.394878Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:5da35b3e4c3bce89a8d55d98b60f20b75a0e6200d697ce23957dcdc9a5e9719e","observation_id":"5e2b5a0e-0f6f-43ab-b9d3-9f6011b968c8","resolution":{"observed_at":"2026-08-15T19:54:23.727170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.713141Z","title":"iqan: Fast and accurate vector search with efficient intra-query parallelism on multi-core ar- chitectures","venue":null,"work_id":"0d3de212-5131-4541-a1b8-983b858f9cae","year":2023},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.398524Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:d2a74ec7441a2118e72c40f7f286034512ceee451e1a9ee9d653468d6b51cf39","observation_id":"f3e2df71-c2a7-4a8b-a6ca-c3794f0ce143","resolution":{"observed_at":"2026-08-15T19:54:23.717141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.701842Z","title":"Glove: Global vectors for word representation.EMNLP, 14:1532–1543, 2014","venue":null,"work_id":"414c390b-29fe-4893-bd21-ba9621467780","year":2014},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.402428Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:004ed61127b5237631a258348186055dcfe7aad87b706d21bfc02748ef98afbb","observation_id":"155af244-053f-45f9-90de-7ffd896c780f","resolution":{"observed_at":"2026-08-15T19:54:23.705984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.690982Z","title":null,"venue":null,"work_id":"e4ed456d-1b0c-4e90-a068-a9b7b34f613a","year":2020},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.405882Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:10cfd3b696abf3ab28e06888fe629aa245cf7d40311e6a576114bdd0ec2cf337","observation_id":"a830f588-6c51-49e0-912f-83c0996cf7c9","resolution":{"observed_at":"2026-08-15T19:54:23.694841Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.679061Z","title":"F1: A distributed sql database that scales","venue":null,"work_id":"bd9af762-1909-4b0b-b49e-75dcfbb88043","year":2013},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.409366Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:1caf1c5b5bd7de9d3c0ce73043f6ece250e4413850cd1f63d624553b5c38dccb","observation_id":"d9f620c4-7eaa-40e2-8d92-1b6a31444b4b","resolution":{"observed_at":"2026-08-15T19:54:23.683125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.665477Z","title":"Toussaint","venue":null,"work_id":"9809891e-8656-4bc3-a5cb-523286e78d09","year":1980},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.412953Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:2f5fffdb91211a2fd6184373ce322637b31776e459ac5ad29d9a7a4b43270c2a","observation_id":"76f6ae1c-a896-407c-af8b-f5743d3c13fd","resolution":{"observed_at":"2026-08-15T19:54:23.669838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.655060Z","title":"Milvus: A purpose-built vector data management system","venue":null,"work_id":"cc572342-f7eb-49a2-b8d7-60fd11656d65","year":2021},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.416566Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:f7c0ce07760db31e449a6b92fe569f8f72a1d3abf179508fe92c0f397a96d1cc","observation_id":"30c91aad-2ca2-4564-ab69-222d386a78ca","resolution":{"observed_at":"2026-08-15T19:54:23.658730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.644034Z","title":"Scalable k-nn graph construction for visual descriptors","venue":null,"work_id":"c8468120-5d6b-47c0-a035-ca6d526cf812","year":2012},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.420931Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:1c8fe547e125cdeeb6b0a27afa9ba890665be81575bd0a82505c15e6a093488d","observation_id":"e8bf553e-5f99-4e0b-8310-9dc6b111ee4f","resolution":{"observed_at":"2026-08-15T19:54:23.647807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.632232Z","title":"Trinary-projection trees for approximate nearest neigh- bor search.IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(2):388–403, 2014","venue":null,"work_id":"98164c7e-6b1b-4ecb-95e1-6122d61b6f04","year":2014},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.424628Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:13705046277a744c1d823fa26182cc6716adc643e80690aeec4121bed235fef8","observation_id":"a56e9593-e873-4641-8fbf-1cf2e30541b8","resolution":{"observed_at":"2026-08-15T19:54:23.636712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.621055Z","title":"A survey on learning to hash.IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(4):769–790, 2018","venue":null,"work_id":"afd4a739-3e3e-409d-b313-288e9fed6719","year":2018},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.428342Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:784bd2f7042963dcc1e072108eba23d4a19c8a8bcb4ac32eba1f90c03c304b65","observation_id":"d56f1e73-c99a-41db-8a9b-6c5628d6d0e2","resolution":{"observed_at":"2026-08-15T19:54:23.624864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.609883Z","title":"Spectral hashing","venue":null,"work_id":"f8ecff0e-6d1f-4cd0-a997-cd08fec3697b","year":2009},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.432367Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:a604105b00c848f810c0dddd72cfb7993aa9ebce09be190bba3d7f6a09c34754","observation_id":"2bada614-6b46-4d43-a1c9-77dc8a9d2baf","resolution":{"observed_at":"2026-08-15T19:54:23.613638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.598213Z","title":"O’Reilly Media, Inc., 3rd edition, 2012","venue":null,"work_id":"26fb6621-5577-47f6-b7e1-be9e9a80d8ff","year":2012},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.435882Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:e46616a33be98f5a0a570a4929d35eaad4d72ac1ef550521b5dbe1b8a803ef1d","observation_id":"f61daf27-d1ba-41c4-8178-4af0e41d8c33","resolution":{"observed_at":"2026-08-15T19:54:23.601938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.583526Z","title":"Progressively optimized bi-granular document representation for scalable embedding based retrieval","venue":null,"work_id":"d20d5db7-a841-4bfa-8fd8-dcd0985c924d","year":2022},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.439322Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:4d5cbfc04a5ec9e121cd365b709c4f81b0e1f37c591e92533a366fd048bc0d4a","observation_id":"096b65bf-390e-44d8-8852-af416ace2960","resolution":{"observed_at":"2026-08-15T19:54:23.587607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.572277Z","title":"Spfresh: In- cremental in-place update for billion-scale vector search","venue":null,"work_id":"de63548a-5995-44be-b005-188087cdfd61","year":2023},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.442807Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:ddbe83fd8e0ed316771353fab2e443b5c29129d9538654db22679ac3e377d9d7","observation_id":"df82e66b-e50d-4122-b274-b70692b2a9d7","resolution":{"observed_at":"2026-08-15T19:54:23.576311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.560803Z","title":"Spark: Cluster computing with working sets","venue":null,"work_id":"7c70042a-56c2-4e51-a936-9362a2deefd5","year":2010},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.446313Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:15dec8ba567c4831b566877ad075387c4d828d6dc9e651d20fc9bf292d0a2a73","observation_id":"cd74d1a1-2de2-46fe-b13d-fa1e182c9ecc","resolution":{"observed_at":"2026-08-15T19:54:23.564814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.549098Z","title":"Df-gas: a distributed fpga-as-a-service architecture towards billion-scale graph-based approximate nearest neighbor search","venue":null,"work_id":"b2c6d39e-7db3-4d67-9781-10a89bca3373","year":2023},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.450191Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:200abaa1536a11a21f8d498ff3dcafed4f9c2a97e8f02d214e4281e42d40f2b9","observation_id":"5f7f1b1f-0d9f-4e60-992c-452d5175154b","resolution":{"observed_at":"2026-08-15T19:54:23.553207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.537538Z","title":"VBASE: unifying online vector similarity search and relational queries via relaxed monotonicity","venue":null,"work_id":"5cdbedba-7dbd-46a0-b181-f59a5893fbed","year":2023},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.453889Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:1c71067d5d393fdbd04004e578d12c79ffcf356bbeddd2f7dabe5c892735eb0c","observation_id":"b8cf8871-5800-46e9-b369-e7a4de01c57e","resolution":{"observed_at":"2026-08-15T19:54:23.541375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.525168Z","title":"Composite quantization for approxi- mate nearest neighbor search","venue":null,"work_id":"9eb001c9-0c32-45f9-b8b6-88213a2155d8","year":2014},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.457515Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:9b8ea73a6a1fc58eef5ef95ab847734ce55ea5481e408638aa02e32a03fdf337","observation_id":"d24ca7ed-6c47-4149-af01-2f9aeb29576a","resolution":{"observed_at":"2026-08-15T19:54:23.529666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.511318Z","title":"Fast, approximate vector queries on very large unstructured datasets","venue":null,"work_id":"34103092-13a2-4f08-a903-b19f84a1501c","year":2023},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.461314Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:668f92f7c4582715dea81e1b7d978a19884bc33a1a7dd03f2ce475b06d91a064","observation_id":"e840a9b2-5b38-4b52-90cc-e88360f39b7d","resolution":{"observed_at":"2026-08-15T19:54:23.516775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:54:23.300999Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T19:54:23.300999Z"},"links":{"citing_paper":"/paper/2506.14707"},"observation_digest":"sha256:ea5f24548bb3aa4b2e2253a1da71b056154ce3c6a344b9766f76dca144501759","observation_id":"713693a5-2ea0-4acf-9096-f31fc1611754","resolution":{"observed_at":"2026-08-15T19:54:23.300999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.14707","last_updated":"2025-06-17T16:45:42Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-20T02:37:56.602924Z","submitted_at":"2025-06-17T16:45:42Z","title":"HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":59},"total_outbound_references":69},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 1 inbound Pith citation observation for arXiv:2506.14707."}