{"entities":{"Q6224912":{"pageid":13361690,"ns":120,"title":"Item:Q6224912","lastrevid":94103465,"modified":"2026-06-05T05:53:03Z","type":"item","id":"Q6224912","labels":{"en":{"language":"en","value":"Solution of the optimal assignment problem by diagonal scaling algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900128651"}},"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":"Q6224912$AF82AB5C-41ED-4DA4-B7C5-94D02064A8DF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"319e54af93e30bd9a7bb4adac4d1793504aad59c","datavalue":{"value":{"time":"+2011-04-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6224912$264934AE-96DE-4B49-A038-1449DDD067D5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a508359f866670af4504ef403acb3fb17e8105d3","datavalue":{"value":{"entity-type":"item","numeric-id":1789405,"id":"Q1789405"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6224912$789EF09A-BF78-4BA6-A8AF-0317B47FA166","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e298a50abdd4dae72108aced252284ab65651b78","datavalue":{"value":{"entity-type":"item","numeric-id":255785,"id":"Q255785"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6224912$08CDCC27-236C-443F-A92D-EE08EBA24B4C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"433f84df332f8da4d60514fcf224a97e22cc6e3f","datavalue":{"value":{"entity-type":"item","numeric-id":629536,"id":"Q629536"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6224912$FD8FA5E8-A64D-452C-9E63-883FEDB00437","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"27cd054b66f145a239f6ca06a18651d59941bfd1","datavalue":{"value":"900128651","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6224912$73AFF004-8981-4E3E-9F68-F626EDD9BF59","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":"Q6224912$1A4EE2A9-D8E1-49D0-83F7-ADA760095CA5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Solution of the optimal assignment problem by diagonal scaling algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Solution_of_the_optimal_assignment_problem_by_diagonal_scaling_algorithms"}}}}}