<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Towards Recommender System Supported Contact Tracing for Cost-Efficient and Risk Aware Infection Suppression ⋆</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Vladimir</forename><surname>Marbukh</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Information Technology Laboratory</orgName>
								<orgName type="institution">National Institute of Standards &amp; Technology</orgName>
								<address>
									<addrLine>100 Bureau Dr</addrLine>
									<settlement>Gaithersburg</settlement>
									<region>Maryland</region>
									<country key="US">USA</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Towards Recommender System Supported Contact Tracing for Cost-Efficient and Risk Aware Infection Suppression ⋆</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">0B05A829B3BC5A1FC4CE3E74175B0A10</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:22+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>contact tracing</term>
					<term>exposure notifications</term>
					<term>recommender system</term>
					<term>deep reinforcement learning</term>
					<term>partially observable Markov decision process</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>In public health, contact tracing is the process of identifying people who may have been exposed to an infected person. Contact tracing performance criteria, which include infection suppression, protection of high-risk individuals, and cost-efficiency, are not necessarily aligned with each other. Pareto optimization of the corresponding inherent trade-offs, especially at the early stages of infection, is typically unrealistic due to insufficient information on infection propagation, risk factors, prevention and treatment options, etc. We suggest that contact tracing performance can be significantly improved with the support of a specialized Recommender System (RS). Based on the combination of up-to-date contact tracing and medical data, RS can identify and test through Exposure Notification System (ENS) not only high-risk individuals but also potential superspreaders to suppress infection propagation. Due to incomplete information, the dynamic nature of the problem, and a large state and action spaces, the RS should be supported by Deep Reinforcement Learning (DRL) for solving the corresponding Partially Observable Markov Decision Process (POMDP).</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction &amp; Motivation</head><p>In public health, contact tracing is the process of identifying people who may have been exposed to an infected person, subsequent testing them for infection, and isolating or treating the infected <ref type="bibr" target="#b0">[1]</ref>. Contact tracing performance criteria include infection suppression, protection of high-risk individuals, and cost-efficiency. These criteria are not necessarily aligned with each other, e.g., given testing capacity, infection suppression requires high priority testing for the potential super spreaders, while protection of high-risk individuals requires testing them with higher priority. Given the testing priorities, the existing Google/Apple Exposure Notification (GAEN) technology <ref type="bibr" target="#b1">[2]</ref> can support an Exposure Notification System (ENS) by allowing public health authorities to quickly notify people for subsequent testing. GAEN is a framework and protocol specification developed by Apple Inc. and Google to facilitate digital contact tracing during the COVID-19 pandemic to augment more traditional contact tracing techniques using Android or iOS smartphones.</p><p>Extensive research on COVID-19 has revealed that while risk-aware, multi-criteria optimization of contact tracing has significant potential, realization of this potential requires deep knowledge of the infection propagation mechanisms, medical prognoses and treatment options for infected individuals with different risk profiles <ref type="bibr" target="#b2">[3]</ref>. Even though COVID-19 originated almost five years ago, such knowledge is still lacking <ref type="bibr" target="#b3">[4,</ref><ref type="bibr" target="#b4">5]</ref>, which suggests that a contact tracing system should have the ability to collect and make sense of all up-to-date available information on infection. This can be achieved with the Certain equipment, instruments, software, or materials are identified in this paper in order to specify the experimental procedure adequately. Such identification is not intended to imply recommendation or endorsement of any product or service by NIST, nor is it intended to imply that the materials or equipment identified are necessarily the best available for the purpose. Envelope marbukh@nist.gov (V. Marbukh) support of a specialized Recommender System (RS). Given testing capacity, the RS should utilize the upto-date contact tracing, medical, and all other available relevant data to identify and through Exposure Notification System (ENS) notify individuals to be tested <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b5">6]</ref>. Due to incomplete information, the dynamic nature of the problem, and a large state and action space the RS should be supported by Deep Reinforcement Learning (DRL) for solving the corresponding Partially Observable Markov Decision Process (POMDP) <ref type="bibr" target="#b6">[7,</ref><ref type="bibr" target="#b7">8]</ref>. POMDP describes the evolution of health status of each participating individual, where infectious status may not be observable and testing decisions are constrained by available testing capacity. Since a positive test result for some individual may reveal increased accumulated exposure for other individuals due to proximity to the newly discovered infection spreaders, the problem cannot be decoupled. These interdependencies significantly complicate the problem. The paper is organized as follows. Section 2 outlines operations and flow of information in the proposed RS supported contact tracing, and section 3 provides some technical details on accumulated exposure evaluation. 𝑖 . Note that participating individuals are likely to consent to revealing their health information since they would benefit from accounting for their risk factors, e.g., advanced age, preexisting conditions, etc. For not participating individuals, some relevant information, which does not require revealing individual identity, can be obtained without violating their privacy.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">RS Supported Contact Tracing</head><p>RS is also fed the estimate of the infection reproduction number 𝑅(𝑡), i.e., the average number of new infections produced by one infected individual during his/her lifetime: R (𝑡) ≈ 𝑅(𝑡). Estimate R (𝑡) may combine information from EMS, the Health Care System, and possibly from other tracing mechanisms not shown in Figure <ref type="figure" target="#fig_1">1</ref>, e.g., from manual tracing. Infection suppression requires keeping the infection reproduction number less than one: 𝑅(𝑡) &lt; 1. Due to numerous uncertainties in the 𝑅(𝑡) estimation: R (𝑡) ≈ 𝑅(𝑡), the infection suppression condition is R (𝑡) ≤ 1 − 𝜀, where "safety margin" 𝜀 &lt; 1 depends on the confidence level of the corresponding estimate. The reward of the RS supported Contact Tracing is quantified be the negative loss −𝐿(𝑡), where 𝐿(𝑡) = 𝐿 𝑒𝑐 (𝑡) + 𝐿 𝑠𝑐 (𝑡). Here economic loss due to lost productivity and cost of testing/treatment is 𝐿 𝑒𝑐 (𝑡), and "social cost" quantifying suffering and, most importantly, deaths due to the infection 𝐿 𝑠𝑐 (𝑡). The cost estimates are provided to RS by the Health Care System and Agencies collecting and processing economic data.</p><p>System evolution is described by POMDP 𝛿(𝑡) = (𝛿 𝑖 (𝑡)), where component 𝛿 𝑖 (𝑡) describes the health status of participating individual 𝑖 , i.e., "non-infected," "infected," "deceased." "Non-infected" and "infected" states may not be observable which makes process 𝛿(𝑡) partially observable. The decision to test a participating individual reveals his/her infected or not-infected status at a certain cost due to limited testing capacity. RL employs DRL to make testing decisions on the basis of</p><formula xml:id="formula_0">ℰ [0,𝑡] 𝑖 , 𝑥<label>(1)</label></formula><p>𝑖 , 𝑥</p><p>𝑖 . Constraints on the infection reproduction number can be incorporated through penalty function ℎ( R (𝑡)) which is flat for R (𝑡) ≤ 1 − 𝜀 and sharply increases for R (𝑡) &gt; 1 − 𝜀.</p><p>Our conjecture is that (near) optimal notification strategy is threshold-based: individual 𝑖 should be notified at the first moment 𝑡 = 𝜃 𝑖 &gt; 0 when this individual's accumulated exposure reaches threshold Ê 𝑖 :</p><formula xml:id="formula_2">𝜃 𝑖 = inf 𝑡≥0 {𝑡 ∶ ℰ [0,𝑡] 𝑖 ≥ Ê 𝑖 },<label>(1)</label></formula><p>where threshold Ê 𝑖 = Δ(ℰ , 𝑥) depends on the history of former testing decisions/results combined with medical and demographic data of these individuals. The function Δ(ℰ , 𝑥) can be evaluated by employing a Deep Supervised Learning (DSL) algorithm. Note that in practice, notification strategy may operate on the basis of a small number of risk groups <ref type="bibr" target="#b2">[3]</ref>, which may be defined and then redefined by an on-line clustering algorithm. Assumptions of homogeneity and large number of individuals within each group, simplifies optimization of group-specific thresholds in (1).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Accumulated Exposure</head><p>For each participating individual 𝑖, the contact tracing system identifies "accumulated exposure" to another participating individual 𝑗 during time interval [0, 𝑡] as follows:</p><formula xml:id="formula_3">ℰ [0,𝑡] 𝑖𝑗 = ∫ 𝑇 0 𝜙 [( d/𝑑 𝑖𝑗 (𝜏 )) 𝛼 ] 𝑑𝜏 ,<label>(2)</label></formula><p>where the corresponding instantaneous exposure rate 𝜙(𝑧) is an increasing function of 𝑧 &gt; 0, the distance between individuals 𝑖 and 𝑗 at moment 𝜏 is 𝑑 𝑖𝑗 (𝜏 ), and d &gt; 0, 𝛼 ≥ 1 are some parameters. Individual 𝑖 accumulated exposure to infection during time interval [0, 𝑡] is defined as the aggregated exposure to all known spreaders during this time interval:</p><formula xml:id="formula_4">ℰ [0,𝑡] 𝑖 = ∑ 𝑗 ∫ 𝑇 0 𝜋 𝑗 (𝜏 )𝜙 [( d/𝑑 𝑖𝑗 (𝜏 )) 𝛼 ] 𝑑𝜏 ,<label>(3)</label></formula><p>where 𝜋 𝑗 (𝜏 ) = 1 if individual 𝑗 is infected at moment 𝜏 and 𝜋 𝑗 (𝜏 ) = 0 otherwise. Consider some examples. As currently defined by the CDC <ref type="bibr" target="#b0">[1]</ref>, a high-risk COVID-19 exposure is a contact with a person who tests/tested positive for SARS-CoV-2 which takes place at a distance of less than two meters for a total of 15 minutes or more over a 24-hour period. In this case, d = 2 m, 𝛼 → ∞, 𝜙(𝑥) ≡ min(𝑥, 1), and thus an individual is assumed exposed if ℰ [0,𝑇 ] = ∫ 24 0 𝟙(𝑑(𝑡) − 2 m)𝑑𝑡 &gt; 15 min, where 𝟙(𝑥) = 0 if 𝑥 ≤ 0 and 𝟙(𝑥) = 1 otherwise. In another example <ref type="bibr" target="#b8">[9]</ref>, d = 2 m, 𝜙(𝑥) ≡ 𝑥, and thus an individual is assumed exposed if ℰ [0,𝑇 ] = ∫ 24 0 (2/𝑑(𝑡)) 𝛼 𝑑𝑡 &gt; 15 min. Finally note that available information on accumulated exposure to specific individuals can be used to identify "infection superspreaders" who otherwise could be unidentified, e.g., due to being asymptomatic or for any other reason. This can be done with known algorithms <ref type="bibr" target="#b9">[10]</ref> on undirected exposure graph 𝐺 where nodes 𝑖 and 𝑗 are connected if ℰ𝑖𝑗 [0,𝑡] ≥ Ȇ [0,𝑡] , and Ȇ [0,𝑡] &gt; 0 is a properly defined threshold.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>HealthRecSys' 24 :</head><label>24</label><figDesc>The 6th Workshop on Health Recommender Systems co-located with ACM RecSys 2024 ⋆ Official contribution of the National Institute of Standards and Technology; not subject to copyright in the United States.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Recommender System supported Contact Tracing.</figDesc><graphic coords="2,184.82,65.61,225.64,204.06" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 2</head><label>2</label><figDesc>Figure 2 presents a highly aggregated view of a Recommender System supported Contact Tracing System.The Exposure Monitoring System (EMS) monitors "accumulated exposure to infection" for each participating individual 𝑖, ℰ [0,𝑡] 𝑖 (defined in the next section) in near real time 𝑡, and feeds this information into the RS. RS also gets available information on demographic and risk factors of participating individuals 𝑥<ref type="bibr" target="#b0">(1)</ref> 𝑖 as well as health status of both participating and not participating individuals who went through Health Care System 𝑥<ref type="bibr" target="#b1">(2)</ref> </figDesc></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Contact tracing</title>
		<author>
			<persName><surname>Cdc</surname></persName>
		</author>
		<ptr target="https://www.cdc.gov/museum/pdf/cdcm-pha-stem-lesson-contact-tracing-lesson.pdf" />
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Digital exposure notification tools: A global landscape analysis</title>
		<author>
			<persName><forename type="first">C</forename><surname>Nebeker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Kareem</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Yong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Kunowski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Malekinejad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Aronoff-Spencer</surname></persName>
		</author>
		<idno type="DOI">10.1371/journal.pdig.0000287</idno>
	</analytic>
	<monogr>
		<title level="j">PLOS Digital Health</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="page" from="1" to="16" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Optimal Targeted Lockdowns in a Multigroup SIR Model</title>
		<author>
			<persName><forename type="first">D</forename><surname>Acemoglu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Chernozhukov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Werning</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">D</forename><surname>Whinston</surname></persName>
		</author>
		<idno type="DOI">10.1257/aeri.20200590</idno>
	</analytic>
	<monogr>
		<title level="j">American Economic Review: Insights</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="487" to="502" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Estimating the COVID-19 infection rate: Anatomy of an inference problem</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">F</forename><surname>Manski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Molinari</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jeconom.2020.04.041</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Econometrics</title>
		<imprint>
			<biblScope unit="volume">220</biblScope>
			<biblScope unit="page" from="181" to="192" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Estimating actual SARS-CoV-2 infections from secondary data</title>
		<author>
			<persName><forename type="first">W</forename><surname>Rauch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Schenk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Rauch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Harders</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Oberacher</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Insam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Markt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Kreuzinger</surname></persName>
		</author>
		<idno type="DOI">10.1038/s41598-024-57238-0</idno>
	</analytic>
	<monogr>
		<title level="j">Scientific Reports</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="page">6732</biblScope>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Deep reinforcement learning in recommender systems: A survey and new perspectives</title>
		<author>
			<persName><forename type="first">X</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Yao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mcauley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Wang</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.knosys.2023.110335</idno>
	</analytic>
	<monogr>
		<title level="j">Knowledge-Based Systems</title>
		<imprint>
			<biblScope unit="volume">264</biblScope>
			<biblScope unit="page">110335</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Recent advances in deep reinforcement learning applications for solving partially observable markov decision processes (POMDP) problems: Part 1-fundamentals and applications in games, robotics and natural language processing</title>
		<author>
			<persName><forename type="first">X</forename><surname>Xiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Foo</surname></persName>
		</author>
		<idno type="DOI">10.3390/make3030029</idno>
	</analytic>
	<monogr>
		<title level="j">Machine Learning and Knowledge Extraction</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="554" to="581" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Recent advances in deep reinforcement learning applications for solving partially observable markov decision processes (POMDP) problems part 2-applications in transportation, industries, communications and networking and more topics</title>
		<author>
			<persName><forename type="first">X</forename><surname>Xiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Foo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zang</surname></persName>
		</author>
		<idno type="DOI">10.3390/make3040043</idno>
	</analytic>
	<monogr>
		<title level="j">Machine Learning and Knowledge Extraction</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="863" to="878" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Impact of using soft exposure thresholds in automatic contact tracing</title>
		<author>
			<persName><forename type="first">K</forename><surname>Sayrafian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Cloteaux</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Marbukh</surname></persName>
		</author>
		<idno type="DOI">10.1109/HealthCom54947.2022.9982790</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE International Conference on E-health Networking, Application &amp; Services (HealthCom)</title>
				<imprint>
			<date type="published" when="2022">2022. 2022</date>
			<biblScope unit="page" from="1" to="6" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Identifying and quantifying potential super-spreaders in social networks</title>
		<author>
			<persName><forename type="first">D</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Zhang</surname></persName>
		</author>
		<idno type="DOI">10.1038/s41598-019-51153-5</idno>
	</analytic>
	<monogr>
		<title level="j">Scientific Reports</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page">14811</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
