{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NTALFIEZHLPG5ESMPQS7224NOB","short_pith_number":"pith:NTALFIEZ","schema_version":"1.0","canonical_sha256":"6cc0b2a0993ade6e924c7c25fd6b8d705ba46e98e4eb800c801948c607aa6149","source":{"kind":"arxiv","id":"2104.02804","version":1},"attestation_state":"computed","paper":{"title":"Efficient emotion recognition using hyperdimensional computing with combinatorial channel encoding and cellular automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","eess.SP"],"primary_cat":"cs.ET","authors_text":"Alisha Menon, Anirudh Natarajan, Daniel Sun, Harrison Liew, Jan M. Rabaey, Melvin Aristio, Reva Agashe, Yakun Sophia Shao","submitted_at":"2021-04-06T21:46:16Z","abstract_excerpt":"In this paper, a hardware-optimized approach to emotion recognition based on the efficient brain-inspired hyperdimensional computing (HDC) paradigm is proposed. Emotion recognition provides valuable information for human-computer interactions, however the large number of input channels (>200) and modalities (>3) involved in emotion recognition are significantly expensive from a memory perspective. To address this, methods for memory reduction and optimization are proposed, including a novel approach that takes advantage of the combinatorial nature of the encoding process, and an elementary cel"},"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":"2104.02804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2021-04-06T21:46:16Z","cross_cats_sorted":["cs.AR","eess.SP"],"title_canon_sha256":"01c071ce4626908d55fbe9ac8a3a548b004f2e3d5b3675166549d44836325e69","abstract_canon_sha256":"4541472c7639474794798024a92038f184312bf263a2a6033f93efba9688c287"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:59.799493Z","signature_b64":"+tIK7DGTNT89+M/edR85MpDwDlQL74BJjUQ138UT+Y+HblMzw2GIiIYfxcUMiuvijHBuv4DLzkwamGn7wUvTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc0b2a0993ade6e924c7c25fd6b8d705ba46e98e4eb800c801948c607aa6149","last_reissued_at":"2026-07-05T02:29:59.799052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:59.799052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient emotion recognition using hyperdimensional computing with combinatorial channel encoding and cellular automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","eess.SP"],"primary_cat":"cs.ET","authors_text":"Alisha Menon, Anirudh Natarajan, Daniel Sun, Harrison Liew, Jan M. Rabaey, Melvin Aristio, Reva Agashe, Yakun Sophia Shao","submitted_at":"2021-04-06T21:46:16Z","abstract_excerpt":"In this paper, a hardware-optimized approach to emotion recognition based on the efficient brain-inspired hyperdimensional computing (HDC) paradigm is proposed. Emotion recognition provides valuable information for human-computer interactions, however the large number of input channels (>200) and modalities (>3) involved in emotion recognition are significantly expensive from a memory perspective. To address this, methods for memory reduction and optimization are proposed, including a novel approach that takes advantage of the combinatorial nature of the encoding process, and an elementary cel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02804","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/2104.02804/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":"2104.02804","created_at":"2026-07-05T02:29:59.799109+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.02804v1","created_at":"2026-07-05T02:29:59.799109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02804","created_at":"2026-07-05T02:29:59.799109+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTALFIEZHLPG","created_at":"2026-07-05T02:29:59.799109+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTALFIEZHLPG5ESM","created_at":"2026-07-05T02:29:59.799109+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTALFIEZ","created_at":"2026-07-05T02:29:59.799109+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/NTALFIEZHLPG5ESMPQS7224NOB","json":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB.json","graph_json":"https://pith.science/api/pith-number/NTALFIEZHLPG5ESMPQS7224NOB/graph.json","events_json":"https://pith.science/api/pith-number/NTALFIEZHLPG5ESMPQS7224NOB/events.json","paper":"https://pith.science/paper/NTALFIEZ"},"agent_actions":{"view_html":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB","download_json":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB.json","view_paper":"https://pith.science/paper/NTALFIEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.02804&json=true","fetch_graph":"https://pith.science/api/pith-number/NTALFIEZHLPG5ESMPQS7224NOB/graph.json","fetch_events":"https://pith.science/api/pith-number/NTALFIEZHLPG5ESMPQS7224NOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB/action/storage_attestation","attest_author":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB/action/author_attestation","sign_citation":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB/action/citation_signature","submit_replication":"https://pith.science/pith/NTALFIEZHLPG5ESMPQS7224NOB/action/replication_record"}},"created_at":"2026-07-05T02:29:59.799109+00:00","updated_at":"2026-07-05T02:29:59.799109+00:00"}