{"as_of":"2026-08-17T08:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29a90502661d35751e7079df82fb07b2bbdbaeaa7674dbbb41feaa908d8992a1","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-17T06:30:58.91139+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-13T23:28:27.689732Z","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:ed79899bb0b27ca76f22120b57c310e55046577e37f74478e9ad711c9d9fce66","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-08-16T16:52:33.844268Z","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-13T23:28:27.689732Z","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:6b3992dbb932e1d6ca1c2a1da45f7762c31228eb918e227fd478183bcc353215","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-13T23:28:27.689732Z","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:2f161375f5b458d9723fa367577792085a104dd1408d0ecdc7b0f5e3ed9a7f86","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-13T23:28:27.689732Z","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:28b33314f5c5a892eb5a36bf73cef797ff54f682d12b3addfea2a20f6d1ee38d","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-13T23:28:27.689732Z","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:a60600fd7430328b91a0ffe097bc19bbec130f86d26195c87a08ac1581b12ada","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-13T23:28:27.689732Z","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:a5d95adebf7e7e5091c886ee2cf0317ac7ccfc730f6e05ad241e8fcf95b053b0","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-13T23:28:27.689732Z","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:c7432e628b2ed90d90ddff1ecff0e1b11a1c3d461699f1be4706e4cc601ecdc8","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-13T23:28:27.689732Z","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:83fb992d493867f31ce32b567f6d89c72579720dace20b7649fa6390e8d897fb","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-13T23:28:27.689732Z","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:dc20bdcf47b00aaee42c47ce1a3ca9596cb5ce47f7f8e5b45cf07a59c7995582","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-13T23:28:27.689732Z","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:e4b57b29db77b32b21f23d12af21c07244503ea6f5850e51a59db09bb98faf22","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-13T23:28:27.689732Z","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:526ca2d474056b1bf8f1590f4bb48455c0fa1e10112d80ff29752d3b2cb229a1","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-13T23:28:27.689732Z","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:7e732ff85275998a406d65e76c6c208907e11b23c8f08ea20385d2d670aa0ea9","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-13T23:28:27.689732Z","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:4560725ea1eb2e344814f1b8d9726d856c05dd0e1151bcf7b4c858fa3e684e43","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T17:26:19.667090Z","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-13T23:28:27.689732Z","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:7155407bc24955dab3f743b60abc56d575b12c9a89a2b76eeacde06e732bed40","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-13T07:44:10.367333Z","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-13T23:28:27.689732Z","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:aacd1e6a71f3caed10f5c2a13cb4e35982d8a5f727b9c8b0584977096f6a100c","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-15T00:44:44.618533Z","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-13T23:28:27.689732Z","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:61074b688e815360941eca6c1315a45706e5302ef9f5e18061fdaed274ee45e8","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-13T23:28:27.689732Z","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:dc7724aed132c6a43b0297c83b0d41ab1f1d175674b217023f0f073322ee72f2","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-13T23:28:27.689732Z","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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.13728."}