{"entities":{"Q7413356":{"pageid":32542194,"ns":120,"title":"Item:Q7413356","lastrevid":108189177,"modified":"2026-11-03T14:19:53Z","type":"item","id":"Q7413356","labels":{"en":{"language":"en","value":"Linear Programming Upper Bounds for the Coil-in-the-Box Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q7413356$FF7FF14E-0A36-4A41-A907-826088AABFDE","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":"Q7413356$AB84480B-6EE9-4050-90FE-CF331C5093E1","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7413356$22C0AD3F-09BA-4286-ABD8-9D8838A589F4","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":"Q7413356$56E0C4A5-051F-4DA7-8D94-5997B2619BD1","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"8e922c69f595c894c47c23929faa4108edb41e54","datavalue":{"value":"2610.36461","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7413356$D47A4BB8-176B-41C4-B64F-DAC63E37BEC9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"da3a6a480b006b285d3b7d46586ba1ec149a2b87","datavalue":{"value":{"entity-type":"item","numeric-id":2032976,"id":"Q2032976"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7413356$41AF1971-D48F-4C5B-A8D1-6D32F90C697F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4a3e101198b196ec565ce9ae7ea6fcda8ab7afce","datavalue":{"value":{"entity-type":"item","numeric-id":7413355,"id":"Q7413355"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7413356$3F833DD7-B3FB-4836-957A-D5B92846012B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d18f662d55c9bed2fdb1cb412f4c2aa93f8f88df","datavalue":{"value":{"entity-type":"item","numeric-id":743012,"id":"Q743012"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7413356$4ACC74A8-A8C4-4BA2-83C8-864F7FF95CC2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Linear Programming Upper Bounds for the Coil-in-the-Box Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Linear_Programming_Upper_Bounds_for_the_Coil-in-the-Box_Problem"}}}}}