{"entities":{"Q4091991":{"pageid":6121591,"ns":120,"title":"Item:Q4091991","lastrevid":93232130,"modified":"2026-06-05T04:01:04Z","type":"item","id":"Q4091991","labels":{"en":{"language":"en","value":"A Shortest Path Algorithm for Edge-Sparse Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3512160"}},"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":"Q4091991$EC830A6B-355A-465F-A250-55795798FC93","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"402da824d969e9e11c1642aed382d66ad3588d23","datavalue":{"value":{"text":"A Shortest Path Algorithm for Edge-Sparse Graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4091991$44B65F5A-F908-436C-A890-4A687F2152E6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"27d23f6990afff0f1289aa6de57c8be2b84d0894","datavalue":{"value":"0327.05120","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$F02D2E23-73E0-42A9-AEB3-94FF72C1C3EA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"61fb8a4dc672bbad39c7fb632f5d5ef8618d523e","datavalue":{"value":"10.1145/321921.321927","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$453F6405-124D-4B21-A7C1-70D7690EA31B","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f12bfc80fe4a431c556e028f5134a217234a7cc4","datavalue":{"value":{"entity-type":"item","numeric-id":63915,"id":"Q63915"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4091991$1A8DF036-813D-434E-AFE2-B912F0F55D61","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"974fa8a46aa40326fb3113b279589eb02559bb73","datavalue":{"value":{"time":"+1976-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4091991$BE770289-1567-4E46-B091-C5BCAF0C6A3F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$0651F172-CA17-47D1-AC96-F2A935209A5E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$950685B3-70CA-41C3-AD2D-26E6D807F21F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$46FA8FDB-95F4-47E6-8449-D9E45FE2869C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$E6862974-71E1-4932-9498-72370FBC0B21","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"39a661b6bb8c56ed7e45b670812b4f6d3e9d8b87","datavalue":{"value":"3512160","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$FDBCCEF0-AF1F-4578-9C0D-D30C5DC3EF8E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a8340eb79987daeab20625e6b843f23240721b99","datavalue":{"value":{"entity-type":"item","numeric-id":1823616,"id":"Q1823616"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4091991$96C501FA-7F0C-4CE4-A021-D5E70F5AD455","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":"Q4091991$A8AF7A4E-1EE1-431D-9CC2-3D11989929DB","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ea2827c88cd5fd6298a10bc67c3eab06de780dbc","datavalue":{"value":"https://doi.org/10.1145/321921.321927","type":"string"},"datatype":"url"},"type":"statement","id":"Q4091991$FDB4B331-3F7C-44A3-AE9E-426016B4DBFC","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"ee68f93ca31e87ac22978246ab34443ac3c75fd4","datavalue":{"value":"W2023367804","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4091991$7DF9D0DA-6F8E-4220-94BA-895E2573CB2F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Shortest Path Algorithm for Edge-Sparse Graphs","badges":[]}}}}}