{"entities":{"Q6348677":{"pageid":13483340,"ns":120,"title":"Item:Q6348677","lastrevid":102967283,"modified":"2026-06-06T06:00:31Z","type":"item","id":"Q6348677","labels":{"en":{"language":"en","value":"A polynomial-time algorithm for spanning tree modulus"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900439043"}},"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":"Q6348677$2CD57452-0A26-46A2-B1AE-A8AC04FBA8A5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0c27025de8b388440ce9f14f6354e419dbcdb6a4","datavalue":{"value":{"time":"+2020-09-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6348677$0E23D7DB-E09D-4C7E-AE07-BC5D9CF0F239","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d7afd2147a0b2ba469e830ecc8b699ca8d3f3d01","datavalue":{"value":{"entity-type":"item","numeric-id":298244,"id":"Q298244"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6348677$55726032-F1D6-4FFE-A90A-6EEE4718BA57","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e65b927aa72fb8c2ae84aca0cb3c761c4ef0a07","datavalue":{"value":{"entity-type":"item","numeric-id":6092623,"id":"Q6092623"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6348677$AC037BF2-B2A6-4E19-90EB-19DEB6239A00","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fc75664172c99367cabb3f44fa08beebed3f3884","datavalue":{"value":{"entity-type":"item","numeric-id":298242,"id":"Q298242"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6348677$D4C7A9BC-9CD7-421A-B646-DC9FB9D0F03E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1c6400b959483571d92fb0716858bf5b5b7e39ca","datavalue":{"value":"900439043","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6348677$655E5F4C-4BD3-4EBE-BD5F-2FF17768235E","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":"Q6348677$B5C44533-BBD0-4AD3-8F0B-3E8AF58D9812","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A polynomial-time algorithm for spanning tree modulus","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_polynomial-time_algorithm_for_spanning_tree_modulus"}}}}}