{"entities":{"Q7244686":{"pageid":24564578,"ns":120,"title":"Item:Q7244686","lastrevid":107737358,"modified":"2026-10-27T12:02:17Z","type":"item","id":"Q7244686","labels":{"en":{"language":"en","value":"Finite combinatorics and computability theory"}},"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":"Q7244686$F4CC64AE-2737-46ED-BE1F-A1D2341635E8","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":"Q7244686$69B46305-8AC4-4D42-A3F3-872BF15AD621","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"f86dc70b4f89bb6e6ce7d4ed9c14d3c58cf17ba6","datavalue":{"value":"2604.18290","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7244686$CDB587C6-6B02-46EF-840F-78FF3F0B8749","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"df47b160552dc894c1aa471ca705195c5906bca7","datavalue":{"value":{"entity-type":"item","numeric-id":375887,"id":"Q375887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7244686$05C16089-2656-4E38-9F46-A65BAD4BF737","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fa2490f91cd745d6b9e71812c9fda5aa0e502878","datavalue":{"value":{"entity-type":"item","numeric-id":1987212,"id":"Q1987212"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7244686$8F9EC662-77CA-4AB5-9BBE-0827392887DC","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":"Q7244686$177D4EE8-B7F2-4714-A6B1-1D93606ABE72","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":"Q7244686$9E5220CF-DD1E-4B16-ACA0-980FFA2F818C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Finite combinatorics and computability theory","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Finite_combinatorics_and_computability_theory"}}}}}