{"entities":{"Q6829231":{"pageid":15115324,"ns":120,"title":"Item:Q6829231","lastrevid":56016337,"modified":"2026-02-24T14:09:06Z","type":"item","id":"Q6829231","labels":{"en":{"language":"en","value":"Are lock-free concurrent algorithms practically wait-free?"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6451601"}},"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":"Q6829231$F85C90D7-EF77-4825-B8BE-6948761F3B2A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e858ab8a3c2a56077a043331c0a20abfe9336af4","datavalue":{"value":{"text":"Are lock-free concurrent algorithms practically wait-free?","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6829231$648466B3-D51B-4D36-B3ED-EF945D172B3E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"efdab5a71310fd619f0c2b869008b87e93a58ba7","datavalue":{"value":"1315.68012","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829231$49A057E7-58D4-4B23-8923-DD48EA761B58","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"07f6b4b161add0aee7f65ae36931683e00e08b97","datavalue":{"value":"10.1145/2591796.2591836","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829231$E78ABC77-D435-4314-9FBF-1D96007B95E1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1bf7160b1a2094cdb5915f4267698705367a11dc","datavalue":{"value":{"entity-type":"item","numeric-id":693078,"id":"Q693078"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829231$608AE875-5A1B-496C-9243-896776A56958","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"50169214229f0aaa4dd9bb9948faad51feef1744","datavalue":{"value":{"entity-type":"item","numeric-id":259273,"id":"Q259273"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829231$1407D821-6A7D-43B4-9601-6FE0B15CB072","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"091716c7232b0a53349943b0984e436e6ac34abb","datavalue":{"value":{"entity-type":"item","numeric-id":236454,"id":"Q236454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829231$769132E6-61FA-4ADE-97D3-216E1EF01EC3","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"90ec4024f317cae195318ef8c101c050662582f1","datavalue":{"value":{"entity-type":"item","numeric-id":5259532,"id":"Q5259532"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829231$D5BC3CEF-6AEE-41C8-A825-FA68FDEF28D6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a4795efe26ace72ea33e5b50072c8db0e5047722","datavalue":{"value":{"time":"+2015-06-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6829231$DB23E138-E758-43F1-98A1-E8D262038C46","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62ff42057022552eaa82447a5a1563ef3bf93acd","datavalue":{"value":"68M14","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829231$3C4EA4CF-39F4-4326-9AC6-F57E3F64EC9A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de3565cfd3393000dd87ca545f95ff84d4c1446","datavalue":{"value":"68W10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829231$81D9CD15-BE62-4684-B480-2AF32EBD8E3A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b65efe51b183d0f4a672427b8171cd1e14211cba","datavalue":{"value":"68W15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829231$8C23B01E-5941-4235-B694-D9C3E94763A6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d02f58e405ec63d3d163cac136b87113c608a829","datavalue":{"value":"6451601","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829231$83D03003-038A-4221-A1E3-54ED46E92182","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0b36d924addd0d2f364b26835d91730b673a9f92","datavalue":{"value":"distributed computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829231$2908A9F9-7752-44C5-9855-CD261CAC0F85","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0e6d19c4155a5e9454190aac64bd84b58512563f","datavalue":{"value":"lockfree algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829231$3179015F-3470-43E0-83CD-BE0519773A27","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"82ca9731b8bcc52a986538b6239b20722b2057a0","datavalue":{"value":"progress properties","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829231$671A7750-B36E-47AD-B8D0-DDED63844C06","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1db42c1b6352ba17f7878a78c1d9383f5c04835c","datavalue":{"value":"schedulers","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829231$31499536-9429-4A08-9BE8-B4EF3D7C8ECF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d0beb0dd62e616b9d74dedf917295173f10e62d8","datavalue":{"value":"shared memory","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829231$B5050DD1-9B68-4896-A292-39BB2590D2CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"efa9a6859e9068693c3d5e36ce751c48908c47e6","datavalue":{"value":"wait-free algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829231$1990AF93-0FB1-483D-B7C2-53A2957279E4","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":"Q6829231$4FF49D39-EA7F-4FFC-B45F-4ACE6AF4C694","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Are lock-free concurrent algorithms practically wait-free?","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Are_lock-free_concurrent_algorithms_practically_wait-free%3F"}}}}}