{"as_of":"2026-08-10T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6efcf8d9e4e6ac956aa31f4f9d8583bb6ad9a4916838e5c0e1570b73f2920828","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:05:45.266849Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":3,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.14958","last_updated":"2022-11-08T03:04:06Z","snapshot_observed_at":"2026-07-06T14:10:51.793831Z","submitted_at":"2022-10-26T18:15:47Z","title":"Constrained Approximate Similarity Search on Proximity Graph","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.14958","snapshot_observed_at":"2026-08-09T15:05:45.266849Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01528","last_updated":"2025-02-03T17:08:26Z","snapshot_observed_at":"2026-08-10T11:07:37.964418Z","submitted_at":"2025-02-03T17:08:26Z","title":"SQUASH: Serverless and Distributed Quantization-based Attributed Vector Similarity Search","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-09T15:05:45.266849Z"},"links":{"cited_paper":"/paper/2210.14958","citing_paper":"/paper/2502.01528"},"observation_digest":"sha256:84e7a136be8518ebff862105c15b95ab94b44eb7433682a376b9d7e5d4810c64","observation_id":"626851e2-ef9c-4c69-b0a1-faa564743949","resolution":{"observed_at":"2026-08-09T15:05:45.266849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14958","last_updated":"2022-11-08T03:04:06Z","snapshot_observed_at":"2026-07-06T14:10:51.793831Z","submitted_at":"2022-10-26T18:15:47Z","title":"Constrained Approximate Similarity Search on Proximity Graph","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.14958","snapshot_observed_at":"2026-08-03T03:53:58.089786Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.06721","last_updated":"2026-05-28T06:51:41Z","snapshot_observed_at":"2026-08-09T12:51:40.408339Z","submitted_at":"2026-02-06T14:14:00Z","title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T03:53:58.089786Z"},"links":{"cited_paper":"/paper/2210.14958","citing_paper":"/paper/2602.06721"},"observation_digest":"sha256:3b2f24b8b5730311b51c827e6d791bf28868a52d6d939e8194ba215f33f0fef1","observation_id":"ba719c06-7671-4326-bd67-84d70b944dcb","resolution":{"observed_at":"2026-08-03T03:53:58.089786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14958","last_updated":"2022-11-08T03:04:06Z","snapshot_observed_at":"2026-07-06T14:10:51.793831Z","submitted_at":"2022-10-26T18:15:47Z","title":"Constrained Approximate Similarity Search on Proximity Graph","version":2},"cited_work":{"arxiv_id":"2210.14958","doi":"10.48550/arxiv.2210.14958","metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14958","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"1389e938-16cc-45bd-9734-e5b7e409312b","year":2022},"citing_paper":{"arxiv_id":"2604.02522","last_updated":"2026-04-02T21:23:00Z","snapshot_observed_at":"2026-08-03T01:43:37.179078Z","submitted_at":"2026-04-02T21:23:00Z","title":"Opal: Private Memory for Personal AI","version":1},"reference_index":279,"source":"pdf_text","source_observed_at":"2026-05-13T21:09:06.320543Z"},"links":{"cited_paper":"/paper/2210.14958","citing_paper":"/paper/2604.02522"},"observation_digest":"sha256:e68b8cd540543af975b7306a6e4ecc02dd7c0a7d17caa0f53c741a1f76146f17","observation_id":"3cc7aac7-132c-4d12-ad2a-e0326bdaa1a1","resolution":{"observed_at":"2026-05-13T21:13:16.729260Z","resolver_source":"arxiv_id","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":"2210.14958","last_updated":"2022-11-08T03:04:06Z","snapshot_observed_at":"2026-07-06T14:10:51.793831Z","submitted_at":"2022-10-26T18:15:47Z","title":"Constrained Approximate Similarity Search on Proximity Graph","version":2},"cited_work":{"arxiv_id":"2210.14958","doi":"10.48550/arxiv.2210.14958","metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14958","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"1389e938-16cc-45bd-9734-e5b7e409312b","year":2022},"citing_paper":{"arxiv_id":"2605.07770","last_updated":"2026-05-08T14:11:49Z","snapshot_observed_at":"2026-08-08T02:10:34.428275Z","submitted_at":"2026-05-08T14:11:49Z","title":"FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-11T02:38:26.167721Z"},"links":{"cited_paper":"/paper/2210.14958","citing_paper":"/paper/2605.07770"},"observation_digest":"sha256:ef4597396dd991f3b957305719b66687bc914a413912bab4b4155f8207ceadf2","observation_id":"8e488d27-2983-4197-895e-62a8bb9a2100","resolution":{"observed_at":"2026-05-11T02:40:53.666565Z","resolver_source":"arxiv_id","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":"2210.14958","last_updated":"2022-11-08T03:04:06Z","snapshot_observed_at":"2026-07-06T14:10:51.793831Z","submitted_at":"2022-10-26T18:15:47Z","title":"Constrained Approximate Similarity Search on Proximity Graph","version":2},"cited_work":{"arxiv_id":"2210.14958","doi":"10.48550/arxiv.2210.14958","metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14958","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"1389e938-16cc-45bd-9734-e5b7e409312b","year":2022},"citing_paper":{"arxiv_id":"2606.00734","last_updated":"2026-05-30T13:56:00Z","snapshot_observed_at":"2026-08-02T09:59:17.967563Z","submitted_at":"2026-05-30T13:56:00Z","title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-28T17:58:06.658283Z"},"links":{"cited_paper":"/paper/2210.14958","citing_paper":"/paper/2606.00734"},"observation_digest":"sha256:4fa39cb83df4e9f0a5fb57d2e70e14540f820ed8c296191be5e99037b90eb6ba","observation_id":"f1571b20-fb41-482e-b7ba-53cd852242fc","resolution":{"observed_at":"2026-06-28T18:02:26.925406Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2210.14958/citation-record","integrity":"/paper/2210.14958/integrity","json":"/paper/2210.14958/citation-record.json","paper":"/paper/2210.14958"},"outbound":[],"paper":{"arxiv_id":"2210.14958","last_updated":"2022-11-08T03:04:06Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T14:10:51.793831Z","submitted_at":"2022-10-26T18:15:47Z","title":"Constrained Approximate Similarity Search on Proximity Graph"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2210.14958."}