{"entities":{"Q7289728":{"pageid":31152109,"ns":120,"title":"Item:Q7289728","lastrevid":104619616,"modified":"2026-09-11T10:11:34Z","type":"item","id":"Q7289728","labels":{"en":{"language":"en","value":"Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8217638"}},"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":"Q7289728$0458866B-3222-416C-8885-490F4087F225","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b6328acb5762da9efd2a5594f8adc9032c3d3863","datavalue":{"value":{"text":"Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7289728$F9A09D4A-E000-491D-8BF4-345A7D49E656","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d1d2a93bf451be7de2c6bf396075e2bd8d70c94b","datavalue":{"value":"10.1137/1.9781611978322.147","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7289728$BE5E5E48-836D-4A06-AA9F-281D7363A8B9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"55ec5b829b15d069be83bf590c89ce27fe9ec0ea","datavalue":{"value":{"entity-type":"item","numeric-id":2051853,"id":"Q2051853"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7289728$74175AD8-F12A-4606-9E83-F3B22438A6C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"eea4036609f8e523825f4ff4ff8b5f4e102877b4","datavalue":{"value":{"entity-type":"item","numeric-id":7253098,"id":"Q7253098"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7289728$98A6E8AB-7838-43A2-8EC6-7B7D75C74BA9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d0e7b09539a160a9fd6354f44ec86b05fdd8b9c8","datavalue":{"value":{"time":"+2026-07-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7289728$EB16F4F8-6911-4DA7-9977-E780EF207A9B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7289728$7B7BBFD9-8C3C-4F88-A660-43E0DEF6A2C8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9a0debe37c390a5ac1599fa0bbb471ea11753012","datavalue":{"value":"8217638","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7289728$8E5AB4F2-7236-4589-83A3-7092C5BF7AE1","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":"Q7289728$65FEC17B-670A-4848-B1D2-05750DC3A540","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Subquadratic_algorithms_in_minor-free_digraphs:_(weighted)_distance_oracles,_decremental_reachability,_and_more"}}}}}