{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IF4LBHGK3GQAZFGAPCTUICJ3CA","short_pith_number":"pith:IF4LBHGK","canonical_record":{"source":{"id":"2407.02921","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-07-03T08:53:54Z","cross_cats_sorted":[],"title_canon_sha256":"8e5adb22cbe63924c357a3bac0ae3ff85bf33c9f0fa35768786adf91c2916fc6","abstract_canon_sha256":"1e6274351e03f7208d3d7f888356f5638cfc0f8ada8a126d5e5dfed028ca8eac"},"schema_version":"1.0"},"canonical_sha256":"4178b09ccad9a00c94c078a744093b1032b380126c6c5e6712721119682b9a6a","source":{"kind":"arxiv","id":"2407.02921","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02921","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02921v2","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02921","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"IF4LBHGK3GQA","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"pith_short_16","alias_value":"IF4LBHGK3GQAZFGA","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"pith_short_8","alias_value":"IF4LBHGK","created_at":"2026-07-05T08:40:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IF4LBHGK3GQAZFGAPCTUICJ3CA","target":"record","payload":{"canonical_record":{"source":{"id":"2407.02921","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-07-03T08:53:54Z","cross_cats_sorted":[],"title_canon_sha256":"8e5adb22cbe63924c357a3bac0ae3ff85bf33c9f0fa35768786adf91c2916fc6","abstract_canon_sha256":"1e6274351e03f7208d3d7f888356f5638cfc0f8ada8a126d5e5dfed028ca8eac"},"schema_version":"1.0"},"canonical_sha256":"4178b09ccad9a00c94c078a744093b1032b380126c6c5e6712721119682b9a6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:20.649510Z","signature_b64":"n/c+faYrBPKH3o0XeFnq78/2Z8hQwPe6q6JEUtYmHJQULORjraPnsY235ZBRYKO20I4Wfe7tKZvymUJC7yoaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4178b09ccad9a00c94c078a744093b1032b380126c6c5e6712721119682b9a6a","last_reissued_at":"2026-07-05T08:40:20.649027Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:20.649027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.02921","source_version":2,"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-05T08:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0FHwP2ySEgPLyVtcPgZvg8IMg6TEfaUe/VcFq3OvHOzFbaIdCctvm5zHUgbTX4R/USqfmV3BuUv3YEMOQ3HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:44:58.908562Z"},"content_sha256":"85e80144bf067eeb7ae24a682b3baac6bcb8bbad24952d59519f7b85060e049a","schema_version":"1.0","event_id":"sha256:85e80144bf067eeb7ae24a682b3baac6bcb8bbad24952d59519f7b85060e049a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IF4LBHGK3GQAZFGAPCTUICJ3CA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In-Memory Mirroring: Cloning Without Reading","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Ankit Bende, Chandan Kumar Jha, Farhad Merchant, Rolf Drechsler, Sachin Patkar, Simranjeet Singh, Vikas Rana","submitted_at":"2024-07-03T08:53:54Z","abstract_excerpt":"In-memory computing (IMC) has gained significant attention recently as it attempts to reduce the impact of memory bottlenecks. Numerous schemes for digital IMC are presented in the literature, focusing on logic operations. Often, an application's description has data dependencies that must be resolved. Contemporary IMC architectures perform read followed by write operations for this purpose, which results in performance and energy penalties. To solve this fundamental problem, this paper presents in-memory mirroring (IMM). IMM eliminates the need for read and write-back steps, thus avoiding ene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02921","kind":"arxiv","version":2},"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/2407.02921/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-05T08:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mq4aeE3AMnxErCU/YGRCyS6K8LUiu2VBC2nDi7RA3DF0W1Kzmf92wTKWqpAS/sA3lW0w0aELWVSBLqI84D2WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:44:58.908934Z"},"content_sha256":"315f4fd8ec9ffa1feb49cea8d192c5d3cfeef4fa64b6fee6edc47c8e5e201c57","schema_version":"1.0","event_id":"sha256:315f4fd8ec9ffa1feb49cea8d192c5d3cfeef4fa64b6fee6edc47c8e5e201c57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IF4LBHGK3GQAZFGAPCTUICJ3CA/bundle.json","state_url":"https://pith.science/pith/IF4LBHGK3GQAZFGAPCTUICJ3CA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IF4LBHGK3GQAZFGAPCTUICJ3CA/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-07-06T11:44:58Z","links":{"resolver":"https://pith.science/pith/IF4LBHGK3GQAZFGAPCTUICJ3CA","bundle":"https://pith.science/pith/IF4LBHGK3GQAZFGAPCTUICJ3CA/bundle.json","state":"https://pith.science/pith/IF4LBHGK3GQAZFGAPCTUICJ3CA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IF4LBHGK3GQAZFGAPCTUICJ3CA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IF4LBHGK3GQAZFGAPCTUICJ3CA","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":"1e6274351e03f7208d3d7f888356f5638cfc0f8ada8a126d5e5dfed028ca8eac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-07-03T08:53:54Z","title_canon_sha256":"8e5adb22cbe63924c357a3bac0ae3ff85bf33c9f0fa35768786adf91c2916fc6"},"schema_version":"1.0","source":{"id":"2407.02921","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02921","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02921v2","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02921","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"IF4LBHGK3GQA","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"pith_short_16","alias_value":"IF4LBHGK3GQAZFGA","created_at":"2026-07-05T08:40:20Z"},{"alias_kind":"pith_short_8","alias_value":"IF4LBHGK","created_at":"2026-07-05T08:40:20Z"}],"graph_snapshots":[{"event_id":"sha256:315f4fd8ec9ffa1feb49cea8d192c5d3cfeef4fa64b6fee6edc47c8e5e201c57","target":"graph","created_at":"2026-07-05T08:40:20Z","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/2407.02921/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In-memory computing (IMC) has gained significant attention recently as it attempts to reduce the impact of memory bottlenecks. Numerous schemes for digital IMC are presented in the literature, focusing on logic operations. Often, an application's description has data dependencies that must be resolved. Contemporary IMC architectures perform read followed by write operations for this purpose, which results in performance and energy penalties. To solve this fundamental problem, this paper presents in-memory mirroring (IMM). IMM eliminates the need for read and write-back steps, thus avoiding ene","authors_text":"Ankit Bende, Chandan Kumar Jha, Farhad Merchant, Rolf Drechsler, Sachin Patkar, Simranjeet Singh, Vikas Rana","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-07-03T08:53:54Z","title":"In-Memory Mirroring: Cloning Without Reading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02921","kind":"arxiv","version":2},"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:85e80144bf067eeb7ae24a682b3baac6bcb8bbad24952d59519f7b85060e049a","target":"record","created_at":"2026-07-05T08:40:20Z","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":"1e6274351e03f7208d3d7f888356f5638cfc0f8ada8a126d5e5dfed028ca8eac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-07-03T08:53:54Z","title_canon_sha256":"8e5adb22cbe63924c357a3bac0ae3ff85bf33c9f0fa35768786adf91c2916fc6"},"schema_version":"1.0","source":{"id":"2407.02921","kind":"arxiv","version":2}},"canonical_sha256":"4178b09ccad9a00c94c078a744093b1032b380126c6c5e6712721119682b9a6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4178b09ccad9a00c94c078a744093b1032b380126c6c5e6712721119682b9a6a","first_computed_at":"2026-07-05T08:40:20.649027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:40:20.649027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n/c+faYrBPKH3o0XeFnq78/2Z8hQwPe6q6JEUtYmHJQULORjraPnsY235ZBRYKO20I4Wfe7tKZvymUJC7yoaCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:40:20.649510Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.02921","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85e80144bf067eeb7ae24a682b3baac6bcb8bbad24952d59519f7b85060e049a","sha256:315f4fd8ec9ffa1feb49cea8d192c5d3cfeef4fa64b6fee6edc47c8e5e201c57"],"state_sha256":"13fc7cd4a02e9ad701a3262f7cfac5e93988e2a307fa8733a5bbe37bb4822588"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKZ0pAVzRkMYLTxUaf3cTWD+tTD1w3nuxrWH27dswdOj4W+gRwXca73WZ4J1pg3aJ7R0c7d7pPCKEL0Z8IfcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T11:44:58.910819Z","bundle_sha256":"012de84f4b8a1e89dcfb51109fcf8f16dd06c602298d43c3337568dca89860a9"}}