{"entities":{"Q2906545":{"pageid":2917270,"ns":120,"title":"Item:Q2906545","lastrevid":42481494,"modified":"2025-06-28T15:43:36Z","type":"item","id":"Q2906545","labels":{"en":{"language":"en","value":"Optimal dynamic flows in networks and algorithms for finding them"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6077584"}},"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":"Q2906545$21BE9112-1C23-46CF-AB31-83A3F0377E26","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"09577ac07adc0d7ed44e4ea5344911cc0d01f093","datavalue":{"value":"1260.90092","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2906545$506E25CB-84EC-4C53-9A64-36CBFB5F2621","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fd0374f9cee657eee67ac4dd9d79d96d1538c53a","datavalue":{"value":{"time":"+2012-09-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2906545$2340134E-D6E6-44C8-BB19-5520DDB55DF2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2906545$F1A4A68B-0343-4260-A4A0-2BC994CBDB2E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2906545$6A8AA694-39E0-48FA-8C55-3E336DC4CB03","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8c00031e5d21d84a0b637ffcc7b3767c87e68971","datavalue":{"value":"6077584","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2906545$C1A148A1-7DE6-41A0-8CC6-32CBAEEAE3C5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"fb2421af18922a83ef78de6404a222aef728a1b4","datavalue":{"value":{"entity-type":"item","numeric-id":558648,"id":"Q558648"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2906545$6B4D12F2-BCBE-4969-A8BC-13D823B229EA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"712ff485df37a27ef9a740d0ed30731a51002502","datavalue":{"value":{"entity-type":"item","numeric-id":558647,"id":"Q558647"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2906545$E4F15E27-17DF-4E0D-8BA3-23980CA653ED","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":"Q2906545$80A210AF-0370-4CE4-8F26-B82DBCF3CE60","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c78f1bb63be38c56c33b08ba9ffd6c662e13c84f","datavalue":{"value":{"text":"Optimal dynamic flows in networks and algorithms for finding them","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2906545$2AEE4102-9794-4BD5-90A4-76662CD39299","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2906545","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2906545"}}}}}