{"entities":{"Q5570042":{"pageid":7599602,"ns":120,"title":"Item:Q5570042","lastrevid":32433956,"modified":"2024-03-19T22:41:29Z","type":"item","id":"Q5570042","labels":{"en":{"language":"en","value":"The Problem of the Shortest Network Joining n Points"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3286710"}},"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":"Q5570042$AA2D4A39-5DD6-476E-A9B8-55A1A9A3F426","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"112a6b70123b6217e51faa111529a23109c8b672","datavalue":{"value":"0179.26001","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5570042$934DD2A6-7856-4DA5-B837-E8D48B22AE5D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3178294296878557c94893fc1b3d38618956c478","datavalue":{"value":"10.2307/2688800","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5570042$048487C3-A36B-447C-8C5B-5FE047B5FE17","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"99b7caf505f436c822805e8695093f0cef3dae6c","datavalue":{"value":{"entity-type":"item","numeric-id":2530967,"id":"Q2530967"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5570042$06218B83-194F-4AE7-8408-97C371EB3D84","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6b7d902a691bf065ccbbbe3c070a7f8cb1f53366","datavalue":{"value":{"time":"+1968-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5570042$52FA4307-D9E9-48AC-8514-0DF2F8B2CA8B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a8aa87e752293329aebfa902db911eb8bc21f99b","datavalue":{"value":"3286710","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5570042$E670283A-5F45-4978-84DC-8A50A97A27BD","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fee9677937af4280ca2b7da086523ad813e30fbe","datavalue":{"value":"elementary geometry","type":"string"},"datatype":"string"},"type":"statement","id":"Q5570042$4A636F86-D8F8-48D8-BA74-A15E6B639EEB","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":"Q5570042$7EDCB7F2-3510-4411-B90C-6B72CDD397C3","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"9feffd1404169e747933a91562e34ba7f42c707c","datavalue":{"value":"https://doi.org/10.2307/2688800","type":"string"},"datatype":"url"},"type":"statement","id":"Q5570042$C9620B03-E523-4AA0-AB4D-B3E86039C015","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"96ced291b708bae5d987f212ab420bc45cdc16de","datavalue":{"value":"W4245752809","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5570042$493D8B75-BDEF-44B8-8BCA-F8EE6F1BC0BB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"85815407d54cd12775ab287febfb935a6c46e04f","datavalue":{"value":{"text":"The Problem of the Shortest Network Joining n Points","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5570042$837E7A10-9DBF-4703-9D5E-EB859CEA2D09","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5570042","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5570042"}}}}}