{"entities":{"Q6039769":{"pageid":13121515,"ns":120,"title":"Item:Q6039769","lastrevid":102286946,"modified":"2026-06-06T04:05:58Z","type":"item","id":"Q6039769","labels":{"en":{"language":"en","value":"Fast splitting algorithms for sparsity-constrained and noisy group testing"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7688063"}},"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":"Q6039769$A3EE3229-A000-467B-81E0-1AD6BAC593C8","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d85c8b238ec9432157190b76d17b9b63e7cecc87","datavalue":{"value":{"text":"Fast splitting algorithms for sparsity-constrained and noisy group testing","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6039769$0A08B6FF-E297-4EE5-B30D-8AF9CC18E08F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"60ef93790f2e877e26d253c49f4a4ed916c35a0d","datavalue":{"value":{"entity-type":"item","numeric-id":970607,"id":"Q970607"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6039769$5BC445BC-9663-4BCD-ABD2-57C5BCB30225","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a957b0aff25b31f3cf196f326b0c91428f933911","datavalue":{"value":{"entity-type":"item","numeric-id":2976703,"id":"Q2976703"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6039769$E74409FE-6F0E-42F9-B122-D55E735368BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"132397955f763f6ddf4ba770624e75f7096cbb13","datavalue":{"value":{"entity-type":"item","numeric-id":5088466,"id":"Q5088466"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6039769$C3B7B0F0-8F8B-4D5B-A440-D18267DF0B00","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"df70915f30478a4be330da3d9e8026048c82ffff","datavalue":{"value":{"entity-type":"item","numeric-id":3383813,"id":"Q3383813"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6039769$9657BCFA-48EC-412C-9FA4-E90FC3630029","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"df3e76aba048da6d60ed30c78f02969029aa9ede","datavalue":{"value":{"time":"+2023-05-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6039769$719CD439-5048-4AA3-9607-788B0C6641B8","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"400071cae28789e181000fd80b89c3cb10b1cb41","datavalue":{"value":"https://arxiv.org/abs/2106.00308","type":"string"},"datatype":"url"},"type":"statement","id":"Q6039769$610EB1E9-9C9C-4644-92AF-BEAC8B8A7D32","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"923277c2ca15164b9d1e9edd451ca037b356ac9e","datavalue":{"value":"62-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6039769$2EF69499-9B85-4240-A66D-E7467D62013E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c63045f3ff4731469000457f06aeea6c97a5d15f","datavalue":{"value":"7688063","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6039769$ACD65E65-E5E6-41EB-9A37-B8F5D61C6474","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4e4a5b819171dd0fa8de17b0e5d4491c841626f8","datavalue":{"value":"group testing","type":"string"},"datatype":"string"},"type":"statement","id":"Q6039769$0B9DB4E2-0822-4DA0-903B-751E0D7D5646","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0f7b82989b92e55f23a284155ef019acab639cb1","datavalue":{"value":"sparsity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6039769$70714CB3-1C9A-4C15-8FFC-820F8C418940","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"da16e87a727ad5a67888b5448599c08db53df9b1","datavalue":{"value":"sublinear time algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6039769$DF42E972-48D3-4354-8CB9-0BF0B04DF9F8","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":"Q6039769$F807EF1D-8B30-465C-A2D0-661A607907F0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"780d1e8650f103c7fb27feae55afefefc280efd5","datavalue":{"value":"10.1093/IMAIAI/IAAC031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6039769$13E4B493-C38E-4EB5-BDF3-8A6F5BEA79A4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast splitting algorithms for sparsity-constrained and noisy group testing","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_splitting_algorithms_for_sparsity-constrained_and_noisy_group_testing"}}}}}