A Review of Graphene‐Based Memristive Neuromorphic Devices and Circuits
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
As data processing volume increases, the limitations of traditional computers and the need for more efficient computing methods become evident. Neuromorphic computing mimics the brain's low‐power and high‐speed computations, making it crucial in the era of big data and artificial intelligence. One significant development in this field is the memristor, a device that exhibits neuromorphic tendencies. The performance of memristive devices and circuits relies on the materials used, with graphene being a promising candidate due to its unique properties. Researchers are investigating graphene‐based memristors for large‐scale, sustainable fabrication. Herein, progress in the development of graphene‐based memristive neuromorphic devices and circuits is highlighted. Graphene and its common fabrication methods are discussed. The fabrication and production of graphene‐based memristive devices are reviewed and comparisons are provided among graphene‐ and nongraphene‐based memristive devices. Next, a detailed synthesis of the devices utilizing graphene‐based memristors is provided to implement the basic building blocks of neuromorphic architectures, that is, synapses, and neurons. This is followed by reviewing studies building graphene memristive spiking neural networks (SNNs). Finally, insights on the prospects of graphene‐based neuromorphic memristive systems including their device‐ and network‐level challenges and opportunities are given.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it