{"entities":{"Q7339607":{"pageid":31420978,"ns":120,"title":"Item:Q7339607","lastrevid":107924621,"modified":"2026-10-27T13:40:57Z","type":"item","id":"Q7339607","labels":{"en":{"language":"en","value":"A polynomial time algorithm for almost bounded denumerant"}},"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":"Q7339607$63549073-FDEF-4601-A65B-514462D541AA","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":"Q7339607$02BE4CFF-8CB3-4628-BFA9-F5458E99E3A0","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"0fefa7c9b4e4c8cdfb18b96afb99e5c5aba831d4","datavalue":{"value":"2608.14985","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7339607$42A6FB28-CD63-4398-A458-6D4CE9D3B3AF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d845b9a0574525c43349d79f9c7962bf5585bdf1","datavalue":{"value":{"entity-type":"item","numeric-id":344451,"id":"Q344451"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7339607$459BBC16-72CF-4234-A612-11EAFB1FCCFF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4d21395427b87b27f5c7e3fd8099e66a561dc332","datavalue":{"value":{"entity-type":"item","numeric-id":6939594,"id":"Q6939594"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7339607$BD06B5FE-D158-48FE-9587-D2FAC578E5A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"96f6964e9ab9587d6b01cd09a13ed4df29ddb09b","datavalue":{"value":{"entity-type":"item","numeric-id":2139083,"id":"Q2139083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7339607$7E818C97-6FAB-4D67-92FF-C5D00A416E78","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":"Q7339607$CADBC09C-A62F-4097-A5A1-ADB6898A9F85","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":"Q7339607$0F3C09E0-CFDD-4503-A200-4D65D81ECD93","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A polynomial time algorithm for almost bounded denumerant","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_polynomial_time_algorithm_for_almost_bounded_denumerant"}}}}}