{"entities":{"Q1222389":{"pageid":1233138,"ns":120,"title":"Item:Q1222389","lastrevid":66374904,"modified":"2026-04-12T09:39:43Z","type":"item","id":"Q1222389","labels":{"en":{"language":"en","value":"The optimal reward operator in dynamic programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3498747"}},"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":"Q1222389$EB651FF8-D4DC-48E3-BDB9-52E8268E1B91","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1bb314e2e5acc8f3ff014c79b8fe88c2b031a1f2","datavalue":{"value":{"text":"The optimal reward operator in dynamic programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1222389$960323EC-031E-4978-801B-F3BDB3800B31","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1ed71ac43913a10f9038e6153c82c2f89016ae42","datavalue":{"value":"0318.49021","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$3E717E81-4DDD-47EA-AA01-2A2903756A1F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6b62d75a4b1c80bd21e56bd6ab3f3aabaabfbeec","datavalue":{"value":{"entity-type":"item","numeric-id":679035,"id":"Q679035"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1222389$7073CAE7-EC8F-4952-A351-DC5D566886EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9193c583d3cd5a5d9b7e9287f269ab6c6e00f9e9","datavalue":{"value":{"entity-type":"item","numeric-id":1846100,"id":"Q1846100"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1222389$22F0E0E4-35CD-49B9-9D64-D6253243B4ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b8d4442a386b44b46007dbe428462850278add82","datavalue":{"value":{"entity-type":"item","numeric-id":6482298,"id":"Q6482298"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1222389$53A7DA72-014E-482A-A494-3711E3BC8F2C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c9d829dece3e2d330deed49a6cb836edc666e294","datavalue":{"value":{"entity-type":"item","numeric-id":107063,"id":"Q107063"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1222389$5A63DFF9-3974-4F46-8DB3-DD032905515F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"718868df62fa29cb04609217d34e1254e53a40d9","datavalue":{"value":{"time":"+1974-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1222389$826B9D74-9678-44D9-A4C2-B1FCA596A3C5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1dfb8d8aba4854afdcac1afd7e652cf7e180f0cd","datavalue":{"value":"49L99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$69CC3D76-2225-4207-89C7-7904CF7FEF03","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"208daa359f764563c0b4736dfe251df697e9c22d","datavalue":{"value":"60K99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$DA6B6E07-FF16-4173-A298-084A3484EDE1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"7dc0be147dc793dec5b4d43620512b87e8c947ec","datavalue":{"value":"90C99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$C1C983FE-6394-4AAB-83BC-4F7C3E498B6B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"7f10a8c2218f37e16920ada947854b8ed3009189","datavalue":{"value":"28A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$22E1EB7D-2F65-40DC-BE17-075811DEC3DB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4caf7de22f40a28c3ce821a59abbe75424f0bc2a","datavalue":{"value":"3498747","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$7034FED3-1FE3-4066-8E3E-55151848595D","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":"Q1222389$7F48B5E5-0181-45F6-8FC0-1E5A5C9964C0","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c98527434a7a77dec5984ebc382bf706a1302286","datavalue":{"value":"https://doi.org/10.1214/aop/1176996558","type":"string"},"datatype":"url"},"type":"statement","id":"Q1222389$82A84B26-D658-4DF9-BE3F-A11E7D450714","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3238da523880ed9031ce461c4aefc04e4bd81eb0","datavalue":{"value":"W1975828588","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$76946C14-D563-4061-944D-400EF8433437","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d0ab22c52c4f9c2ce9e20bd030f17c90e2299365","datavalue":{"value":"10.1214/AOP/1176996558","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1222389$6858520D-9F28-4464-9334-4E4EAA541786","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The optimal reward operator in dynamic programming","badges":[]}}}}}