{"entities":{"Q2856008":{"pageid":2866728,"ns":120,"title":"Item:Q2856008","lastrevid":79663028,"modified":"2026-05-06T14:26:02Z","type":"item","id":"Q2856008","labels":{"en":{"language":"en","value":"A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6218360"}},"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":"Q2856008$48484C43-8711-423C-9B13-E1C4857FE0E4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"74a922d6ce1f145a7143b863e91d59ae18ae5a28","datavalue":{"value":"1286.68296","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$C2B46DFC-EE8C-4866-9BDB-2015D4980D09","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e50a2266e6589d48b265e4a8f5b5ba5f3c4f5edb","datavalue":{"value":"10.1142/S012905411350007X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$BE813AB6-8EE1-49F0-89EB-2690A757B963","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4c701fc788c0b34e8533f89f915de9689806aced","datavalue":{"value":{"entity-type":"item","numeric-id":2790349,"id":"Q2790349"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2856008$C7CB0FBB-8205-43F1-B2C4-60678C08050A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"47adaa7123c6f3744cf7fa8eab088d52b4982295","datavalue":{"value":{"entity-type":"item","numeric-id":2703009,"id":"Q2703009"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2856008$B000FBD4-C76F-4EAB-8862-F5E2985E1134","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6e41e95550d16033ed81f1eb7c35b7c5a600767d","datavalue":{"value":{"time":"+2013-10-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2856008$7915D9F0-3727-4F39-AB78-9F9EC3E0DF51","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$DE678B4F-D789-47BE-9F29-6D58034ACBD5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c189c45b466f89dd188bd061df8c45f23f05da60","datavalue":{"value":"68Q32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$5D5CCB78-9580-44D3-80CB-9D1D3F248E80","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$DA65203A-300D-48AB-86E4-BA5B11675FB9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$E72B3524-12B2-4F2A-A5B6-CF1A9CFE5839","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4dd6b8847e09c706889ad9ef05dc0040f1c9f982","datavalue":{"value":"05C80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$C16DC1AF-452C-49B0-8A74-B0C4E93AC235","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8195a9e26c453276e1d31339bf2413392412013d","datavalue":{"value":"68Q17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$622DF732-CFA5-4783-92DE-DE523FD8D3C5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b128bc1ac4d2a209a23cf6d1d30f42831b04a161","datavalue":{"value":"6218360","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$FBE49C36-9998-492B-A8A6-2BD2DADBAB20","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"732e1592c53acfd9740f2cb8680bbb91fda5b0af","datavalue":{"value":"minimum spanning tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q2856008$96DC0207-84F3-4E6C-B3BC-494F1C58183C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"92dbda524506f79ea28013aa559aae7d69893733","datavalue":{"value":"min-degree constrained minimum spanning tree problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q2856008$5CDC0848-D26C-40C0-A620-12AD77E8B49B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"98da63f1e69541c00ec0aec438cba695da263de3","datavalue":{"value":"learning automata","type":"string"},"datatype":"string"},"type":"statement","id":"Q2856008$A01377D2-BC17-4786-A21A-B6B1BBEA1375","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e6144aab87baab2c74bd70b27712a2db16c4ce54","datavalue":{"value":"stochastic graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q2856008$8E340218-8F87-4860-BB04-809ADC77B7F4","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":"Q2856008$3D365515-8BBC-4027-AF83-B6E6B4BBC458","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"07b2faa219fc3aad710e52b5e8480ff33320e479","datavalue":{"value":{"entity-type":"item","numeric-id":1374041,"id":"Q1374041"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2856008$10D5B31D-5FA0-4BCC-B117-70ACA2AAC3B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"fdaaf268b94a623ab8661a7a105c9c1612ef7389","datavalue":{"value":{"entity-type":"item","numeric-id":4121719,"id":"Q4121719"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2856008$11C4227A-0B8A-44B5-BB4F-39B8E055CB4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0f07a74f47e39c2380bfdef5e99dafb40fa8574c","datavalue":{"value":{"entity-type":"item","numeric-id":3771625,"id":"Q3771625"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2856008$7C953BA1-B60E-4C57-B1A5-D3E00C47CE93","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6abb87de27e2da0b0baa0f11d38599277a85a7cb","datavalue":{"value":"https://doi.org/10.1142/s012905411350007x","type":"string"},"datatype":"url"},"type":"statement","id":"Q2856008$5B1B1069-EB4A-42FE-96F7-5D6C7E7A7A11","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a6b2b9bc47c58334ced477567633c9b4b3660d04","datavalue":{"value":"W1972373016","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2856008$85CC3A47-EB69-4F43-AD7D-65C0604788BA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a330768dc1abf0275afa36621968f65385e8b78c","datavalue":{"value":{"text":"A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2856008$EE27944B-BA8A-426B-8130-E6F0674FD651","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5a9f5f20db19ea187eb5579b916c5fa29e889c52","datavalue":{"value":{"entity-type":"item","numeric-id":2790350,"id":"Q2790350"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"73bfc179c7fc9d05cd3815d535aac66ce9f392b3","datavalue":{"value":{"amount":"+0.9241763949394226","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2856008$CE3996C9-ECAD-4B31-B228-97D542D86952","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d32bb8f874d1d16daa6e3362317f16af02a72e1b","datavalue":{"value":{"entity-type":"item","numeric-id":3187006,"id":"Q3187006"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d2063e54aaf793d67ebb92c643b7acc21d268e3b","datavalue":{"value":{"amount":"+0.8763578534126282","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2856008$1DFD7489-AAB3-4BF3-81EB-51223920C35A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"632eabbc3da63e481a6aec7d7a889504f975088e","datavalue":{"value":{"entity-type":"item","numeric-id":712488,"id":"Q712488"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"be11b932708cf32775cecd968f5310f2f1f87079","datavalue":{"value":{"amount":"+0.7907643914222717","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2856008$6641487A-6AA0-460D-B5A5-990CB7D0D5C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f3475186f240ec5162c509f5c88fad7a49eee01a","datavalue":{"value":{"entity-type":"item","numeric-id":1751721,"id":"Q1751721"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dec7c4e1451b368a4e741fd72c4ddc334ef7163b","datavalue":{"value":{"amount":"+0.7868911623954773","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2856008$4B003A1B-0E95-4EB3-9382-12648FBD1016","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"740062cf6592a8e6a76ad7b37364c5c3b9237e95","datavalue":{"value":{"entity-type":"item","numeric-id":1025243,"id":"Q1025243"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5ded7c36a895bbcbd04328538f3142361a08135f","datavalue":{"value":{"amount":"+0.786845862865448","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2856008$4AE3BA60-927A-4CB0-AC63-00A9AEA2977F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem","badges":[]}}}}}