{"entities":{"Q6990323":{"pageid":21444942,"ns":120,"title":"Item:Q6990323","lastrevid":76364136,"modified":"2026-04-23T20:01:23Z","type":"item","id":"Q6990323","labels":{"en":{"language":"en","value":"Fast approximation algorithms for cut-based problems in undirected graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8033980"}},"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":"Q6990323$DC32F024-56B8-4B5D-AD3B-0B3A089F7535","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4bcbfb618e1dd3dc4cd6ff33b72ae1139b197aa6","datavalue":{"value":{"text":"Fast approximation algorithms for cut-based problems in undirected graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6990323$48CED612-2BA4-420B-AD50-A9B73808C66C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0cead9c64a5c0da9fa0adc8f7be4469de3cc2f14","datavalue":{"value":"10.1109/FOCS.2010.30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990323$BF9F69B9-D3A6-48A0-9264-693C734ECA61","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b1ac597ffa3002ed62987f6d92d3d2b8278459ef","datavalue":{"value":{"entity-type":"item","numeric-id":541658,"id":"Q541658"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6990323$207E7003-1D8F-42CB-8880-B2945E7D99DC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1e0d6617dd626682cda2f457b20b85a92c8d2d47","datavalue":{"value":{"time":"+2025-04-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6990323$535C9A32-AC98-43CD-A06B-CB8D9FA94059","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990323$83CC365E-4486-429B-AEF3-045E5286FE17","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"57f167c32409cd84dad7e725a6344d78daf6bdb3","datavalue":{"value":"05-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990323$18F760C6-174F-405B-9D6F-9A5EB293048A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990323$7E42E52C-E09E-4EEB-AB9C-9B7EB70F83E4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8f6766b8624ccdb244599978d10dcfbc7f9b73a8","datavalue":{"value":"8033980","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990323$B07913A3-6D1C-47D7-AECF-22BB9FA3C40B","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":"Q6990323$862E5473-7DD7-4DA9-A2C6-0B7BEEEB2FC7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast approximation algorithms for cut-based problems in undirected graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_approximation_algorithms_for_cut-based_problems_in_undirected_graphs"}}}}}