{"as_of":"2026-08-21T10:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24a52867300f2214eeb84f5dbd99e4318b38a405dce406a63fa9c410ca97e383","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:00:44.797046Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2608.12903/citation-record","integrity":"/paper/2608.12903/integrity","json":"/paper/2608.12903/citation-record.json","paper":"/paper/2608.12903"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:00:45.216228Z","title":"A simple knn algorithm for text catego- rization,","venue":null,"work_id":"1d19078e-12a5-4960-a29b-403ace4f9bd5","year":2001},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.651923Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:f1395acd0f1d323481a7762e32a7c82d387a353c77201c471d83797d2c1d5f72","observation_id":"71cc643b-554c-4e6c-8bae-077dbbe8c230","resolution":{"observed_at":"2026-08-15T21:00:45.219691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.205886Z","title":"Application of k-nearest-neighbor decision rule in vowel recognition,","venue":null,"work_id":"06f835a7-822c-4da8-9e0f-66af419bea41","year":1983},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.656247Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:924c336d846b472336afc342269645f1983872fdb820af118a97241dbc0cc0fb","observation_id":"ec2a72bb-e49d-4219-a44e-833900d66be8","resolution":{"observed_at":"2026-08-15T21:00:45.209725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.196232Z","title":"High-resolution mobile fingerprint matching via deep joint knn-triplet embedding,","venue":null,"work_id":"07c13dab-69b2-488d-a057-e5cccf3f53d6","year":2017},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.660138Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:88d3d55edd797bd973835d501a6962351cc7995d1139eff8a58a1bff1e568f17","observation_id":"a7d988ae-b295-4245-aba5-05bc04528d54","resolution":{"observed_at":"2026-08-15T21:00:45.199609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.186234Z","title":"Handwritten character recog- nition using cnn, knn and svm,","venue":null,"work_id":"b5e5cf77-02b2-49a1-aeb8-c099d34800f4","year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.663391Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:4b17cf1ad833d3d6ab9ab5b0c3247e17081a09f0f0e7da1e5ef5eb1a1170092b","observation_id":"881fdf88-9f1e-4b4b-a339-145ef7ebe88b","resolution":{"observed_at":"2026-08-15T21:00:45.189809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.174559Z","title":"Intelligent handwritten recognition using hybrid cnn architectures based-svm classifier with dropout,","venue":null,"work_id":"da4b84df-4135-4bff-9e7c-edf4a3cdee82","year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.667185Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:6b57dc6f8f2fc2cbd8429046cd26b9754b083a1853dbc2e2fae7808f7116c1f8","observation_id":"d50b7272-44da-4aed-867b-a02fc4f3df8f","resolution":{"observed_at":"2026-08-15T21:00:45.179135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:00:44.671245Z","title":"Hierarchical text classification with multi-label contrastive learning and knn,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.671245Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:96f91f45ee15aac89a593318dc77a8f2fdc9b6054b6814429c10f88f212251c9","observation_id":"1de86e6f-4ee1-481c-aa4e-b4fbb3582e35","resolution":{"observed_at":"2026-08-15T21:00:44.671245Z","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-15T21:00:45.158392Z","title":"Efficientnet-lite and hybrid cnn-knn implementation for facial expression recognition on raspberry pi,","venue":null,"work_id":"5a4329b1-25e7-4730-80fd-3849a048f9e8","year":2021},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.675060Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:f6c44bd640862bb9a70e0e9764d71bd5772e24e07e0f65590f73c219bf8f426b","observation_id":"1b662a05-74e3-4bc3-8244-be9513472e0a","resolution":{"observed_at":"2026-08-15T21:00:45.162296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.148682Z","title":"Distance encoded product quanti- zation for approximate k-nearest neighbor search in high-dimensional space,","venue":null,"work_id":"e3b9ebae-f4d8-48e4-9b25-61a78a0daff6","year":2018},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.678394Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:dcc9282f5202863420a86d68014cf35458d04db7a5ef5c9af244cce092a7c431","observation_id":"0218889c-1253-4642-aea5-70a1cfc33593","resolution":{"observed_at":"2026-08-15T21:00:45.152095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.139124Z","title":"K-nearest neighbor finding using maxnearestdist,","venue":null,"work_id":"83c42733-7008-4e56-979f-1e3e8ce76f4f","year":2007},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.681431Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:aba6d306ee290ade929d92263a02376735ce319c49139a95c71e2a55b55f06a3","observation_id":"b60f2c68-b772-4caf-a559-f5ad1c0e371c","resolution":{"observed_at":"2026-08-15T21:00:45.142793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.128900Z","title":"Fast k-nearest neighbor classification using cluster-based trees,","venue":null,"work_id":"82610fa7-681e-4fae-be87-15fdcdd35729","year":2004},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.684701Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:6db7a406faa70fafc0a12aa5d6c69e97e3e8d0959f74c2cb0cf7a207bfbed087","observation_id":"7f5274f4-bdc0-4616-949b-2f799d1b3055","resolution":{"observed_at":"2026-08-15T21:00:45.132767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.118674Z","title":"A fast k nearest neighbor finding algorithm based on the ordered partition,","venue":null,"work_id":"de3a0e84-053c-40d6-a8b4-6a2d37af8ed7","year":1986},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.688033Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:9f68d57f56dd359f5ff5e1d00eb6efbeefbc13fada90b0cb5c87ac30d8db876e","observation_id":"1e3a9bc7-71bf-44dc-9c80-0d99dfa6eefa","resolution":{"observed_at":"2026-08-15T21:00:45.122430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.108090Z","title":"Classification bias of the k-nearest neighbor algorithm,","venue":null,"work_id":"87735f21-da2e-4955-b753-d250dbe2c1fa","year":1984},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.691643Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:dff56279d63b81b9646eb8e2394d81420ae08eb837eaf96eb31ab5d14cc64677","observation_id":"3e114b81-e1ad-4e31-b814-46dad31e9cbc","resolution":{"observed_at":"2026-08-15T21:00:45.111933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.097768Z","title":"Survey on exact knn queries over high-dimensional data space,","venue":null,"work_id":"f3aa7b7c-9e4b-41fb-818e-790204618aa0","year":2023},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.695258Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:a695cc1cbd354b05db7e5638734def1d0d9931c9f15ed61928845a4617bfba4f","observation_id":"65140fc9-c3e4-4030-9001-1d27093a6135","resolution":{"observed_at":"2026-08-15T21:00:45.101033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.087018Z","title":"On optimum choice of k in nearest neighbor classifi- cation,","venue":null,"work_id":"3db1e316-fefe-4401-a714-577d2b4f916d","year":2006},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.698508Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:e359d6707ca1a5ba10c8b9e8df072b2627092c2d67e84cacf9a490b7fb3a437b","observation_id":"da76bab7-4412-4fc0-8402-b9efcab50631","resolution":{"observed_at":"2026-08-15T21:00:45.091010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.076589Z","title":"Locally adaptive metric nearest-neighbor classification,","venue":null,"work_id":"c133e7cb-f9ff-4ddf-a725-96d859dd0102","year":2002},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.701608Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:a0ee0f4a069113a5faf313bdbbdae75f2de1d3e97ae1e68d8e0e228b4b59ca84","observation_id":"f2da0f00-34c8-4e49-83b3-029f9a1ce406","resolution":{"observed_at":"2026-08-15T21:00:45.080474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.064787Z","title":"An affinity-based new local distance function and similarity measure for knn algorithm,","venue":null,"work_id":"06e12b00-16b5-417f-8dfd-1f69b1fa70ca","year":2012},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.704790Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:8dce1cfe50e2b98460f9bfc8e8d599ad8732ea8895e5a754eb317ba5cc02fdfe","observation_id":"1a28ab77-d13a-451a-869e-94e5651dca06","resolution":{"observed_at":"2026-08-15T21:00:45.068445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.053832Z","title":"Reverse nearest neighbors search in ad hoc subspaces,","venue":null,"work_id":"6ef166b7-2d19-4817-90c2-b23d7746a3f9","year":2007},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.708090Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:a03ad27c1d442359adb7e40e96c2e6ba680563501ec097fc8e4cfaafd0dfaf8b","observation_id":"310dce9b-9743-4032-a584-91d5c3b46241","resolution":{"observed_at":"2026-08-15T21:00:45.057667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.041745Z","title":"A geometric-based clustering method using natural neighbors,","venue":null,"work_id":"438656ff-ae1a-4dc4-ab49-d67a268b2997","year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.712002Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:06ffc2fe6f7b3b6258c14fb1b87d62656249a470c4116f3ffed2d2768e0d02bc","observation_id":"5fd6c9ba-95ce-404a-977c-5d7bf323cb25","resolution":{"observed_at":"2026-08-15T21:00:45.046367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.031537Z","title":"Natural neighbor: A self-adaptive neighborhood method without parameter k,","venue":null,"work_id":"93a6f1dc-193f-4b12-8a0d-e3c298154663","year":2016},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.715321Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:28ca8856dbbae24fac111979f71b26718130a31cb93da40764e8ded29b264a79","observation_id":"3d66ff22-9b1a-4d59-a380-149c9dbaa983","resolution":{"observed_at":"2026-08-15T21:00:45.035288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:45.021245Z","title":"Gnan: A natural neighbor search algorithm based on universal gravita- tion,","venue":null,"work_id":"e5268026-01e4-49b1-a186-2a2b75fb6bd9","year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.718923Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:ba3302cdde29ef19be5b4b8d68f02ab02f21bede7148bcb2be3728f9bfd57c3c","observation_id":"8b450133-8d36-448c-81d4-df697653be8f","resolution":{"observed_at":"2026-08-15T21:00:45.024884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:00:44.723037Z","title":"Granular ball computing classifiers for efficient, scalable and robust learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.723037Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:183584e24acb7993818ebd1b06d8348d53dbb641f5516fdc2cf86eb33acb5919","observation_id":"b7958886-e5ab-4ce8-ad5c-d7ed8c9fff0a","resolution":{"observed_at":"2026-08-15T21:00:44.723037Z","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-15T21:00:45.004325Z","title":"An efficient and adaptive granular-ball generation method in classification problem,","venue":null,"work_id":"baa410b9-cdac-43ae-b389-e58a1f2e17e9","year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.726193Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:2a6adc3a6e5f3b08e5ef33b3c43938b67031a658c9d77cf7c46bd65f6caf0d18","observation_id":"e81b5db8-b7c1-44f5-b976-871bd1ba3009","resolution":{"observed_at":"2026-08-15T21:00:45.007918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.993138Z","title":"Mgnr: A multi- granularity neighbor relationship and its application in knn classification and clustering methods,","venue":null,"work_id":"b5dae221-3c30-442a-a7d1-84c150d693ea","year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.729576Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:724bf9b1b3d90804a18e9d7718062728d21f5fd366ddb91fcaf33926825f885b","observation_id":"36609c9a-3363-4677-b7fa-616f2c6c8d6b","resolution":{"observed_at":"2026-08-15T21:00:44.997520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.982200Z","title":"Lightweight-yet-efficient: Revitalizing ball- tree for point-to-hyperplane nearest neighbor search,","venue":null,"work_id":"219370eb-8dd6-4756-b8ba-ba35379e32cb","year":2023},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.732819Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:224cdc5da34cda6e833506205d5e3c3a970cf699ba446e9963432c9779902579","observation_id":"61fd1958-c770-4a58-b6e4-24b090c8af87","resolution":{"observed_at":"2026-08-15T21:00:44.985697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.972115Z","title":"Lan: Learning-based approximate k-nearest neighbor search in graph databases,","venue":null,"work_id":"d7ca0276-abf5-4d2f-9d26-754c535b8fc9","year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.736974Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:43c3aff12908bed13069d3017736ca488bce31a2c662ae958d693ddb7bf2aa67","observation_id":"8248d0b2-ac1d-46cb-997f-5a217af0d0f5","resolution":{"observed_at":"2026-08-15T21:00:44.975841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.961073Z","title":"Joint evidential k-nearest neighbor classification,","venue":null,"work_id":"1c8bf3c1-d045-4272-93e1-b92b40527aee","year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.741144Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:18bc78530fd4b0d9cc9d7eade6b2f7e92c6833872699dca64620461bfd8ffd31","observation_id":"487505ae-e355-409c-93cc-7c9302e5238b","resolution":{"observed_at":"2026-08-15T21:00:44.964999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.951187Z","title":"Connec- tivity of the mutual k-nearest-neighbor graph in clustering and outlier detection,","venue":null,"work_id":"9c12c6ee-b3d7-46b2-9cfc-b92579f52172","year":1997},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.744943Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:674fefc5f69428132a7f548ad17096700356220d956bd4bc8cee789a75aa502a","observation_id":"7cf31bf1-6bc1-4d1c-b133-454836ac563f","resolution":{"observed_at":"2026-08-15T21:00:44.954779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.939817Z","title":"Adaptive learning-basedk- nearest neighbor classifiers with resilience to class imbalance,","venue":null,"work_id":"15c2e052-bedf-478e-9659-ed7a18a56989","year":2018},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.749238Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:b3118c8a2bfb386ae39e1b700881cf12ade55f23f2737c5f44724fe21906ec8e","observation_id":"2fbf5a3a-8fd9-4374-985f-35adf2f2e6fa","resolution":{"observed_at":"2026-08-15T21:00:44.944279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.929432Z","title":"Knn classification with one-step computation,","venue":null,"work_id":"19d7214c-4b5f-4b94-8d1c-e80733be923d","year":2021},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.752796Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:78a67200da8d07e4d15baa18ddb54bdef03239cc0c13770975e9716807f0bb05","observation_id":"e62dfbc0-81d9-4a76-8048-0514438f5239","resolution":{"observed_at":"2026-08-15T21:00:44.933078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.919015Z","title":"Pl-k nn: A parameterless nearest neighbors classifier,","venue":null,"work_id":"05f2ed02-d234-4d1c-8c7f-432e06a65af5","year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.756358Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:e787787985855ed3d3226e7c75434e533da1e4d2e42b3ccf5108593c30d3560b","observation_id":"96c8d95a-9730-4d6a-856a-35f69155a4b6","resolution":{"observed_at":"2026-08-15T21:00:44.922659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:00:44.759640Z","title":"Distributionally robust weighted k-nearest neighbors,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.759640Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:778f82e52d2a78e4e8c1fec75bd2f5bd6c39d23c127ad7e66edf217b4a157438","observation_id":"6e3e0a11-309b-4ac4-9732-26e1f4675771","resolution":{"observed_at":"2026-08-15T21:00:44.759640Z","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-15T21:00:44.902669Z","title":"Gene expression cancer classification using modified k-nearest neighbors technique,","venue":null,"work_id":"6a064a5a-16bc-45a5-8601-9f30fc632239","year":2019},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.763654Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:f2cb855a84b776d06cb39611723f12d640cdac7cc09cc690b3408c7ced19dc9d","observation_id":"1820a36b-9b1a-4fdd-85a6-8629d19dd176","resolution":{"observed_at":"2026-08-15T21:00:44.906132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.891561Z","title":"Gbg++: A fast and stable granular ball generation method for clas- sification,","venue":null,"work_id":"781b5b7e-efa2-4c5f-bdad-e38807752c04","year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.767533Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:8e17f006268e604aaacd56e5f3ec023eeb25c7c40e9881c9e86dd0bf7a9d189c","observation_id":"4d6b5f18-919a-484f-ae0f-564b0ab9bc81","resolution":{"observed_at":"2026-08-15T21:00:44.895063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:00:44.771246Z","title":"Gbsvm: an efficient and robust support vector machine framework via granular- ball computing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.771246Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:1faa4b04bdd86a8693a0258dc9a3317e02a4d85afea4513c2daeee4b250aef50","observation_id":"04c9c7fa-800c-42fd-9663-aa778810cc67","resolution":{"observed_at":"2026-08-15T21:00:44.771246Z","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-15T21:00:44.874672Z","title":"W-gbc: An adaptive weighted clustering method based on granular-ball structure,","venue":null,"work_id":"7ef0302c-301f-49ef-9337-cc21498af800","year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.775285Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:2d812e807fe9553936834e8d26782d764fb94ab6433e66e9fd4a90d768c74cfe","observation_id":"89139fd3-094b-4fa2-a79d-d35e9273a23c","resolution":{"observed_at":"2026-08-15T21:00:44.878198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:00:44.779169Z","title":"Graph coarsening via supervised granular-ball for scalable graph neural network training,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.779169Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:607469a23460d9e2fb22db4e8e2492734074d59b34a4763e43705569fef4c414","observation_id":"3b8cc61d-14ca-4ac9-8069-c0f1fc5bbc00","resolution":{"observed_at":"2026-08-15T21:00:44.779169Z","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-15T21:00:44.782619Z","title":"Gbrs: A unified granular-ball learning model of pawlak rough set and neighborhood rough set,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.782619Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:7c02314f8ce67d665b0ec5f6debbabbd873a63344bd87cf6262d2573cf41f70f","observation_id":"2a8b6c08-a53c-4fab-be75-52a54cc325fe","resolution":{"observed_at":"2026-08-15T21:00:44.782619Z","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-15T21:00:44.851697Z","title":"Unlock the cognitive generalization of deep reinforcement learning via granular ball representation,","venue":null,"work_id":"693a9ad6-1840-427b-9a03-befa019727fa","year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.785965Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:37841903feca11fa9c2060bd4057f8007893493647c667c610f5c4a1146d54cc","observation_id":"6f4316f5-a9fb-4941-8065-39eb978cbc55","resolution":{"observed_at":"2026-08-15T21:00:44.855058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.841746Z","title":"Never-ending learning for explainable brain computing,","venue":null,"work_id":"53280216-7eeb-4cae-a993-da38adb2e9bd","year":2024},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.789395Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:5537780df7fc1c259d44b2a6f663695dc338137beace8c7e9931a0c6d733cfeb","observation_id":"ce317d2a-98cf-4e37-ac39-8e8f96ab73ff","resolution":{"observed_at":"2026-08-15T21:00:44.845221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:00:44.829283Z","title":"Circumspheres of sets of n+1 random points in the d- dimensional euclidean unit ball (1≤n≤d),","venue":null,"work_id":"f4325081-2ca9-4ecf-86af-2b735d5aebd5","year":2017},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.792606Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:b77267f19e2f28e150b417674d47336ca42e4c155cb990d257a83b5c2f8bef92","observation_id":"084ca23a-3745-4c80-a04a-b395f665dbe6","resolution":{"observed_at":"2026-08-15T21:00:44.834668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:00:44.797046Z","title":"Hilbert space embeddings and metrics on probability measures,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:00:44.797046Z"},"links":{"citing_paper":"/paper/2608.12903"},"observation_digest":"sha256:db9473b8b321b678781dbdd24321a2ce7ef81255e4c76515fa7ef26a9f8d7ac3","observation_id":"22cbdfb5-921f-40f8-bbd8-806414e6a7d2","resolution":{"observed_at":"2026-08-15T21:00:44.797046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.12903","last_updated":"2026-08-13T07:39:46Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T23:11:15.427608Z","submitted_at":"2026-08-13T07:39:46Z","title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":41},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2608.12903."}