{"entities":{"Q6287829":{"pageid":13424329,"ns":120,"title":"Item:Q6287829","lastrevid":94887239,"modified":"2026-06-05T07:53:42Z","type":"item","id":"Q6287829","labels":{"en":{"language":"en","value":"Network Simplex Algorithm associated with the Maximum Flow Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900318278"}},"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":"Q6287829$A79785BC-225E-4C51-A131-172D012FF3D8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9fb82429bb4ba602ab7d5caf04c575952ba3fb53","datavalue":{"value":{"time":"+2017-06-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6287829$51DC94CE-0A44-4903-9E0B-0B17BB20A708","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"62050dc20115382a3c5385a869839997fca4d611","datavalue":{"value":{"entity-type":"item","numeric-id":1943083,"id":"Q1943083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6287829$618635A4-770F-4EC9-A432-88E6C105627C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"20da7f00929953cea29023df9a5b947cba47063c","datavalue":{"value":{"entity-type":"item","numeric-id":6287828,"id":"Q6287828"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6287829$2A033546-EB60-4643-9A34-D1E623802563","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"00a0112beef6a00f5bed1d8d99ccec2153d8fb57","datavalue":{"value":{"entity-type":"item","numeric-id":760613,"id":"Q760613"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6287829$807E37B8-4756-4BFD-B70D-9ED8468A5BDD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ff5cb3dbb12b25ef835a82ffd31d850db44f7a62","datavalue":{"value":"900318278","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6287829$4FA4FAE4-5326-409B-9E54-7EFACCCB3505","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":"Q6287829$417BBC7D-FB97-48CF-8234-E721C3FF995D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Network Simplex Algorithm associated with the Maximum Flow Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Network_Simplex_Algorithm_associated_with_the_Maximum_Flow_Problem"}}}}}