{"entities":{"Q6575175":{"pageid":14186330,"ns":120,"title":"Item:Q6575175","lastrevid":99882038,"modified":"2026-06-05T20:55:18Z","type":"item","id":"Q6575175","labels":{"en":{"language":"en","value":"Universally-optimal distributed shortest paths and transshipment via graph-based \\(\\ell_1\\)-oblivious routing"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883681"}},"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":"Q6575175$6DBD2BBB-100C-4F59-81E9-F62C8D95CCE2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2644bd0a4b8d829af6ccf5189807c8473997a39f","datavalue":{"value":{"text":"Universally-optimal distributed shortest paths and transshipment via graph-based \\(\\ell_1\\)-oblivious routing","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575175$6CEF998B-3D9B-49A1-BF4F-2FFA75A85C9A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e2623c1e3e4428d9d129b02ffa9efa387891f9a5","datavalue":{"value":"10.1137/1.9781611977073.100","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575175$EE1D763D-5316-45DA-8D1C-10A27CF732EB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a03822af62311c7dc126dceeab4b1c87937701f6","datavalue":{"value":{"entity-type":"item","numeric-id":1660931,"id":"Q1660931"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575175$4A303900-348F-4661-8668-60C52B348805","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"47783af70ace06a4a948d8f3757b71f4c03597f0","datavalue":{"value":{"entity-type":"item","numeric-id":2971160,"id":"Q2971160"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575175$19017C34-9357-49FB-AD02-BCE005CA1C66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5f4e0266c79d97433614a133607bf2006776e1f3","datavalue":{"value":{"entity-type":"item","numeric-id":2239503,"id":"Q2239503"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575175$36CB2CE8-C464-436B-8A41-7677DEACE42C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"67a4892b98f738d085af760899eef6e53d3384ef","datavalue":{"value":{"entity-type":"item","numeric-id":540050,"id":"Q540050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575175$A3B91082-7727-417F-BCB1-955AD25EE6C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b1fafbfdbcba730df23f71f6b7ad97fc662ceddf","datavalue":{"value":{"entity-type":"item","numeric-id":726338,"id":"Q726338"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575175$D283D092-F3D6-4621-A53B-36855D7B3157","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575175$DCE4B88A-F0AB-47C0-9577-C89DC0215297","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575175$386705A6-664A-40C6-8C18-71353B8A4D3B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1d95bfd03f7619d06a191785dbf96e7c6497bd71","datavalue":{"value":"7883681","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575175$CD321E4B-CB98-4A0E-AB76-88F2B47821DB","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":"Q6575175$B32DDC46-7060-4423-8442-C62903B6239D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Universally-optimal distributed shortest paths and transshipment via graph-based \\(\\ell 1\\)-oblivious routing","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Universally-optimal_distributed_shortest_paths_and_transshipment_via_graph-based_%5C(%5Cell_1%5C)-oblivious_routing"}}}}}