{"entities":{"Q6382626":{"pageid":13516268,"ns":120,"title":"Item:Q6382626","lastrevid":59049765,"modified":"2026-04-07T10:06:02Z","type":"item","id":"Q6382626","labels":{"en":{"language":"en","value":"Graph Matching via Optimal Transport"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900494403"}},"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":"Q6382626$1C49D17A-1780-43FD-A895-3D7F59457419","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"42e8877531cc3beb8833806042dffaedcc047af9","datavalue":{"value":{"time":"+2021-11-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6382626$02E96FF9-8DA5-4CE5-8763-60A1E50F7535","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"007e342a9eaf81ff0fc83d266f52fc5fa6e6c839","datavalue":{"value":{"entity-type":"item","numeric-id":6382624,"id":"Q6382624"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6382626$98B3A3BD-7C34-4C4E-8598-D0DF6BDE0877","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"677b502bb50bc39a8a3e3ed4a62d4431b03be741","datavalue":{"value":{"entity-type":"item","numeric-id":6382625,"id":"Q6382625"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6382626$4E2DABE6-05B8-40DB-8E07-E98926FA4135","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ad230dd57ab3c139c3fca79dae713211a93d2a47","datavalue":{"value":{"entity-type":"item","numeric-id":485939,"id":"Q485939"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6382626$15E38717-59A0-4134-911F-EC27C0CA806B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"61fddec267779c5c56c457611ed029a173d9a4e2","datavalue":{"value":{"entity-type":"item","numeric-id":641073,"id":"Q641073"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6382626$59C73C90-0D82-43EB-B39E-A99931F3DDA8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9637999c5f5c6df2821ea55c4c8d095f338ba0ac","datavalue":{"value":"900494403","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6382626$A6942642-B833-434A-BBA8-62CF00DE999A","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":"Q6382626$07391E71-5DF3-40D8-8C33-B74D92917192","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"37291c90ed3e493ac95ea1c6eb271b0bf9c10950","datavalue":{"value":"https://github.com/neurodata/goat","type":"string"},"datatype":"url"},"type":"statement","id":"Q6382626$664166D1-C5B7-4CE4-A874-7011358EC1A9","rank":"normal","references":[{"hash":"abfee2fe181ba2399b6cf366103a92f11d4bf0b1","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"4b7bc47ece35c737a2c00f0765dfe855ed7fdeda","datavalue":{"value":"https://paperswithcode.com/paper/graph-matching-via-optimal-transport","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6382626","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6382626"}}}}}