{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WFKQDQSVR2QMQTT5WFAGHKDSMS","short_pith_number":"pith:WFKQDQSV","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"},"canonical_sha256":"b15501c2558ea0c84e7db14063a87264941dd737f33f56f5098df95be2c868fa","source":{"kind":"arxiv","id":"2202.10424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.10424","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"2202.10424v1","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10424","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"WFKQDQSVR2QM","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"pith_short_16","alias_value":"WFKQDQSVR2QMQTT5","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"pith_short_8","alias_value":"WFKQDQSV","created_at":"2026-07-05T03:58:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WFKQDQSVR2QMQTT5WFAGHKDSMS","target":"record","payload":{"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"},"canonical_sha256":"b15501c2558ea0c84e7db14063a87264941dd737f33f56f5098df95be2c868fa","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"},"source_kind":"arxiv","source_id":"2202.10424","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GshhLcRQHAMsUUDfx8HJOWml+kiterpL18CUK1U9sL+QzAsT3742Jj20l6Hx50AiY4YC05ZOob3g7enVEIVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:39:56.683884Z"},"content_sha256":"4b11ea2f0e487d1632c588daf3312c3a75dd5a1852f16de333f7ef5d1f847f48","schema_version":"1.0","event_id":"sha256:4b11ea2f0e487d1632c588daf3312c3a75dd5a1852f16de333f7ef5d1f847f48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WFKQDQSVR2QMQTT5WFAGHKDSMS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2ofTAYRg+rFKCEJ0ptfE/bvjZ+2jhvrySMMxqnoUI0ajH1IROKtvw9I/bPo7ZIYkMQesk66vmgp6GGtJPC8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:39:56.684375Z"},"content_sha256":"14e1c176316483a5d708a5627f6e6c08ff66c3aa18b0e8350e3246fe25d5fd28","schema_version":"1.0","event_id":"sha256:14e1c176316483a5d708a5627f6e6c08ff66c3aa18b0e8350e3246fe25d5fd28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/bundle.json","state_url":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T15:39:56Z","links":{"resolver":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS","bundle":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/bundle.json","state":"https://pith.science/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFKQDQSVR2QMQTT5WFAGHKDSMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WFKQDQSVR2QMQTT5WFAGHKDSMS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b6447df49d3efcd90e01b7889dc60036d1d6a86e1c9d0ac0676e9c430bafec20","cross_cats_sorted":["eess.SP"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AR","submitted_at":"2022-02-15T09:20:22Z","title_canon_sha256":"e2765213faf847ad39c192601cd3f53d959e2a9320a3cb8318a72425c3b99470"},"schema_version":"1.0","source":{"id":"2202.10424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.10424","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"2202.10424v1","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10424","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"WFKQDQSVR2QM","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"pith_short_16","alias_value":"WFKQDQSVR2QMQTT5","created_at":"2026-07-05T03:58:42Z"},{"alias_kind":"pith_short_8","alias_value":"WFKQDQSV","created_at":"2026-07-05T03:58:42Z"}],"graph_snapshots":[{"event_id":"sha256:14e1c176316483a5d708a5627f6e6c08ff66c3aa18b0e8350e3246fe25d5fd28","target":"graph","created_at":"2026-07-05T03:58:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.10424/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Lianfeng Yu, Yaoyu Tao, Yuchao Yang, Zhaokun Jing","cross_cats":["eess.SP"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AR","submitted_at":"2022-02-15T09:20:22Z","title":"Fast and Scalable Memristive In-Memory Sorting with Column-Skipping Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10424","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b11ea2f0e487d1632c588daf3312c3a75dd5a1852f16de333f7ef5d1f847f48","target":"record","created_at":"2026-07-05T03:58:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b6447df49d3efcd90e01b7889dc60036d1d6a86e1c9d0ac0676e9c430bafec20","cross_cats_sorted":["eess.SP"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AR","submitted_at":"2022-02-15T09:20:22Z","title_canon_sha256":"e2765213faf847ad39c192601cd3f53d959e2a9320a3cb8318a72425c3b99470"},"schema_version":"1.0","source":{"id":"2202.10424","kind":"arxiv","version":1}},"canonical_sha256":"b15501c2558ea0c84e7db14063a87264941dd737f33f56f5098df95be2c868fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b15501c2558ea0c84e7db14063a87264941dd737f33f56f5098df95be2c868fa","first_computed_at":"2026-07-05T03:58:42.249139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:58:42.249139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oyLwHfXjJufNHuk4RQZ+J6t5oU+0Q+3zhAsG6EQqvxu+PRHPi0knQ2sDZ74Z++pba8NdKEzIvVpld5aKEYcYCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:58:42.249484Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.10424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b11ea2f0e487d1632c588daf3312c3a75dd5a1852f16de333f7ef5d1f847f48","sha256:14e1c176316483a5d708a5627f6e6c08ff66c3aa18b0e8350e3246fe25d5fd28"],"state_sha256":"47235877190cb67c9011f2c8b7851055dfdcdb5bea11fc6ddf94d72f29c97dbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3o1CUyZxs4sebVuMLeyhlYnp4fCNxBnSzk0dIK1xU4RxpI6fAzhoacOyrIx9pJfMLSxshj+fAs6SDt1swtCGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:39:56.687738Z","bundle_sha256":"4b4a2cb1e71decbdefc9bc9cea418d33c3a2d3c7df3cff411b7a371700020291"}}