{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BOGJGQ7UHCKI22DTWJMUTVG3A6","short_pith_number":"pith:BOGJGQ7U","schema_version":"1.0","canonical_sha256":"0b8c9343f438948d6873b25949d4db07b3355988204210197a61c8b65a14c0a0","source":{"kind":"arxiv","id":"2012.09918","version":3},"attestation_state":"computed","paper":{"title":"Sorting in Memristive Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.ET","authors_text":"M. Hassan Najafi, Mohsen Riahi Alam, Nima TaheriNejad","submitted_at":"2020-12-17T20:25:02Z","abstract_excerpt":"Sorting is needed in many application domains. The data is read from memory and sent to a general purpose processor or application specific hardware for sorting. The sorted data is then written back to the memory. Reading/writing data from/to memory and transferring data between memory and processing unit incur a large latency and energy overhead. In this work, we develop, to the best of our knowledge, the first architectures for in-memory sorting of data. We propose two architectures. The first architecture is applicable to the conventional format of representing data, weighted binary radix. "},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2012.09918","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2020-12-17T20:25:02Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"15cc393cdcad8e7689e52e2c4bbb22938a784d778a7f339529973beb79fd6af1","abstract_canon_sha256":"417075b645a7d416a16f35b4e501a9540b6b73f17c3bdb77725cfd52f11b7520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:19.002879Z","signature_b64":"UbiO3hZIyjtmaovBMFyoLTyy0VYrySydAuSayRaK3D3fNT2sHOYQwNTv1jP+52srFCdwKqb0Bb3/iME71SJ3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8c9343f438948d6873b25949d4db07b3355988204210197a61c8b65a14c0a0","last_reissued_at":"2026-07-05T03:54:19.002415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:19.002415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting in Memristive Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.ET","authors_text":"M. Hassan Najafi, Mohsen Riahi Alam, Nima TaheriNejad","submitted_at":"2020-12-17T20:25:02Z","abstract_excerpt":"Sorting is needed in many application domains. The data is read from memory and sent to a general purpose processor or application specific hardware for sorting. The sorted data is then written back to the memory. Reading/writing data from/to memory and transferring data between memory and processing unit incur a large latency and energy overhead. In this work, we develop, to the best of our knowledge, the first architectures for in-memory sorting of data. We propose two architectures. The first architecture is applicable to the conventional format of representing data, weighted binary radix. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09918","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.09918/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":"2012.09918","created_at":"2026-07-05T03:54:19.002471+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.09918v3","created_at":"2026-07-05T03:54:19.002471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09918","created_at":"2026-07-05T03:54:19.002471+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOGJGQ7UHCKI","created_at":"2026-07-05T03:54:19.002471+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOGJGQ7UHCKI22DT","created_at":"2026-07-05T03:54:19.002471+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOGJGQ7U","created_at":"2026-07-05T03:54:19.002471+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/BOGJGQ7UHCKI22DTWJMUTVG3A6","json":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6.json","graph_json":"https://pith.science/api/pith-number/BOGJGQ7UHCKI22DTWJMUTVG3A6/graph.json","events_json":"https://pith.science/api/pith-number/BOGJGQ7UHCKI22DTWJMUTVG3A6/events.json","paper":"https://pith.science/paper/BOGJGQ7U"},"agent_actions":{"view_html":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6","download_json":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6.json","view_paper":"https://pith.science/paper/BOGJGQ7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.09918&json=true","fetch_graph":"https://pith.science/api/pith-number/BOGJGQ7UHCKI22DTWJMUTVG3A6/graph.json","fetch_events":"https://pith.science/api/pith-number/BOGJGQ7UHCKI22DTWJMUTVG3A6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/action/storage_attestation","attest_author":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/action/author_attestation","sign_citation":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/action/citation_signature","submit_replication":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/action/replication_record"}},"created_at":"2026-07-05T03:54:19.002471+00:00","updated_at":"2026-07-05T03:54:19.002471+00:00"}