{"entities":{"Q3123118":{"pageid":3133834,"ns":120,"title":"Item:Q3123118","lastrevid":85844771,"modified":"2026-06-03T11:59:20Z","type":"item","id":"Q3123118","labels":{"en":{"language":"en","value":"Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 987640"}},"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":"Q3123118$0296DB12-417B-4294-A90B-DBCE5403AB0D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"955693fd222f378ba6327eb7fc631b11c35e8ba9","datavalue":{"value":"0881.05116","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$E22C4CEE-A735-4A33-9A17-1FFDA021BCB4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8aca970a50a53816b96310c70ede9dcbcb5bfbc5","datavalue":{"value":{"entity-type":"item","numeric-id":232455,"id":"Q232455"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3123118$B26BFBD5-BB3B-4867-AB15-FC96FE5450A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ee31696a3be6df3bdd79f474603a4526c11abc4","datavalue":{"value":{"entity-type":"item","numeric-id":1577015,"id":"Q1577015"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3123118$44DC4A32-4247-42F5-9B55-84F69D702DDB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8bb21a1c0989eb39ea024bc553a264711f2dc5f4","datavalue":{"value":{"time":"+1997-03-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q3123118$9927D8C1-2B87-4BB1-B7D9-C0F648643F6F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$5BBB0897-FCF0-4952-AB18-97749E8115C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4dd6b8847e09c706889ad9ef05dc0040f1c9f982","datavalue":{"value":"05C80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$AF77A960-C80A-4181-BB8F-A8E75E1152F0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a09872c507729d29e1c1613e820db567c4517089","datavalue":{"value":"05C65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$B91549C6-CB9D-439E-9752-7831002E8A8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$FDB6C3E0-5F5C-403F-851D-280FDDBFCF79","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"42e731a917e8a0b0ca2ae58227a2d1ae87f6a965","datavalue":{"value":"987640","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$2131874E-5C4F-41A2-9CB4-B231A190A9B4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5ad22613fc54c36c8248580a6c672588e112aab2","datavalue":{"value":"random hypergraph","type":"string"},"datatype":"string"},"type":"statement","id":"Q3123118$40E8B26C-0257-4D1A-99DD-FB177ED41CD6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0967c5f93d36d6aa18ee008d77ee288965d952b9","datavalue":{"value":"parallel algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q3123118$2AB27E99-628E-4BF5-B8F9-4FB5EFD76892","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7ae5cad662cee9457a0e88de5ca640ccabb9ba00","datavalue":{"value":"maximal independent set","type":"string"},"datatype":"string"},"type":"statement","id":"Q3123118$F866435B-7C6F-4460-9613-5D3C0B30CFEB","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":"Q3123118$D2464966-E7EB-426B-880D-CE4D782EF523","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"1a5e85b797b1f40fcf57c739eefefe104551d5bc","datavalue":{"value":"W2073539635","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$DCA5F124-3C55-4C82-8934-8BA0B60CAB66","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"920a8c2edc2b865997916bdf4ca69c6b9a67cc23","datavalue":{"value":{"text":"Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3123118$FC606680-30A0-4FF5-A16E-37B80791A0AC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e7ae67e2bd55255bab7fa034e32b50626d4e3f42","datavalue":{"value":"10.1002/(SICI)1098-2418(199612)9:4%3C359::AID-RSA2%3E3.0.CO;2-W","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3123118$985ED6AD-1A4D-45D2-A535-33597B4D5E98","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"460d1cdbb6129f6cff15510687bb8495064a6d6e","datavalue":{"value":"https://doi.org/10.1002/(sici)1098-2418(199612)9:4%3C359::aid-rsa2%3E3.0.co;2-w","type":"string"},"datatype":"url"},"type":"statement","id":"Q3123118$37602036-66F0-4900-BA5B-6C9BE5A307DD","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"07d7b118f802499ab13a26b14a0a0ce866afee25","datavalue":{"value":{"entity-type":"item","numeric-id":3489456,"id":"Q3489456"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"80376abc7ded9904a3107381a248fd779780f324","datavalue":{"value":{"amount":"+0.8773287534713745","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3123118$291146F4-551F-40D9-958F-F04A4649005F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"97f59923532301f4b525e2ff1dbf9b22b488ae2c","datavalue":{"value":{"entity-type":"item","numeric-id":3990223,"id":"Q3990223"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e104290a6ece70ece6731cb329635430ef62ec02","datavalue":{"value":{"amount":"+0.8662595152854919","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3123118$D4D80138-DA71-4C96-829F-1C54E3A12C95","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0ece252943494c02f3a371f6943ed81e32f10e5e","datavalue":{"value":{"entity-type":"item","numeric-id":1318767,"id":"Q1318767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"022fe0737ce1da41d5457da69959ed0e5839bb90","datavalue":{"value":{"amount":"+0.860525906085968","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3123118$A8550F7B-012B-4EE0-9392-00C0BA73A5E1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph","badges":[]}}}}}