{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:BOGJGQ7UHCKI22DTWJMUTVG3A6","short_pith_number":"pith:BOGJGQ7U","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"},"canonical_sha256":"0b8c9343f438948d6873b25949d4db07b3355988204210197a61c8b65a14c0a0","source":{"kind":"arxiv","id":"2012.09918","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09918","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09918v3","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09918","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"pith_short_12","alias_value":"BOGJGQ7UHCKI","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"pith_short_16","alias_value":"BOGJGQ7UHCKI22DT","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"pith_short_8","alias_value":"BOGJGQ7U","created_at":"2026-07-05T03:54:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:BOGJGQ7UHCKI22DTWJMUTVG3A6","target":"record","payload":{"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"},"canonical_sha256":"0b8c9343f438948d6873b25949d4db07b3355988204210197a61c8b65a14c0a0","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"},"source_kind":"arxiv","source_id":"2012.09918","source_version":3,"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:54:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0R3Pgew40ECp0fpLJEyiSc+IYp3hQxNFZIyLqqATC+JxQ1MOep/a+QuEUUmbamzYFADJ2e3kQNmt2wmy15dGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:10:02.221861Z"},"content_sha256":"be5bf8f9b7088d19bf86bfcaaebb9efee8c52191ad4c6e40e3906e762d650a31","schema_version":"1.0","event_id":"sha256:be5bf8f9b7088d19bf86bfcaaebb9efee8c52191ad4c6e40e3906e762d650a31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:BOGJGQ7UHCKI22DTWJMUTVG3A6","target":"graph","payload":{"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"},"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:54:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsj+9Xak97ajKRiaZ+IlUpRaYRzVl03BT/6NaXYMBNyYPyHJJvRZeVqu/29T6Lse+832Q3Y+JCSD7O7C6OJEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:10:02.222399Z"},"content_sha256":"67784604304c85facd05b47f81c81697b28783a519cdfb7e681d71ec3cbc8429","schema_version":"1.0","event_id":"sha256:67784604304c85facd05b47f81c81697b28783a519cdfb7e681d71ec3cbc8429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/bundle.json","state_url":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/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-15T02:10:02Z","links":{"resolver":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6","bundle":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/bundle.json","state":"https://pith.science/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOGJGQ7UHCKI22DTWJMUTVG3A6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:BOGJGQ7UHCKI22DTWJMUTVG3A6","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":"417075b645a7d416a16f35b4e501a9540b6b73f17c3bdb77725cfd52f11b7520","cross_cats_sorted":["cs.AR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2020-12-17T20:25:02Z","title_canon_sha256":"15cc393cdcad8e7689e52e2c4bbb22938a784d778a7f339529973beb79fd6af1"},"schema_version":"1.0","source":{"id":"2012.09918","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09918","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09918v3","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09918","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"pith_short_12","alias_value":"BOGJGQ7UHCKI","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"pith_short_16","alias_value":"BOGJGQ7UHCKI22DT","created_at":"2026-07-05T03:54:19Z"},{"alias_kind":"pith_short_8","alias_value":"BOGJGQ7U","created_at":"2026-07-05T03:54:19Z"}],"graph_snapshots":[{"event_id":"sha256:67784604304c85facd05b47f81c81697b28783a519cdfb7e681d71ec3cbc8429","target":"graph","created_at":"2026-07-05T03:54:19Z","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/2012.09918/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. ","authors_text":"M. Hassan Najafi, Mohsen Riahi Alam, Nima TaheriNejad","cross_cats":["cs.AR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2020-12-17T20:25:02Z","title":"Sorting in Memristive Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09918","kind":"arxiv","version":3},"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:be5bf8f9b7088d19bf86bfcaaebb9efee8c52191ad4c6e40e3906e762d650a31","target":"record","created_at":"2026-07-05T03:54:19Z","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":"417075b645a7d416a16f35b4e501a9540b6b73f17c3bdb77725cfd52f11b7520","cross_cats_sorted":["cs.AR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2020-12-17T20:25:02Z","title_canon_sha256":"15cc393cdcad8e7689e52e2c4bbb22938a784d778a7f339529973beb79fd6af1"},"schema_version":"1.0","source":{"id":"2012.09918","kind":"arxiv","version":3}},"canonical_sha256":"0b8c9343f438948d6873b25949d4db07b3355988204210197a61c8b65a14c0a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b8c9343f438948d6873b25949d4db07b3355988204210197a61c8b65a14c0a0","first_computed_at":"2026-07-05T03:54:19.002415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:54:19.002415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbiO3hZIyjtmaovBMFyoLTyy0VYrySydAuSayRaK3D3fNT2sHOYQwNTv1jP+52srFCdwKqb0Bb3/iME71SJ3AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:54:19.002879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.09918","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be5bf8f9b7088d19bf86bfcaaebb9efee8c52191ad4c6e40e3906e762d650a31","sha256:67784604304c85facd05b47f81c81697b28783a519cdfb7e681d71ec3cbc8429"],"state_sha256":"21f811735819e85271b232cd661dc8648af4d9ef47639c19ce02cf849920c5b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2L0wdQLWROko2OKNx7PlmoQV2Q/sf4dNnE6pAuregWaYOhK79JZ4IbrYHqAusCuUAmR/NHN+ckdeVr72p97CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T02:10:02.230000Z","bundle_sha256":"eef6398f35fea647e8424ad3e37d3ecdbcf306ee8b7483c4879012b4cb122981"}}