{"entities":{"Q7208067":{"pageid":22264298,"ns":120,"title":"Item:Q7208067","lastrevid":107581694,"modified":"2026-10-27T10:53:18Z","type":"item","id":"Q7208067","labels":{"en":{"language":"en","value":"On the complex zeros and the computational complexity of approximating the reliability polynomial"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7208067$107128DE-5B63-4533-9167-FDDE30201838","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-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":"Q7208067$27BAF9AA-3674-4E89-BF31-1E4752EB5137","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"74005e29b954b3a696a9d779a4191c99bb4da6ec","datavalue":{"value":"2512.11504","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7208067$BAC03A34-588D-4F0A-818F-BFB260672AD1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"90d10f5cc26f5121c81314d601f99497fa584f47","datavalue":{"value":{"entity-type":"item","numeric-id":824264,"id":"Q824264"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7208067$FDB2D248-C759-4AA6-8790-6DFB7B28B00F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"401a1ccefdd8f5f8f3185942dbb2c97b7e2e1557","datavalue":{"value":{"entity-type":"item","numeric-id":7208066,"id":"Q7208066"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7208067$0B67F42F-6228-4D22-93F6-A844CE44B6B4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"443cc822cea4a0703f7bb06becb988a202c11463","datavalue":{"value":{"entity-type":"item","numeric-id":252624,"id":"Q252624"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7208067$D7F8F76B-0565-4B03-808F-DA39A11074F0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5ac4eec6d7cc8329ab3df374138b13cb9d331467","datavalue":{"value":"82B20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7208067$B76B3B4E-658E-433F-8D9A-D89F9EAE9F74","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7208067$762707F6-1F77-4CBC-9E5D-EF2B44F8154C","rank":"normal"}],"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":"Q7208067$46DC66C3-5FF3-495B-B1CF-A31883F9258B","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":"Q7208067$011048E0-BE7E-4767-A212-518B726600E3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the complex zeros and the computational complexity of approximating the reliability polynomial","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_complex_zeros_and_the_computational_complexity_of_approximating_the_reliability_polynomial"}}}}}