{"entities":{"Q6521716":{"pageid":14100678,"ns":120,"title":"Item:Q6521716","lastrevid":103492340,"modified":"2026-06-06T07:29:10Z","type":"item","id":"Q6521716","labels":{"en":{"language":"en","value":"An approximation algorithm for zero forcing"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q6521716$17B5079D-73ED-4AA6-B4D5-6BC871907F5C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2b14eec3c23bb0fcd1328bf4a4f160ce9ba2462f","datavalue":{"value":{"text":"An approximation algorithm for zero forcing","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6521716$2C5B108A-EB02-4D58-81FB-967BF60526EE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5bc35ef63fa8037abf98cd3417dfb905eb27dbe","datavalue":{"value":{"entity-type":"item","numeric-id":831868,"id":"Q831868"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6521716$3C943B0D-7A30-471E-8044-28324DAC7311","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9d78501335861375842f274f1c1e5006caa3d42c","datavalue":{"value":{"entity-type":"item","numeric-id":1344238,"id":"Q1344238"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6521716$7B9B75F3-4C3B-4C6D-9796-A1F24F7253F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fe33a0908bcf6be7afb52221d73c8f84f5541db3","datavalue":{"value":{"entity-type":"item","numeric-id":6521715,"id":"Q6521715"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6521716$C5901F5B-3A7B-4D9F-90F6-F4802CDE1D0A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4d0fe72873c830ea4d771f969d4b68fd03805e5e","datavalue":{"value":{"entity-type":"item","numeric-id":655572,"id":"Q655572"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6521716$221C3B7F-B4C5-4D2C-B8E5-ECF51558F4F1","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":"Q6521716$569DC459-C73E-466E-8522-7B89AE23EC24","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"e86250568a34e3733e1a572a7efc28d9acecc3ca","datavalue":{"value":"2402.08866","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6521716$BAF42F03-0F1D-4BC9-A85F-4A8E03D58448","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"6156f71e4171430349a748bb220cc965cc491c24","datavalue":{"value":"https://github.com/owenzzy/cjmz_zf","type":"string"},"datatype":"url"},"type":"statement","id":"Q6521716$E8EBAE5C-EB03-40B0-BC33-C475C8590803","rank":"normal","references":[{"hash":"fcafd1f87305a600032bda03469070e0b093b035","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"30d559de72cc0c9c1ce89221e32d8c5fa802198d","datavalue":{"value":"https://paperswithcode.com/paper/an-approximation-algorithm-for-zero-forcing","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"An approximation algorithm for zero forcing (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_approximation_algorithm_for_zero_forcing_(scientific_article_from_arXiv)"}}}}}