{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T22:26:48Z","timestamp":1770416808880,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,12]],"date-time":"2018-08-12T00:00:00Z","timestamp":1534032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,12]]},"DOI":"10.1145\/3230744.3230749","type":"proceedings-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T12:09:54Z","timestamp":1534248594000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Syntropic counterpoints"],"prefix":"10.1145","author":[{"given":"Predrag K.","family":"Nikoli\u0107","sequence":"first","affiliation":[{"name":"Shantou University"}]},{"given":"Hua","family":"Yang","sequence":"additional","affiliation":[{"name":"Shantou University"}]},{"given":"Jyunjye","family":"Chen","sequence":"additional","affiliation":[{"name":"Shantou University"}]},{"given":"George Peter","family":"Stankevich","sequence":"additional","affiliation":[{"name":"Shantou University"}]}],"member":"320","published-online":{"date-parts":[[2018,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"{n. d.}. Softmax Regression - Ufldl. http:\/\/ufldl.stanford.edu\/wiki\/index.php\/Softmax_Regression. ({n. d.}). (Accessed on 01\/03\/2018).  {n. d.}. Softmax Regression - Ufldl. http:\/\/ufldl.stanford.edu\/wiki\/index.php\/Softmax_Regression. ({n. d.}). (Accessed on 01\/03\/2018)."},{"key":"e_1_3_2_2_2_1","unstructured":"{n. d.}. Unsupervised Feature Learning and Deep Learning Tutorial. http:\/\/ufldl.stanford.edu\/tutorial\/supervised\/OptimizationStochasticGradientDescent\/. ({n. d.}). (Accessed on 01\/03\/2018).  {n. d.}. Unsupervised Feature Learning and Deep Learning Tutorial. http:\/\/ufldl.stanford.edu\/tutorial\/supervised\/OptimizationStochasticGradientDescent\/. ({n. d.}). (Accessed on 01\/03\/2018)."},{"key":"e_1_3_2_2_3_1","volume-title":"The unreasonable effectiveness of recurrent neural networks. Andrej Karpathy blog","author":"Andrej Karpathy","year":"2015","unstructured":"Andrej Karpathy . 2015. The unreasonable effectiveness of recurrent neural networks. Andrej Karpathy blog ( 2015 ). Andrej Karpathy. 2015. The unreasonable effectiveness of recurrent neural networks. Andrej Karpathy blog (2015)."}],"event":{"name":"SIGGRAPH '18: Special Interest Group on Computer Graphics and Interactive Techniques Conference","location":"Vancouver British Columbia Canada","acronym":"SIGGRAPH '18","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["ACM SIGGRAPH 2018 Posters"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230744.3230749","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230744.3230749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:30Z","timestamp":1750208250000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230744.3230749"}},"subtitle":["art of AI sense or machine made context art"],"short-title":[],"issued":{"date-parts":[[2018,8,12]]},"references-count":3,"alternative-id":["10.1145\/3230744.3230749","10.1145\/3230744"],"URL":"https:\/\/doi.org\/10.1145\/3230744.3230749","relation":{},"subject":[],"published":{"date-parts":[[2018,8,12]]},"assertion":[{"value":"2018-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}