{"entities":{"Q5151706":{"pageid":7181277,"ns":120,"title":"Item:Q5151706","lastrevid":100354151,"modified":"2026-06-05T21:55:56Z","type":"item","id":"Q5151706","labels":{"en":{"language":"en","value":"Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7314026"}},"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":"Q5151706$1B633140-B811-429B-B3FF-7501BEEC9EDC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"079f13bf812a68516bbd246f9ca474586cccda8d","datavalue":{"value":{"text":"Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5151706$99E3C328-042E-44C8-A848-518809A5CA14","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"545a3bea71fd78dcd987db991d3c1b2dbe4bb7ab","datavalue":{"value":"1465.94131","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5151706$712B93AF-8647-4E57-BFF5-DF659A5D9276","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cab6a9ab15b4537d80da266c9d124e15ea166c04","datavalue":{"value":"10.1109/TIT.2020.3029720","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5151706$EC5B82B4-F2A2-4F3F-B794-3B3F1060A2D2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e10b6520a6cb0301dada73c677854a14b37cc78a","datavalue":{"value":{"entity-type":"item","numeric-id":195173,"id":"Q195173"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5151706$D9D86BD7-85F0-4203-B085-59F75A018779","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"99963837088dd754c02e2db03dac9c92552b5e69","datavalue":{"value":{"entity-type":"item","numeric-id":396761,"id":"Q396761"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5151706$5C9B90FA-C759-4234-9DC5-93B063030B55","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f2c24bf99b1bab15baa5f5fb0690fbaf20241077","datavalue":{"value":{"entity-type":"item","numeric-id":482201,"id":"Q482201"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5151706$457A6434-ADD8-48CD-ADE9-B6326A67E75D","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":"Q5151706$1D6546C4-91CF-4A52-A13B-5C99C960E7CC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bf0749869f595759ee793dee0f3189be235834d4","datavalue":{"value":{"time":"+2021-02-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5151706$8A20A8C0-C290-420C-B23E-B07DFBF17F1E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0c3cdafa68da1cd8441c02cae1d4f7b344a92c14","datavalue":{"value":"94B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5151706$D4E051C7-D556-4BF5-BEF2-0D5AC4C6553A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a762d1a2468ec8882180d0d1124f12b94f8eb1b0","datavalue":{"value":"68P20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5151706$5C9B7955-07E1-428A-A29D-4AA06D28F4D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5151706$B397C714-CA94-4D7A-83AB-1BEB9F9D9344","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3de6ef5f7475b6ceff15c9662e44a6daaab83c64","datavalue":{"value":"7314026","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5151706$EC6017F5-182D-4FB4-96A0-AB8A6BFD394D","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":"Q5151706$E94C3288-ABA4-458C-8F08-42F0F695FC44","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ec002a31a41b50a00a82f55f381b93fc9f52ef40","datavalue":{"value":"https://doi.org/10.1109/tit.2020.3029720","type":"string"},"datatype":"url"},"type":"statement","id":"Q5151706$F61AABC7-7AC0-45DE-BE4E-E84DF046BBAE","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"b8c523055674206a16eeb4b403f8affc6b6b6f21","datavalue":{"value":"W3092503177","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5151706$550BF0AB-B95A-4D74-BA7C-357C032AEA36","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Lower_Bounds_for_Total_Storage_of_Multiset_Combinatorial_Batch_Codes_Using_Linear_Programming"}}}}}