{"entities":{"Q5092175":{"pageid":7121751,"ns":120,"title":"Item:Q5092175","lastrevid":100184624,"modified":"2026-06-05T21:34:21Z","type":"item","id":"Q5092175","labels":{"en":{"language":"en","value":"An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7564894"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5092175$1B3EFB0A-412D-4806-8A66-F8A061D4A491","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1eaddb3912c66c2f059eaa83ec92e390bbdf98da","datavalue":{"value":{"text":"An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5092175$CD5D58D7-D0E7-483E-9804-8AC841E4EBEC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f7558b33652ae6898c70f90e680246d9e7fb6df8","datavalue":{"value":"10.1109/TAC.2021.3088792","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5092175$48F1E97B-A726-4621-AA5B-DAD9A920F39A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6d56e89cf37593c17852e4a3ac402e912bb68c05","datavalue":{"value":{"entity-type":"item","numeric-id":3386307,"id":"Q3386307"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5092175$0B9A9101-096C-416F-8F88-5193096E1506","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"02da8684a8cd8b0e4ad56dfc271844e2cf611ceb","datavalue":{"value":{"entity-type":"item","numeric-id":645550,"id":"Q645550"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5092175$9BDBEA85-26F4-49A3-A5CD-9E5664BD4990","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"68b856425cdc52580114e016d158bf1057594783","datavalue":{"value":{"entity-type":"item","numeric-id":258306,"id":"Q258306"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5092175$167FB2E3-D1A0-488A-B2A4-55DAD9F054F2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"231075b9dab1b13e4c64992ef81666085035687e","datavalue":{"value":{"entity-type":"item","numeric-id":123639,"id":"Q123639"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5092175$B17BE6BC-5B88-4078-A49F-D14ACA36B6CA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"01279d7f55acc877723cd85c14b09c6b8e535af8","datavalue":{"value":{"time":"+2022-07-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5092175$46D74D69-B3E7-4D98-8F65-348136E4671B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c13acc40c1e720dcf36fa25026090a0da6ada982","datavalue":{"value":"https://arxiv.org/abs/2009.12407","type":"string"},"datatype":"url"},"type":"statement","id":"Q5092175$50498D5D-70F4-4DFD-86F2-D978986D8CD0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0d5eef6e848157326ce3189563feefa6213bff81","datavalue":{"value":"93-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5092175$42D64BB3-5950-4C25-9731-5371120AC552","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3c0efbbbc7d4c654f0fa818e7c7a8105877fbf93","datavalue":{"value":"7564894","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5092175$54B5290F-8D90-4D72-9AD7-EAAB5FE34C1B","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5092175$ADA3640D-9540-49B6-8ED1-4979C0414123","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"7db3d2e41c1d6e36985bb32fe285d3df45b56251","datavalue":{"value":"W3167334575","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5092175$E5FF67C1-A3D1-46A0-A78B-3D067317867E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Optimal_Computing_Budget_Allocation_Tree_Policy_for_Monte_Carlo_Tree_Search"}}}}}