Evidence map›Paper›PMID 42069719›Full record

ArticleNature communications2026

Adaptive spatial hashing with dual-domain memristive hardware.

Dong Hoon Shin, Wonho Choi, Sunwoo Cheong, Néstor Ghenzi, Sung Keun Shim, Sung Ho Kim, Kunhee Son, Soo Hyung Lee, Byongwoo Park, Jonghoon Shin and 1 more

Abstract read
In one paragraph

Article in Nature communications, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

11 authors.

Dong Hoon Shin *Department of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Wonho Choi *Department of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Sunwoo Cheong *Department of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Néstor GhenziDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Sung Keun ShimDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Sung Ho KimDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Kunhee SonDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Soo Hyung LeeDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Byongwoo ParkDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Jonghoon ShinDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea.
Cheol Seong HwangDepartment of Materials Science and Engineering and Inter-university Semiconductor Research Center, College of Engineering, Seoul National University, Seoul, Republic of Korea. cheolsh@snu.ac.kr.ORCID http://orcid.org/0000-0002-6254-9758

Funding

National Research Foundation of Korea (NRF) 2020R1A3B2079882
6 · The paper itself

Abstract

Locality-sensitive hashing is a technique for approximate similarity search, but fixed thresholds and analog encoding inefficiencies have limited its hardware implementation. This work introduces a dual-domain adaptive spatial hashing (DASH) architecture on a monolithic one-transistor-one-resistor active array operating in both digital and analog domains, with an integrated multifunctional memristor. DASH performs entropy-maximized random projection and data-driven bias adaptation in the analog domain, followed by efficient Hamming-distance computation in the digital domain. Using dual-domain vector-matrix multiplication, multidimensional inputs are compressed into binary hash codes, enabling compact similarity encoding within a unified memristive hardware platform. Experimental validation on three-dimensional-clustered synthetic data shows that DASH maintains spatial separability and improves bit entropy through adaptation. Large-scale simulations on a digit dataset demonstrate improved semantic preservation, similarity recall, and noise resilience compared to non-adaptive hashing. These results position DASH as a scalable, hardware-native solution for energy-efficient, locality-aware similarity search in edge and neuromorphic systems.

Identifiers

PMID42069719
PMCPMC13342510

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.