{"entities":{"Q7208730":{"pageid":22266635,"ns":120,"title":"Item:Q7208730","lastrevid":107586914,"modified":"2026-10-27T10:55:30Z","type":"item","id":"Q7208730","labels":{"en":{"language":"en","value":"A Tight Lower bound on Trees in Graphs"}},"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":"Q7208730$7080C079-BC08-40B8-990C-F3F5A7B5D207","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-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":"Q7208730$7A65AA05-F9EE-4615-84CF-1082C465573B","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"0dae90541d8da7ffcf4327e07c4045d41af62d6b","datavalue":{"value":"2512.14890","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7208730$62BB25BE-1315-4AC4-81E6-EB279F38B00E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cb9b082885b745059e64623ad22a9dc0e8a6ecec","datavalue":{"value":{"entity-type":"item","numeric-id":6857766,"id":"Q6857766"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7208730$505962B5-8A16-4AB2-AC6B-052C114E9048","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":"Q7208730$56E90E57-A3FF-47B9-9314-DA1AD461A18C","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":"Q7208730$F7A7D69B-1D26-475E-BB72-17CD4D3AF95E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Tight Lower bound on Trees in Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Tight_Lower_bound_on_Trees_in_Graphs"}}}}}