{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ENWU6IBJSTZZJTTACT5NFISHAH","short_pith_number":"pith:ENWU6IBJ","canonical_record":{"source":{"id":"1803.08005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-03-06T10:04:29Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c4cce8ddee1e900e021903ee78bbe132b0164aa6b0f311ee109d261562e8a3d4","abstract_canon_sha256":"43c67b0ff43e7dbf4db68b2d05490b64b43bb33875dd9b82b380685a70469ed2"},"schema_version":"1.0"},"canonical_sha256":"236d4f202994f394ce6014fad2a24701cabdd961919ce6de34438cadc213d15a","source":{"kind":"arxiv","id":"1803.08005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08005","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08005v1","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08005","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"ENWU6IBJSTZZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENWU6IBJSTZZJTTA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENWU6IBJ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ENWU6IBJSTZZJTTACT5NFISHAH","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-03-06T10:04:29Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c4cce8ddee1e900e021903ee78bbe132b0164aa6b0f311ee109d261562e8a3d4","abstract_canon_sha256":"43c67b0ff43e7dbf4db68b2d05490b64b43bb33875dd9b82b380685a70469ed2"},"schema_version":"1.0"},"canonical_sha256":"236d4f202994f394ce6014fad2a24701cabdd961919ce6de34438cadc213d15a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:28.279845Z","signature_b64":"Sq6QsiSdBkJxGqZt9VxODMKBG0mI8rz+qZXkc8Bm7A5pnADwPODDaOqtw0vSWqqUOdndLxk3pnIQZSlsm64ACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"236d4f202994f394ce6014fad2a24701cabdd961919ce6de34438cadc213d15a","last_reissued_at":"2026-05-18T00:20:28.279309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:28.279309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08005","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-05-18T00:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQY8QUiJzU8wj/aWrMpXxU12WZBTL1puyZACJGX9eIJGXwwO/Y8uD1KgXCct2ySF4jdwAvGysHpdcanJNCLIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:26:21.485814Z"},"content_sha256":"9e6b1621ee7dd3599074efb90f65e003178b7f77490cec3f9bb733d455622118","schema_version":"1.0","event_id":"sha256:9e6b1621ee7dd3599074efb90f65e003178b7f77490cec3f9bb733d455622118"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ENWU6IBJSTZZJTTACT5NFISHAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Approach for Fast and Accurate Mean Error Distance Computation in Approximate Adders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.OH","authors_text":"Anindya Sundar Dhar, Avishek Sinha Roy","submitted_at":"2018-03-06T10:04:29Z","abstract_excerpt":"In error-tolerant applications, approximate adders have been exploited extensively to achieve energy efficient system designs. Mean error distance is one of the important error metrics used as a performance measure of approximate adders. In this work, a fast and efficient methodology is proposed to determine the exact mean error distance in approximate lower significant bit adders. A detailed description of the proposed algorithm along with an example has been demonstrated in this paper. Experimental analysis shows that the proposed method performs better than existing Monte Carlo simulation a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08005","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":""},"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-05-18T00:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Seg7TuUo1txpBYTCxW+DtBF4caRHNrk8HZkB2feg0GwLbXGfOIz8rAFOKT/jDbxrxGRDVNMi4e+2oAJQqciFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:26:21.486171Z"},"content_sha256":"ed21047875b176e733d03ff8cb5f11d3dd91643ec5787b23d5d356c003539adb","schema_version":"1.0","event_id":"sha256:ed21047875b176e733d03ff8cb5f11d3dd91643ec5787b23d5d356c003539adb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENWU6IBJSTZZJTTACT5NFISHAH/bundle.json","state_url":"https://pith.science/pith/ENWU6IBJSTZZJTTACT5NFISHAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENWU6IBJSTZZJTTACT5NFISHAH/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-06-29T05:26:21Z","links":{"resolver":"https://pith.science/pith/ENWU6IBJSTZZJTTACT5NFISHAH","bundle":"https://pith.science/pith/ENWU6IBJSTZZJTTACT5NFISHAH/bundle.json","state":"https://pith.science/pith/ENWU6IBJSTZZJTTACT5NFISHAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENWU6IBJSTZZJTTACT5NFISHAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ENWU6IBJSTZZJTTACT5NFISHAH","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":"43c67b0ff43e7dbf4db68b2d05490b64b43bb33875dd9b82b380685a70469ed2","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-03-06T10:04:29Z","title_canon_sha256":"c4cce8ddee1e900e021903ee78bbe132b0164aa6b0f311ee109d261562e8a3d4"},"schema_version":"1.0","source":{"id":"1803.08005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08005","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08005v1","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08005","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"ENWU6IBJSTZZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENWU6IBJSTZZJTTA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENWU6IBJ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:ed21047875b176e733d03ff8cb5f11d3dd91643ec5787b23d5d356c003539adb","target":"graph","created_at":"2026-05-18T00:20:28Z","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"},"paper":{"abstract_excerpt":"In error-tolerant applications, approximate adders have been exploited extensively to achieve energy efficient system designs. Mean error distance is one of the important error metrics used as a performance measure of approximate adders. In this work, a fast and efficient methodology is proposed to determine the exact mean error distance in approximate lower significant bit adders. A detailed description of the proposed algorithm along with an example has been demonstrated in this paper. Experimental analysis shows that the proposed method performs better than existing Monte Carlo simulation a","authors_text":"Anindya Sundar Dhar, Avishek Sinha Roy","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-03-06T10:04:29Z","title":"A Novel Approach for Fast and Accurate Mean Error Distance Computation in Approximate Adders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08005","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:9e6b1621ee7dd3599074efb90f65e003178b7f77490cec3f9bb733d455622118","target":"record","created_at":"2026-05-18T00:20:28Z","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":"43c67b0ff43e7dbf4db68b2d05490b64b43bb33875dd9b82b380685a70469ed2","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-03-06T10:04:29Z","title_canon_sha256":"c4cce8ddee1e900e021903ee78bbe132b0164aa6b0f311ee109d261562e8a3d4"},"schema_version":"1.0","source":{"id":"1803.08005","kind":"arxiv","version":1}},"canonical_sha256":"236d4f202994f394ce6014fad2a24701cabdd961919ce6de34438cadc213d15a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"236d4f202994f394ce6014fad2a24701cabdd961919ce6de34438cadc213d15a","first_computed_at":"2026-05-18T00:20:28.279309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:28.279309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sq6QsiSdBkJxGqZt9VxODMKBG0mI8rz+qZXkc8Bm7A5pnADwPODDaOqtw0vSWqqUOdndLxk3pnIQZSlsm64ACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:28.279845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e6b1621ee7dd3599074efb90f65e003178b7f77490cec3f9bb733d455622118","sha256:ed21047875b176e733d03ff8cb5f11d3dd91643ec5787b23d5d356c003539adb"],"state_sha256":"bfb6ba4f3b949e696cacc8652332d1a419aac38a1a948edf6e8cd2c184f774d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7mopfZFYF7Z7fheOzB6xMtVs0vyHiQeCVcP2GRdSnjwy7E5JD7aOQtoW3pzbHS4R5uDcyINJmuclIITHoTPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T05:26:21.488014Z","bundle_sha256":"b96a87af8488eebb85e03dd6943cf8c2c1800a1c92467afb23aa20793c821e5a"}}