{"entities":{"Q1249756":{"pageid":1260506,"ns":120,"title":"Item:Q1249756","lastrevid":67116285,"modified":"2026-04-12T15:25:03Z","type":"item","id":"Q1249756","labels":{"en":{"language":"en","value":"Factorization method for linear dynamic programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3600675"}},"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":"Q1249756$1762E494-3B17-4F8B-AA61-23A0E4B2BC1E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"30a3636a7c8085ac8f7a595559ee34955e9bd1e9","datavalue":{"value":{"text":"Factorization method for linear dynamic programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1249756$8C3071A7-03CF-4D86-8E46-21BAFB7B9D2F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c0854b5129557167fb686449ec0c594612d13a4a","datavalue":{"value":"0386.49021","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1249756$4D79D5DA-5231-47A9-8F10-6646A275D650","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8b0a9d74b461ce256cf866a710f6edce883672a9","datavalue":{"value":{"entity-type":"item","numeric-id":1134996,"id":"Q1134996"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1249756$51D5AD2B-BE71-4CF5-9EEA-77D75CF6A34A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"08840e9b2a9cbdf2deb99f3a20bef68be1507341","datavalue":{"value":{"entity-type":"item","numeric-id":1011274,"id":"Q1011274"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1249756$135F8E30-8387-412D-8675-9862BC63C765","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1249756$FF376B46-D4A5-4F14-A0E3-26555CA66BDF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"974fa8a46aa40326fb3113b279589eb02559bb73","datavalue":{"value":{"time":"+1976-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":"Q1249756$BC321293-F7AD-4F8B-A406-C229873E38F7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"15c1c1e0a1d69b462ee4ebf3442d37cf266ace92","datavalue":{"value":"49L20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1249756$97ACF859-4143-49D4-A83C-DCB1428029FD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"fcd34c8519bd07731bcbd8e951180f605578d93b","datavalue":{"value":"3600675","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1249756$1D587307-F8F6-42A7-A4F6-9A743C096CF3","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":"Q1249756$CC303D72-5AE9-4CDF-8EA4-5D82DAC3EA00","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Factorization method for linear dynamic programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Factorization_method_for_linear_dynamic_programming_problems"}}}}}