{"entities":{"Q7201689":{"pageid":22241582,"ns":120,"title":"Item:Q7201689","lastrevid":107535122,"modified":"2026-10-27T10:32:46Z","type":"item","id":"Q7201689","labels":{"en":{"language":"en","value":"New upper bounds for binary linear covering codes"}},"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":"Q7201689$06BA95FD-1142-4C47-A720-1C1FD682CFF4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-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":"Q7201689$DEAF4B92-BC5B-4529-BDAA-86E7ADE9B22B","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"cebdba65ba01d4c6b45734ed02a0209dafe82f6e","datavalue":{"value":"2511.02542","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7201689$97EABD38-945C-4942-ACDF-6C5023F31CC1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"12c801bc0d77f4ed029c859bdb52144f63f9d2c2","datavalue":{"value":{"entity-type":"item","numeric-id":175151,"id":"Q175151"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7201689$F304BB2E-A0A7-47B0-BDAD-A59E60F7B786","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"19d1961612493084c0a98fce9bb4bafe3d8aecd9","datavalue":{"value":{"entity-type":"item","numeric-id":265612,"id":"Q265612"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7201689$9C3C219E-55B3-46BB-ADAE-EED05B9967CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c0745e2bda9ff7c2f176ea7ac5b1ef97ee57c367","datavalue":{"value":{"entity-type":"item","numeric-id":265613,"id":"Q265613"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7201689$132F73B6-D8BE-4D62-84AA-1484C9DB4D9F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ab81cc6be792359bf679043e23dc40b5d9ce60b6","datavalue":{"value":"94B65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7201689$BED7FA70-7C4D-4C94-9B47-780796F0272E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0c3cdafa68da1cd8441c02cae1d4f7b344a92c14","datavalue":{"value":"94B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7201689$47269F55-A3A5-4221-B24C-85D7FF6AEE40","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"06c948fd44541499360dc4d8f03d345101abad05","datavalue":{"value":"94B60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7201689$6D3A6365-8C53-412A-855F-FBD7B05D43C1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e51adb5fded8427aba510fd00c59eaf339cb8e95","datavalue":{"value":"94B05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7201689$EC5E9C7D-800C-435D-8639-AE7DD98E7A97","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":"Q7201689$A201380A-674C-4559-882E-8C65BF894FCF","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":"Q7201689$C29BFBDD-D2D6-4D0C-914E-3C88CD4AA2D9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"New upper bounds for binary linear covering codes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/New_upper_bounds_for_binary_linear_covering_codes"}}}}}