{"entities":{"Q6538715":{"pageid":14149858,"ns":120,"title":"Item:Q6538715","lastrevid":103511537,"modified":"2026-06-06T07:31:21Z","type":"item","id":"Q6538715","labels":{"en":{"language":"en","value":"Differentially private all-pairs shortest path distances: improved algorithms and lower bounds"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7848144"}},"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":"Q6538715$B83E80B6-FE23-4BBE-9B70-3C0B78F02BAF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"be68c6de7a3b6f2011067a72d4380c83612de93d","datavalue":{"value":{"text":"Differentially private all-pairs shortest path distances: improved algorithms and lower bounds","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6538715$B61E193A-F4A2-42EB-B078-1F26A053FF95","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ace752bc55e792bc79c935785f13304a45b4838","datavalue":{"value":{"entity-type":"item","numeric-id":6271743,"id":"Q6271743"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538715$101E5F4A-5884-4CE2-895A-9875384907B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a2a3d88924496d5e4e5a0402d245c0d0cea1d046","datavalue":{"value":{"entity-type":"item","numeric-id":1616617,"id":"Q1616617"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538715$EA5C2BDF-8572-40F6-AFB2-5C5732012BF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8a15d87f61cebce8a0c7d9d3660d76b6972e6971","datavalue":{"value":{"entity-type":"item","numeric-id":6538714,"id":"Q6538714"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538715$77354A43-31DE-4D87-BD1A-7830E71F040F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"18a901d1a78f32110e38e24a7f49a346af16da30","datavalue":{"value":{"entity-type":"item","numeric-id":513281,"id":"Q513281"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538715$B9C15202-FF7A-4798-8242-F5524F489A36","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d6b0666cf19f0293232a00195a50692adf2afa9a","datavalue":{"value":{"entity-type":"item","numeric-id":1979441,"id":"Q1979441"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538715$5E26D2C4-A391-40E8-A109-29E8A64C8B8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"254750530ce39a0fc13beb2c559c38a2236cac98","datavalue":{"value":{"entity-type":"item","numeric-id":496170,"id":"Q496170"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538715$2316F080-06D8-4E2F-9499-45CCF6EAF959","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1ac80ef7383636c444645d5d6e34ee78765d27ea","datavalue":{"value":{"entity-type":"item","numeric-id":5091197,"id":"Q5091197"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538715$8517318B-043A-40AD-A87B-B1DD91E6BA23","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e8e66a32d534df6de0df71c4be5910df36dd6c70","datavalue":{"value":{"time":"+2024-05-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6538715$78EA8F9F-191C-4A88-AF07-1FC3EEBAA401","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538715$3CFD86E5-95BF-4FB3-9660-74F495F678A1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2d1f69e9165c287a9cb1aa83a5f3f43de6027da1","datavalue":{"value":"7848144","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538715$7905DFB5-6E62-4736-AA35-25218CA487AF","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":"Q6538715$0B02532F-110D-46D3-8750-B33CD7D4A578","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9f8b92a7f892cbda741f668b81decd3e1df2ebda","datavalue":{"value":"10.1137/1.9781611977554.CH184","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538715$CB3154C6-3C59-4E6D-B143-D77D15238EE8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Differentially private all-pairs shortest path distances: improved algorithms and lower bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Differentially_private_all-pairs_shortest_path_distances:_improved_algorithms_and_lower_bounds"}}}}}