{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:27Z","timestamp":1750221087613,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["2R01GM057089, 1U01AI124302"],"award-info":[{"award-number":["2R01GM057089, 1U01AI124302"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009708","name":"Novo Nordisk Fonden","doi-asserted-by":"publisher","award":["NNF10CC1016517"],"award-info":[{"award-number":["NNF10CC1016517"]}],"id":[{"id":"10.13039\/501100009708","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1741129"],"award-info":[{"award-number":["IIS-1741129"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330775","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"2202-2211","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Estimating Cellular Goals from High-Dimensional Biological Data"],"prefix":"10.1145","author":[{"given":"Laurence","family":"Yang","sequence":"first","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Michael A.","family":"Saunders","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Jean-Christophe","family":"Lachance","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Sherbrooke, Sherbrooke, PQ, Canada"}]},{"given":"Bernhard O.","family":"Palsson","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Jos\u00e9","family":"Bento","sequence":"additional","affiliation":[{"name":"Boston College, Chestnut Hill, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10295-015-1585-x"},{"volume-title":"Practical bilevel optimization: algorithms and applications","author":"Bard J. F.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0609845104"},{"key":"e_1_3_2_1_4_1","unstructured":"J. Bento N. Derbinsky J. Alonso-Mora and J. S. Yedidia. 2013. A message-passing algorithm for multi-agent trajectory planning. In Adv Neur In . 521--529.   J. Bento N. Derbinsky J. Alonso-Mora and J. S. Yedidia. 2013. A message-passing algorithm for multi-agent trajectory planning. In Adv Neur In . 521--529."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1038\/nrg3643"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4072"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2458"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/bit.10617"},{"key":"e_1_3_2_1_10_1","unstructured":"R. L. Carmichael. {n. d.}. Public Domain Aeronautical Software . http:\/\/www.pdas.com . Accessed: 2018-08--12.  R. L. Carmichael. {n. d.}. Public Domain Aeronautical Software . http:\/\/www.pdas.com . Accessed: 2018-08--12."},{"key":"e_1_3_2_1_11_1","unstructured":"N. Derbinsky J. Bento V. Elser and J. S. Yedidia. 2013b. An improved three-weight message-passing algorithm. arXiv preprint arXiv:1305.1961 (2013).  N. Derbinsky J. Bento V. Elser and J. S. Yedidia. 2013b. An improved three-weight message-passing algorithm. arXiv preprint arXiv:1305.1961 (2013)."},{"key":"e_1_3_2_1_12_1","unstructured":"N. Derbinsky J. Bento and J. S. Yedidia. 2013a. Methods for integrating knowledge with the three-weight optimization algorithm for hybrid cognitive processing. arXiv preprint arXiv:1311.4064 (2013).  N. Derbinsky J. Bento and J. S. Yedidia. 2013a. Methods for integrating knowledge with the three-weight optimization algorithm for hybrid cognitive processing. arXiv preprint arXiv:1311.4064 (2013)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/992200.992202"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"A. M. Feist and B. O. Palsson. 2016. What do cells actually want? Genome biology Vol. 17 1 (2016) 110.  A. M. Feist and B. O. Palsson. 2016. What do cells actually want? Genome biology Vol. 17 1 (2016) 110.","DOI":"10.1186\/s13059-016-0983-3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1038\/msb.2011.35"},{"volume-title":"IEEE International Symposium on Information Theory. IEEE, 2104--2108","author":"Bento G.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"E. P. Gianchandani M. A. Oberhardt A. P. Burgard C. D. Maranas and J. A. Papin. 2008. Predicting biological system objectives de novo from internal state measurements. BMC bioinformatics Vol. 9 1 (2008) 43.  E. P. Gianchandani M. A. Oberhardt A. P. Burgard C. D. Maranas and J. A. Papin. 2008. Predicting biological system objectives de novo from internal state measurements. BMC bioinformatics Vol. 9 1 (2008) 43.","DOI":"10.1186\/1471-2105-9-43"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236465"},{"key":"e_1_3_2_1_19_1","unstructured":"L Hanyk. {n. d.}. UMFPACK Fortran interface . http:\/\/geo.mff.cuni.cz\/ lh\/Fortran\/UMFPACK\/. Accessed: 2018-08--18.  L Hanyk. {n. d.}. UMFPACK Fortran interface . http:\/\/geo.mff.cuni.cz\/ lh\/Fortran\/UMFPACK\/. Accessed: 2018-08--18."},{"volume-title":"IEEE International Parallel and Distributed Processing Symposium Workshops. IEEE, 835--844","author":"Hao N.","key":"e_1_3_2_1_20_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3254"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004603514434"},{"key":"e_1_3_2_1_23_1","unstructured":"HSL. 2013. A collection of Fortran codes for large scale scientific computation. http:\/\/www.hsl.rl.ac.uk  HSL. 2013. A collection of Fortran codes for large scale scientific computation. http:\/\/www.hsl.rl.ac.uk"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2593681"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkv1049"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.copbio.2017.11.015"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1006302"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/bit.260350711"},{"volume-title":"NIPS 2015 Workshop on Learning, Inference, and Control of Multi-agent Systems .","author":"Mathy C. J. M.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2870"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3956"},{"key":"e_1_3_2_1_33_1","unstructured":"R. Nishihara L. Lessard B. Recht A. Packard and M. I. Jordan. 2015. A general analysis of the convergence of ADMM. (2015).  R. Nishihara L. Lessard B. Recht A. Packard and M. I. Jordan. 2015. A general analysis of the convergence of ADMM. (2015)."}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330775","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330775","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:51Z","timestamp":1750208271000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":32,"alternative-id":["10.1145\/3292500.3330775","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330775","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}