{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:03Z","timestamp":1759063683818},"reference-count":5,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9816,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1016\/0012-365x(86)90088-9","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"165-179","source":"Crossref","is-referenced-by-count":5,"title":["Do local majorities force a global majority?"],"prefix":"10.1016","volume":"61","author":[{"given":"P.C","family":"Fishburn","sequence":"first","affiliation":[]},{"given":"F.K","family":"Hwang","sequence":"additional","affiliation":[]},{"given":"Hikyu","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(86)90088-9_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/TCT.1970.1083099","article-title":"On graphs of invulnerable communication nets","volume":"17","author":"Boesch","year":"1970","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0012-365X(86)90088-9_BIB2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1137\/0607011","article-title":"Super line-connectivity properties of circulant graphs","volume":"7","author":"Boesch","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(86)90088-9_BIB3","series-title":"Utility Theory for Decision Making","author":"Fishburn","year":"1970"},{"key":"10.1016\/0012-365X(86)90088-9_BIB4","first-page":"1142","article-title":"The maximum connectivity of a graph","volume":"48","author":"Harary","year":"1962"},{"key":"10.1016\/0012-365X(86)90088-9_BIB5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.2307\/2310345","article-title":"Solvability and consistency for linear equations and inequalities","volume":"63","author":"Kuhn","year":"1956","journal-title":"Amer. Math. Monthly"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86900889?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86900889?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:53:28Z","timestamp":1553932408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86900889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":5,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["0012365X86900889"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90088-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}