{"entities":{"Q6575117":{"pageid":14186272,"ns":120,"title":"Item:Q6575117","lastrevid":95575769,"modified":"2026-06-05T09:19:19Z","type":"item","id":"Q6575117","labels":{"en":{"language":"en","value":"A deterministic parallel reduction from weighted matroid intersection search to decision"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883625"}},"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":"Q6575117$CFEDEB0B-E430-4AB5-88C5-91D24D68740F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"844d08359175ea61a256f26575430d862530bcca","datavalue":{"value":{"text":"A deterministic parallel reduction from weighted matroid intersection search to decision","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575117$76580544-954F-4F2B-89CE-6915113B33EA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3ec3f25329a128ec046f2268b9a3d3755f4c0931","datavalue":{"value":"10.1137/1.9781611977073.44","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575117$B8AD59DD-7F53-4028-AF09-379841E3B6F0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7f5ed46b5ce64e65a461c1d610558683940cdd82","datavalue":{"value":{"entity-type":"item","numeric-id":2087773,"id":"Q2087773"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575117$07CEBF2A-1EE6-4D04-A386-2C2B6D9754EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a3ff8b7e1fadb83b7a0a813229310ccfe7cda5dc","datavalue":{"value":{"entity-type":"item","numeric-id":1686833,"id":"Q1686833"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575117$5A98DB4C-56E0-4AC3-948A-E1461A054951","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"af99d0a56a91850879faef05f4bb23e9d6f861fb","datavalue":{"value":{"entity-type":"item","numeric-id":6130319,"id":"Q6130319"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575117$A353E161-4096-48B6-8444-BBF65B2AE3BA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575117$4403FDFA-8B26-43DB-BC6F-F5FBCF8C368D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575117$B924A67D-313A-492A-B1ED-DA207574BB02","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b9090bb2c0093387a5472ba89cdf578472c994bf","datavalue":{"value":"7883625","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575117$6CEA79A7-FEC5-4D63-A0AF-CF7496930AAA","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":"Q6575117$0E860BAE-1D18-4305-8DA1-E46213002F01","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A deterministic parallel reduction from weighted matroid intersection search to decision","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_deterministic_parallel_reduction_from_weighted_matroid_intersection_search_to_decision"}}}}}