{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:42:16Z","timestamp":1648903336129},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,3,1]],"date-time":"1977-03-01T00:00:00Z","timestamp":226022400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1977,3]]},"DOI":"10.1007\/bf00991479","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T16:51:53Z","timestamp":1105289513000},"page":"1-7","source":"Crossref","is-referenced-by-count":2,"title":["On the solution of multiattribute problems involving counting in intersecting sets"],"prefix":"10.1007","volume":"6","author":[{"given":"Herbert","family":"Hellerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Cavallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"107","volume-title":"Computer System Performance","author":"H. Hellerman","year":"1975","unstructured":"H. Hellerman and T. C. Conroy,Computer System Performance (McGraw-Hill Book Co., New York, 1975), pp. 107?108."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/00029890.1967.11999993","volume":"74","author":"E. D. Homer","year":"1967","unstructured":"E. D. Homer, ?On the computation of the number of elements in combinations of sets,?Am. Math. Mon. 74:531?522 (1967).","journal-title":"Am. Math. Mon."},{"key":"CR3","volume-title":"Digital Computer and Control Engineering","author":"R. S. Ledley","year":"1960","unstructured":"R. S. Ledley,Digital Computer and Control Engineering (McGraw-Hill, New York, 1960)."},{"key":"CR4","volume-title":"Introduction to Combinatorial Mathematics","author":"C. L. Liu","year":"1968","unstructured":"C. L. Liu,Introduction to Combinatorial Mathematics (McGraw-Hill, New York, 1968)."},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440147","volume-title":"Combinatorial Mathematics","author":"H. J. Ryser","year":"1963","unstructured":"H. J. Ryser,Combinatorial Mathematics (John Wiley & Sons, New York, 1963)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0097-3165(74)90028-4","volume":"17","author":"H. J. Ryser","year":"1974","unstructured":"H. J. Ryser, ?Subsets of a finite set that intersect each other in at most one element,?J. Comb. Theor. 17:59?74 (1974).","journal-title":"J. Comb. Theor."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991479.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00991479\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T08:11:57Z","timestamp":1586074317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00991479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["BF00991479"],"URL":"https:\/\/doi.org\/10.1007\/bf00991479","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,3]]}}}