{"entities":{"Q6740495":{"pageid":14459272,"ns":120,"title":"Item:Q6740495","lastrevid":105911672,"modified":"2026-10-21T13:00:03Z","type":"item","id":"Q6740495","labels":{"en":{"language":"en","value":"Data Clustering and Visualization with Recursive Max k-Cut Algorithm"}},"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":"Q6740495$B03D149D-8C1A-4BF2-B94E-660988991940","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fecb2f2a7c1f813db3a025a7dd8b5d82439618b9","datavalue":{"value":{"time":"+2024-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":"Q6740495$77AAB93E-0A4D-453B-A9AF-A6771925CC55","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"c29bb53fd657adf75bff69148171a8462bcc770f","datavalue":{"value":"2408.07771","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6740495$A74AF347-AC1C-4B4C-B74C-A4728B2D9BCE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f0c21b09bb83b08cdd7889becacf3a3d5a399ca9","datavalue":{"value":{"entity-type":"item","numeric-id":6740493,"id":"Q6740493"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6740495$BB62F579-2125-4145-8974-E796186673E6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a483e890722403e8daf7d38e3df6409e836498ae","datavalue":{"value":{"entity-type":"item","numeric-id":6740494,"id":"Q6740494"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6740495$2B496655-17A5-4CB8-8F0A-0EEA99496C98","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"81df0d030184a66a984aa9a54af566afefe4969c","datavalue":{"value":{"entity-type":"item","numeric-id":256836,"id":"Q256836"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6740495$444601B1-7CF0-4A86-A086-070551584BF8","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":"Q6740495$C8514BE9-5632-4B19-9167-5282A576FD6E","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":"Q6740495$87384618-839A-434C-BE92-CDA9C096443C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Data Clustering and Visualization with Recursive Max k-Cut Algorithm","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Data_Clustering_and_Visualization_with_Recursive_Max_k-Cut_Algorithm"}}}}}