{"entities":{"Q6906428":{"pageid":20938186,"ns":120,"title":"Item:Q6906428","lastrevid":75575614,"modified":"2026-04-19T12:43:11Z","type":"item","id":"Q6906428","labels":{"en":{"language":"en","value":"Are there graphs whose shortest path structure requires large edge weights?"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8115337"}},"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":"Q6906428$E2D05565-A31A-4011-8C47-35738AAC186E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"199091255f133dcf29492ffe185c532541f0da00","datavalue":{"value":{"text":"Are there graphs whose shortest path structure requires large edge weights?","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6906428$0A9407F5-DAFF-4E31-901A-12C86FFA4CB8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e2cd0214943315f55488c43267ab6a5eafab1e12","datavalue":{"value":"10.4230/LIPICS.ITCS.2024.12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906428$8571FB1F-A5F0-48F0-B4A7-53DD706B630C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a0676865b99e589ad0d4f0004122f3f8f2f2a428","datavalue":{"value":{"entity-type":"item","numeric-id":2118103,"id":"Q2118103"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906428$659D357A-EEA8-4D03-9196-59E322C00F5F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6878ac77726c1ae31dfa202ff8709dd1dec0cda2","datavalue":{"value":{"entity-type":"item","numeric-id":2026286,"id":"Q2026286"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906428$F31DD027-ACF5-472C-A675-F3AF61F021E7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bddf992d61ee7668901eb12759900f7f93a29af9","datavalue":{"value":{"entity-type":"item","numeric-id":4987443,"id":"Q4987443"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906428$1FB93D5D-AC5A-4C4E-B9C3-B4AB9BB01E4D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"57d1246c8339bcdec3a59483c632c6d106ca03b0","datavalue":{"value":{"time":"+2025-11-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6906428$82B26D33-06D5-4F95-899A-683DA1871353","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906428$C6451B28-2F63-4C1B-837C-2F88CE2E3B6C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d95990148131426bd7ae923b0ff74044ae71018f","datavalue":{"value":"8115337","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906428$7A766769-3F40-483F-9E43-C59B5EEA568C","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906428$6D295B76-D12A-44B6-919B-C5D8259BA6A5","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"69d0c99f1e5283b31715a9c7d799852fe62c506e","datavalue":{"value":"shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906428$514C8A3F-DB5D-470C-857A-26F4945B0DF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bdf4dc3db86d44e89a36d3ec12340c2571d04f06","datavalue":{"value":"graph theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906428$E617878B-91FF-465E-8FC7-357E6AB5408C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"34d5d1526cb2202ec3865572751e759db97b7c5d","datavalue":{"value":"weighted graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906428$877A6A35-E5AA-472D-B7F0-9F721CEA5160","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":"Q6906428$893E8B7B-398B-4AB7-B631-B61BC4416834","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Are there graphs whose shortest path structure requires large edge weights?","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Are_there_graphs_whose_shortest_path_structure_requires_large_edge_weights%3F"}}}}}