{"id":"oscr:b:2FN5EAYTXBJVW-H","url":"https://openscicode.org/b/oscr:b:2FN5EAYTXBJVW-H","status":"current","doi":"10.1038/s41467-026-70354-x","since":"2026-11-14","page":"doi_10.1038_s41467-026-70354-x","repo":"github.com/johnhongyumeng/duetpredictivecoding_plasticity","commit":"aac67332eb4b7b0bfe459ff72d610b560b2eab64","path":"scripts/class_main_nPE_perturbe.py","swhid":"swh:1:cnt:278931c1d76c0fd513c7aae14a858978626c35e9","lines":[13,66],"symbol":"nPE_model.main","paragraphs":[[12,"Results › Three-factor learning rule optimizes prediction-error computation"]],"method":"lexical-v1","origin":"machine","paper":"https://doi.org/10.1038/s41467-026-70354-x","swhid_qualified":"swh:1:cnt:278931c1d76c0fd513c7aae14a858978626c35e9;origin=https://github.com/johnhongyumeng/duetpredictivecoding_plasticity;anchor=swh:1:rev:aac67332eb4b7b0bfe459ff72d610b560b2eab64;path=/scripts/class_main_nPE_perturbe.py;lines=13-66","reader":"https://openscicode.org/paper/doi_10.1038_s41467-026-70354-x/?path=scripts%2Fclass_main_nPE_perturbe.py#L13-L66","citation":"Code block oscr:b:2FN5EAYTXBJVW-H (https://openscicode.org/b/oscr:b:2FN5EAYTXBJVW-H)\nscripts/class_main_nPE_perturbe.py, lines 13 to 66, in github.com/johnhongyumeng/duetpredictivecoding_plasticity (https://github.com/johnhongyumeng/duetpredictivecoding_plasticity), commit aac67332eb4b7b0bfe459ff72d610b560b2eab64.\nPaper: https://doi.org/10.1038/s41467-026-70354-x\nSWHID: swh:1:cnt:278931c1d76c0fd513c7aae14a858978626c35e9;origin=https://github.com/johnhongyumeng/duetpredictivecoding_plasticity;anchor=swh:1:rev:aac67332eb4b7b0bfe459ff72d610b560b2eab64;path=/scripts/class_main_nPE_perturbe.py;lines=13-66"}