{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:07:32Z","timestamp":1780373252087,"version":"3.54.1"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032272416","type":"print"},{"value":"9783032272423","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27242-3_15","type":"book-chapter","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:30:00Z","timestamp":1780371000000},"page":"243-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Contextual Preference Distribution Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9461-5895","authenticated-orcid":false,"given":"Benjamin","family":"Hudson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6545-9459","authenticated-orcid":false,"given":"Laurent","family":"Charlin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1930-607X","authenticated-orcid":false,"given":"Emma","family":"Frejinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Allen, R., Rehbeck, J.: Identification With Additively Separable Heterogeneity. Econometrica 87(3), 1021\u20131054 (2019). https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.3982\/ECTA15867, https:\/\/doi.org\/10.3982\/ECTA15867","DOI":"10.3982\/ECTA15867"},{"key":"15_CR2","unstructured":"Berthet, Q., Blondel, M., Teboul, O., Cuturi, M., Vert, J.P., Bach, F.: Learning with differentiable perturbed optimizers. In: Advances in Neural Information Processing Systems, vol. 33, pp. 9508\u20139519. Curran Associates, Inc. (2020), https:\/\/papers.nips.cc\/paper\/2020\/hash\/6bb56208f672af0dd65451f869fedfd9-Abstract.html"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.ejor.2022.03.030","volume":"304","author":"D Bertsimas","year":"2023","unstructured":"Bertsimas, D., McCord, C., Sturt, B.: Dynamic optimization with side information. Eur. J. Oper. Res. 304(2), 634\u2013651 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2022.03.030","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1287\/opre.2021.0369","volume":"73","author":"O Besbes","year":"2025","unstructured":"Besbes, O., Fonseca, Y., Lobel, I.: Contextual inverse optimization: offline and online learning. Oper. Res. 73(1), 424\u2013443 (2025). https:\/\/doi.org\/10.1287\/opre.2021.0369","journal-title":"Oper. Res."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Birge, J., Li, X., Sun, C.: Learning from Stochastically Revealed Preference. Adv. Neural. Inf. Process. Syst. 35, 35061\u201335071 (2022). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2022\/hash\/e3c3473812173643147170188ef2b141-Abstract-Conference.html","DOI":"10.52202\/068431-2541"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Burton, J.W., Stein, M.K., Jensen, T.B.: A systematic review of algorithm aversion in augmented decision making. J. Behav. Decis. Mak. 33(2), 220\u2013239 (2020). https:\/\/doi.org\/10.1002\/bdm.2155, https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/bdm.2155","DOI":"10.1002\/bdm.2155"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10601-023-09363-2","volume":"28","author":"R Canoy","year":"2023","unstructured":"Canoy, R., Bucarey, V., Mandi, J., Guns, T.: Learn and route: learning implicit preferences for vehicle routing. Constraints 28(3), 363\u2013396 (2023). https:\/\/doi.org\/10.1007\/s10601-023-09363-2","journal-title":"Constraints"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-030-30048-7_4","volume-title":"Principles and Practice of Constraint Programming","author":"R Canoy","year":"2019","unstructured":"Canoy, R., Guns, T.: Vehicle routing by learning from historical solutions. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 54\u201370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_4"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1287\/opre.2022.0382","volume":"73","author":"TCY Chan","year":"2025","unstructured":"Chan, T.C.Y., Mahmood, R., Zhu, I.Y.: Inverse optimization: theory and applications. Oper. Res. 73(2), 1046\u20131074 (2025). https:\/\/doi.org\/10.1287\/opre.2022.0382","journal-title":"Oper. Res."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Chen, N., Farajollahzadeh, S., Wang, G.: Learning Consumer Preferences from Bundle Sales Data (Sep 2022). https:\/\/doi.org\/10.48550\/arXiv.2209.04942","DOI":"10.2139\/ssrn.4467829"},{"key":"15_CR11","unstructured":"Chenreddy, A., Delage, E.: End-to-end Conditional Robust Optimization (Mar 2024). https:\/\/doi.org\/10.48550\/arXiv.2403.04670"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Chenreddy, A.R., Bandi, N., Delage, E.: Data-Driven Conditional Robust Optimization. Adv. Neural. Inf. Process. Syst. 35, 9525\u20139537 (2022). https:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/3df874367ce2c43891aab1ab23ae6959-Abstract-Conference.html","DOI":"10.52202\/068431-0692"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10287-021-00400-0","volume":"19","author":"Y Deng","year":"2022","unstructured":"Deng, Y., Sen, S.: Predictive stochastic programming. CMS 19(1), 65\u201398 (2022). https:\/\/doi.org\/10.1007\/s10287-021-00400-0","journal-title":"CMS"},{"key":"15_CR14","unstructured":"Elmachtoub, A.N., Lam, H., Zhang, H., Zhao, Y.: Estimate-Then-Optimize versus Integrated-Estimation-Optimization versus Sample Average Approximation: A Stochastic Dominance Perspective (May 2025). https:\/\/doi.org\/10.48550\/arXiv.2304.06833"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Elmasri, M., Labbe, A., Larocque, D., Charlin, L.: Predictive inference for travel time on transportation networks (Mar 2023). https:\/\/doi.org\/10.48550\/arXiv.2004.11292","DOI":"10.48550\/arXiv.2004.11292"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.trb.2013.07.012","volume":"56","author":"M Fosgerau","year":"2013","unstructured":"Fosgerau, M., Frejinger, E., Karlstrom, A.: A link based network route choice model with unrestricted choice set. Trans. Res. Part B: Methodol. 56, 70\u201380 (2013). https:\/\/doi.org\/10.1016\/j.trb.2013.07.012","journal-title":"Trans. Res. Part B: Methodol."},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Fosgerau, M., Paulsen, M., Rasmussen, T.K.: A perturbed utility route choice model. Trans. Res. Part C: Emerging Technol. 136, 103514 (2022). https:\/\/doi.org\/10.1016\/j.trc.2021.103514, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0968090X21004976","DOI":"10.1016\/j.trc.2021.103514"},{"issue":"5","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/s00778-020-00608-7","volume":"29","author":"C Guo","year":"2020","unstructured":"Guo, C., Yang, B., Hu, J., Jensen, C.S., Chen, L.: Context-aware, preference-based vehicle routing. VLDB J. 29(5), 1149\u20131170 (2020). https:\/\/doi.org\/10.1007\/s00778-020-00608-7","journal-title":"VLDB J."},{"key":"15_CR19","unstructured":"Hannah, L., Powell, W., Blei, D.: Nonparametric density estimation for stochastic optimization with an observable state variable. In: Advances in Neural Information Processing Systems. vol. 23. Curran Associates, Inc. (2010). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2010\/hash\/e1e32e235eee1f970470a3a6658dfdd5-Abstract.html"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2307\/2393078","volume":"29","author":"JR Harrison","year":"1984","unstructured":"Harrison, J.R., March, J.G.: Decision making and postdecision surprises. Adm. Sci. Q. 29(1), 26\u201342 (1984). https:\/\/doi.org\/10.2307\/2393078","journal-title":"Adm. Sci. Q."},{"key":"15_CR21","unstructured":"Hunter, T., Herring, R., Abbeel, P., Bayen, A.: Path and travel time inference from GPS probe vehicle data. NIPS Analy. Netw. Learn. Graphs 12, 1\u20138 (2009). https:\/\/snap.stanford.edu\/nipsgraphs2009\/papers\/hunter-paper.pdf"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-023-02014-7","volume":"207","author":"R Kannan","year":"2024","unstructured":"Kannan, R., Bayraksan, G., Luedtke, J.R.: Residuals-based distributionally robust optimization with covariate information. Math. Program. 207(1), 369\u2013425 (2024). https:\/\/doi.org\/10.1007\/s10107-023-02014-7","journal-title":"Math. Program."},{"key":"15_CR23","unstructured":"Kristensen, D.: On inverse reinforcement learning and dynamic discrete choice for predicting path choices (Nov 2021). http:\/\/hdl.handle.net\/1866\/26530"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Lin, B., Delage, E., Chan, T.C.: Conformal Inverse Optimization. Adv. Neural. Inf. Process. Syst. 37, 63534\u201363564 (2024). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2024\/hash\/7423902b5534e2b267438c85444a54b1-Abstract-Conference.html","DOI":"10.52202\/079017-2029"},{"key":"15_CR25","unstructured":"Lu, H., Peng, Z., Yang, J.: MPAX: Mathematical Programming in JAX (Feb 2025). https:\/\/doi.org\/10.48550\/arXiv.2412.09734"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Mandi, J., et al.: Decision-focused learning: foundations, state of the art, benchmark and future opportunities. J. Artifi. Intell. Res. 80, 1623\u20131701 (2024). https:\/\/doi.org\/10.1613\/jair.1.15320, http:\/\/arxiv.org\/abs\/2307.13565","DOI":"10.1613\/jair.1.15320"},{"key":"15_CR27","unstructured":"McFadden, D.: Econometric models of probabilistic choice. Structural analysis of discrete data with econometric applications 198272 (1981)"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"McFadden, D., Fosgerau, M.: A theory of the perturbed consumer with general budgets. Tech. rep., National Bureau of Economic Research (2012). https:\/\/www.nber.org\/papers\/w17953","DOI":"10.3386\/w17953"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Merch\u00e1n, D., et al.: 2021 amazon last mile routing research challenge: data set. Transp. Sci. 58(1), 8\u201311 (2024). https:\/\/doi.org\/10.1287\/trsc.2022.1173, https:\/\/pubsonline.informs.org\/doi\/full\/10.1287\/trsc.2022.1173","DOI":"10.1287\/trsc.2022.1173"},{"key":"15_CR30","doi-asserted-by":"publisher","unstructured":"Minervini, P., Franceschi, L., Niepert, M.: Adaptive perturbation-based gradient estimation for discrete latent variable models. In: Proceedings of the AAAI Conference on Artificial Intelligence , vol. 37(8), pp. 9200\u20139208 (2023). https:\/\/doi.org\/10.1609\/aaai.v37i8.26103","DOI":"10.1609\/aaai.v37i8.26103"},{"issue":"1","key":"15_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-017-1216-6","volume":"167","author":"P Mohajerin Esfahani","year":"2018","unstructured":"Mohajerin Esfahani, P., Shafieezadeh-Abadeh, S., Hanasusanto, G.A., Kuhn, D.: Data-driven inverse optimization with imperfect information. Math. Program. 167(1), 191\u2013234 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1216-6","journal-title":"Math. Program."},{"key":"15_CR32","unstructured":"Mohamed, S., Rosca, M., Figurnov, M., Mnih, A.: Monte Carlo Gradient Estimation in Machine Learning (Sep 2020). https:\/\/doi.org\/10.48550\/arXiv.1906.10652"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Mulamba, M., Mandi, J., Diligenti, M., Lombardi, M., Bucarey, V., Guns, T.: Contrastive Losses and Solution Caching for Predict-and-Optimize (Jul 2021). https:\/\/doi.org\/10.48550\/arXiv.2011.05354","DOI":"10.24963\/ijcai.2021\/390"},{"key":"15_CR34","unstructured":"Murphy, K.P.: Probabilistic Machine Learning: Advanced Topics. The MIT Press, Cambridge, Massachusetts (2023)"},{"key":"15_CR35","unstructured":"Nguyen, T.: ETA Phone Home: How Uber Engineers an Efficient Route (Nov 2015). https:\/\/www.uber.com\/en-EG\/blog\/engineering-routing-engine\/"},{"key":"15_CR36","unstructured":"Niepert, M., Minervini, P., Franceschi, L.: Implicit MLE: Backpropagating through discrete exponential family distributions. In: Advances in Neural Information Processing Systems, vol. 34, pp. 14567\u201314579. Curran Associates, Inc. (2021). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/hash\/7a430339c10c642c4b2251756fd1b484-Abstract.html"},{"issue":"2","key":"15_CR37","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3390\/math9020119","volume":"9","author":"S Ohmori","year":"2021","unstructured":"Ohmori, S.: A predictive prescription using minimum volume k-nearest neighbor enclosing ellipsoid and robust optimization. Mathematics 9(2), 119 (2021). https:\/\/doi.org\/10.3390\/math9020119","journal-title":"Mathematics"},{"key":"15_CR38","unstructured":"Patel, Y., Rayan, S., Tewari, A.: Conformal Contextual Robust Optimization (Oct 2023). https:\/\/doi.org\/10.48550\/arXiv.2310.10003"},{"key":"15_CR39","doi-asserted-by":"publisher","unstructured":"Per\u0161ak, E., Anjos, M.F.: Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Presented at the (2023). https:\/\/doi.org\/10.1007\/978-3-031-33271-5_9 Contextual Robust Optimisation with Uncertainty Quantification","DOI":"10.1007\/978-3-031-33271-5_9"},{"key":"15_CR40","doi-asserted-by":"publisher","unstructured":"Sadana, U., Chenreddy, A., Delage, E., Forel, A., Frejinger, E., Vidal, T.: A survey of contextual optimization methods for decision-making under uncertainty. Eur. J. Oper. Res. 320(2), 271\u2013289 (2025). https:\/\/doi.org\/10.1016\/j.ejor.2024.03.020. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221724002200","DOI":"10.1016\/j.ejor.2024.03.020"},{"key":"15_CR41","unstructured":"Sahoo, S.S., Vlastelica, M., Paulus, A., Musil, V., Kuleshov, V., Martius, G.: Gradient Backpropagation Through Combinatorial Algorithms: Identity with Projection Works (May 2022). https:\/\/doi.org\/10.48550\/arXiv.2205.15213"},{"key":"15_CR42","unstructured":"Silvestri, M., et al.: Score Function Gradient Estimation to Widen the Applicability of Decision-Focused Learning (Jun 2024). https:\/\/doi.org\/10.48550\/arXiv.2307.05213"},{"key":"15_CR43","unstructured":"Srivastava, P.R., Wang, Y., Hanasusanto, G.A., Ho, C.P.: On Data-Driven Prescriptive Analytics with Side Information: A Regularized Nadaraya-Watson Approach (Oct 2021). https:\/\/doi.org\/10.48550\/arXiv.2110.04855"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Sun, C., Liu, L., Li, X.: Predict-then-calibrate: a new perspective of robust contextual LP. Adv. Neural. Inf. Process. Syst. 36, 17713\u201317741 (2023). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2023\/hash\/397271e11322fae8ba7f827c50ca8d9b-Abstract-Conference.html","DOI":"10.52202\/075280-0778"},{"key":"15_CR45","unstructured":"Sun, C., Liu, S., Li, X.: Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programming (May 2023). https:\/\/doi.org\/10.48550\/arXiv.2301.11260"},{"key":"15_CR46","doi-asserted-by":"publisher","unstructured":"Train, K.E.: Discrete Choice Methods with Simulation. Cambridge University Press, Cambridge, 2 edn. (2009). https:\/\/doi.org\/10.1017\/CBO9780511805271, https:\/\/www.cambridge.org\/core\/books\/discrete-choice-methods-with-simulation\/49CABD00F3DDDA088A8FBFAAAD7E9546","DOI":"10.1017\/CBO9780511805271"},{"key":"15_CR47","unstructured":"Vlastelica, M., Paulus, A., Musil, V., Martius, G., Rol\u00ednek, M.: Differentiation of Blackbox Combinatorial Solvers (Feb 2020). https:\/\/doi.org\/10.48550\/arXiv.1912.02175"},{"issue":"1","key":"15_CR48","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.ejor.2016.01.004","volume":"252","author":"BS Westgate","year":"2016","unstructured":"Westgate, B.S., Woodard, D.B., Matteson, D.S., Henderson, S.G.: Large-network travel time distribution estimation for ambulances. Eur. J. Oper. Res. 252(1), 322\u2013333 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.01.004","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR49","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2023.0254","author":"P Zattoni Scroccaro","year":"2024","unstructured":"Zattoni Scroccaro, P., Atasoy, B., Mohajerin Esfahani, P.: Learning in inverse optimization: incenter cost, augmented suboptimality loss, and algorithms. Oper. Res. (2024). https:\/\/doi.org\/10.1287\/opre.2023.0254","journal-title":"Oper. Res."},{"key":"15_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2023.104079","volume":"149","author":"Z Zhao","year":"2023","unstructured":"Zhao, Z., Liang, Y.: A deep inverse reinforcement learning approach to route choice modeling with context-dependent rewards. Trans. Res. Part C: Emerging Technol. 149, 104079 (2023). https:\/\/doi.org\/10.1016\/j.trc.2023.104079","journal-title":"Trans. Res. Part C: Emerging Technol."},{"key":"15_CR51","unstructured":"Ziebart, B.D., Maas, A., Bagnell, J.A., Dey, A.K.: Maximum entropy inverse reinforcement learning. In: Proceedings of the 23rd National Conference on Artificial Intelligence, AAAI 2008, vol. 3, pp. 1433\u20131438. AAAI Press, Chicago, Illinois (Jul 2008). https:\/\/cdn.aaai.org\/AAAI\/2008\/AAAI08-227.pdf"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27242-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:30:11Z","timestamp":1780371011000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27242-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032272416","9783032272423"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27242-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2026\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}