{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4YXUII3WP6G5UKUDLQA7UQGMR2","short_pith_number":"pith:4YXUII3W","schema_version":"1.0","canonical_sha256":"e62f4423767f8dda2a835c01fa40cc8e91ff55cd60430947c767a80c54cd114f","source":{"kind":"arxiv","id":"1906.00889","version":4},"attestation_state":"computed","paper":{"title":"Learning to solve the credit assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"q-bio.NC","authors_text":"Benjamin James Lansdell, Konrad Paul Kording, Prashanth Ravi Prakash","submitted_at":"2019-06-03T15:48:38Z","abstract_excerpt":"Backpropagation is driving today's artificial neural networks (ANNs). However, despite extensive research, it remains unclear if the brain implements this algorithm. Among neuroscientists, reinforcement learning (RL) algorithms are often seen as a realistic alternative: neurons can randomly introduce change, and use unspecific feedback signals to observe their effect on the cost and thus approximate their gradient. However, the convergence rate of such learning scales poorly with the number of involved neurons. Here we propose a hybrid learning approach. Each neuron uses an RL-type strategy to"},"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":"1906.00889","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2019-06-03T15:48:38Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6a3720186aff0799a0513bd586c7e54ba650374930e699ff8f7a219ed503bdf1","abstract_canon_sha256":"b7a0386245e70bc4cfafd782747a83ed52a28fba425bb12ded1ee269d1bad7d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:33.219554Z","signature_b64":"dTmVqdvC72JJEG9ox4Q0+WBoYZ31D/VyoaKWkz4j4PhUNIa0Va4FvtZma8rZ9x1eWer2QpCqBf+MmQKL9shlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e62f4423767f8dda2a835c01fa40cc8e91ff55cd60430947c767a80c54cd114f","last_reissued_at":"2026-07-05T00:57:33.219084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:33.219084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to solve the credit assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"q-bio.NC","authors_text":"Benjamin James Lansdell, Konrad Paul Kording, Prashanth Ravi Prakash","submitted_at":"2019-06-03T15:48:38Z","abstract_excerpt":"Backpropagation is driving today's artificial neural networks (ANNs). However, despite extensive research, it remains unclear if the brain implements this algorithm. Among neuroscientists, reinforcement learning (RL) algorithms are often seen as a realistic alternative: neurons can randomly introduce change, and use unspecific feedback signals to observe their effect on the cost and thus approximate their gradient. However, the convergence rate of such learning scales poorly with the number of involved neurons. Here we propose a hybrid learning approach. Each neuron uses an RL-type strategy to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00889","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/1906.00889/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":"1906.00889","created_at":"2026-07-05T00:57:33.219145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00889v4","created_at":"2026-07-05T00:57:33.219145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00889","created_at":"2026-07-05T00:57:33.219145+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YXUII3WP6G5","created_at":"2026-07-05T00:57:33.219145+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YXUII3WP6G5UKUD","created_at":"2026-07-05T00:57:33.219145+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YXUII3W","created_at":"2026-07-05T00:57:33.219145+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24005","citing_title":"LC-ERD: Mining Latent Logic for Self-Evolving Reasoning via Consistency-Regulated Reward Decomposition","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2503.02642","citing_title":"Spike-based alignment learning solves the weight transport problem","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2","json":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2.json","graph_json":"https://pith.science/api/pith-number/4YXUII3WP6G5UKUDLQA7UQGMR2/graph.json","events_json":"https://pith.science/api/pith-number/4YXUII3WP6G5UKUDLQA7UQGMR2/events.json","paper":"https://pith.science/paper/4YXUII3W"},"agent_actions":{"view_html":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2","download_json":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2.json","view_paper":"https://pith.science/paper/4YXUII3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00889&json=true","fetch_graph":"https://pith.science/api/pith-number/4YXUII3WP6G5UKUDLQA7UQGMR2/graph.json","fetch_events":"https://pith.science/api/pith-number/4YXUII3WP6G5UKUDLQA7UQGMR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2/action/storage_attestation","attest_author":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2/action/author_attestation","sign_citation":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2/action/citation_signature","submit_replication":"https://pith.science/pith/4YXUII3WP6G5UKUDLQA7UQGMR2/action/replication_record"}},"created_at":"2026-07-05T00:57:33.219145+00:00","updated_at":"2026-07-05T00:57:33.219145+00:00"}