{"entities":{"Q1242818":{"pageid":1253568,"ns":120,"title":"Item:Q1242818","lastrevid":67102743,"modified":"2026-04-12T15:18:31Z","type":"item","id":"Q1242818","labels":{"en":{"language":"en","value":"Minimal cut problems on an infinite network"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3575388"}},"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":"Q1242818$A8F22FFD-7E46-42CE-895E-7AA627035521","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5a2b7aa96b785abb2b4d9342c78203cfd6332ef3","datavalue":{"value":{"text":"Minimal cut problems on an infinite network","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1242818$B9AC77EC-CC5E-4EDE-8CBD-B22091818CB8","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"99e92af2a0db9f51d2b0a6782b57a2bdd8ec2275","datavalue":{"value":"0368.90126","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1242818$BF32614F-0084-4F31-9766-03896A8D3059","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f4e0b56a96c2923cae304e1e0cb3ef37a3faaca2","datavalue":{"value":{"entity-type":"item","numeric-id":1062702,"id":"Q1062702"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1242818$21F8254A-5F97-47D3-9256-015BE8761652","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"068a6da9441e28889aee890db5f8920c6fff801b","datavalue":{"value":{"entity-type":"item","numeric-id":171490,"id":"Q171490"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1242818$888795AE-BC12-435E-BA84-3AAE02084712","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ff1738183464565e1571c6f5c1efa36ed974056e","datavalue":{"value":{"entity-type":"item","numeric-id":175744,"id":"Q175744"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1242818$39F68ACD-97CB-49AB-8356-FDD2C480250F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a49472451190faf858f564fafd4bcba399999753","datavalue":{"value":{"time":"+1977-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":"Q1242818$9355F2B1-CF11-4B6B-9D0E-61F8F983BFC1","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1242818$57B64C84-02DF-4D36-8604-7024A190EA5C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5b5382a3c8cda606aaeed0d96776816115509f05","datavalue":{"value":"3575388","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1242818$C82E280C-F50A-4947-8AEA-AF7A172DB90F","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":"Q1242818$9E735EE8-F670-4371-9B83-C5B2619AE53D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Minimal cut problems on an infinite network","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Minimal_cut_problems_on_an_infinite_network"}}}}}