{"as_of":"2026-08-11T01:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf9803ab9cbf96dc8d85b5a18cad126e1f7608e8b2218e8df8064298592fe121","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T04:36:25.531779Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2501.17788/citation-record","integrity":"/paper/2501.17788/integrity","json":"/paper/2501.17788/citation-record.json","paper":"/paper/2501.17788"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.13950","last_updated":"2024-04-22T07:51:13Z","snapshot_observed_at":"2026-08-10T16:39:48.927238Z","submitted_at":"2024-04-22T07:51:13Z","title":"SPLATE: Sparse Late Interaction Retrieval","version":1},"cited_work":{"arxiv_id":"2404.13950","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.13950","snapshot_observed_at":"2026-08-10T04:36:26.045108Z","title":"SPLATE: Sparse Late Interaction Retrieval","venue":"cs.IR","work_id":"5537e012-82b4-440f-8000-60389c65bf46","year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.316578Z"},"links":{"cited_paper":"/paper/2404.13950","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:4fe956aa718c7ead3cc491c0a05077510bb7217a66e451d6565e818d75d45f2d","observation_id":"1bdd9aa4-c740-413c-8365-bedf255a4c62","resolution":{"observed_at":"2026-08-10T04:36:26.051784Z","resolver_source":"local_arxiv","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":{"arxiv_id":"2104.07186","last_updated":"2021-04-15T00:53:54Z","snapshot_observed_at":"2026-08-06T16:32:06.004294Z","submitted_at":"2021-04-15T00:53:54Z","title":"COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.07186","snapshot_observed_at":"2026-08-10T04:36:25.329238Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.329238Z"},"links":{"cited_paper":"/paper/2104.07186","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:c64bef0fcbbdaf92d485348bc2b1086b10087ab4334ddce641b987be9be02d76","observation_id":"40cff950-ea2f-4092-89d6-bf48046ea59f","resolution":{"observed_at":"2026-08-10T04:36:25.329238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:36:26.154863Z","title":null,"venue":null,"work_id":"9bf33e0d-14a5-4e7d-8e2f-0501c462eb36","year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.346969Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:e72ae5e6f37136da65496e08ab6af9dfdd913412375f5e0f14d452e8ea405b4f","observation_id":"317b39e3-694c-4719-8d29-14c851293103","resolution":{"observed_at":"2026-08-10T04:36:26.159597Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:36:26.139217Z","title":null,"venue":null,"work_id":"afd0b623-ff19-4b94-ad39-897d4ad884fd","year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.358072Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:f3bdb89086c1c792bf66a4b65a3d0668251caea1a95b47865aefdcfbac2d5c14","observation_id":"1bc8fe8f-c197-4b42-b618-dd8605116daa","resolution":{"observed_at":"2026-08-10T04:36:26.144099Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"1908.10396","last_updated":"2020-12-04T21:29:31Z","snapshot_observed_at":"2026-08-10T18:49:56.141270Z","submitted_at":"2019-08-27T18:27:17Z","title":"Accelerating Large-Scale Inference with Anisotropic Vector Quantization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10396","snapshot_observed_at":"2026-08-10T04:36:25.366689Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.366689Z"},"links":{"cited_paper":"/paper/1908.10396","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:720dc746e7089cbc979c6949abab8be283b64de0b64b9c82663a3ec41a8b6c10","observation_id":"b9f8fc87-2dc5-470a-9e6a-0c2c97198e40","resolution":{"observed_at":"2026-08-10T04:36:25.366689Z","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-10T04:36:25.376359Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.376359Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:cf75c3e3ac23f7441a5ec3996d0a45752e4332b483131ab9b3922ac03fb5e873","observation_id":"07ee9d26-4246-4c3c-a8ad-d164e4147369","resolution":{"observed_at":"2026-08-10T04:36:25.376359Z","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-10T04:36:25.383955Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.383955Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:afdc790d764a314089e4f559176e217c09f2581a84bc35610486f9973dbc63f0","observation_id":"b3f77068-b9d1-41e7-b299-b1dc05558b99","resolution":{"observed_at":"2026-08-10T04:36:25.383955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.12832","last_updated":"2020-06-04T05:28:21Z","snapshot_observed_at":"2026-08-09T14:19:22.545430Z","submitted_at":"2020-04-27T14:21:03Z","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.12832","snapshot_observed_at":"2026-08-10T04:36:25.395917Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.395917Z"},"links":{"cited_paper":"/paper/2004.12832","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:ff3118ef03c454d02245190eb4e7831692a273695e90d888156dd62be57832bf","observation_id":"8cf6d4a7-2ef6-4221-a307-eb02de55b52a","resolution":{"observed_at":"2026-08-10T04:36:25.395917Z","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-10T04:36:25.404664Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.404664Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:f233695b5dbbda512942f49c90e9cbf7b245a42415ce5f572f45933f61a66c98","observation_id":"edc7a2b1-7cae-4deb-93d5-c669f7f97874","resolution":{"observed_at":"2026-08-10T04:36:25.404664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:36:26.092200Z","title":null,"venue":null,"work_id":"bc99f939-c35c-40da-a088-acda7ca958ea","year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.434613Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:4a5b76c799e50a4e1e58f2d19ef4b87889022aeec9c45b373761910ebeee5242","observation_id":"0c8bfe3e-c043-474c-a06b-d240c9044dff","resolution":{"observed_at":"2026-08-10T04:36:26.097477Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2304.01982","last_updated":"2024-04-08T18:31:32Z","snapshot_observed_at":"2026-08-07T22:47:34.048228Z","submitted_at":"2023-04-04T17:37:06Z","title":"Rethinking the Role of Token Retrieval in Multi-Vector Retrieval","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.01982","snapshot_observed_at":"2026-08-10T04:36:25.442408Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.442408Z"},"links":{"cited_paper":"/paper/2304.01982","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:edb9e1192605e2141c00cfe78f5408c8c1cc1545587a7b77ff879f65b68c20d9","observation_id":"a0ae2c14-6280-4b7f-a52c-f61c9290d91e","resolution":{"observed_at":"2026-08-10T04:36:25.442408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:36:26.074399Z","title":null,"venue":null,"work_id":"ed0b2b99-22c4-40ab-903a-bf7bf13524eb","year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.449995Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:d13a1cb2d6f1de687d0c562ee1b910604b09f92d667dac0309d02fb5b80b3f07","observation_id":"88886eed-c2ae-44bb-b1a0-ef6b066fa996","resolution":{"observed_at":"2026-08-10T04:36:26.078952Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2211.10411","last_updated":"2022-11-18T18:27:35Z","snapshot_observed_at":"2026-07-06T14:20:22.694637Z","submitted_at":"2022-11-18T18:27:35Z","title":"CITADEL: Conditional Token Interaction via Dynamic Lexical Routing for Efficient and Effective Multi-Vector Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.10411","snapshot_observed_at":"2026-08-10T04:36:25.455917Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.455917Z"},"links":{"cited_paper":"/paper/2211.10411","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:2f6d14d76bd6cc9337df6110c980fdbf587fada7139cc4bd84b26e9d94878acf","observation_id":"88c3b479-7445-45a2-b149-35fd23467271","resolution":{"observed_at":"2026-08-10T04:36:25.455917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14989","last_updated":"2024-04-23T12:46:53Z","snapshot_observed_at":"2026-07-06T18:04:21.920880Z","submitted_at":"2024-04-23T12:46:53Z","title":"A Reproducibility Study of PLAID","version":1},"cited_work":{"arxiv_id":"2404.14989","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.14989","snapshot_observed_at":"2026-08-10T04:36:25.811648Z","title":"A Reproducibility Study of PLAID","venue":"cs.IR","work_id":"e65b6d79-fa9b-4865-bce5-844ffba40252","year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.461399Z"},"links":{"cited_paper":"/paper/2404.14989","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:1966490bd11a2752b490b1ab3714cdebc9baccb80864d1f45872f00b4c8370dd","observation_id":"75dba899-eddf-493b-9b24-2f7fe80c6b4e","resolution":{"observed_at":"2026-08-10T04:36:25.820889Z","resolver_source":"local_arxiv","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":{"arxiv_id":"2404.02805","last_updated":"2024-04-03T15:20:24Z","snapshot_observed_at":"2026-08-09T07:36:16.705585Z","submitted_at":"2024-04-03T15:20:24Z","title":"Efficient Multi-Vector Dense Retrieval Using Bit Vectors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02805","snapshot_observed_at":"2026-08-10T04:36:25.469444Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.469444Z"},"links":{"cited_paper":"/paper/2404.02805","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:7c84ff089036da003c8373e8729241b7b7d48e0d2fc243c1015cc26821885efb","observation_id":"86580098-a282-435b-8c5f-52a15ef9b0c6","resolution":{"observed_at":"2026-08-10T04:36:25.469444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.10683","last_updated":"2023-09-19T15:14:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-10-23T17:37:36Z","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.10683","snapshot_observed_at":"2026-08-10T04:36:25.475369Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.475369Z"},"links":{"cited_paper":"/paper/1910.10683","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:eef47b381806134f0d13967f608bd07587d02c2ddaee92f500c44af9c0e7929c","observation_id":"d94f3708-682c-45bf-831f-6386f7615a1b","resolution":{"observed_at":"2026-08-10T04:36:25.475369Z","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-10T04:36:25.481593Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.481593Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:7ff9f1e783fdd4922d367e276cacb61fa88ef28c8b31da44332673f0bec77462","observation_id":"705616ed-86da-435f-ab6d-b182cc106e5c","resolution":{"observed_at":"2026-08-10T04:36:25.481593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09707","last_updated":"2022-05-19T17:19:31Z","snapshot_observed_at":"2026-08-10T03:45:50.087208Z","submitted_at":"2022-05-19T17:19:31Z","title":"PLAID: An Efficient Engine for Late Interaction Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.09707","snapshot_observed_at":"2026-08-10T04:36:25.488446Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.488446Z"},"links":{"cited_paper":"/paper/2205.09707","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:25162ba34f430ebc8c2be49409a4124afea2b30ebda8598b2082186729e3af95","observation_id":"a38c18a2-23e0-4e79-8685-4d96a4fda8fd","resolution":{"observed_at":"2026-08-10T04:36:25.488446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.01488","last_updated":"2022-07-10T17:28:51Z","snapshot_observed_at":"2026-08-10T16:38:48.073388Z","submitted_at":"2021-12-02T18:38:50Z","title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.01488","snapshot_observed_at":"2026-08-10T04:36:25.494919Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.494919Z"},"links":{"cited_paper":"/paper/2112.01488","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:76393d217a2a0b53a137b6df48765c45336109703bbd3ce7be26aa8545eb473d","observation_id":"b7d57575-471e-4587-b43d-7d4664d5b8c7","resolution":{"observed_at":"2026-08-10T04:36:25.494919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08663","last_updated":"2021-10-21T01:18:28Z","snapshot_observed_at":"2026-08-09T23:22:21.200279Z","submitted_at":"2021-04-17T23:29:55Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08663","snapshot_observed_at":"2026-08-10T04:36:25.503472Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.503472Z"},"links":{"cited_paper":"/paper/2104.08663","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:4b7e5f1ef13208d03cff8bc291653d031e2e1e3094d3d67e1e3928556140c2fc","observation_id":"5202cdd3-5455-4df7-874a-c589b0462227","resolution":{"observed_at":"2026-08-10T04:36:25.503472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00808","last_updated":"2020-10-20T22:17:19Z","snapshot_observed_at":"2026-08-06T15:45:53.027828Z","submitted_at":"2020-07-01T23:15:56Z","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.00808","snapshot_observed_at":"2026-08-10T04:36:25.510820Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.510820Z"},"links":{"cited_paper":"/paper/2007.00808","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:0152342fe2a0fdb0de3a0df542891e8d00ee50d3e377e3f1721a15fe3ea1d74b","observation_id":"1fe56a1f-99fc-451c-9966-e54a55f6b551","resolution":{"observed_at":"2026-08-10T04:36:25.510820Z","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-10T04:36:25.519718Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.519718Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:f9473ece664107928bda58a04b5063442b321c014fa60fb039e02405ef9e3b4b","observation_id":"187ede1c-9af9-44fd-b218-9d6a884344c2","resolution":{"observed_at":"2026-08-10T04:36:25.519718Z","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-10T04:36:25.422428Z","title":"doi: 10.1145/2487575.2488217","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":1176,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.422428Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:626c89923b84bd646672aa4c9277f4c6c283f283db6e60285f55b874aa499f00","observation_id":"3b6e1289-5de6-4fc1-833a-68b2cb6cf206","resolution":{"observed_at":"2026-08-10T04:36:25.422428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:36:26.110137Z","title":"In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’13)","venue":null,"work_id":"d8761089-1854-4bfb-988c-b11d0c9856e3","year":null},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.410243Z"},"links":{"citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:180805f796aa1a25e0c0c06c457f53247b879c3508e11071ea1f12fc82566755","observation_id":"cf7c5fa0-aff1-4525-ade7-b29bfeb51a3d","resolution":{"observed_at":"2026-08-10T04:36:26.115542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2104.08051","last_updated":"2021-04-16T11:57:35Z","snapshot_observed_at":"2026-08-08T17:36:03.236364Z","submitted_at":"2021-04-16T11:57:35Z","title":"Optimizing Dense Retrieval Model Training with Hard Negatives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08051","snapshot_observed_at":"2026-08-10T04:36:25.531779Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T04:36:25.531779Z"},"links":{"cited_paper":"/paper/2104.08051","citing_paper":"/paper/2501.17788"},"observation_digest":"sha256:519c98365e5a421fc72e75ad4211870d4c7b013cf38401fb6004f83554e41f4c","observation_id":"aa6ac72d-3e49-4866-8d2d-4992a44a47f3","resolution":{"observed_at":"2026-08-10T04:36:25.531779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.17788","last_updated":"2025-07-06T10:07:26Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-10T16:39:09.602931Z","submitted_at":"2025-01-29T17:26:47Z","title":"WARP: An Efficient Engine for Multi-Vector Retrieval"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":25},"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 11 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2501.17788."}