{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5KQUC76QEHRYTBNIXBTBBBDFK4","short_pith_number":"pith:5KQUC76Q","schema_version":"1.0","canonical_sha256":"eaa1417fd021e38985a8b86610846557165f7a5074dbc173bde59b7f026b8eff","source":{"kind":"arxiv","id":"2412.15888","version":1},"attestation_state":"computed","paper":{"title":"IMPLY-based Approximate Full Adders for Efficient Arithmetic Operations in Image Processing and Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.ET","authors_text":"Caoyueshan Fan, Fabian Seiler, Gulafshan, Melanie Qiu, Nima TaheriNejad, Salar Shakibhamedan","submitted_at":"2024-12-20T13:36:40Z","abstract_excerpt":"To overcome the performance limitations in modern computing, such as the power wall, emerging computing paradigms are gaining increasing importance. Approximate computing offers a promising solution by substantially enhancing energy efficiency and reducing latency, albeit with a trade-off in accuracy. Another emerging method is memristor-based In-Memory Computing (IMC) which has the potential to overcome the Von Neumann bottleneck. In this work, we combine these two approaches and propose two Serial APProximate IMPLY-based full adders (SAPPI). When embedded in a Ripple Carry Adder (RCA), our d"},"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":"2412.15888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2024-12-20T13:36:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ca63178185cc795f6a5dec196fe7d2b973c410f99961815c3be9e1fd076b4dbe","abstract_canon_sha256":"982bb684ab721528f0d6d2a2ae86291ec764a63bf35b927e12af58fe5bff73be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:31.652541Z","signature_b64":"rwKaNwlSh5Jt5bBL0vhZdy4E2TAUX6HTKWA1iWalONidAPWCvCYwerZUXDLQP0THQmGkB3JUEPv9zcX0u86nDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaa1417fd021e38985a8b86610846557165f7a5074dbc173bde59b7f026b8eff","last_reissued_at":"2026-07-05T09:52:31.652035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:31.652035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"IMPLY-based Approximate Full Adders for Efficient Arithmetic Operations in Image Processing and Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.ET","authors_text":"Caoyueshan Fan, Fabian Seiler, Gulafshan, Melanie Qiu, Nima TaheriNejad, Salar Shakibhamedan","submitted_at":"2024-12-20T13:36:40Z","abstract_excerpt":"To overcome the performance limitations in modern computing, such as the power wall, emerging computing paradigms are gaining increasing importance. Approximate computing offers a promising solution by substantially enhancing energy efficiency and reducing latency, albeit with a trade-off in accuracy. Another emerging method is memristor-based In-Memory Computing (IMC) which has the potential to overcome the Von Neumann bottleneck. In this work, we combine these two approaches and propose two Serial APProximate IMPLY-based full adders (SAPPI). When embedded in a Ripple Carry Adder (RCA), our d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15888","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/2412.15888/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":"2412.15888","created_at":"2026-07-05T09:52:31.652093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.15888v1","created_at":"2026-07-05T09:52:31.652093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15888","created_at":"2026-07-05T09:52:31.652093+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KQUC76QEHRY","created_at":"2026-07-05T09:52:31.652093+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KQUC76QEHRYTBNI","created_at":"2026-07-05T09:52:31.652093+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KQUC76Q","created_at":"2026-07-05T09:52:31.652093+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/5KQUC76QEHRYTBNIXBTBBBDFK4","json":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4.json","graph_json":"https://pith.science/api/pith-number/5KQUC76QEHRYTBNIXBTBBBDFK4/graph.json","events_json":"https://pith.science/api/pith-number/5KQUC76QEHRYTBNIXBTBBBDFK4/events.json","paper":"https://pith.science/paper/5KQUC76Q"},"agent_actions":{"view_html":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4","download_json":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4.json","view_paper":"https://pith.science/paper/5KQUC76Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.15888&json=true","fetch_graph":"https://pith.science/api/pith-number/5KQUC76QEHRYTBNIXBTBBBDFK4/graph.json","fetch_events":"https://pith.science/api/pith-number/5KQUC76QEHRYTBNIXBTBBBDFK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4/action/storage_attestation","attest_author":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4/action/author_attestation","sign_citation":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4/action/citation_signature","submit_replication":"https://pith.science/pith/5KQUC76QEHRYTBNIXBTBBBDFK4/action/replication_record"}},"created_at":"2026-07-05T09:52:31.652093+00:00","updated_at":"2026-07-05T09:52:31.652093+00:00"}