{"as_of":"2026-08-11T14:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c5a5e0d657e93c02438070f6bdfa2472dfde8b7adfcf73874711f8fdd6cce5f7","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:03:03.971313Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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.20393/citation-record","integrity":"/paper/2607.20393/integrity","json":"/paper/2607.20393/citation-record.json","paper":"/paper/2607.20393"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:03:01.700174Z","title":"Proceedings of the 43rd International","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:01.700174Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:63cf35db004aad902da81c1dd12ad4a5a43402e6d1f7ab635ec826d1b6745e97","observation_id":"7e4d4465-d0f5-4793-a7ff-549eaca2175c","resolution":{"observed_at":"2026-08-01T10:03:01.700174Z","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-01T10:03:01.868431Z","title":"Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies , pages =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:01.868431Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:d60bf1f859c8c9caf7c5362a0f46e2fb25b6ce298eff44b7184c3d089a19bd36","observation_id":"91388833-a0b9-4e28-94a1-03ac7448ec09","resolution":{"observed_at":"2026-08-01T10:03:01.868431Z","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-01T10:03:01.989991Z","title":"Proceedings of the 31st","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:01.989991Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:ff6a58e4a12fa36cadb7509fc0f7bc5578313022b1acf0968bf08b85788072e9","observation_id":"78278160-bc49-4e0f-bba4-8510685a8992","resolution":{"observed_at":"2026-08-01T10:03:01.989991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19504","last_updated":"2026-06-08T18:58:48Z","snapshot_observed_at":"2026-08-04T23:43:03.375891Z","submitted_at":"2024-05-29T20:40:20Z","title":"MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19504","snapshot_observed_at":"2026-08-01T10:03:02.129130Z","title":"arXiv preprint arXiv:2405.19504v2 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:02.129130Z"},"links":{"cited_paper":"/paper/2405.19504","citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:36ef2dd43dee27a54e822179e6483f1b403257725cabc529408332001375f9b3","observation_id":"58c55e75-26a4-44e5-8d78-59fbbac788bb","resolution":{"observed_at":"2026-08-01T10:03:02.129130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.23475","last_updated":"2026-06-22T15:22:05Z","snapshot_observed_at":"2026-08-06T19:33:42.775295Z","submitted_at":"2026-06-22T15:22:05Z","title":"Multi-Vector Embeddings are Provably More Expressive than Single Vector Embeddings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.23475","snapshot_observed_at":"2026-08-01T10:03:02.277559Z","title":"arXiv preprint arXiv:2606.23475 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:02.277559Z"},"links":{"cited_paper":"/paper/2606.23475","citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:1630a068921199a374855d2cf46bc575b9694fadb1ab58978717e53d5780a414","observation_id":"e21b64fe-e7d1-47ae-8471-4d983116b108","resolution":{"observed_at":"2026-08-01T10:03:02.277559Z","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-01T10:03:02.405378Z","title":"Sherstov , title =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:02.405378Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:2c63aa2ef31a92f8aa5bb6b6330a8a9366652ee3a92fb20c30f058aa12b0e512","observation_id":"825f8c3b-427a-4863-8e0b-e9224d0ec8de","resolution":{"observed_at":"2026-08-01T10:03:02.405378Z","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-01T10:03:02.601751Z","title":"Sherstov , title =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:02.601751Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:26ea9fe675718fa6b5e26b7d797ac3ecbb3bfb40bf1e78dc8b790d0daa7cb3eb","observation_id":"ac54be5d-4f53-41f8-80b6-2b29c83e4fe5","resolution":{"observed_at":"2026-08-01T10:03:02.601751Z","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-01T10:03:02.720790Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:02.720790Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:4d42a404ea4d52ce94bf1c2e29afce6c8a84c3efc8ea01c103dc5d3317dbdf07","observation_id":"d9528a5e-ce28-4165-aed2-efdc602e6376","resolution":{"observed_at":"2026-08-01T10:03:02.720790Z","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-01T10:03:02.862887Z","title":"The Fourteenth International Conference on Learning Representations , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:02.862887Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:ceddc47428c031874dd333be968859c3f60d325cd09595b6d0df94098204981e","observation_id":"62517dad-40d1-47cf-bd60-ca1644bda85f","resolution":{"observed_at":"2026-08-01T10:03:02.862887Z","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-01T10:03:02.975042Z","title":"arXiv preprint arXiv:2603.29519 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:02.975042Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:ef29dd3de19a78a4685a326bf188dd9d900a1cc4d326cc2943d5f4618e7c8fe5","observation_id":"b3a78a9e-b477-4c7a-a988-b436ab12bba6","resolution":{"observed_at":"2026-08-01T10:03:02.975042Z","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-01T10:03:03.080564Z","title":"arXiv preprint arXiv:2512.12458 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.080564Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:904d35559980afa4749cb4edc88afc74abb4d23af5db327f8360f6cfc41bc601","observation_id":"b43ba074-8c1a-4c1e-967b-47fb271903b6","resolution":{"observed_at":"2026-08-01T10:03:03.080564Z","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-01T10:03:03.178830Z","title":"Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies , pages =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.178830Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:57236cefb87a59d73ddcbb3e41523ad9d48996f8084910e6bc483805228c7884","observation_id":"8f154434-036b-4cfc-a60c-d31dde233f6c","resolution":{"observed_at":"2026-08-01T10:03:03.178830Z","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-01T10:03:03.298788Z","title":"Introducing Neural Bag of Whole-Words with","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.298788Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:1d826820e0e820d072d8b0a6adc4a64d5494cd6813e27fc373523d8e1a924eb6","observation_id":"70b28e84-eb34-4936-bd1a-251dfd0f96de","resolution":{"observed_at":"2026-08-01T10:03:03.298788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01267","last_updated":"2022-11-02T16:49:58Z","snapshot_observed_at":"2026-08-10T06:46:33.424643Z","submitted_at":"2022-11-02T16:49:58Z","title":"Multi-Vector Retrieval as Sparse Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01267","snapshot_observed_at":"2026-08-01T10:03:03.382419Z","title":"Zhao , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.382419Z"},"links":{"cited_paper":"/paper/2211.01267","citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:2bc2361a4fd3a533b6eeb674e0248e2f6d3282a13a179c1a510458fe46b7dc08","observation_id":"1bb6ad98-8c9e-4be3-b3cb-9dfa06a15834","resolution":{"observed_at":"2026-08-01T10:03:03.382419Z","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-01T10:03:03.428354Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.428354Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:698b4a000bfae03f174ff1f8c58ec277ff83c33679644a1a551fdfe08e7d36af","observation_id":"4a9b0ef6-67d1-407c-b0c8-7ba9f795b231","resolution":{"observed_at":"2026-08-01T10:03:03.428354Z","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-01T10:03:03.510613Z","title":"Advances in Information Retrieval , series =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.510613Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:d0a53fa95c168b07eb5d4f5adc9719849cf053d02e37e12efee111a9ce0cec9f","observation_id":"92c74278-445f-46a6-8db3-db5e67c6e73e","resolution":{"observed_at":"2026-08-01T10:03:03.510613Z","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-01T10:03:03.631260Z","title":"Proceedings of the 48th International","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.631260Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:a9f87aacb0ad4a68d9e46bb6c532309f277faea3ba4442704b91fd8433083c06","observation_id":"af1fc51d-bdff-41bc-a945-a4d1f0278320","resolution":{"observed_at":"2026-08-01T10:03:03.631260Z","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-01T10:03:03.757186Z","title":"The Thirteenth International Conference on Learning Representations , pages =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.757186Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:22c3192051914600c4d461d9a7a05729dbd696e34bb3b632c3b6ac0bdcca675a","observation_id":"47164d84-ee22-4432-90f1-592521cd9d68","resolution":{"observed_at":"2026-08-01T10:03:03.757186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.25280","last_updated":"2026-05-30T01:05:41Z","snapshot_observed_at":"2026-08-07T00:56:11.184928Z","submitted_at":"2026-05-24T22:20:33Z","title":"Approximate Algorithms for Chamfer Distance Under Translation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.25280","snapshot_observed_at":"2026-08-01T10:03:03.841052Z","title":"arXiv preprint arXiv:2605.25280 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.841052Z"},"links":{"cited_paper":"/paper/2605.25280","citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:740700c3f50302b1cae62f75fc60125aa6bf81b1c5b87b52a05fd8749e48ae02","observation_id":"89f82564-7a9c-4ab3-b1d6-d78fa334d840","resolution":{"observed_at":"2026-08-01T10:03:03.841052Z","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-01T10:03:03.971313Z","title":"Jiang and Peter Kiss and Eva Szilagyi and Qiaoyuan Yang , title =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T10:03:03.971313Z"},"links":{"citing_paper":"/paper/2607.20393"},"observation_digest":"sha256:0a64551c1793c20e06d6f984e43aff9263214f3782fe98f9762ab43cc8303892","observation_id":"8e7c6f57-027b-4727-9719-bc137d66b7f5","resolution":{"observed_at":"2026-08-01T10:03:03.971313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20393","last_updated":"2026-07-25T05:20:41Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T10:13:08.501693Z","submitted_at":"2026-07-22T17:27:20Z","title":"Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similarity"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.20393."}