{"as_of":"2026-08-08T20:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:90a7fc60e44e275a1a81b2a12f7414ff1ec15824cffe2261373d411aee6e7355","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T04:16:16.986636Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.13728/citation-record","integrity":"/paper/2607.13728/integrity","json":"/paper/2607.13728/citation-record.json","paper":"/paper/2607.13728"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:16:16.986636Z","title":"The coefficient ϵ, which represents the level of approximation in the auction (see Bertsekas (Bertsekas, 1988)), is set to1× 10−2","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.986636Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:4684db67759af91b867c92aeed41f4e32b9c1890c4691b1c731e351d04bedc25","observation_id":"8d4bf9c2-ab2e-43f2-a302-eeb6ead49e8a","resolution":{"observed_at":"2026-08-02T04:16:16.986636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08091","last_updated":"2022-10-19T07:15:47Z","snapshot_observed_at":"2026-07-06T13:21:35.473469Z","submitted_at":"2022-06-16T11:17:03Z","title":"Unsupervised Space Partitioning for Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.08091","snapshot_observed_at":"2026-08-02T04:16:15.914483Z","title":"Unsupervised space partitioning for nearest neighbor search, 2022.https://arxiv.org/abs/2206.08091","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.914483Z"},"links":{"cited_paper":"/paper/2206.08091","citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:3eb13a733fe7f4ca667ca95d95c8c21b7a5686bcaa4c0156e769af78e9793917","observation_id":"dd109f6f-a838-41d4-ae8d-99247b7bf0c9","resolution":{"observed_at":"2026-08-02T04:16:15.914483Z","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-02T04:16:16.766818Z","title":"To choose parameter K (see Gupta et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.766818Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:9034139a8958a2e12ded3d425fa86f72ced14dba6b7e279cf64e1fc7750e9d6c","observation_id":"12a7f87b-6b47-4a57-867b-46226321200c","resolution":{"observed_at":"2026-08-02T04:16:16.766818Z","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-02T04:16:16.306374Z","title":"Stanislav Morozov and Artem Babenko","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.306374Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:996589540d8d326adf852cb2220ab9686355cc500366b52dc40182671159717d","observation_id":"229b5168-9382-4e7d-b678-050b88857e97","resolution":{"observed_at":"2026-08-02T04:16:16.306374Z","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-02T04:16:16.718043Z","title":"•BLISS: We use the architecture described in Gupta et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":200,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.718043Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:0dda510198a6a9daf643cf818f6670110d87bf553744845f64c2b455285f4796","observation_id":"35ba16d8-1685-4cb2-b528-1d9525f746e2","resolution":{"observed_at":"2026-08-02T04:16:16.718043Z","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-02T04:16:16.612006Z","title":"eco\" configuration because the","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":512,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.612006Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:c2e74102e6f6fea71d916ab525e24a9e0bd5d1f08e00876f9c5e97f245f56a85","observation_id":"da84a828-4659-4029-9289-732b6dbf15fc","resolution":{"observed_at":"2026-08-02T04:16:16.612006Z","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.1007/bf02186476","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dimitri P","venue":"Annals of Operations Research","work_id":"ce593ef4-f86f-4f8b-96dd-bcd8529996cb","year":null},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":1988,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.368821Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:2f94a7633405511639d06200a61efe924fbb31a8e8cb60a6dbb917c255104f20","observation_id":"81a8e0b3-05b0-4308-a7c4-8ffa8bf311ad","resolution":{"observed_at":"2026-08-02T04:18:47.005859Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02021667","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Meng Chen, Kai Zhang, Zhenying He, Yinan Jing, and X","venue":"Zeitschrift für Ernährungswissenschaft","work_id":"aa3bb6ac-aa17-4cfb-99d7-5c9ba74ebf20","year":null},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.524831Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:f37730c3612d9a5fdf51b5a81da9364b1db5ed647979928a197c939bd0289077","observation_id":"69176fc6-36c8-406f-a9c4-9362f8fbc5ff","resolution":{"observed_at":"2026-08-02T04:18:46.877463Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01759061.https://doi.org/10.1007/bf01759061","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:18:46.408924Z","title":"Romain Tavenard, Hervé Jégou, and Laurent Amsaleg","venue":null,"work_id":"92bcb54d-6bb8-43a3-b097-fe4be1060c32","year":null},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.437360Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:ef37e445d08c76b3202e5231faf885bb16820bf2fcf6a9d6a8da9b58fe9c2905","observation_id":"b9f64a16-0e0c-4674-bb69-52b927ca83bc","resolution":{"observed_at":"2026-08-02T04:18:46.508023Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-02T04:16:15.227006Z","title":"ISBN 1595930469","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.227006Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:eb38979daf68fede2192af3d25fbbde195d54589b97327b158d0be229c06166f","observation_id":"12fd23a8-3ef3-455c-b47c-62db8b387386","resolution":{"observed_at":"2026-08-02T04:16:15.227006Z","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-02T04:16:16.487097Z","title":"17 • Neural LSH: We use the architecture described in Dong et al","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.487097Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:94a1d7eb6b4240e4a501f46cd5a3a11bd89bdef9d55e6b7567d5aa1ed23161a2","observation_id":"5b270680-defb-43cb-8c9d-6c1210f5631c","resolution":{"observed_at":"2026-08-02T04:16:16.487097Z","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-02T04:16:15.063089Z","title":"Artem Babenko and Victor Lempitsky","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.063089Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:0adf595b7ec30bb643d91867fb4c3e6902a78fd5dfbc32a9e654f44de1bb5dd8","observation_id":"4373de17-c94a-4a0f-8d41-bd0d6a1fdfb5","resolution":{"observed_at":"2026-08-02T04:16:15.063089Z","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.1007/978-3-662-44415-3_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi: 10.1007/978-3-662-44415-3_4","venue":"Lecture notes in computer science","work_id":"bd4b3c1c-6976-4e6a-9b8b-4fa91e05f363","year":null},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.009499Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:78c1a2ee1fb83024b37f1c2903999062f9de56e3582f64f91d3fd2128e08609c","observation_id":"086fff93-7a48-4077-82af-8f7e2e51f675","resolution":{"observed_at":"2026-08-02T04:18:46.728828Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.08544","last_updated":"2020-09-29T02:50:54Z","snapshot_observed_at":"2026-08-02T03:18:12.303328Z","submitted_at":"2019-01-24T18:07:59Z","title":"Learning Space Partitions for Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.08544","snapshot_observed_at":"2026-08-02T04:16:15.829762Z","title":"Learning space partitions for nearest neighbor search, 2020.https://arxiv.org/abs/1901.08544","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.829762Z"},"links":{"cited_paper":"/paper/1901.08544","citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:68963fa1a61cd4c047cbfe70bd325208c08bc7ef2d4cda211ae3a5ba56242e74","observation_id":"de837c3a-76b5-4248-954a-38b9ac3e49bb","resolution":{"observed_at":"2026-08-02T04:16:15.829762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08246","last_updated":"2025-06-03T10:07:35Z","snapshot_observed_at":"2026-08-08T05:49:05.821041Z","submitted_at":"2025-02-12T09:39:54Z","title":"Inference-time sparse attention with asymmetric indexing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08246","snapshot_observed_at":"2026-08-02T04:16:16.178633Z","title":"Inference-time sparse attention with asymmetric indexing, 2025.https://arxiv.org/abs/2502.08246","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.178633Z"},"links":{"cited_paper":"/paper/2502.08246","citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:50fbfe77a05932ba6f5cbdbce195168f3816055bf85e46216b44ccec0ba8b253","observation_id":"c0e25e1c-d8e2-4586-bc1b-de89745c62a9","resolution":{"observed_at":"2026-08-02T04:16:16.178633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1210.0477","last_updated":"2012-10-01T17:30:47Z","snapshot_observed_at":"2026-08-04T11:53:06.673206Z","submitted_at":"2012-10-01T17:30:47Z","title":"Think Locally, Act Globally: Perfectly Balanced Graph Partitioning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1210.0477","snapshot_observed_at":"2026-08-02T04:16:16.367040Z","title":"Think locally, act globally: Perfectly balanced graph partitioning.CoRR, abs/1210.0477, 2012.http://arxiv.org/abs/1210.0477","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:16.367040Z"},"links":{"cited_paper":"/paper/1210.0477","citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:fb6cfe04719ae5bd864dea1b0d98bd63429a33dcfbbf2480cf3bdea2b64aa13a","observation_id":"5485422f-37c1-44e2-a39e-6b8e6834f03f","resolution":{"observed_at":"2026-08-02T04:16:16.367040Z","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-02T04:16:15.672402Z","title":"doi: 10.14778/3681954.3681959.http://dx.doi.org/10.14778/3681954.3681959","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.672402Z"},"links":{"citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:4a1135d7aad9f00324dc9bb19c2a9db87a0a12cf022360e7e45d5cbdfbee140f","observation_id":"4abafb49-fe50-4a55-946a-0a9f70a63c1f","resolution":{"observed_at":"2026-08-02T04:16:15.672402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":17},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.13728."}