Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints

We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations obey some Markov chain. For this system, we characterize the fundamental type-II error exponents region, i.e., the type-II error exponents t...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 69; no. 7; pp. 4255 - 4283
Main Authors:	Hamad, Mustapha, Wigger, Michele, Sarkiss, Mireille
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Subjects:	Asymptotic methods Computer Science distributed hypothesis testing Encoding error exponents Error probability expected-rate constraints Exponents Hypothesis testing Markov chains Markov processes Multi-hop Multiplexing Permissible error Spread spectrum communication Symbols Testing variable-length coding Expected-rate constraints Multi-hop Variable-length coding Distributed hypothesis testing Error exponents
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations obey some Markov chain. For this system, we characterize the fundamental type-II error exponents region, i.e., the type-II error exponents that the various DCs can achieve simultaneously, under expected-rate constraints. Our results show that this fundamental exponents region is boosted compared to the region under maximum-rate constraints, and that it depends on the permissible type-I error probabilities. When all DCs have equal permissible type-I error probabilities, the exponents region is rectangular and all DCs can simultaneously achieve their optimal type-II error exponents. When the DCs have different permissible type-I error probabilities, a tradeoff between the type-II error exponents at the different DCs arises. New achievability and converse proofs are presented. For the achievability, a new multiplexing and rate-sharing strategy is proposed. The converse proof is based on applying different change of measure arguments in parallel and on proving asymptotic Markov chains. For the special cases <inline-formula> <tex-math notation="LaTeX">K \in \{2,3\} </tex-math></inline-formula>, and for arbitrary <inline-formula> <tex-math notation="LaTeX">K\geq 2 </tex-math></inline-formula> when all permissible type-I error probabilities at the various DCs are equal, we provide simplified expressions for the exponents region; a similar simplification is conjectured for the general case.
AbstractList	We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations obey some Markov chain. For this system, we characterize the fundamental type-II error exponents region, i.e., the type-II error exponents that the various DCs can achieve simultaneously, under expected-rate constraints. Our results show that this fundamental exponents region is boosted compared to the region under maximum-rate constraints, and that it depends on the permissible type-I error probabilities. When all DCs have equal permissible type-I error probabilities, the exponents region is rectangular and all DCs can simultaneously achieve their optimal type-II error exponents. When the DCs have different permissible type-I error probabilities, a tradeoff between the type-II error exponents at the different DCs arises. New achievability and converse proofs are presented. For the achievability, a new multiplexing and rate-sharing strategy is proposed. The converse proof is based on applying different change of measure arguments in parallel and on proving asymptotic Markov chains. For the special cases [Formula Omitted], and for arbitrary [Formula Omitted] when all permissible type-I error probabilities at the various DCs are equal, we provide simplified expressions for the exponents region; a similar simplification is conjectured for the general case. We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations obey some Markov chain. For this system, we characterize the fundamental type-II error exponents region, i.e., the type-II error exponents that the various DCs can achieve simultaneously, under expected-rate constraints. Our results show that this fundamental exponents region is boosted compared to the region under maximum-rate constraints, and that it depends on the permissible type-I error probabilities. When all DCs have equal permissible type-I error probabilities, the exponents region is rectangular and all DCs can simultaneously achieve their optimal type-II error exponents. When the DCs have different permissible type-I error probabilities, a tradeoff between the type-II error exponents at the different DCs arises. New achievability and converse proofs are presented. For the achievability, a new multiplexing and rate-sharing strategy is proposed. The converse proof is based on applying different change of measure arguments in parallel and on proving asymptotic Markov chains. For the special cases <inline-formula> <tex-math notation="LaTeX">K \in \{2,3\} </tex-math></inline-formula>, and for arbitrary <inline-formula> <tex-math notation="LaTeX">K\geq 2 </tex-math></inline-formula> when all permissible type-I error probabilities at the various DCs are equal, we provide simplified expressions for the exponents region; a similar simplification is conjectured for the general case. We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations obey some Markov chain. For this system, we characterize the fundamental type-II error exponents region, i.e., the type-II error exponents that the various DCs can achieve simultaneously, under expected-rate constraints. Our results show that this fundamental exponents region is boosted compared to the region under maximum-rate constraints, and that it depends on the permissible type-I error probabilities. When all DCs have equal permissible type-I error probabilities, the exponents region is rectangular and all DCs can simultaneously achieve their optimal type-II error exponents. When the DCs have different permissible type-I error probabilities, a tradeoff between the type-II error exponents at the different DCs arises. New achievability and converse proofs are presented. For the achievability, a new multiplexing and rate-sharing strategy is proposed. The converse proof is based on applying different change of measure arguments in parallel and on proving asymptotic Markov chains. For the special cases K∈{2,3} , and for arbitrary K≥2 when all permissible type-I error probabilities at the various DCs are equal, we provide simplified expressions for the exponents region; a similar simplification is conjectured for the general case
Author	Wigger, Michele Hamad, Mustapha Sarkiss, Mireille
Author_xml	– sequence: 1 givenname: Mustapha orcidid: 0000-0002-8631-1760 surname: Hamad fullname: Hamad, Mustapha email: mustapha.hamad@huawei.com organization: LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France – sequence: 2 givenname: Michele orcidid: 0000-0002-6737-5427 surname: Wigger fullname: Wigger, Michele email: michele.wigger@telecom-paris.fr organization: LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France – sequence: 3 givenname: Mireille orcidid: 0000-0002-8359-5921 surname: Sarkiss fullname: Sarkiss, Mireille email: mireille.sarkiss@telecom-sudparis.eu organization: SAMOVAR, Télécom SudParis, Institut Polytechnique de Paris, Palaiseau, France
BackLink	https://hal.science/hal-04240070$$DView record in HAL
BookMark	eNp9kDlPxDAQhS0EEsvRU1BEoqLIMj6S2CVajkVaDqFFlJaTTIQhxMH2cvx7sixCiIJqNE_vvRl9W2S9cx0SskdhTCmoo_nFfMyA8TFnXHKu1siIZlmRqjwT62QEQGWqhJCbZCuEx2EVGWUjcnO5aKNNp65PrjC-Of-U3Nv4kHzJfYvJCVY2WNclE-wi-pDcdTX65PS9xypind6aiMnEdSF6Y7sYdshGY9qAu99zm9ydnc4n03R2fX4xOZ6lFc9lTLFsCiUVlrSpa5U3AhEyo0pOFdS1yUvIODN1hcpgLmgpkbNaZUXVCN4UFfBtcrjqfTCt7r19Nv5DO2P19HimlxoIJgAKeKWD92Dl7b17WWCI-tEtfDe8p5lkEkAUUgwuWLkq70Lw2PzUUtBLxnpgrJeM9TfjIZL_iVQ2mjjgWtJo_wvur4IWEX_dASaUEvwTJz6K6w
CODEN	IETTAW
CitedBy_id	crossref_primary_10_1109_TIT_2023_3327314
Cites_doi	10.1109/ALLERTON.2018.8635828 10.3390/e21050478 10.1109/JSAIT.2020.3039839 10.1109/ISIT.2016.7541590 10.1109/ISIT.2018.8437906 10.1109/TIT.2020.2993172 10.1109/ISIT.2013.6620744 10.1109/GLOBECOM46510.2021.9685750 10.1109/ITW48936.2021.9611470 10.1109/TIT.2018.2833626 10.1109/SPCOM.2016.7746613 10.1109/ITW.2018.8613433 10.3390/e20050352 10.1109/ISIT50566.2022.9834807 10.1109/18.42171 10.1109/ITW48936.2021.9611441 10.1109/TSIPN.2016.2524572 10.1109/TIT.2020.3019654 10.1109/TIT.1987.1057383 10.1109/TIT.2019.2953877 10.1109/Allerton.2012.6483336 10.3390/e21121171 10.1109/ISIT.2009.5205934 10.1109/ITW54588.2022.9965790 10.1109/ISIT.2017.8006667 10.1109/TIT.2017.2688348 10.1109/ISIT.2011.6034154 10.1109/TIT.2019.2953750 10.1109/TCOMM.2018.2798659 10.1109/TIT.1986.1057176 10.1109/18.119685 10.1109/ISIT50566.2022.9834275 10.1017/CBO9780511921889 10.1109/TIT.1986.1057194 10.1109/TIT.2012.2206793 10.1109/ISIT.2019.8849485 10.1109/ISIT44484.2020.9174170 10.1109/ISIT.1994.394874 10.1109/TIT.1976.1055508 10.1109/TIT.2019.2897698
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC
DOI	10.1109/TIT.2023.3238339
DatabaseName	IEEE Xplore (IEEE) IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL)
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1557-9654
EndPage	4283
ExternalDocumentID	oai:HAL:hal-04240070v1 10_1109_TIT_2023_3238339 10024994
Genre	orig-research
GrantInformation_xml	– fundername: European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme grantid: 715111 funderid: 10.13039/100010663
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD ESBDL F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC
ID	FETCH-LOGICAL-c368t-ebf7989eb1fdd96f4ee05a9b3190dda6b0532adce9ae641b8e32d957cf43f7c03
IEDL.DBID	RIE
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001017307000009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9448
IngestDate	Sun Oct 19 06:21:17 EDT 2025 Sun Jun 29 15:38:56 EDT 2025 Sat Nov 29 03:31:50 EST 2025 Tue Nov 18 21:00:59 EST 2025 Wed Aug 27 02:50:01 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	7
Keywords	Expected-rate constraints Multi-hop Variable-length coding Distributed hypothesis testing Error exponents
Language	English
License	https://creativecommons.org/licenses/by/4.0/legalcode Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c368t-ebf7989eb1fdd96f4ee05a9b3190dda6b0532adce9ae641b8e32d957cf43f7c03
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-8631-1760 0000-0002-6737-5427 0000-0002-8359-5921
OpenAccessLink	https://ieeexplore.ieee.org/document/10024994
PQID	2828004784
PQPubID	36024
PageCount	29
ParticipantIDs	hal_primary_oai_HAL_hal_04240070v1 proquest_journals_2828004784 ieee_primary_10024994 crossref_citationtrail_10_1109_TIT_2023_3238339 crossref_primary_10_1109_TIT_2023_3238339
PublicationCentury	2000
PublicationDate	2023-07-01
PublicationDateYYYYMMDD	2023-07-01
PublicationDate_xml	– month: 07 year: 2023 text: 2023-07-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on information theory
PublicationTitleAbbrev	TIT
PublicationYear	2023
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: Institute of Electrical and Electronics Engineers
References	ref13 ref35 ref12 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 inan (ref32) 2021 ref2 ref1 ref17 ref39 ref16 ref38 ref19 ref18 salehkalaibar (ref28) 2017 ref24 hamad (ref43) 2020 ref23 ref26 ref25 ref20 ref42 ref41 ref22 ref44 ref21 gattegno (ref45) 2016 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40
References_xml	– ident: ref25 doi: 10.1109/ALLERTON.2018.8635828 – ident: ref15 doi: 10.3390/e21050478 – ident: ref33 doi: 10.1109/JSAIT.2020.3039839 – ident: ref18 doi: 10.1109/ISIT.2016.7541590 – year: 2020 ident: ref43 article-title: Cooperative multi-sensor detection under variable-length coding publication-title: arXiv 2010 09616 – ident: ref24 doi: 10.1109/ISIT.2018.8437906 – ident: ref12 doi: 10.1109/TIT.2020.2993172 – year: 2016 ident: ref45 article-title: Fourier-Motzkin elimination software for information theoretic inequalities publication-title: arXiv 1610 03990 – ident: ref17 doi: 10.1109/ISIT.2013.6620744 – ident: ref2 doi: 10.1109/GLOBECOM46510.2021.9685750 – ident: ref1 doi: 10.1109/ITW48936.2021.9611470 – ident: ref21 doi: 10.1109/TIT.2018.2833626 – start-page: 8 year: 2021 ident: ref32 article-title: A fundamental limit of distributed hypothesis testing under memoryless quantization publication-title: Proc IEEE Int Conf Commun – ident: ref22 doi: 10.1109/SPCOM.2016.7746613 – year: 2017 ident: ref28 article-title: Hypothesis testing over the two-hop relay network publication-title: arXiv 1708 05198 – ident: ref14 doi: 10.1109/ITW.2018.8613433 – ident: ref40 doi: 10.3390/e20050352 – ident: ref30 doi: 10.1109/JSAIT.2020.3039839 – ident: ref44 doi: 10.1109/ISIT50566.2022.9834807 – ident: ref5 doi: 10.1109/18.42171 – ident: ref31 doi: 10.1109/ITW48936.2021.9611441 – ident: ref20 doi: 10.1109/TSIPN.2016.2524572 – ident: ref26 doi: 10.1109/TIT.2020.3019654 – ident: ref4 doi: 10.1109/TIT.1987.1057383 – ident: ref34 doi: 10.1109/TIT.2019.2953877 – ident: ref16 doi: 10.1109/Allerton.2012.6483336 – ident: ref29 doi: 10.3390/e21121171 – ident: ref35 doi: 10.1109/ISIT.2009.5205934 – ident: ref41 doi: 10.1109/ITW54588.2022.9965790 – ident: ref37 doi: 10.1109/ISIT.2017.8006667 – ident: ref19 doi: 10.1109/TIT.2017.2688348 – ident: ref36 doi: 10.1109/ISIT.2011.6034154 – ident: ref11 doi: 10.1109/TIT.2019.2953750 – ident: ref23 doi: 10.1109/TCOMM.2018.2798659 – ident: ref38 doi: 10.1109/TIT.1986.1057176 – ident: ref6 doi: 10.1109/18.119685 – ident: ref10 doi: 10.1109/ISIT50566.2022.9834275 – ident: ref42 doi: 10.1017/CBO9780511921889 – ident: ref3 doi: 10.1109/TIT.1986.1057194 – ident: ref8 doi: 10.1109/TIT.2012.2206793 – ident: ref9 doi: 10.1109/ISIT.2019.8849485 – ident: ref13 doi: 10.1109/ISIT44484.2020.9174170 – ident: ref7 doi: 10.1109/ISIT.1994.394874 – ident: ref39 doi: 10.1109/TIT.1976.1055508 – ident: ref27 doi: 10.1109/TIT.2019.2897698
SSID	ssj0014512
Score	2.4362512
Snippet	We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations...
SourceID	hal proquest crossref ieee
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	4255
SubjectTerms	Asymptotic methods Computer Science distributed hypothesis testing Encoding error exponents Error probability expected-rate constraints Exponents Hypothesis testing Markov chains Markov processes Multi-hop Multiplexing Permissible error Spread spectrum communication Symbols Testing variable-length coding
Title	Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints
URI	https://ieeexplore.ieee.org/document/10024994 https://www.proquest.com/docview/2828004784 https://hal.science/hal-04240070
Volume	69
WOSCitedRecordID	wos001017307000009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_c8EEfnM6J84sgvvjQrV3TNnkc6pigY8hE30rzUTaQbWzd_n5zaTYGouBbKUkJvVzuLnf3-wHccZmbXREJL48C4dHMxCksCwJPG9NlvN2OTmJhySaSwYB9fvKha1a3vTBaa1t8plv4aHP5aiZXeFXWDizAHacVqCRJXDZrbVMGNApKaPDAaLAJOjY5SZ-3R8-jFtKEt0JjoELkBd-xQZUxVkBaapUf57E1Mr3aP5d3DEfOmyTdUvwnsKendahtmBqIU9w6HO7ADp7C0Hbdev3ZnAzKKnDyMSnG5NUVF5JHR7xD8O7X-IfEsiMRhEWWxkP13oyDSpDq0xJMFMsGvPeeRg99zzEreDKMWeFpkSeccXNO50rxOKda-1HGhdFHX6ksFsgXkSmpeaZjGgimw47iUSJzGuaJ9MMzqE5nU30OhDPBNWWCKuNZ5bKTGRcg45htVZLRkDahvfnXqXSw47i4r9SGHz5PjXRSlE7qpNOE--2MeQm58cfYWyO-7TDEyu53X1J8hzldBDNaB01ooLB2PlbKqQlXG3GnTnOXKYagCKHJ6MUv0y7hAJdQ1uxeQbVYrPQ17Mt1MVkubuym_AaQQd1l
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_8AvXBz4nTqUF88aFbu6Zt8jj8YOIcIhN9C81H2UA2cdW_31yajYEo-FZKE0Ivl7vL3f1-ABdcFXZXJDIokkgGNLdxCsujKDDWdFlvt22yVDqyiazfZ6-v_NE3q7teGGOMKz4zTXx0uXw9UZ94VdaKHMAdp8uwijOFVbvWPGlAk6gCB4-sDtuwY5aVDHlrcDdoIlF4M7YmKkZm8AUrtDzEGkhHrvLjRHZm5nb7nwvcgS3vT5JOtQF2YcmM92B7xtVAvOruweYC8OA-PLq-26A7eSf9qg6cvIzKIXnw5YXk2lPvELz9tR4icfxIBIGRlfVRgyfrohIk-3QUE-W0Bs-3N4OrbuC5FQIVp6wMjCwyzrg9qQuteVpQY8Ik59JqZKh1nkpkjMi1Mjw3KY0kM3Fb8yRTBY2LTIXxAayMJ2NzCIQzyQ1lkmrrWxWqnVsnIOeYb9WK0ZjWoTX710J54HFc3JtwAUjIhZWOQOkIL506XM5HvFegG398e27FN_8M0bK7nZ7Ad5jVRTijr6gONRTWwmSVnOrQmIlbeN2dCgxCEUST0aNfhp3Benfw0BO9u_79MWzgcqoK3gaslB-f5gTW1Fc5mn6cug36DTuu4Kw
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multi-Hop+Network+With+Multiple+Decision+Centers+Under+Expected-Rate+Constraints&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Hamad%2C+Mustapha&rft.au=Wigger%2C+Michele&rft.au=Sarkiss%2C+Mireille&rft.date=2023-07-01&rft.pub=IEEE&rft.issn=0018-9448&rft.volume=69&rft.issue=7&rft.spage=4255&rft.epage=4283&rft_id=info:doi/10.1109%2FTIT.2023.3238339&rft.externalDocID=10024994
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon