{"entities":{"Q6842441":{"pageid":20551360,"ns":120,"title":"Item:Q6842441","lastrevid":74990296,"modified":"2026-04-17T09:37:34Z","type":"item","id":"Q6842441","labels":{"en":{"language":"en","value":"The complexity of verifying loop-free programs as differentially private"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8174033"}},"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":"Q6842441$89F174DF-365F-4FD3-8DDE-7C723D841CF3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f1646e5ff84c9090f263aa0b96bc0d0af0de4ba6","datavalue":{"value":{"text":"The complexity of verifying loop-free programs as differentially private","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6842441$E08D9DB2-F7C9-47CF-84E4-3DF7399E0E8B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ed758efaebd9fba0b87bd4bb59cba5451efac08a","datavalue":{"value":"10.4230/LIPICS.ICALP.2020.129","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842441$9D1659B3-4E4C-4B74-9F69-8C201B2ED125","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0543480bd713540e86d55e77dccdfc4a22872606","datavalue":{"value":{"entity-type":"item","numeric-id":843950,"id":"Q843950"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842441$EB049105-AA3A-4C7D-9B94-AF722EE9AC21","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ee5bf92e3770c5a26b5d10fe0060ac828429207a","datavalue":{"value":{"entity-type":"item","numeric-id":271587,"id":"Q271587"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842441$B76B1D11-D2DE-404E-BCE7-20E0C08CAF47","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d20f5b4127431a252123fabe9a9dd1834e29c1af","datavalue":{"value":{"entity-type":"item","numeric-id":832261,"id":"Q832261"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842441$ACDC1E1A-173C-4E09-8B80-7168207F0D9A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"08788b2cbf350ad4bc12c8b64351e1e6eefe3b67","datavalue":{"value":{"time":"+2026-03-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6842441$40CA8316-2972-45F7-9DEC-116567C12CF8","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1a86519cb3571ebce07f2774b2a00a0f17e12c3e","datavalue":{"value":"68Nxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842441$2102EEA1-2EBC-4611-9E24-261164728792","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842441$4EF91A14-CA9D-42E8-A7DC-8B0F801F6EFB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9ac083627d90713dbc14f73c5d3c32cefc984af7","datavalue":{"value":"8174033","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842441$E3CC4763-74E6-4667-B8F3-470151003F3E","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"daf5f856a5d861312ad309ab567540337a5f61d6","datavalue":{"value":{"entity-type":"item","numeric-id":57050,"id":"Q57050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842441$B738BB81-CE27-46C3-9568-4E2B2DB66DE5","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1c855e62dd5703cb0415e9cc6eeda75791ac88b3","datavalue":{"value":"differential privacy","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842441$3A22B7DC-289C-4C8A-BA36-C438F3873FF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c50d987ab7c3ea2a41cb6aca681d912964971ed8","datavalue":{"value":"program verification","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842441$3345C186-3E5E-4854-9EFE-80D93F8E531A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"abb803c6475a042fe06038cc89389e508b9ca513","datavalue":{"value":"probabilistic programs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842441$FB5D83CD-CAEC-46FA-9807-9979E7F8D894","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":"Q6842441$A111AADF-F6F0-46A2-9D55-D89CE0443DA0","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The complexity of verifying loop-free programs as differentially private","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_complexity_of_verifying_loop-free_programs_as_differentially_private"}}}}}