{"id":"oscr:b:ADE878WQ4Z466-7","url":"https://openscicode.org/b/oscr:b:ADE878WQ4Z466-7","status":"current","doi":"10.1038/s41598-026-52140-3","since":"2026-11-14","page":"doi_10.1038_s41598-026-52140-3","repo":"github.com/nalin-dhiman/energy-efficient-information-processing-and-eligibility","commit":"19bcd7d83a044f90ad691bff5bfe1df636b7150a","path":"partE_pubready_package/partE_pubready/scripts/make_partE_patch_motif_generalization.py","swhid":"swh:1:cnt:e547f8e058fbdd8b5b6421a1ad3ccda13252e99f","lines":[1,32],"symbol":"","paragraphs":[[29,"Results › Part E Eligibility-trace learning robustly aligns wiring geometry unde"],[51,"Methods › Learning rules and benchmarking"]],"method":"lexical-v1","origin":"machine","paper":"https://doi.org/10.1038/s41598-026-52140-3","swhid_qualified":"swh:1:cnt:e547f8e058fbdd8b5b6421a1ad3ccda13252e99f;origin=https://github.com/nalin-dhiman/energy-efficient-information-processing-and-eligibility;anchor=swh:1:rev:19bcd7d83a044f90ad691bff5bfe1df636b7150a;path=/partE_pubready_package/partE_pubready/scripts/make_partE_patch_motif_generalization.py;lines=1-32","reader":"https://openscicode.org/paper/doi_10.1038_s41598-026-52140-3/?path=partE_pubready_package%2FpartE_pubready%2Fscripts%2Fmake_partE_patch_motif_generalization.py#L1-L32","citation":"Code block oscr:b:ADE878WQ4Z466-7 (https://openscicode.org/b/oscr:b:ADE878WQ4Z466-7)\npartE_pubready_package/partE_pubready/scripts/make_partE_patch_motif_generalization.py, lines 1 to 32, in github.com/nalin-dhiman/energy-efficient-information-processing-and-eligibility (https://github.com/nalin-dhiman/energy-efficient-information-processing-and-eligibility), commit 19bcd7d83a044f90ad691bff5bfe1df636b7150a.\nPaper: https://doi.org/10.1038/s41598-026-52140-3\nSWHID: swh:1:cnt:e547f8e058fbdd8b5b6421a1ad3ccda13252e99f;origin=https://github.com/nalin-dhiman/energy-efficient-information-processing-and-eligibility;anchor=swh:1:rev:19bcd7d83a044f90ad691bff5bfe1df636b7150a;path=/partE_pubready_package/partE_pubready/scripts/make_partE_patch_motif_generalization.py;lines=1-32"}