{"entities":{"Q7447598":{"pageid":32974418,"ns":120,"title":"Item:Q7447598","lastrevid":110356394,"modified":"2026-11-16T15:43:46Z","type":"item","id":"Q7447598","labels":{"en":{"language":"en","value":"A matroid characterization of the combinatorially symmetric maximum nullity of a graph"}},"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":"Q7447598$D7359E0F-C61A-470A-9980-1EEDE4B13727","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":"Q7447598$C8834275-5DAD-4C73-B24A-20BA9734D3AC","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7447598$E545EC36-3D5F-41BD-A3BC-D36B60E3F02D","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":"Q7447598$6E001031-1890-448B-9991-B30169BC5362","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"3e35614050d4059b585f6a7e17934e2b30a7f091","datavalue":{"value":"2611.01102","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7447598$6FB4025A-6393-4E55-BD2F-92EF933C9A01","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"eb856ee1753a19e373213276b01272e7b1aec949","datavalue":{"value":{"entity-type":"item","numeric-id":244878,"id":"Q244878"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7447598$315FAF12-3B3C-4143-9994-91FBEEFE6BCA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"52a14645da6b124bf67c70393e279bc30d53371f","datavalue":{"value":{"entity-type":"item","numeric-id":734337,"id":"Q734337"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7447598$EDD259C5-4ED6-42F8-8114-8B7327A42372","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"dd877e783c134afba9c4716953fec4b5cfd744ce","datavalue":{"value":{"entity-type":"item","numeric-id":304531,"id":"Q304531"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7447598$69A71EA6-B6F2-4532-9406-F688DB0A2066","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9de9065babc5e558fcfdf18a2172bf0f20c15cda","datavalue":{"value":{"entity-type":"item","numeric-id":551286,"id":"Q551286"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7447598$E506E9D1-99FA-4A8A-8D60-8E4FBC42D28D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A matroid characterization of the combinatorially symmetric maximum nullity of a graph","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_matroid_characterization_of_the_combinatorially_symmetric_maximum_nullity_of_a_graph"}}}}}