{"as_of":"2026-08-10T17:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2f662408830f257f3e2f692c40de7700be38b3138c09f8a5eecb8a25808f22a","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T04:31:25.183144Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.27623/citation-record","integrity":"/paper/2607.27623/integrity","json":"/paper/2607.27623/citation-record.json","paper":"/paper/2607.27623"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:19.245896Z","title":"2011.KGraph: A Library for Approximate Nearest Neighbor Search","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.245896Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:59e077e2f1f07ca9adb50e1512b6f36088e4d6ab2a43ada5bae36c12a78133dd","observation_id":"15e64d18-5844-4d15-a439-219c1373f3d7","resolution":{"observed_at":"2026-08-01T04:31:19.245896Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:19.343412Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.343412Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:5ecffb13397c7ea5e1dc418b996b9b58ad4eb0f8aeb64a0249a0dde35bbc9175","observation_id":"76375b3e-b5f5-46a8-b049-5bc8c93f26bf","resolution":{"observed_at":"2026-08-01T04:31:19.343412Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:19.417892Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.417892Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:117f4de25ebefc52d4601b7ead94a26cf3f63d6ef2ed25ecd7d263503f3837a3","observation_id":"4e6519fb-0ddf-4f38-a25f-46c8e26af307","resolution":{"observed_at":"2026-08-01T04:31:19.417892Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:19.498454Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.498454Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:bdba36ce8a8452b38791c714eb846bc50231263d2a6a8ec99a8b8c3f43c4e86c","observation_id":"05d20860-98c2-4f42-ac73-329ecb37b0f0","resolution":{"observed_at":"2026-08-01T04:31:19.498454Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:19.630078Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.630078Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:8e86f68142847ade82d4e06324566cef6ff71722c5966fad8dcfe0f1955686b9","observation_id":"c7887ac3-8961-4173-b728-c1f6a2a95398","resolution":{"observed_at":"2026-08-01T04:31:19.630078Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:19.717255Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.717255Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:65d4c3f76b48b1b90f404ed06761474c26d9a26e91b84114ecc29051a4075ce3","observation_id":"b1869f03-e469-4d13-971d-8c65bbec8cf6","resolution":{"observed_at":"2026-08-01T04:31:19.717255Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:19.831696Z","title":"2016.NNS Benchmark: Evaluating Approximate Nearest Neighbor Search Algorithms in High Dimensional Euclidean Space","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.831696Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:9706c99ad72e53b3ef110565c70587af783fc63589687d11130d948f521cb58d","observation_id":"1083d9b8-140d-4ef5-b16c-abb49be978ff","resolution":{"observed_at":"2026-08-01T04:31:19.831696Z","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":"10.1524/zkri.1933.84.1.109","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Delaunay","venue":"Zeitschrift für Kristallographie - Crystalline Materials","work_id":"55b40d5c-3ce5-4be3-b364-02db706a8143","year":1933},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:19.966459Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:3d58102a652406a01cfc9008cd03e408c27734e9f9d292c6fb54bf6b2f82f38a","observation_id":"164f6d0a-84cc-4d49-9e11-2acc1a18f6a1","resolution":{"observed_at":"2026-08-01T04:33:18.514742Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T04:31:20.077991Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.077991Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:e972f40b85132d360ab4dfdb03421bc30e828b815c5d2e71ffeccde7ccdb49d0","observation_id":"4a5713b5-ec90-4133-a382-79527e422019","resolution":{"observed_at":"2026-08-01T04:31:20.077991Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:20.166227Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.166227Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:91e53895d0d82e6ee6cc690a78cd6fa1e008a662f867916544f578f59018361f","observation_id":"e3b43728-6b18-4cff-b394-b2e7ea5df648","resolution":{"observed_at":"2026-08-01T04:31:20.166227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.06992","last_updated":"2018-03-19T15:31:41Z","snapshot_observed_at":"2026-07-06T06:29:04.031745Z","submitted_at":"2018-03-19T15:31:41Z","title":"Estimating the intrinsic dimension of datasets by a minimal neighborhood information","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.06992","snapshot_observed_at":"2026-08-01T04:31:20.202245Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.202245Z"},"links":{"cited_paper":"/paper/1803.06992","citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:cbcfd9a472f2e724652f8ea8e9f9272664dd22f90acad4c6f73d6fa797bfe4ac","observation_id":"2cc8c04a-8028-4ff9-94f5-0d8f1e1e8c98","resolution":{"observed_at":"2026-08-01T04:31:20.202245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-01T04:31:20.302127Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.302127Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:1146f420f3b757c37d9d367c91ce9475f01909e1ce1d078c167f0a90d414d94c","observation_id":"d8fbcbc5-37d9-44ad-ad98-21076f860d41","resolution":{"observed_at":"2026-08-01T04:31:20.302127Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:20.372164Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.372164Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:15b44d1c6d9bb56ffd7d3605419cd214a4237066a59cbcf196b7a186c128a7d6","observation_id":"946a0a13-f005-4e29-a724-844d851a8237","resolution":{"observed_at":"2026-08-01T04:31:20.372164Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:20.469912Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.469912Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:fdf17174040f1917ac7c4f60b35a155a725f81811158ae2d07b253b91e8fb96b","observation_id":"3b755cb3-d42d-44e4-8ded-fb2e13f44979","resolution":{"observed_at":"2026-08-01T04:31:20.469912Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:20.571053Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.571053Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:4c7ee7724be8049e51c010ab38caefeee483c1bed5907296154ce8758c30db10","observation_id":"5b389fa4-077b-4354-a564-4503c618b8ea","resolution":{"observed_at":"2026-08-01T04:31:20.571053Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:20.678168Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.678168Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:5a60c689287f3a0840f9a706709d8dd2379fcd892be7c8731abf1a83468cd2df","observation_id":"c2620f05-c2d9-438d-9a06-307d3f7023ee","resolution":{"observed_at":"2026-08-01T04:31:20.678168Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:20.796989Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.796989Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:2e083b6ac9c44c252a0f414c0bbacaba1f89c880678d9d31681558bd0a8645f6","observation_id":"29059193-f77c-4c4d-8860-1a1cf6623426","resolution":{"observed_at":"2026-08-01T04:31:20.796989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.07355","last_updated":"2018-10-17T02:22:34Z","snapshot_observed_at":"2026-08-07T19:48:53.448770Z","submitted_at":"2018-10-17T02:22:34Z","title":"Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.07355","snapshot_observed_at":"2026-08-01T04:31:20.868896Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.868896Z"},"links":{"cited_paper":"/paper/1810.07355","citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:d73690bcc5846ef2a5e83420c09c88f0279190e92770f0be25c45fff0a514732","observation_id":"4d94dec0-c914-46dc-9492-27b3cc67f5cb","resolution":{"observed_at":"2026-08-01T04:31:20.868896Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:20.994650Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:20.994650Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:d22727aeb1012af1c8a86137293cbd9ee494bbad46bad12cc192c25f2dc64bb2","observation_id":"9e56a4b0-c579-44f5-8e2e-340ec1acb605","resolution":{"observed_at":"2026-08-01T04:31:20.994650Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:21.116925Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.116925Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:abc8d6b2355d5aa96fa7ee6113a12b5e84b19d0719209d0de6ffa9493fbd5364","observation_id":"ac88013f-7df9-42db-a3c9-b4f2b8f04117","resolution":{"observed_at":"2026-08-01T04:31:21.116925Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:21.250908Z","title":"Andersen, and Yuxiong He","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.250908Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:90645b147e9853a04671231db7cf82e4b2dbe13f23296eed726b3a2e55771791","observation_id":"eedc7d8f-9511-4bd1-b369-6380600cb8f7","resolution":{"observed_at":"2026-08-01T04:31:21.250908Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:21.357971Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.357971Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:589221711b2491942e6c9e3256c4916fe7740a47896ba23083f9c12cdd42ebb0","observation_id":"b5da3321-c77c-4cf5-924d-4f1fa52bbace","resolution":{"observed_at":"2026-08-01T04:31:21.357971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02077","last_updated":"2019-06-18T09:07:06Z","snapshot_observed_at":"2026-08-09T06:57:50.140452Z","submitted_at":"2019-04-03T16:12:55Z","title":"Graph based Nearest Neighbor Search: Promises and Failures","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.02077","snapshot_observed_at":"2026-08-01T04:31:21.474451Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.474451Z"},"links":{"cited_paper":"/paper/1904.02077","citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:8d4f26a80ac9e57aca790f283485e6c7bec6d079f31b1bd8cfdf010296e6fc61","observation_id":"14a14c4d-f60c-45f3-904c-2f9941cfb09e","resolution":{"observed_at":"2026-08-01T04:31:21.474451Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:21.577451Z","title":"2018.Hnswlib: fast approximate nearest neighbor search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.577451Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:777a98a5af255a3557c095508f8433542ca3fea71dde53c9cbbadaa190dae5e7","observation_id":"67846758-284b-44e9-994b-aa0b6631d4e4","resolution":{"observed_at":"2026-08-01T04:31:21.577451Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:21.658129Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.658129Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:8551d2baedd9343af451ac4e1b7590fab223dabc98b9c209732d01d4fe45eda2","observation_id":"f1b2f73d-2f13-4fb3-811d-d0042f29c873","resolution":{"observed_at":"2026-08-01T04:31:21.658129Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:21.874913Z","title":"Malkov and D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.874913Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:5ce2e342b307767eaab3d37f789dabe122ebbf2fd06990541915e49930315052","observation_id":"20d0ee02-faf5-44df-a64b-3745c506b722","resolution":{"observed_at":"2026-08-01T04:31:21.874913Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:22.089637Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:22.089637Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:c0bd800b2c1bfafc41df89e809a4c4c0035a613fc6ebcbccf35d928cace8b762","observation_id":"43d4d7b3-7b9c-4d0c-a008-d10cfbd4da39","resolution":{"observed_at":"2026-08-01T04:31:22.089637Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:22.287241Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:22.287241Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:578c847c1af98f3ac472111da2d0c882e98319fea28fa8bc6a6de8ea02bab141","observation_id":"ac40b45d-4cea-47ea-b991-67cb9c1e1f25","resolution":{"observed_at":"2026-08-01T04:31:22.287241Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:22.472522Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:22.472522Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:1865843fa8355b8e4175cb66a5d88afd6ce16344632898ae572776e84ca51fb1","observation_id":"8b8a2c69-c60b-468e-8e46-d382300d192a","resolution":{"observed_at":"2026-08-01T04:31:22.472522Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:22.677184Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:22.677184Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:40467479c314e095b49b865a7b3a0376e8b76776e2f60711744046970f7f53c4","observation_id":"315e6e4d-3591-44d4-8448-0d3193051fb1","resolution":{"observed_at":"2026-08-01T04:31:22.677184Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:22.818909Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:22.818909Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:a7119b19be719ae28a0460488a391a8adfa3899f02d8007b164eb1476bdbc17c","observation_id":"45d37ec7-5c3e-44e5-add7-112c6110703e","resolution":{"observed_at":"2026-08-01T04:31:22.818909Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:22.962558Z","title":"Vieira, and Daniel S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:22.962558Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:03ad9a18c46e82774e67af1e86e9ca43a9d654e8303b09afffc744242a4059c8","observation_id":"4234b497-1ca2-43c9-aa9c-a36c5776e57c","resolution":{"observed_at":"2026-08-01T04:31:22.962558Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:23.106471Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:23.106471Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:2ffb76407aab7824d1873af2268c3f46668d37a00f688495e86804c41fdf53a8","observation_id":"1ed28ea3-0859-4cd0-b689-0350aab9a8d1","resolution":{"observed_at":"2026-08-01T04:31:23.106471Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:23.241005Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:23.241005Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:fe7d8aab79f0cb09bd889692f27d30ae8d675c7650eef9387c0c183635d92191","observation_id":"7bd4cff3-1da7-4db8-94fb-ee272bd76f2b","resolution":{"observed_at":"2026-08-01T04:31:23.241005Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:23.376978Z","title":"Toussaint","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:23.376978Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:98597c2d5272033c04aa3114ca5d572f3823f1c6dde522318e910b32c839697d","observation_id":"3adc471d-4fb4-4572-b5fc-05c3f31b88de","resolution":{"observed_at":"2026-08-01T04:31:23.376978Z","resolver_source":null,"status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:23.552214Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:23.552214Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:770a6c8631ccfa86ba7ef5e143d54182ba573f467668a84d158c255efdb31419","observation_id":"7cf3d443-df4b-4bc1-ac9b-d2782ba67267","resolution":{"observed_at":"2026-08-01T04:31:23.552214Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:23.723872Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:23.723872Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:c4b74d50ac55e68daf0db01ebf414ee7153a8fcb60c9146a10b6a28fa65c7f1e","observation_id":"28685ec1-8633-4cd1-95bd-7ba3277f7439","resolution":{"observed_at":"2026-08-01T04:31:23.723872Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:23.864124Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:23.864124Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:c2bef285b008b9a39af973808d22140895cd71e05e7f4ec485898e6ec6a9f02d","observation_id":"72b2ae41-5440-4843-ab11-2a1a15d05191","resolution":{"observed_at":"2026-08-01T04:31:23.864124Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:24.164606Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:24.164606Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:89ae42328fda7239f743f3d1bd6e65b2396ed39bf3e0fea292935d25bf1b0f2f","observation_id":"90883b49-607e-4b68-81ee-1d0f38ba76a4","resolution":{"observed_at":"2026-08-01T04:31:24.164606Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:24.314281Z","title":"2016.Neighborhood Graph and Tree for Indexing High-dimensional Data","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:24.314281Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:631ee07472f9a833564ce8766f6359dfd1c330ae8136f841869b7b6c3e919bc7","observation_id":"41e7fd46-a359-420a-ad18-e229a0cf6dc5","resolution":{"observed_at":"2026-08-01T04:31:24.314281Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:24.469961Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:24.469961Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:c842fa78c62498d9f10cb15030568dd06b633b5b43d9f1e16d74a6b87820a668","observation_id":"fb167a15-c0aa-4265-812a-91857aa3510f","resolution":{"observed_at":"2026-08-01T04:31:24.469961Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:24.676826Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:24.676826Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:d8ca6c65d69940ddb1d41383f24d455c13116cc6d3c9ed1b18362a708e22871f","observation_id":"3aa348a3-c9aa-4c9a-95ad-593f74576b50","resolution":{"observed_at":"2026-08-01T04:31:24.676826Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:24.858873Z","title":"2017.efanna: An extremely fast approximate nearest neighbor graph construction algorithm framework","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:24.858873Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:57005809c33454aa693dd282a26f26e95890cf85f7921e9389b77b913476cfcc","observation_id":"af3811c4-2777-4fba-af59-670273fcf53d","resolution":{"observed_at":"2026-08-01T04:31:24.858873Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:25.054111Z","title":"2018.NSG: Navigating Spread-out Graph For Approximate Nearest Neighbor Search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:25.054111Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:ff948ad956053c07798d78d38a7d5698cdffcf0a105369110b800e36b8a2ee12","observation_id":"b4c6d8fb-31b8-4cd4-8c06-22b82f0c2f5a","resolution":{"observed_at":"2026-08-01T04:31:25.054111Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:25.183144Z","title":"2019.SSG: Code for Satellite System graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:25.183144Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:b7a926610db2bc3fca6dbcc0fb258ee3e223d3a9c5f3fb23409fd610d99f66ac","observation_id":"a549666e-b487-4968-ab7c-51aa86bb758b","resolution":{"observed_at":"2026-08-01T04:31:25.183144Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:24.044525Z","title":"InSIGMETRICS, Leana Golubchik, Mostafa H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:24.044525Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:05a459db15a3c3679f075c01b73496e09a5f827b4fbafb5317d9ce5045df9eac","observation_id":"eb2c4eaa-ffc6-4f35-8574-54cb6921faf5","resolution":{"observed_at":"2026-08-01T04:31:24.044525Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:31:21.782144Z","title":"Syst.45 (2014), 61–68","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.782144Z"},"links":{"citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:bcdb649d4b3919ddd2b153e8aae692a8ae6e49bd87448174ae9895151c70e32b","observation_id":"43344a3d-f4ae-4eee-b468-851094d203c9","resolution":{"observed_at":"2026-08-01T04:31:21.782144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":47},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2607.27623."}