{"entities":{"Q7365250":{"pageid":31540316,"ns":120,"title":"Item:Q7365250","lastrevid":108026174,"modified":"2026-10-27T14:27:51Z","type":"item","id":"Q7365250","labels":{"en":{"language":"en","value":"Discounted Hitting Domination on Graphs with Submodularity, Complexity and Exact Algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7365250$DD9DAAE9-55F5-46E0-AB01-74B06808286E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7365250$1327C56B-566F-4D96-8097-EB21E5AEB922","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"6493c47b4c85e8d3835854b8af04c77c7ce91a53","datavalue":{"value":"2609.31535","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7365250$071FF1F3-AD03-4565-B2C8-8D6724DF015F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"726fe4735fddefb4bc0c380f21d702a983072c01","datavalue":{"value":{"entity-type":"item","numeric-id":5225031,"id":"Q5225031"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7365250$04FDBD90-EDBE-4E83-8AA4-FADFF81E7B30","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"cd9083243201477818eba3e2050675e9a86f6450","datavalue":{"value":{"entity-type":"item","numeric-id":6854640,"id":"Q6854640"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7365250$BA12F755-B9AD-4CF3-A638-7DFE87E05219","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3d0ae6f498dcc70be463295fa2ebccc4f06a430e","datavalue":{"value":{"entity-type":"item","numeric-id":386339,"id":"Q386339"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7365250$5330F113-75B1-4335-B51D-9E8FAF295477","rank":"normal"}],"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":"Q7365250$A4407FC0-18F8-4545-986C-0D8E845681CE","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":"Q7365250$ED44E16F-ECF6-481D-91BE-8A090FAB84CB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Discounted Hitting Domination on Graphs with Submodularity, Complexity and Exact Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Discounted_Hitting_Domination_on_Graphs_with_Submodularity,_Complexity_and_Exact_Algorithms"}}}}}