{"as_of":"2026-08-18T07:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:023f07cad32a6853244cb7f98dffffa0917dcadfb6e5e7e8e1f768c85a38ec57","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-18T06:34:40.430872+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-15T20:28:21.644843Z","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-03T17:08:42.753103Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.04523","last_updated":"2020-04-29T11:07:06Z","snapshot_observed_at":"2026-08-15T17:53:49.253976Z","submitted_at":"2020-04-09T13:00:05Z","title":"k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04523","snapshot_observed_at":"2026-08-11T23:50:08.496179Z","title":"k-nearest neighbour classifiers: 2nd edition (with python examples)","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.02148","last_updated":"2024-12-03T04:09:19Z","snapshot_observed_at":"2026-08-16T16:12:31.054030Z","submitted_at":"2024-12-03T04:09:19Z","title":"Mining Tweets to Predict Future Bitcoin Price","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:50:08.496179Z"},"links":{"cited_paper":"/paper/2004.04523","citing_paper":"/paper/2412.02148"},"observation_digest":"sha256:187c4c61ef833fcfdddbcd9bb0d8ef55deec5a1b162c0092a2c56be43cdd963a","observation_id":"98b8f401-8f04-4d14-9c08-76f33c39c891","resolution":{"observed_at":"2026-08-11T23:50:08.496179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04523","last_updated":"2020-04-29T11:07:06Z","snapshot_observed_at":"2026-08-15T17:53:49.253976Z","submitted_at":"2020-04-09T13:00:05Z","title":"k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04523","snapshot_observed_at":"2026-08-15T20:28:21.644843Z","title":"k-Nearest neighbour classifiers: (with Python examples)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13042","last_updated":"2025-05-19T12:32:28Z","snapshot_observed_at":"2026-08-15T20:19:00.717105Z","submitted_at":"2025-05-19T12:32:28Z","title":"An introduction to Neural Networks for Physicists","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:28:21.644843Z"},"links":{"cited_paper":"/paper/2004.04523","citing_paper":"/paper/2505.13042"},"observation_digest":"sha256:f28f827723312f8aff3c92e121f01fa77dc4f5ecc8a833c9a29170fb9bf83b52","observation_id":"5ed7bb17-1775-42af-a3b7-a25d98353c9d","resolution":{"observed_at":"2026-08-15T20:28:21.644843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04523","last_updated":"2020-04-29T11:07:06Z","snapshot_observed_at":"2026-08-15T17:53:49.253976Z","submitted_at":"2020-04-09T13:00:05Z","title":"k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)","version":2},"cited_work":{"arxiv_id":"2004.04523","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.04523","snapshot_observed_at":"2026-07-03T17:08:42.753103Z","title":"arXiv preprint arXiv:2004.04523 , year=","venue":null,"work_id":"4a3f0356-c15e-4185-b1b2-d2f196142d65","year":2004},"citing_paper":{"arxiv_id":"2607.02072","last_updated":"2026-07-06T14:17:36Z","snapshot_observed_at":"2026-08-07T11:32:07.307879Z","submitted_at":"2026-07-02T12:07:00Z","title":"kNNGuard: Turning LLM Hidden Activations into a Training-Free Configurable Guardrail","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-03T17:03:06.656045Z"},"links":{"cited_paper":"/paper/2004.04523","citing_paper":"/paper/2607.02072"},"observation_digest":"sha256:5d9b3126eae3ba8de7baac08656ae1308dd199a0f922c8b36dbe417a383d9970","observation_id":"98d734df-4672-40a5-a230-689e3d62d9c3","resolution":{"observed_at":"2026-07-03T17:08:42.754927Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04523","last_updated":"2020-04-29T11:07:06Z","snapshot_observed_at":"2026-08-15T17:53:49.253976Z","submitted_at":"2020-04-09T13:00:05Z","title":"k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04523","snapshot_observed_at":"2026-07-12T08:27:42.250470Z","title":"arXiv preprint arXiv:2004.04523 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.02072","last_updated":"2026-07-06T14:17:36Z","snapshot_observed_at":"2026-08-07T11:32:07.307879Z","submitted_at":"2026-07-02T12:07:00Z","title":"kNNGuard: Turning LLM Hidden Activations into a Training-Free Configurable Guardrail","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-12T08:27:42.250470Z"},"links":{"cited_paper":"/paper/2004.04523","citing_paper":"/paper/2607.02072"},"observation_digest":"sha256:76bcd91544e771b919f98334fd76d6e86040280f76d82383a27d3545e37262b9","observation_id":"00400434-a4d1-4c23-a2c1-9f064e2b44fe","resolution":{"observed_at":"2026-07-12T08:27:42.250470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04523","last_updated":"2020-04-29T11:07:06Z","snapshot_observed_at":"2026-08-15T17:53:49.253976Z","submitted_at":"2020-04-09T13:00:05Z","title":"k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04523","snapshot_observed_at":"2026-07-31T18:01:58.839110Z","title":"k-Nearest Neighbour Classifiers: 2nd Edition (with Python Examples),","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.24332","last_updated":"2026-07-27T12:09:03Z","snapshot_observed_at":"2026-08-15T15:21:06.621078Z","submitted_at":"2026-07-27T12:09:03Z","title":"Cross-Attention Calibrated Deduplication for Retrieval-Augmented Generation System","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T18:01:58.839110Z"},"links":{"cited_paper":"/paper/2004.04523","citing_paper":"/paper/2607.24332"},"observation_digest":"sha256:c9a15090ddc1a0ed4b38ee470b27099feb69ba6efa83e9ae3b7638e00488432a","observation_id":"38b038a5-9411-4472-87ed-70c5d4eb0921","resolution":{"observed_at":"2026-07-31T18:01:58.839110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2004.04523/citation-record","integrity":"/paper/2004.04523/integrity","json":"/paper/2004.04523/citation-record.json","paper":"/paper/2004.04523"},"outbound":[],"paper":{"arxiv_id":"2004.04523","last_updated":"2020-04-29T11:07:06Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T17:53:49.253976Z","submitted_at":"2020-04-09T13:00:05Z","title":"k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2004.04523."}