{"entities":{"Q6969633":{"pageid":21320862,"ns":120,"title":"Item:Q6969633","lastrevid":76177968,"modified":"2026-04-23T03:19:34Z","type":"item","id":"Q6969633","labels":{"en":{"language":"en","value":"Learning-augmented query policies for minimum spanning tree with uncertainty"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8054573"}},"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":"Q6969633$A860A79C-11F1-434E-8715-04B4F62F5550","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4896d046a600605f03e17dd4dcb349e8c36a78da","datavalue":{"value":{"text":"Learning-augmented query policies for minimum spanning tree with uncertainty","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6969633$D48EBAF3-FA2A-4432-8D5E-6315ACAA9454","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"084b2f5208cf082dc686a96dfaa587ff39e71279","datavalue":{"value":"10.4230/LIPICS.ESA.2022.49","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969633$92DBF2D9-55D3-4EBD-84D9-D9FBA5520D83","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e2ae77f47bcde8d0b6ca783574e8e9f2f563d970","datavalue":{"value":{"entity-type":"item","numeric-id":163073,"id":"Q163073"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6969633$DC145550-F836-4807-AC82-5FFC72596DB5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2d7faa8b76bb751f2a86450024da22db2b90fa16","datavalue":{"value":{"entity-type":"item","numeric-id":2081615,"id":"Q2081615"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6969633$0EF6CE23-384F-4370-B7B7-898B2F2DEB7D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4142bc7f6289ef0f5fcfeb49b6f56a41b8903b32","datavalue":{"value":{"entity-type":"item","numeric-id":417996,"id":"Q417996"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6969633$741ED62E-B21A-4760-8508-2DBEEF9087CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fc879063c541de77bf64da4b0e88a5d84d91b635","datavalue":{"value":{"entity-type":"item","numeric-id":2084004,"id":"Q2084004"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6969633$44D702E7-7B7B-465C-8487-54FCF454B497","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4a2026fb75f5daddaed5a35be8cef68702a6e3d6","datavalue":{"value":{"time":"+2025-06-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":"Q6969633$B06D2EFB-6F77-442C-8298-7A728183E16D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969633$979A8370-D37F-4324-9E14-E40FBC79AC92","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"68fbe1d31364ad0f0936de07791b60a25003eecf","datavalue":{"value":"8054573","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6969633$A1952C38-A403-4A40-B5EA-B70638BAE54A","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":"Q6969633$66F3BB9D-E7E3-48FA-82C1-2C90E2039609","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ea00d803b3dcaafa56999a7ee207d5d528f73a41","datavalue":{"value":"explorable uncertainty","type":"string"},"datatype":"string"},"type":"statement","id":"Q6969633$103D1E90-D995-4EC8-A8BA-95F9366B61D5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8b089b06f0cc77ca1cb2aa0a815b20bf421cb6ce","datavalue":{"value":"queries","type":"string"},"datatype":"string"},"type":"statement","id":"Q6969633$B8C5E155-34F7-45EB-980E-B9383C3F1658","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4649b02df82ca05152d9743d4f6b609d7b390c75","datavalue":{"value":"untrusted predictions","type":"string"},"datatype":"string"},"type":"statement","id":"Q6969633$B42133FC-C767-42ED-8958-FF13BE08BC86","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":"Q6969633$9A0474C1-C59E-499C-BF7C-3737F55457ED","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Learning-augmented query policies for minimum spanning tree with uncertainty","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Learning-augmented_query_policies_for_minimum_spanning_tree_with_uncertainty"}}}}}