{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3PC6X2FBDFGHZNWN2ZY276Y7OT","short_pith_number":"pith:3PC6X2FB","schema_version":"1.0","canonical_sha256":"dbc5ebe8a1194c7cb6cdd671affb1f74f36edf73626d1758553ab0d26497f3bf","source":{"kind":"arxiv","id":"2605.16213","version":1},"attestation_state":"computed","paper":{"title":"ADS-IMC: Accelerating Data Sorting with In-Memory Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"In-memory sorting using 6T SRAM cuts data movement costs by keeping operations inside memory.","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Narendra Singh Dhakad, Santosh Kumar Vishvakarma","submitted_at":"2026-05-15T17:27:52Z","abstract_excerpt":"Sorting is a fundamental operation across numerous computational domains. Traditionally, this process involves transferring data from main memory to a processing unit for sorting, followed by writing the sorted data back to memory. This conventional approach incurs substantial latency and energy overheads due to the extensive data movement between memory and processing components. To mitigate these overheads, this paper introduces novel architectures for executing sorting operations directly within the memory fabric, eliminating the need for off-chip data transfer. To our knowledge, this work "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.16213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-15T17:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"5c8567909aa7eab9365681d9e07a2a883307edd5720a241973a447a027ad9cbc","abstract_canon_sha256":"1e9add68110e6bde71ef9f0008eef096479b7a32da193eb73420851bbf2b3443"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:58.306685Z","signature_b64":"3kRl83fHGMekIV/ATlW35ZrckIlg+3p4Ks9t8u4vedXoPRkA5pby7X8URCoPAX51dv6RINRNv4bjYoHEm3LFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc5ebe8a1194c7cb6cdd671affb1f74f36edf73626d1758553ab0d26497f3bf","last_reissued_at":"2026-05-20T00:01:58.305887Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:58.305887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADS-IMC: Accelerating Data Sorting with In-Memory Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"In-memory sorting using 6T SRAM cuts data movement costs by keeping operations inside memory.","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Narendra Singh Dhakad, Santosh Kumar Vishvakarma","submitted_at":"2026-05-15T17:27:52Z","abstract_excerpt":"Sorting is a fundamental operation across numerous computational domains. Traditionally, this process involves transferring data from main memory to a processing unit for sorting, followed by writing the sorted data back to memory. This conventional approach incurs substantial latency and energy overheads due to the extensive data movement between memory and processing components. To mitigate these overheads, this paper introduces novel architectures for executing sorting operations directly within the memory fabric, eliminating the need for off-chip data transfer. To our knowledge, this work "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Presents the first in-memory sorting design using 6T SRAM that delivers 3.4 times lower latency than memristor-based methods.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"In-memory sorting using 6T SRAM cuts data movement costs by keeping operations inside memory.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"91bcc90c43964879319dc0a46b17fa67473617788e0a5171a8828731d50f5131"},"source":{"id":"2605.16213","kind":"arxiv","version":1},"verdict":{"id":"328ab6dd-baba-4878-bceb-e0525a1cddc6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:18:30.777640Z","strongest_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.","one_line_summary":"Presents the first in-memory sorting design using 6T SRAM that delivers 3.4 times lower latency than memristor-based methods.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":"In-memory sorting using 6T SRAM cuts data movement costs by keeping operations inside memory."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16213/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.723094Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:30:52.387680Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T17:49:44.672045Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T17:49:44.161953Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:24.801959Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:33.803773Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T17:22:06.533173Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.391796Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c518934b060fd55924a37f838bd4e6154a067f186e88cd05b613b915893fb3c3"},"references":{"count":17,"sample":[{"doi":"","year":2006,"title":"Gputerasort: high performance graphics co-processor sorting for large database man- agement,","work_id":"e40c5897-9e9c-4b8a-9a42-0420ab00a96b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Implementing sorting in database systems,","work_id":"782720b9-08a2-49a7-89d0-8d15bef67b9a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"Implementing scheduling algorithms in high-speed networks,","work_id":"503bfc59-2802-4266-98a0-e3eb3bdc8bdf","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"A novel sorting algorithm and its application to a gamma-ray telescope asynchronous data acquisition system,","work_id":"16469442-fd13-420e-9e56-154aa461337a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Review on sorting algorithms a comparative study,","work_id":"32bfc2e7-b40c-4b42-b448-77bb9b940318","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"c17e49c9db18c29ea554457e0030a350335f5e848930e0fe656ba7148879060c","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.16213","created_at":"2026-05-20T00:01:58.306022+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16213v1","created_at":"2026-05-20T00:01:58.306022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16213","created_at":"2026-05-20T00:01:58.306022+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PC6X2FBDFGH","created_at":"2026-05-20T00:01:58.306022+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PC6X2FBDFGHZNWN","created_at":"2026-05-20T00:01:58.306022+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PC6X2FB","created_at":"2026-05-20T00:01:58.306022+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT","json":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT.json","graph_json":"https://pith.science/api/pith-number/3PC6X2FBDFGHZNWN2ZY276Y7OT/graph.json","events_json":"https://pith.science/api/pith-number/3PC6X2FBDFGHZNWN2ZY276Y7OT/events.json","paper":"https://pith.science/paper/3PC6X2FB"},"agent_actions":{"view_html":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT","download_json":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT.json","view_paper":"https://pith.science/paper/3PC6X2FB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16213&json=true","fetch_graph":"https://pith.science/api/pith-number/3PC6X2FBDFGHZNWN2ZY276Y7OT/graph.json","fetch_events":"https://pith.science/api/pith-number/3PC6X2FBDFGHZNWN2ZY276Y7OT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT/action/storage_attestation","attest_author":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT/action/author_attestation","sign_citation":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT/action/citation_signature","submit_replication":"https://pith.science/pith/3PC6X2FBDFGHZNWN2ZY276Y7OT/action/replication_record"}},"created_at":"2026-05-20T00:01:58.306022+00:00","updated_at":"2026-05-20T00:01:58.306022+00:00"}