{"entities":{"Q6457768":{"pageid":13590770,"ns":120,"title":"Item:Q6457768","lastrevid":95276255,"modified":"2026-06-05T08:45:42Z","type":"item","id":"Q6457768","labels":{"en":{"language":"en","value":"On Conflict-Free Cuts: Algorithms and Complexity"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 902357579"}},"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":"Q6457768$745B93BC-6E74-4ECC-A4AC-081596405209","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7998a4700485ee1c911c6376847a8ba8998b55e1","datavalue":{"value":{"time":"+2023-11-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6457768$7E7ED785-50A2-43F7-BF0D-99DB2D7D7828","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"77ccc18a00cb11dc8f5682a0b405b166ac34fee7","datavalue":{"value":{"entity-type":"item","numeric-id":2030708,"id":"Q2030708"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6457768$72C0C320-2FDC-4F04-8BCE-48C722DE0CBD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6a76e14dae6cbb3abcd2d6da25c84b7ddc989b2f","datavalue":{"value":{"entity-type":"item","numeric-id":186196,"id":"Q186196"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6457768$5B94F1C3-44E2-4A15-BB1B-79C3DD806116","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f129b06f469a7f73a2e133b154da657c1c0ce59a","datavalue":{"value":{"entity-type":"item","numeric-id":317428,"id":"Q317428"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6457768$DB34FC38-F3EF-4AAF-A5CA-ED6D67D0CE61","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6457768$346EF993-9E62-4F2B-B680-345E2BCFA725","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6457768$E7CB8AFD-D30E-4FC9-B014-38B2E2BCE8C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6457768$63E497B9-D06E-4699-B475-1E180F5F14D7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ca48c4aaf01b69f48fd62471eb94879af2886ee1","datavalue":{"value":"902357579","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6457768$4762EE77-040E-4920-B004-EE0C80F1255C","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":"Q6457768$ABEFB7AD-625C-4262-B765-92953D1497F7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On Conflict-Free Cuts: Algorithms and Complexity","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_Conflict-Free_Cuts:_Algorithms_and_Complexity"}}}}}