{"entities":{"Q1158968":{"pageid":1169717,"ns":120,"title":"Item:Q1158968","lastrevid":69760143,"modified":"2026-04-13T09:12:04Z","type":"item","id":"Q1158968","labels":{"en":{"language":"en","value":"A note on 'Is shortest path problem not harder than matrix multiplication?'"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3744565"}},"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":"Q1158968$8F1C4114-8A0C-4190-B037-A2FD50354055","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"66648f1198007d4ef2223e789b1cc436d74dc5d2","datavalue":{"value":{"text":"A note on 'Is shortest path problem not harder than matrix multiplication?'","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1158968$F8E6A9EB-7D06-4F5E-9950-893F22AAAEC4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"5f418373c7585cf45cf2c95c2b67659dddc18028","datavalue":{"value":"0474.68078","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$0A7D2A00-FED7-46DB-9C19-6A2838112317","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0dd7ce690fba4e60eb7b6ecd24ee2d3abc1007b6","datavalue":{"value":"10.1016/0020-0190(81)90039-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$C99BEE7B-425D-4868-9A97-7F61A8E9468F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3bd4342967813d6c73138a0b6a4a791b0a8c6593","datavalue":{"value":{"entity-type":"item","numeric-id":287984,"id":"Q287984"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1158968$1496B14C-DFCF-4390-8E4F-6C4EEAFC00DB","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1158968$54AED654-BCBB-4290-958C-7458AD04D5C2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"50fad0db7dc87cb4e51866acdb5ccbaa54ec857b","datavalue":{"value":{"time":"+1981-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":"Q1158968$031EB325-5B5C-42DB-9A03-2664F0F7F26F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$22614755-A4BE-4B76-89A9-FC7A7FBF676C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$389623A6-C78E-4E62-A535-48525F3EDDB3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$23141CC3-A55B-498A-9674-8A66F2122395","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"83bbf0b299346afb89579c3d6a26f4aedc76938a","datavalue":{"value":"05C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$1CBC0AA6-958F-4B3D-B605-4F0CD8855C9F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"898109ac7e401de8fce76101fe27418b7afd5158","datavalue":{"value":"05C50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$449A05F7-C804-4B90-A549-849414360006","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4a942037a148ab5693277d331246ced5001d9981","datavalue":{"value":"3744565","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$9210CD01-3B77-403B-85CE-488C7AC470DE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0432e748f3635c2103b8c9a5fe2443dbbd8da0e1","datavalue":{"value":"bitwise complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q1158968$78C3F319-90D5-463F-B300-F26299721D96","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"82f7548ca92a19713f8fc2bef1bd55924e036303","datavalue":{"value":"total arithmetic complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q1158968$6A3E1B70-452F-4A37-9C1F-DC6B7ED4340E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b0bc1cc50e8d4b517f651118878724606a4faacd","datavalue":{"value":"reducibility","type":"string"},"datatype":"string"},"type":"statement","id":"Q1158968$880CE89F-6ED5-45E5-B86A-8F2E6C7DF7C4","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":"Q1158968$6FA4A027-6E53-4D5F-9E74-5373A0AC8721","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"b245d5ee1dc2207ab3c7639acc1a46ba60d316f4","datavalue":{"value":"https://doi.org/10.1016/0020-0190(81)90039-9","type":"string"},"datatype":"url"},"type":"statement","id":"Q1158968$3340B963-5C09-432E-8151-6E238C44AC97","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4ff720973cd903aaf6f2d1f5bd2d57f82e744051","datavalue":{"value":"W1997654840","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1158968$497E2142-F45B-4DC2-9C3E-7EF64636AAD6","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"340ea97c0f2f383d364057042ebc9f9438fcc85a","datavalue":{"value":{"entity-type":"item","numeric-id":4091421,"id":"Q4091421"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1158968$36E6CAD3-1944-44B0-80AC-2B7D2B8228AB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dad0037d127c13d7455329129a8da84d6251d9cd","datavalue":{"value":{"entity-type":"item","numeric-id":1149782,"id":"Q1149782"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1158968$C07E1166-7592-4456-98F4-DAB059CF9309","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d97a3128124fa8bd35ebbf9fbed77c519f5a7561","datavalue":{"value":{"entity-type":"item","numeric-id":1232179,"id":"Q1232179"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1158968$83141186-B0DB-4027-806C-7117A8FC9BC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7f1746c0002a982167f6b872896509d0ce78aa9e","datavalue":{"value":{"entity-type":"item","numeric-id":2536323,"id":"Q2536323"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1158968$30B07289-C87D-410B-8CC2-2BD524381B5F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"be3624bcabb24cc9ff70e76200fbb9cd084e9cdc","datavalue":{"value":{"entity-type":"item","numeric-id":1228358,"id":"Q1228358"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1158968$E46E18A2-DF7F-47F9-BA6D-31662F566B7A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A note on 'Is shortest path problem not harder than matrix multiplication?'","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_note_on_%27Is_shortest_path_problem_not_harder_than_matrix_multiplication%3F%27"}}}}}