Pith Number

pith:3PC6X2FB

pith:2026:3PC6X2FBDFGHZNWN2ZY276Y7OT

not attested not anchored not stored refs resolved

ADS-IMC: Accelerating Data Sorting with In-Memory Computation

Narendra Singh Dhakad, Santosh Kumar Vishvakarma

In-memory sorting using 6T SRAM cuts data movement costs by keeping operations inside memory.

arxiv:2605.16213 v1 · 2026-05-15 · cs.AR

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{3PC6X2FBDFGHZNWN2ZY276Y7OT}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

This work represents the first exploration of in-memory sorting using 6T SRAM. The proposed architecture achieves a significant 3.4x reduction in latency compared to memristor-based IMC sorting.

C2weakest assumption

That a functional 6T SRAM-based in-memory sorting circuit can be realized in hardware with the claimed latency benefit, without major area, power, or reliability penalties that would offset the gains.

C3one line summary

Presents the first in-memory sorting design using 6T SRAM that delivers 3.4 times lower latency than memristor-based methods.

References

17 extracted · 17 resolved · 0 Pith anchors

[1] Gputerasort: high performance graphics co-processor sorting for large database man- agement, 2006

[2] Implementing sorting in database systems, 2006

[3] Implementing scheduling algorithms in high-speed networks, 1999

[4] A novel sorting algorithm and its application to a gamma-ray telescope asynchronous data acquisition system, 1997

[5] Review on sorting algorithms a comparative study, 2013

Receipt and verification

First computed	2026-05-20T00:01:58.305887Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

dbc5ebe8a1194c7cb6cdd671affb1f74f36edf73626d1758553ab0d26497f3bf

Aliases

arxiv: 2605.16213 · arxiv_version: 2605.16213v1 · doi: 10.48550/arxiv.2605.16213 · pith_short_12: 3PC6X2FBDFGH · pith_short_16: 3PC6X2FBDFGHZNWN · pith_short_8: 3PC6X2FB

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: dbc5ebe8a1194c7cb6cdd671affb1f74f36edf73626d1758553ab0d26497f3bf

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "1e9add68110e6bde71ef9f0008eef096479b7a32da193eb73420851bbf2b3443",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.AR",
    "submitted_at": "2026-05-15T17:27:52Z",
    "title_canon_sha256": "5c8567909aa7eab9365681d9e07a2a883307edd5720a241973a447a027ad9cbc"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16213",
    "kind": "arxiv",
    "version": 1
  }
}