{"entities":{"Q5281562":{"pageid":7311137,"ns":120,"title":"Item:Q5281562","lastrevid":100709255,"modified":"2026-06-05T22:54:54Z","type":"item","id":"Q5281562","labels":{"en":{"language":"en","value":"Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6754030"}},"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":"Q5281562$CF3EDD8A-6A2D-4A85-BA5C-4FF7E9888AF9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"90d0529dd7758e70bb2f1f54a327bd0cc67e1b99","datavalue":{"value":{"text":"Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5281562$3A08283F-B836-44FC-B85E-B23A090EB658","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3ae1f8d7b41f051f91aa04a43a968ef724a2efe0","datavalue":{"value":"1366.94703","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5281562$321080D1-CE2B-4BD3-A328-CCC67247C18B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"a22b72f2203e6c900c15e6dca011cbd48592fb5d","datavalue":{"value":"10.1109/TIT.2009.2039084","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5281562$F540247B-0D8D-4C5A-93DF-A8D1618AF090","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3ac955f0b56a0bc8346f780b1b3039af573aec1a","datavalue":{"value":{"entity-type":"item","numeric-id":2937864,"id":"Q2937864"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5281562$6EE107D2-A3C5-4946-8FAB-38FBAC12A2AA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a23d1f27e85167de83594c6396b09c513a46bdbd","datavalue":{"value":{"entity-type":"item","numeric-id":2669085,"id":"Q2669085"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5281562$9220F777-A68C-4E4A-BE55-F4A0A3327BB6","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"90c5240c9cd9e181a1b77d3501d191b6631d1861","datavalue":{"value":{"entity-type":"item","numeric-id":97723,"id":"Q97723"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5281562$37AA957F-E145-46D8-B721-768ECD52DF02","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2c40fe938fbefaf770a613a23526d4d4322534f8","datavalue":{"value":{"time":"+2017-07-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5281562$40ECF43F-9C7E-4164-8FE9-80ECC77005A3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4430c94528f7856126af01b3ac6ccc7f8c77602b","datavalue":{"value":"94B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5281562$A9E76DBD-51E9-48D2-B6B0-F1A3CE0E6303","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"23eabea2f37667b79d34f4282bba7b6c227abf51","datavalue":{"value":"94A24","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5281562$A18D5929-5A96-45FE-AE3F-ED24D3D249D8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"da0d408c366ffa02f44eac78de00f52bba38fd12","datavalue":{"value":"6754030","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5281562$28211007-6602-46B9-AD26-D74CBBA678DD","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":"Q5281562$C19689E7-7BC3-4484-B11E-8B5AE17505B4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Capacity-Achieving_Codes_With_Bounded_Graphical_Complexity_and_Maximum_Likelihood_Decoding"}}}}}