{"entities":{"Q6947247":{"pageid":21187059,"ns":120,"title":"Item:Q6947247","lastrevid":75977205,"modified":"2026-04-22T09:23:57Z","type":"item","id":"Q6947247","labels":{"en":{"language":"en","value":"Decremental single-source shortest paths on undirected graphs in near-linear total update time"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8075781"}},"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":"Q6947247$A0A3E2B4-4B53-452F-AF1D-2EE5A7CD06E6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ed954a429379f4d67bf6fc752b02497ec4430c44","datavalue":{"value":{"text":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6947247$F4C87904-3320-47E2-9394-E2738E81C148","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"095bd0c2858e4513cc2da306d0693e0d5abfd73d","datavalue":{"value":"10.1109/FOCS.2014.24","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947247$74F169A4-9E6B-48A7-A957-27885B907442","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5206d388e7179cac1a1f282e72074e651e25ba7","datavalue":{"value":{"entity-type":"item","numeric-id":1370851,"id":"Q1370851"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6947247$71BA06E2-E6C8-4383-9929-8DC07153973D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8d31f8ada9ce5c02588c1f98c05e862a69746253","datavalue":{"value":{"entity-type":"item","numeric-id":279319,"id":"Q279319"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6947247$6E877A31-4F96-4C6D-8F80-5B53E76E4D32","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1a3b8b3ae49f4a83653d67f230de7a96f1760a4b","datavalue":{"value":{"entity-type":"item","numeric-id":487010,"id":"Q487010"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6947247$415CA2DD-3427-462B-A298-08A38EAF880D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"edc92756de24fbad63d3f53ad7f8ea4e3721e7de","datavalue":{"value":{"time":"+2025-08-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6947247$2A301E1F-637C-4C25-A2F2-8191581BB226","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947247$AEBDE749-3AEF-44E3-BB85-B98B1E787B10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"57f167c32409cd84dad7e725a6344d78daf6bdb3","datavalue":{"value":"05-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947247$D5BF559C-224B-4CB7-9ED6-689C41AEB45C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947247$11FF59B6-1706-432D-93BF-D8E6339C0F0E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"88748d900b7f0eff34620a03d455d2bc986f375e","datavalue":{"value":"8075781","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947247$19D4DA51-B856-4F52-9F70-694B997DEE93","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":"Q6947247$D172E648-4CE6-4E34-9EEA-C59F97782F39","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Decremental_single-source_shortest_paths_on_undirected_graphs_in_near-linear_total_update_time"}}}}}