{"as_of":"2026-08-11T12:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4c1e04df02f4f8d42605b7ad63a6d417980a333cf80b4b6dcb79eb396e8f0f0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T04:36:25.469444Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T12:39:49.785207Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"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":"2404.02805","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02805","snapshot_observed_at":"2026-07-04T12:39:49.785207Z","title":"Efficient multi-vector dense retrieval using bit vectors.arXiv preprint arXiv:2404.02805,","venue":null,"work_id":"f40272c4-eb24-4635-b334-85ea83283533","year":null},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T06:16:51.174659Z"},"links":{"cited_paper":"/paper/2404.02805","citing_paper":"/paper/2606.23475"},"observation_digest":"sha256:9e2bd4999d916f4401858e57a62992daf6551f5895e033fda36d0a6a17628e54","observation_id":"ace4a8e1-e6a4-4079-997d-5e17814afbf5","resolution":{"observed_at":"2026-07-04T12:39:49.786884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.02805/citation-record","integrity":"/paper/2404.02805/integrity","json":"/paper/2404.02805/citation-record.json","paper":"/paper/2404.02805"},"outbound":[],"paper":{"arxiv_id":"2404.02805","last_updated":"2024-04-03T15:20:24Z","latest_version":1,"primary_category":"cs.IR","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.02805."}