{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DI7TCS3BIUP5HPVCAG545HIRUQ","short_pith_number":"pith:DI7TCS3B","schema_version":"1.0","canonical_sha256":"1a3f314b61451fd3bea201bbce9d11a43563b33f2dff057b8cf3a63a1e6a84fe","source":{"kind":"arxiv","id":"2412.17966","version":1},"attestation_state":"computed","paper":{"title":"tuGEMM: Area-Power-Efficient Temporal Unary GEMM Architecture for Low-Precision Edge AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.AR","authors_text":"Albert Chen, Anna Li, Harideep Nair, John Paul Shen, Joseph Finn, Manav Trivedi, Prabhu Vellaisamy","submitted_at":"2024-12-23T20:30:28Z","abstract_excerpt":"General matrix multiplication (GEMM) is a ubiquitous computing kernel/algorithm for data processing in diverse applications, including artificial intelligence (AI) and deep learning (DL). Recent shift towards edge computing has inspired GEMM architectures based on unary computing, which are predominantly stochastic and rate-coded systems. This paper proposes a novel GEMM architecture based on temporal-coding, called tuGEMM, that performs exact computation. We introduce two variants of tuGEMM, serial and parallel, with distinct area/power-latency trade-offs. Post-synthesis Power-Performance-Are"},"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.17966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-12-23T20:30:28Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ed3689f597c3afc0f3b1adb5c8686d5c0b246a78ff985d698a5379f3d5f786d5","abstract_canon_sha256":"592a494c026e112129abb5dced42c7fe8cfc2725f3365144385a3a917539cf39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:31.512957Z","signature_b64":"Ne064u0eoK34W8inbDzzoS8U6ZcTqegdVhGpza03nNE5ay9KKq/wc2Sd/nqlDgitVr+f1u6camCZexdb0xmFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a3f314b61451fd3bea201bbce9d11a43563b33f2dff057b8cf3a63a1e6a84fe","last_reissued_at":"2026-07-05T09:53:31.512538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:31.512538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"tuGEMM: Area-Power-Efficient Temporal Unary GEMM Architecture for Low-Precision Edge AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.AR","authors_text":"Albert Chen, Anna Li, Harideep Nair, John Paul Shen, Joseph Finn, Manav Trivedi, Prabhu Vellaisamy","submitted_at":"2024-12-23T20:30:28Z","abstract_excerpt":"General matrix multiplication (GEMM) is a ubiquitous computing kernel/algorithm for data processing in diverse applications, including artificial intelligence (AI) and deep learning (DL). Recent shift towards edge computing has inspired GEMM architectures based on unary computing, which are predominantly stochastic and rate-coded systems. This paper proposes a novel GEMM architecture based on temporal-coding, called tuGEMM, that performs exact computation. We introduce two variants of tuGEMM, serial and parallel, with distinct area/power-latency trade-offs. Post-synthesis Power-Performance-Are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17966","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.17966/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.17966","created_at":"2026-07-05T09:53:31.512592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17966v1","created_at":"2026-07-05T09:53:31.512592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17966","created_at":"2026-07-05T09:53:31.512592+00:00"},{"alias_kind":"pith_short_12","alias_value":"DI7TCS3BIUP5","created_at":"2026-07-05T09:53:31.512592+00:00"},{"alias_kind":"pith_short_16","alias_value":"DI7TCS3BIUP5HPVC","created_at":"2026-07-05T09:53:31.512592+00:00"},{"alias_kind":"pith_short_8","alias_value":"DI7TCS3B","created_at":"2026-07-05T09:53:31.512592+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/DI7TCS3BIUP5HPVCAG545HIRUQ","json":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ.json","graph_json":"https://pith.science/api/pith-number/DI7TCS3BIUP5HPVCAG545HIRUQ/graph.json","events_json":"https://pith.science/api/pith-number/DI7TCS3BIUP5HPVCAG545HIRUQ/events.json","paper":"https://pith.science/paper/DI7TCS3B"},"agent_actions":{"view_html":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ","download_json":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ.json","view_paper":"https://pith.science/paper/DI7TCS3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17966&json=true","fetch_graph":"https://pith.science/api/pith-number/DI7TCS3BIUP5HPVCAG545HIRUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DI7TCS3BIUP5HPVCAG545HIRUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ/action/storage_attestation","attest_author":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ/action/author_attestation","sign_citation":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ/action/citation_signature","submit_replication":"https://pith.science/pith/DI7TCS3BIUP5HPVCAG545HIRUQ/action/replication_record"}},"created_at":"2026-07-05T09:53:31.512592+00:00","updated_at":"2026-07-05T09:53:31.512592+00:00"}