{"entities":{"Q7333554":{"pageid":31399438,"ns":120,"title":"Item:Q7333554","lastrevid":107875748,"modified":"2026-10-27T13:18:43Z","type":"item","id":"Q7333554","labels":{"en":{"language":"en","value":"A Parallel Evolutionary Algorithm Framework for Graph $k$-CUT Problems"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7333554$14910530-31C3-477E-B15F-79CF28BD7C95","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":"Q7333554$A813ADC9-D619-4A45-88EC-58F7700FE6D3","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"cb5682aafef30614c75f093c529f87e4d27e50b4","datavalue":{"value":"2607.17158","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7333554$076D7D14-9392-4FFB-B3D1-52F98FEBCF54","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f4d7e708c793adf9f04cd11bd79fa9ed5b782ca9","datavalue":{"value":{"entity-type":"item","numeric-id":347705,"id":"Q347705"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7333554$A15DA584-8B16-4164-87F1-0F35E4AF1950","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6bb6527f651a5963c1785199c2be707d908648c6","datavalue":{"value":{"entity-type":"item","numeric-id":2239609,"id":"Q2239609"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7333554$A0E7D6E4-4AD9-4E09-B756-46FE3FF3F699","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":"Q7333554$770B660F-63C4-40AC-B84D-223CA35DA96F","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":"Q7333554$9E598182-A65E-4075-A1E1-1E343AC9CC7A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Parallel Evolutionary Algorithm Framework for Graph $k$-CUT Problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Parallel_Evolutionary_Algorithm_Framework_for_Graph_$k$-CUT_Problems"}}}}}