{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LOVWEI6FMGOB3BEWQG3LBGEWA6","short_pith_number":"pith:LOVWEI6F","schema_version":"1.0","canonical_sha256":"5bab6223c5619c1d849681b6b0989607a7dd1d4869827d18cc04d93308431b73","source":{"kind":"arxiv","id":"2409.08188","version":4},"attestation_state":"computed","paper":{"title":"Efficient Sparse Coding with the Adaptive Locally Competitive Algorithm for Speech Classification","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SD"],"primary_cat":"eess.AS","authors_text":"Eric Plourde, Jean Rouat, Soufiyan Bahadi","submitted_at":"2024-09-12T16:26:29Z","abstract_excerpt":"Researchers are exploring novel computational paradigms such as sparse coding and neuromorphic computing to bridge the efficiency gap between the human brain and conventional computers in complex tasks. A key area of focus is neuromorphic audio processing. While the Locally Competitive Algorithm has emerged as a promising solution for sparse coding, offering potential for real-time and low-power processing on neuromorphic hardware, its applications in neuromorphic speech classification have not been thoroughly studied. The Adaptive Locally Competitive Algorithm builds upon the Locally Competit"},"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":"2409.08188","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.AS","submitted_at":"2024-09-12T16:26:29Z","cross_cats_sorted":["cs.SD"],"title_canon_sha256":"c4117d9e8681a890ab8229d943cf6819fc1aaa6617854526dc5c1d0770f77f1f","abstract_canon_sha256":"c6c65d21271ebe9c241719d003932630a6b53287a37022d6ed5eea5e9abdd727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:19.112142Z","signature_b64":"ngE5jqRYMhE9SpxNlAxoQvhGdeYporctXN0JyzxWdfBNQ4j8F9Cq5dZQA3V7EJuW3tKRI3NW/HeHk/DHw4ghBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bab6223c5619c1d849681b6b0989607a7dd1d4869827d18cc04d93308431b73","last_reissued_at":"2026-07-05T12:01:19.111599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:19.111599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sparse Coding with the Adaptive Locally Competitive Algorithm for Speech Classification","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SD"],"primary_cat":"eess.AS","authors_text":"Eric Plourde, Jean Rouat, Soufiyan Bahadi","submitted_at":"2024-09-12T16:26:29Z","abstract_excerpt":"Researchers are exploring novel computational paradigms such as sparse coding and neuromorphic computing to bridge the efficiency gap between the human brain and conventional computers in complex tasks. A key area of focus is neuromorphic audio processing. While the Locally Competitive Algorithm has emerged as a promising solution for sparse coding, offering potential for real-time and low-power processing on neuromorphic hardware, its applications in neuromorphic speech classification have not been thoroughly studied. The Adaptive Locally Competitive Algorithm builds upon the Locally Competit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08188","kind":"arxiv","version":4},"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/2409.08188/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":"2409.08188","created_at":"2026-07-05T12:01:19.111664+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.08188v4","created_at":"2026-07-05T12:01:19.111664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08188","created_at":"2026-07-05T12:01:19.111664+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOVWEI6FMGOB","created_at":"2026-07-05T12:01:19.111664+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOVWEI6FMGOB3BEW","created_at":"2026-07-05T12:01:19.111664+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOVWEI6F","created_at":"2026-07-05T12:01:19.111664+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03221","citing_title":"Neural Inhibition Improves Dynamic Routing and Mixture of Experts","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6","json":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6.json","graph_json":"https://pith.science/api/pith-number/LOVWEI6FMGOB3BEWQG3LBGEWA6/graph.json","events_json":"https://pith.science/api/pith-number/LOVWEI6FMGOB3BEWQG3LBGEWA6/events.json","paper":"https://pith.science/paper/LOVWEI6F"},"agent_actions":{"view_html":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6","download_json":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6.json","view_paper":"https://pith.science/paper/LOVWEI6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.08188&json=true","fetch_graph":"https://pith.science/api/pith-number/LOVWEI6FMGOB3BEWQG3LBGEWA6/graph.json","fetch_events":"https://pith.science/api/pith-number/LOVWEI6FMGOB3BEWQG3LBGEWA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6/action/storage_attestation","attest_author":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6/action/author_attestation","sign_citation":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6/action/citation_signature","submit_replication":"https://pith.science/pith/LOVWEI6FMGOB3BEWQG3LBGEWA6/action/replication_record"}},"created_at":"2026-07-05T12:01:19.111664+00:00","updated_at":"2026-07-05T12:01:19.111664+00:00"}