{"entities":{"Q6944394":{"pageid":21169950,"ns":120,"title":"Item:Q6944394","lastrevid":75951453,"modified":"2026-04-21T16:10:20Z","type":"item","id":"Q6944394","labels":{"en":{"language":"en","value":"Faster exact and approximate algorithms for \\(k\\)-cut"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078612"}},"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":"Q6944394$BD4D917D-2628-49E7-B9E0-15A71C8A291B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0b4ae58201bcdd1bfcddbb3befd6a40f43c326fd","datavalue":{"value":{"text":"Faster exact and approximate algorithms for \\(k\\)-cut","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944394$FA5A0A27-E24F-4A44-B148-94A6B56402B6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5cb5e5d9b514f2416af5270be57eef6481a698a7","datavalue":{"value":"10.1109/FOCS.2018.00020","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944394$87BCB44A-1FFF-40DF-8109-C1FE4CE70A7A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4da5d9d00c29a1438e24839583d2fe7db0d0793a","datavalue":{"value":{"entity-type":"item","numeric-id":315528,"id":"Q315528"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944394$C2E0531C-09BB-4312-9D31-E1C32FCBBBC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b978f30061ebd566cc21b3a0458062a5313b5d62","datavalue":{"value":{"entity-type":"item","numeric-id":2164708,"id":"Q2164708"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944394$98E7ECEA-1C59-4DA1-AE49-367DC99CEE70","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a4eb02af304dd9babaf8cec1ff7502b920e7cd79","datavalue":{"value":{"entity-type":"item","numeric-id":403673,"id":"Q403673"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944394$A02A0F84-2985-489A-ABEA-E50F35F5851E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c757b9b7db25e8670dea572b24907796ea9667b","datavalue":{"value":{"time":"+2025-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6944394$473E49A3-5CB0-4A3D-92A2-FAAC7B77336B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944394$A5F7F4A1-7409-4BBE-80D5-8946377FFAFE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944394$D5D53ECB-ADC0-4DBB-A4E1-FA477EC02D75","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944394$4D2554F9-805B-4326-94FE-4AEB447B7150","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7a3842ad7fe3e3f49d7c6355bf8349c296f193ce","datavalue":{"value":"8078612","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944394$897F8F32-CF4F-4E36-BAFC-752277BE7059","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":"Q6944394$62B8B09D-6879-4200-9B7D-502BEE2279FC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster exact and approximate algorithms for \\(k\\)-cut","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_exact_and_approximate_algorithms_for_%5C(k%5C)-cut"}}}}}