{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T16:10:05Z","timestamp":1750781405185,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,23]]},"DOI":"10.1145\/3726301.3728413","type":"proceedings-article","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T11:16:41Z","timestamp":1750504601000},"page":"29-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Generative Discrete Event Process Simulation for Hidden Markov Models to Predict Competitor Time-to-Market"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4755-7821","authenticated-orcid":false,"given":"Nandakishore","family":"Santhi","sequence":"first","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2628-1854","authenticated-orcid":false,"given":"Stephan","family":"Eidenbenz","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4231-3948","authenticated-orcid":false,"given":"Brian","family":"Key","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8462-4336","authenticated-orcid":false,"given":"George","family":"Tompkins","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"L. Bahl J. Cocke F. Jelinek and J. Raviv. 1974. Optimal Decoding of Linear Codes for minimizing symbol error rate. IEEE Transactions on Information Theory 20 2 (1974) 284\u2013287. https:\/\/doi.org\/10.1109\/TIT.1974.1055186","DOI":"10.1109\/TIT.1974.1055186"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Forney\u00a0G. D.1973. The Viterbi algorithm. Proc. IEEE 61 3 (1973) 268\u2013278. https:\/\/doi.org\/10.1109\/PROC.1973.9030","DOI":"10.1109\/PROC.1973.9030"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841356.38"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/11556992_38"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"R. Jouini C. Houaidia and L.A. Saidane. 2023. Hidden Markov Model for early prediction of the elderly\u2019s dependency evolution in ambient assisted living. Ann. Telecommun 78 (2023) 599\u2013615. https:\/\/doi.org\/10.1007\/s12243-023-00964-9","DOI":"10.1007\/s12243-023-00964-9"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"L.\u00a0R. Rabiner. 1989. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proc. IEEE 77 2 (1989) 257\u2013286. https:\/\/doi.org\/10.1109\/5.18626","DOI":"10.1109\/5.18626"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2015.7408405"},{"key":"e_1_3_3_1_9_2","unstructured":"Don Sherman. 2015. How a Car is Made: Every Step from Invention to Launch. https:\/\/www.caranddriver.com\/news\/a15350381\/how-a-car-is-made-every-step-from-invention-to-launch\/"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Erik Skau Andrew Hollis Stephan Eidenbenz Kim Rasmussen and Boian Alexandrov. 2024. Generating Hidden Markov Models from Process Models Through Nonnegative Tensor Factorization. ACM Transactions on Modeling and Computer Simulation 34 21 (2024) 1\u201319. Issue 4.","DOI":"10.1145\/3664813"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"A.\u00a0J. Viterbi. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13 2 (1967) 260\u2013269. https:\/\/doi.org\/10.1109\/TIT.1967.1054010","DOI":"10.1109\/TIT.1967.1054010"}],"event":{"name":"SIGSIM-PADS '25: 39th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","sponsor":["SIGSIM ACM Special Interest Group on Simulation and Modeling"],"location":"Santa Fe USA","acronym":"SIGSIM-PADS '25"},"container-title":["Proceedings of the 39th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726301.3728413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T15:33:51Z","timestamp":1750779231000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726301.3728413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":10,"alternative-id":["10.1145\/3726301.3728413","10.1145\/3726301"],"URL":"https:\/\/doi.org\/10.1145\/3726301.3728413","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]},"assertion":[{"value":"2025-06-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}