{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:V4R7ZB3NEBNOLNJ6W46RVP33TV","short_pith_number":"pith:V4R7ZB3N","schema_version":"1.0","canonical_sha256":"af23fc876d205ae5b53eb73d1abf7b9d41534f4039ecf73544ce5aa60a5002e6","source":{"kind":"arxiv","id":"2209.13400","version":2},"attestation_state":"computed","paper":{"title":"Activation Learning by Local Competitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Hongchao Zhou","submitted_at":"2022-09-26T10:43:29Z","abstract_excerpt":"Despite its great success, backpropagation has certain limitations that necessitate the investigation of new learning methods. In this study, we present a biologically plausible local learning rule that improves upon Hebb's well-known proposal and discovers unsupervised features by local competitions among neurons. This simple learning rule enables the creation of a forward learning paradigm called activation learning, in which the output activation (sum of the squared output) of the neural network estimates the likelihood of the input patterns, or \"learn more, activate more\" in simpler terms."},"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":"2209.13400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-09-26T10:43:29Z","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"title_canon_sha256":"7a76d6928f4d7285ba50259ea43ee0e999a7046c5c0acdb44b6d925b54a6ca7d","abstract_canon_sha256":"35de2704486619a571f1c626dfcdf860a27dd32617ab6372bcc26a5141063b20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:09.213549Z","signature_b64":"C839YC+Xf3ILwH58ME1X+ZwAEAuJfIrAt3/aP6QvUIE7WL9TQR3N1Dufyp01AvATt5OoYfUOxvxZWCGyPN6oBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af23fc876d205ae5b53eb73d1abf7b9d41534f4039ecf73544ce5aa60a5002e6","last_reissued_at":"2026-07-05T05:28:09.213195Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:09.213195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Activation Learning by Local Competitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Hongchao Zhou","submitted_at":"2022-09-26T10:43:29Z","abstract_excerpt":"Despite its great success, backpropagation has certain limitations that necessitate the investigation of new learning methods. In this study, we present a biologically plausible local learning rule that improves upon Hebb's well-known proposal and discovers unsupervised features by local competitions among neurons. This simple learning rule enables the creation of a forward learning paradigm called activation learning, in which the output activation (sum of the squared output) of the neural network estimates the likelihood of the input patterns, or \"learn more, activate more\" in simpler terms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13400","kind":"arxiv","version":2},"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/2209.13400/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":"2209.13400","created_at":"2026-07-05T05:28:09.213251+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.13400v2","created_at":"2026-07-05T05:28:09.213251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13400","created_at":"2026-07-05T05:28:09.213251+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4R7ZB3NEBNO","created_at":"2026-07-05T05:28:09.213251+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4R7ZB3NEBNOLNJ6","created_at":"2026-07-05T05:28:09.213251+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4R7ZB3N","created_at":"2026-07-05T05:28:09.213251+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29528","citing_title":"Supervised Hebbian learning in Deep Counterstream Associative Networks","ref_index":111,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV","json":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV.json","graph_json":"https://pith.science/api/pith-number/V4R7ZB3NEBNOLNJ6W46RVP33TV/graph.json","events_json":"https://pith.science/api/pith-number/V4R7ZB3NEBNOLNJ6W46RVP33TV/events.json","paper":"https://pith.science/paper/V4R7ZB3N"},"agent_actions":{"view_html":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV","download_json":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV.json","view_paper":"https://pith.science/paper/V4R7ZB3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.13400&json=true","fetch_graph":"https://pith.science/api/pith-number/V4R7ZB3NEBNOLNJ6W46RVP33TV/graph.json","fetch_events":"https://pith.science/api/pith-number/V4R7ZB3NEBNOLNJ6W46RVP33TV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV/action/storage_attestation","attest_author":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV/action/author_attestation","sign_citation":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV/action/citation_signature","submit_replication":"https://pith.science/pith/V4R7ZB3NEBNOLNJ6W46RVP33TV/action/replication_record"}},"created_at":"2026-07-05T05:28:09.213251+00:00","updated_at":"2026-07-05T05:28:09.213251+00:00"}