{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T12:45:15Z","timestamp":1693745115493},"reference-count":6,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,9,1]]},"DOI":"10.1587\/transfun.2022dml0003","type":"journal-article","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T22:10:01Z","timestamp":1670364601000},"page":"1189-1190","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds on the PTF Weight of ODD-MAXBIT Function"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Kazuyuki","family":"AMANO","sequence":"first","affiliation":[{"name":"Dept. of CS, Gunma University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] K. Amano and S. Tate, \u201cOn XOR lemmas for the weight of polynomial threshold functions,\u201d Inf. Comput., vol.269, article 104439, 2019. 10.1016\/j.ic.2019.104439","DOI":"10.1016\/j.ic.2019.104439"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] R. Beigel, \u201cPerceptrons, PP, and the polynomial hierarchy,\u201d Comput. Complex., vol.4, 339-349, 1994. 10.1007\/bf01263422","DOI":"10.1007\/BF01263422"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] A.R. Klivans and R.A. Servedio, \u201cLearning DNF in time 2<sup><i>\u00d5<\/i>(<i>n<\/i><sup>1\/3<\/sup>)<\/sup>,\u201d J. Comput. Sys. Sci., vol.68, no,2, pp.303-318, 2004. 10.1016\/j.jcss.2003.07.007","DOI":"10.1016\/j.jcss.2003.07.007"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] R. O&apos;Donnell and R.A. Servedio, \u201cExtremal properties of polynomial threshold functions,\u201d J. Comput. Sys. Sci., vol.74, no.3, pp.298-312, 2008. 10.1016\/j.jcss.2007.06.021","DOI":"10.1016\/j.jcss.2007.06.021"},{"key":"5","unstructured":"[5] R.A. Servedio, L. Tan, and J. Thaler, \u201cAttribute-efficient learning and weight-degree tradeoffs for polynomial threshold functions,\u201d Proc. COLT 2012, pp.14.1-14.19, 2012."},{"key":"6","unstructured":"[6] V. Podolskii and N.V. Proskurin, \u201cPolynomial threshold functions for decision lists,\u201d ArXiv:2207.09371, 2022. 10.48550\/arXiv.2207.09371"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/9\/E106.A_2022DML0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T03:26:48Z","timestamp":1693625208000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/9\/E106.A_2022DML0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,1]]},"references-count":6,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022dml0003","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,1]]},"article-number":"2022DML0003"}}