{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YAC3TJZ5DSYQLMELWJ34RMLDVO","short_pith_number":"pith:YAC3TJZ5","schema_version":"1.0","canonical_sha256":"c005b9a73d1cb105b08bb277c8b163ab966b1e098195e0da97c8e8272937c4ce","source":{"kind":"arxiv","id":"1702.06456","version":3},"attestation_state":"computed","paper":{"title":"Online Representation Learning with Single and Multi-layer Hebbian Networks for Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NE","authors_text":"Andrea Soltoggio, Yanis Bahroun","submitted_at":"2017-02-21T16:01:28Z","abstract_excerpt":"Unsupervised learning permits the development of algorithms that are able to adapt to a variety of different data sets using the same underlying rules thanks to the autonomous discovery of discriminating features during training. Recently, a new class of Hebbian-like and local unsupervised learning rules for neural networks have been developed that minimise a similarity matching cost-function. These have been shown to perform sparse representation learning. This study tests the effectiveness of one such learning rule for learning features from images. The rule implemented is derived from a non"},"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":"1702.06456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-21T16:01:28Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"30cdd8747ee3b21c888c995e4d310819cd1bdecc050dd50501cf6b23756fb289","abstract_canon_sha256":"ca0e45c50dd4652e378f039f87d2e2d342c81edced7c56a5df342294b7b7664f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:01.969004Z","signature_b64":"+LKkrHZglzRcLs6on8fag87PAFa5Kj1fwJHA5Spm2qcGhQDx+kgAOGUmU1H1ZMfU/WPqd9WY/9xrHar+mnv9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c005b9a73d1cb105b08bb277c8b163ab966b1e098195e0da97c8e8272937c4ce","last_reissued_at":"2026-05-18T00:25:01.968552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:01.968552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Representation Learning with Single and Multi-layer Hebbian Networks for Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NE","authors_text":"Andrea Soltoggio, Yanis Bahroun","submitted_at":"2017-02-21T16:01:28Z","abstract_excerpt":"Unsupervised learning permits the development of algorithms that are able to adapt to a variety of different data sets using the same underlying rules thanks to the autonomous discovery of discriminating features during training. Recently, a new class of Hebbian-like and local unsupervised learning rules for neural networks have been developed that minimise a similarity matching cost-function. These have been shown to perform sparse representation learning. This study tests the effectiveness of one such learning rule for learning features from images. The rule implemented is derived from a non"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06456","kind":"arxiv","version":3},"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":"1702.06456","created_at":"2026-05-18T00:25:01.968626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06456v3","created_at":"2026-05-18T00:25:01.968626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06456","created_at":"2026-05-18T00:25:01.968626+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAC3TJZ5DSYQ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAC3TJZ5DSYQLMEL","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAC3TJZ5","created_at":"2026-05-18T12:31:56.362134+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/YAC3TJZ5DSYQLMELWJ34RMLDVO","json":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO.json","graph_json":"https://pith.science/api/pith-number/YAC3TJZ5DSYQLMELWJ34RMLDVO/graph.json","events_json":"https://pith.science/api/pith-number/YAC3TJZ5DSYQLMELWJ34RMLDVO/events.json","paper":"https://pith.science/paper/YAC3TJZ5"},"agent_actions":{"view_html":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO","download_json":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO.json","view_paper":"https://pith.science/paper/YAC3TJZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06456&json=true","fetch_graph":"https://pith.science/api/pith-number/YAC3TJZ5DSYQLMELWJ34RMLDVO/graph.json","fetch_events":"https://pith.science/api/pith-number/YAC3TJZ5DSYQLMELWJ34RMLDVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO/action/storage_attestation","attest_author":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO/action/author_attestation","sign_citation":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO/action/citation_signature","submit_replication":"https://pith.science/pith/YAC3TJZ5DSYQLMELWJ34RMLDVO/action/replication_record"}},"created_at":"2026-05-18T00:25:01.968626+00:00","updated_at":"2026-05-18T00:25:01.968626+00:00"}