{"id":"oscr:b:ZRKEECZ5RJWK6-0","url":"https://openscicode.org/b/oscr:b:ZRKEECZ5RJWK6-0","status":"current","doi":"10.7554/elife.71801","since":"2026-11-17","page":"doi_10.7554_elife.71801","repo":"github.com/cedricfoucault/networks_for_sequence_prediction","commit":"f2983a9738ec43e03a430f2f194f0359d2bb5bf7","path":"code/hyperparam_nunit_fit_power_law.py","swhid":"swh:1:cnt:fcb64f9ee7e1f537802c0f4b32c2b0216328c91c","lines":[41,53],"symbol":"","paragraphs":[[68,"Results › Gated recurrence enables simple solutions"]],"method":"lexical-v1","origin":"machine","paper":"https://doi.org/10.7554/elife.71801","swhid_qualified":"swh:1:cnt:fcb64f9ee7e1f537802c0f4b32c2b0216328c91c;origin=https://github.com/cedricfoucault/networks_for_sequence_prediction;anchor=swh:1:rev:f2983a9738ec43e03a430f2f194f0359d2bb5bf7;path=/code/hyperparam_nunit_fit_power_law.py;lines=41-53","reader":"https://openscicode.org/paper/doi_10.7554_elife.71801/?path=code%2Fhyperparam_nunit_fit_power_law.py#L41-L53","citation":"Code block oscr:b:ZRKEECZ5RJWK6-0 (https://openscicode.org/b/oscr:b:ZRKEECZ5RJWK6-0)\ncode/hyperparam_nunit_fit_power_law.py, lines 41 to 53, in github.com/cedricfoucault/networks_for_sequence_prediction (https://github.com/cedricfoucault/networks_for_sequence_prediction), commit f2983a9738ec43e03a430f2f194f0359d2bb5bf7.\nPaper: https://doi.org/10.7554/elife.71801\nSWHID: swh:1:cnt:fcb64f9ee7e1f537802c0f4b32c2b0216328c91c;origin=https://github.com/cedricfoucault/networks_for_sequence_prediction;anchor=swh:1:rev:f2983a9738ec43e03a430f2f194f0359d2bb5bf7;path=/code/hyperparam_nunit_fit_power_law.py;lines=41-53"}