# Inverse Problems in Counterterrorism Networks **Entity class:** Analytic inference framework ## Definition **Inverse problems in counterterrorism networks** begin with incomplete observations and ask which hidden identities, relationships, parameters, or network states could plausibly have produced them. The corresponding forward question asks what observations would be expected if a hypothesized network state were true. The problem is ill-posed: many hidden configurations can generate similar observations. A disciplined output is therefore a distribution over hypotheses with provenance and uncertainty, not an omniscient threat label. ## Significance Oden-style Bayesian inference and UQ provide the relevant discipline. The same principle that prevents a neutron-transport model from claiming certainty under sparse measurements prevents a social graph from treating an ambiguous contact, shared location, ideological statement, or centrality measure as proof of intent. ## Relationships - **specialization of:** [[wiki/Inverse Problem|Inverse Problem]]. - **graph object:** [[wiki/Counterterrorism Predictive Graph|Counterterrorism Predictive Graph]]. - **requires:** [[wiki/Identity and Relationship Analysis|Identity and Relationship Analysis]], provenance, and [[wiki/Uncertainty Quantification|Uncertainty Quantification]]. - **accelerated by:** [[wiki/Reduced-Order Modeling|Reduced-Order Modeling]] when the state space is too large for continuous full inference. ## Sources / Provenance - [[research/Oden Institute - Theater-to-Person Predictive Scale|Oden Institute: From Theater-Scale Fields to Person-Scale Receptors]] - [ODNI — Data Mining Report CY2021–2023](https://www.odni.gov/files/documents/CLPO/CY2021-2023_Data_Mining_Report_FINAL.pdf)