{"entities":{"Q6318973":{"pageid":13454697,"ns":120,"title":"Item:Q6318973","lastrevid":94929797,"modified":"2026-06-05T07:59:23Z","type":"item","id":"Q6318973","labels":{"en":{"language":"en","value":"On greedy heuristics for computing D-efficient saturated subsets"}},"descriptions":{"en":{"language":"en","value":"scientific article"}},"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":"Q6318973$76D79818-FADA-4DDA-A84E-6504B8DFEBCA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"458fb2c39bbf9716feb9c44b954feba49d4e3a99","datavalue":{"value":{"time":"+2019-05-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6318973$7D6EA895-F11D-4B03-96AB-69372B96D069","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"eb79f05d52ccac98bde54401ee0c401affb18744","datavalue":{"value":"1905.07647","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6318973$6D3EF552-D6B8-4BA9-8F95-80C460EEE782","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"1d35dc8f85e37b4367b85ca01ffc9f04aeb2b8ab","datavalue":{"value":"stat.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q6318973$4930520F-3EE6-4468-865D-E0DCAE42CFE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6318973$EA354BAD-46E0-4101-85A9-09894A8204B1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"94c5f6bb30c7a28be067e1d2110426fe9dafd0c1","datavalue":{"value":{"entity-type":"item","numeric-id":254192,"id":"Q254192"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6318973$ED667F71-BD9A-419D-9601-A2B0EAC2ECC9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"cc0052570d100b7d07f0015988014123e0bf44b0","datavalue":{"value":{"entity-type":"item","numeric-id":1726896,"id":"Q1726896"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6318973$E9025382-B15C-442C-AAF7-B8AD73A96679","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3fbc45f88900af7c4b38f7727da68106a1824a0a","datavalue":{"value":"62K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6318973$CD534FE1-8F9D-49DF-9D7B-AE2F15250B91","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":"Q6318973$A4B82DF1-3DBB-40C1-9BDF-7A90896B9841","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4b70ca6986b296ec5fe393d275b3909157806a01","datavalue":{"value":"10.1016/J.ORL.2020.01.003","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6318973$AF0F9EC1-3AA5-415E-A111-39103FB9B75E","rank":"normal"}],"P1676":[{"mainsnak":{"snaktype":"value","property":"P1676","hash":"70f3c1ae1e4dbd46fcf0c4722e73f325de296fa9","datavalue":{"value":{"entity-type":"item","numeric-id":1984679,"id":"Q1984679"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6318973$EDEFDE15-786B-4122-9DDD-35978A2A77F7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On greedy heuristics for computing D-efficient saturated subsets (scientific article)","badges":[]}}}}}