{"entities":{"Q3849456":{"pageid":5879361,"ns":120,"title":"Item:Q3849456","lastrevid":87684872,"modified":"2026-06-04T12:20:55Z","type":"item","id":"Q3849456","labels":{"en":{"language":"en","value":"Dynamic Programming and \"Difficult Crossing\" Puzzles"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3181652"}},"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":"Q3849456$D0295C65-A50A-4E8B-A5BB-1DDFAF5862C1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3725f38faf0dc580101dc29162c754b16af2da0a","datavalue":{"value":{"text":"Dynamic Programming and \"Difficult Crossing\" Puzzles","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3849456$F2C7BF88-07A8-40D0-8EFC-D48235EAE91D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"133cbfd75f08f18fd2f7cd0f2073b872cb2f86ea","datavalue":{"value":"0112.12402","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3849456$E9AAC885-4EDC-4A5C-ACDF-A50B8F565014","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fbb4641af9f3948ef1dc6fb1ab51d8833d8f9fba","datavalue":{"value":"10.2307/2689096","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3849456$A2A22FB5-AAB1-4559-8AE9-1141676268CE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6743a0652084b647dd5a9456802d412b16349fae","datavalue":{"value":{"entity-type":"item","numeric-id":594813,"id":"Q594813"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3849456$D472A6F8-0324-48C3-A990-15752ED6E8C0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"0c5005733ed6ebe6f69b4769e9070f5e0200f81a","datavalue":{"value":{"entity-type":"item","numeric-id":2721365,"id":"Q2721365"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3849456$79C92853-DC37-4473-9EEF-CB7EB05ED4E0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f1151d44c801a909256f62362ee2b01f3c904af1","datavalue":{"value":{"time":"+1962-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":"Q3849456$408D3FEC-08E9-4411-A585-87A8F9A555CF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"217f2c634aabb46370cd9bb6cb4b6e6210c86026","datavalue":{"value":"3181652","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3849456$2E1BA6ED-B8DE-4E58-8F6D-B91414A19C2B","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"013a573a10a65db40cc78020f718d30d0fd6eed2","datavalue":{"value":"applications of probability theory and statistics","type":"string"},"datatype":"string"},"type":"statement","id":"Q3849456$5B8A3F54-C9FA-4A8B-AADF-48DA6FD5FD95","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":"Q3849456$CCFC0FBD-4268-46D3-A52F-902AA012991D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"601dbbd3b3cd080c35e067a5d45902eedb2ba33c","datavalue":{"value":"https://doi.org/10.2307/2689096","type":"string"},"datatype":"url"},"type":"statement","id":"Q3849456$54C753F0-334E-4B1B-A4F8-BCCFD0A68B5F","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"664294117ab2a3d37ce403dcfeadb3270ca843ee","datavalue":{"value":"W4244337384","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3849456$041F68B5-B629-4292-8328-6D1D3BF8534B","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"2f656aa7236319872929c7da9e0eb4bfcb307c2c","datavalue":{"value":"Q56674465","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3849456$EE81A6D3-8463-43B4-A307-72F8B09FE98D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Dynamic Programming and \"Difficult Crossing\" Puzzles","badges":[]}}}}}