{"entities":{"Q6324035":{"pageid":13459577,"ns":120,"title":"Item:Q6324035","lastrevid":103259483,"modified":"2026-06-06T06:39:18Z","type":"item","id":"Q6324035","labels":{"en":{"language":"en","value":"An Efficient Algorithm for Latin Squares in a Bipartite Min-Max-Plus System"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900384496"}},"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":"Q6324035$9D09F78A-514C-4BF2-9A11-3ADF89E96F6B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8e2137b88b3b13f5dc18a801021013ed4e793327","datavalue":{"value":{"time":"+2019-08-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6324035$29686CDC-45B9-4414-A62C-A5D66F44D933","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"176e4dad02753318c5584eae746bdb7379fe6bcd","datavalue":{"value":{"entity-type":"item","numeric-id":2189182,"id":"Q2189182"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6324035$41118542-0DD6-4ED0-9AE5-2C51EDFCC3F5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2149e566fddd3bc246ee8245d1eda3b1595f06ec","datavalue":{"value":{"entity-type":"item","numeric-id":2189181,"id":"Q2189181"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6324035$829D1531-1123-4A45-9288-C3783D389054","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a39570ab32cfc5eb1a3dee8b9e6364ff4f97b715","datavalue":{"value":{"entity-type":"item","numeric-id":648348,"id":"Q648348"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6324035$7B11EB3C-0B45-4B20-A076-17F15FAF825A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"619832bb574274ce1a1e0a2ca37a06ac81d667c2","datavalue":{"value":{"entity-type":"item","numeric-id":709103,"id":"Q709103"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6324035$65C4A6C6-9E08-4400-8669-7498D23870CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0bdf00c304013c9112aecd42e452338de9bf03c4","datavalue":{"value":{"entity-type":"item","numeric-id":1714918,"id":"Q1714918"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6324035$7CE203C2-F0FB-4A84-A398-E5F9801B94F5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ebb9fe198d66f5576b96b6982c79130d4787f1b5","datavalue":{"value":"900384496","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6324035$ACB04718-701F-4CCB-B0A7-70F7AD4D0ED2","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":"Q6324035$A83B385E-DB06-459F-8041-D6A320C88BB4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Efficient Algorithm for Latin Squares in a Bipartite Min-Max-Plus System","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Efficient_Algorithm_for_Latin_Squares_in_a_Bipartite_Min-Max-Plus_System"}}}}}