{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BBL2DMFOZELPYYP4VP6A2OJYGV","short_pith_number":"pith:BBL2DMFO","schema_version":"1.0","canonical_sha256":"0857a1b0aec916fc61fcabfc0d3938357e4c3598f8b12e7deb8bf2961bd3ceae","source":{"kind":"arxiv","id":"1705.05475","version":1},"attestation_state":"computed","paper":{"title":"Sparse Coding by Spiking Neural Networks: Convergence Theory and Computational Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.NE","q-bio.NC"],"primary_cat":"cs.LG","authors_text":"Mike Davies, Ping Tak Peter Tang, Tsung-han Lin","submitted_at":"2017-05-15T23:06:34Z","abstract_excerpt":"In a spiking neural network (SNN), individual neurons operate autonomously and only communicate with other neurons sparingly and asynchronously via spike signals. These characteristics render a massively parallel hardware implementation of SNN a potentially powerful computer, albeit a non von Neumann one. But can one guarantee that a SNN computer solves some important problems reliably? In this paper, we formulate a mathematical model of one SNN that can be configured for a sparse coding problem for feature extraction. With a moderate but well-defined assumption, we prove that the SNN indeed s"},"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":"1705.05475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-15T23:06:34Z","cross_cats_sorted":["cs.NA","cs.NE","q-bio.NC"],"title_canon_sha256":"945701646eeb736b9474f61d7dd697fc666fa285570d5834f24b2d061dfa653f","abstract_canon_sha256":"304b775a552fdbaa8633a328885a4698770114a24014851b736662c4fb8924a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:22.651529Z","signature_b64":"eKesfu1ctEtrWAmSElAc8IAFg83Uh1RcBiQOT3tkuvpeC8pL/1H8jfl1eJwlxW3bQeP0Mt/9RafylZ78HlAHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0857a1b0aec916fc61fcabfc0d3938357e4c3598f8b12e7deb8bf2961bd3ceae","last_reissued_at":"2026-05-18T00:44:22.651096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:22.651096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Coding by Spiking Neural Networks: Convergence Theory and Computational Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.NE","q-bio.NC"],"primary_cat":"cs.LG","authors_text":"Mike Davies, Ping Tak Peter Tang, Tsung-han Lin","submitted_at":"2017-05-15T23:06:34Z","abstract_excerpt":"In a spiking neural network (SNN), individual neurons operate autonomously and only communicate with other neurons sparingly and asynchronously via spike signals. These characteristics render a massively parallel hardware implementation of SNN a potentially powerful computer, albeit a non von Neumann one. But can one guarantee that a SNN computer solves some important problems reliably? In this paper, we formulate a mathematical model of one SNN that can be configured for a sparse coding problem for feature extraction. With a moderate but well-defined assumption, we prove that the SNN indeed s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05475","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.05475","created_at":"2026-05-18T00:44:22.651166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05475v1","created_at":"2026-05-18T00:44:22.651166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05475","created_at":"2026-05-18T00:44:22.651166+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBL2DMFOZELP","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBL2DMFOZELPYYP4","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBL2DMFO","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02927","citing_title":"Generalization Bounds of Spiking Neural Networks via Rademacher Complexity","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV","json":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV.json","graph_json":"https://pith.science/api/pith-number/BBL2DMFOZELPYYP4VP6A2OJYGV/graph.json","events_json":"https://pith.science/api/pith-number/BBL2DMFOZELPYYP4VP6A2OJYGV/events.json","paper":"https://pith.science/paper/BBL2DMFO"},"agent_actions":{"view_html":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV","download_json":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV.json","view_paper":"https://pith.science/paper/BBL2DMFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05475&json=true","fetch_graph":"https://pith.science/api/pith-number/BBL2DMFOZELPYYP4VP6A2OJYGV/graph.json","fetch_events":"https://pith.science/api/pith-number/BBL2DMFOZELPYYP4VP6A2OJYGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV/action/storage_attestation","attest_author":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV/action/author_attestation","sign_citation":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV/action/citation_signature","submit_replication":"https://pith.science/pith/BBL2DMFOZELPYYP4VP6A2OJYGV/action/replication_record"}},"created_at":"2026-05-18T00:44:22.651166+00:00","updated_at":"2026-05-18T00:44:22.651166+00:00"}