{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WFKQDQSVR2QMQTT5WFAGHKDSMS","short_pith_number":"pith:WFKQDQSV","schema_version":"1.0","canonical_sha256":"b15501c2558ea0c84e7db14063a87264941dd737f33f56f5098df95be2c868fa","source":{"kind":"arxiv","id":"2202.10424","version":1},"attestation_state":"computed","paper":{"title":"Fast and Scalable Memristive In-Memory Sorting with Column-Skipping Algorithm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.AR","authors_text":"Lianfeng Yu, Yaoyu Tao, Yuchao Yang, Zhaokun Jing","submitted_at":"2022-02-15T09:20:22Z","abstract_excerpt":"Memristive in-memory sorting has been proposed recently to improve hardware sorting efficiency. Using iterative in-memory min computations, data movements between memory and external processing units can be eliminated for improved latency and energy efficiency. However, the bit-traversal algorithm to search the min requires a large number of column reads on memristive memory. In this work, we propose a column-skipping algorithm with help of a near-memory circuit. Redundant column reads can be skipped based on recorded states for improved latency and hardware efficiency. To enhance the scalabil"},"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":"2202.10424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AR","submitted_at":"2022-02-15T09:20:22Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"e2765213faf847ad39c192601cd3f53d959e2a9320a3cb8318a72425c3b99470","abstract_canon_sha256":"b6447df49d3efcd90e01b7889dc60036d1d6a86e1c9d0ac0676e9c430bafec20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:42.249484Z","signature_b64":"oyLwHfXjJufNHuk4RQZ+J6t5oU+0Q+3zhAsG6EQqvxu+PRHPi0knQ2sDZ74Z++pba8NdKEzIvVpld5aKEYcYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b15501c2558ea0c84e7db14063a87264941dd737f33f56f5098df95be2c868fa","last_reissued_at":"2026-07-05T03:58:42.249139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:42.249139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Scalable Memristive In-Memory Sorting with Column-Skipping Algorithm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.AR","authors_text":"Lianfeng Yu, Yaoyu Tao, Yuchao Yang, Zhaokun Jing","submitted_at":"2022-02-15T09:20:22Z","abstract_excerpt":"Memristive in-memory sorting has been proposed recently to improve hardware sorting efficiency. Using iterative in-memory min computations, data movements between memory and external processing units can be eliminated for improved latency and energy efficiency. However, the bit-traversal algorithm to search the min requires a large number of column reads on memristive memory. In this work, we propose a column-skipping algorithm with help of a near-memory circuit. Redundant column reads can be skipped based on recorded states for improved latency and hardware efficiency. To enhance the scalabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10424","kind":"arxiv","version":1},"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/2202.10424/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":"2202.10424","created_at":"2026-07-05T03:58:42.249198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.10424v1","created_at":"2026-07-05T03:58:42.249198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10424","created_at":"2026-07-05T03:58:42.249198+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFKQDQSVR2QM","created_at":"2026-07-05T03:58:42.249198+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFKQDQSVR2QMQTT5","created_at":"2026-07-05T03:58:42.249198+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFKQDQSV","created_at":"2026-07-05T03:58:42.249198+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/WFKQDQSVR2QMQTT5WFAGHKDSMS","json":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS.json","graph_json":"https://pith.science/api/pith-number/WFKQDQSVR2QMQTT5WFAGHKDSMS/graph.json","events_json":"https://pith.science/api/pith-number/WFKQDQSVR2QMQTT5WFAGHKDSMS/events.json","paper":"https://pith.science/paper/WFKQDQSV"},"agent_actions":{"view_html":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS","download_json":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS.json","view_paper":"https://pith.science/paper/WFKQDQSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.10424&json=true","fetch_graph":"https://pith.science/api/pith-number/WFKQDQSVR2QMQTT5WFAGHKDSMS/graph.json","fetch_events":"https://pith.science/api/pith-number/WFKQDQSVR2QMQTT5WFAGHKDSMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/action/storage_attestation","attest_author":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/action/author_attestation","sign_citation":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/action/citation_signature","submit_replication":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/action/replication_record"}},"created_at":"2026-07-05T03:58:42.249198+00:00","updated_at":"2026-07-05T03:58:42.249198+00:00"}