{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T16:11:33Z","timestamp":1653495093470},"reference-count":0,"publisher":"Maria Curie-Sklodowska University","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1,1]]},"DOI":"10.2478\/v10065-012-0043-x","type":"journal-article","created":{"date-parts":[[2014,1,27]],"date-time":"2014-01-27T20:48:58Z","timestamp":1390855738000},"source":"Crossref","is-referenced-by-count":0,"title":["A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}"],"prefix":"10.17951","volume":"13","author":[{"given":"Marek","family":"Bolanowski","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Paszkiewicz","sequence":"additional","affiliation":[]}],"member":"7349","container-title":["Annales UMCS, Informatica"],"original-title":[],"link":[{"URL":"https:\/\/journals.umcs.pl\/ai\/article\/download\/3371\/2565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T15:48:11Z","timestamp":1653493691000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.umcs.pl\/ai\/article\/view\/3371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,1]]},"references-count":0,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.2478\/v10065-012-0043-x","relation":{},"ISSN":["2083-3628","1732-1360"],"issn-type":[{"value":"2083-3628","type":"electronic"},{"value":"1732-1360","type":"print"}],"subject":[],"published":{"date-parts":[[2013,1,1]]}}}