{"as_of":"2026-08-13T06:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18e63e9bce8a5bae0f3f874620dc4e8fc08c6a5dacde061fa305db6d85185615","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:53:57.595562Z","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-06-28T18:02:26.929363Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.04018","last_updated":"2025-04-05T01:50:09Z","snapshot_observed_at":"2026-08-07T16:08:28.804640Z","submitted_at":"2025-04-05T01:50:09Z","title":"ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04018","snapshot_observed_at":"2026-08-03T03:53:57.595562Z","title":null,"venue":null,"work_id":null,"year":2025},"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":51,"source":"pdf_text","source_observed_at":"2026-08-03T03:53:57.595562Z"},"links":{"cited_paper":"/paper/2504.04018","citing_paper":"/paper/2602.06721"},"observation_digest":"sha256:c7f4a69ac5e009f8baa57a08b5a4dcec29854528f51174ae143992f691d176d6","observation_id":"d731ab10-11a6-42e2-a4de-5a863a468a84","resolution":{"observed_at":"2026-08-03T03:53:57.595562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04018","last_updated":"2025-04-05T01:50:09Z","snapshot_observed_at":"2026-08-07T16:08:28.804640Z","submitted_at":"2025-04-05T01:50:09Z","title":"ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2504.04018","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.04018","snapshot_observed_at":"2026-06-28T18:02:26.929363Z","title":null,"venue":null,"work_id":"4fadca3d-2c9d-417b-a666-c32f3476ccbc","year":2025},"citing_paper":{"arxiv_id":"2604.06616","last_updated":"2026-04-30T00:32:29Z","snapshot_observed_at":"2026-08-11T08:05:31.667130Z","submitted_at":"2026-04-08T02:49:55Z","title":"CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-10T17:34:24.958030Z"},"links":{"cited_paper":"/paper/2504.04018","citing_paper":"/paper/2604.06616"},"observation_digest":"sha256:7a675ebc88995bd45fbafe93837dae8dc8a65d68e7e8b3787979a21f5cfebb3e","observation_id":"c6a38ecf-9d52-4855-9979-d39e59755598","resolution":{"observed_at":"2026-05-11T06:36:02.981952Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04018","last_updated":"2025-04-05T01:50:09Z","snapshot_observed_at":"2026-08-07T16:08:28.804640Z","submitted_at":"2025-04-05T01:50:09Z","title":"ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2504.04018","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.04018","snapshot_observed_at":"2026-06-28T18:02:26.929363Z","title":null,"venue":null,"work_id":"4fadca3d-2c9d-417b-a666-c32f3476ccbc","year":2025},"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":52,"source":"pdf_text","source_observed_at":"2026-06-28T17:58:06.658283Z"},"links":{"cited_paper":"/paper/2504.04018","citing_paper":"/paper/2606.00734"},"observation_digest":"sha256:1f249cb4307b906714eccd88ddd41a25447825fa3ed4d4e65bf31848ded74d9d","observation_id":"1e232235-187a-4fe7-a892-f92741c12d9d","resolution":{"observed_at":"2026-06-28T18:02:26.930689Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.04018/citation-record","integrity":"/paper/2504.04018/integrity","json":"/paper/2504.04018/citation-record.json","paper":"/paper/2504.04018"},"outbound":[],"paper":{"arxiv_id":"2504.04018","last_updated":"2025-04-05T01:50:09Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T16:08:28.804640Z","submitted_at":"2025-04-05T01:50:09Z","title":"ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.04018."}