{"entities":{"Q2857440":{"pageid":2868160,"ns":120,"title":"Item:Q2857440","lastrevid":83543141,"modified":"2026-05-07T08:48:53Z","type":"item","id":"Q2857440","labels":{"en":{"language":"en","value":"Upper bound for the number of perfect \\((n,3)\\)-codes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6222098"}},"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":"Q2857440$66538E0E-3CA3-4525-BA0A-310F57412A5B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e17167e7ab75b5ac56b8e73d9a86b87e16d075dc","datavalue":{"value":"1274.94153","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2857440$CBE3EFE5-A888-4E8D-9D19-0B62A4C0BE18","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c208560dc20a04fb91ae5bdd165df42ccb312e52","datavalue":{"value":{"time":"+2013-11-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2857440$EF954054-6247-48E7-A242-19301AE8B08B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"f783cd09de1358dbc16207d952517c9ecddd59d0","datavalue":{"value":"http://www.sciencedirect.com/science/article/pii/S1571065311001934","type":"string"},"datatype":"url"},"type":"statement","id":"Q2857440$6BC4C561-BA81-460F-8179-C2449A92B5A4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0c3cdafa68da1cd8441c02cae1d4f7b344a92c14","datavalue":{"value":"94B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2857440$2AC3F022-41BE-4952-AD70-ED45E34715BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ab81cc6be792359bf679043e23dc40b5d9ce60b6","datavalue":{"value":"94B65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2857440$56A4E171-8C44-4E17-9BEB-F55EF272AFCD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b1c20550db243555af174b3e1dfccb80cdce6b8e","datavalue":{"value":"6222098","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2857440$60E239B6-B520-43E5-B00B-1E1C49A438ED","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"16452114a5e731fc05796586bedf06ef8019dfbb","datavalue":{"value":{"entity-type":"item","numeric-id":941372,"id":"Q941372"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2857440$BFC8C67C-4C67-4217-B67D-7B45118C3A3C","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":"Q2857440$F32F921D-B1D3-461B-AEDE-FF12EDEDAB4A","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"d51def9d84d7ddb6e74f242dd62c94612ce9dd22","datavalue":{"value":{"entity-type":"item","numeric-id":3364377,"id":"Q3364377"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2857440$14BF7481-635C-4482-AC32-C91435BEDA5A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"53d0d518aa3b95714a7512f47e025b6fd7deca7a","datavalue":{"value":{"entity-type":"item","numeric-id":4936733,"id":"Q4936733"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2857440$A8EF3377-98C3-4390-B2A3-BA0AAD14A5E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a3c7b83c32158863a067bf20549fe68800166c7a","datavalue":{"value":{"entity-type":"item","numeric-id":2377492,"id":"Q2377492"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2857440$8DD13D85-E501-4BD3-B2B6-C49D05CC9DA1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7a02c16b49fe81d6a6a505dbd9b151717d5afb1e","datavalue":{"value":{"text":"Upper bound for the number of perfect \\((n,3)\\)-codes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2857440$B2136D95-3FA7-44BA-A508-0EDB7ADE0775","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Upper bound for the number of perfect \\((n,3)\\)-codes","badges":[]}}}}}