{"entities":{"Q7329226":{"pageid":31383901,"ns":120,"title":"Item:Q7329226","lastrevid":107837525,"modified":"2026-10-27T12:45:56Z","type":"item","id":"Q7329226","labels":{"en":{"language":"en","value":"On the Complexity of Counting Orderings in Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"beea17b17b8d1b5a9f9834b620089ca44509579a","datavalue":{"value":"cs.CC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7329226$35F9023F-0AF7-4AE8-A8F5-E1C8FAA86890","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":"Q7329226$5C1007C7-2CB3-46E7-8CC1-08806D328403","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"699cf52ebb95f6164b8e77de39f57326087cb4a0","datavalue":{"value":"2606.29157","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7329226$6325610F-7875-4D13-BF73-54962ECE9E87","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b19127915fe313f3fb2782293499f36084f2ce89","datavalue":{"value":{"entity-type":"item","numeric-id":309907,"id":"Q309907"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329226$932E70FC-E9CE-4A8B-8F08-991CA0C48D66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bc866eb5f4f6a172d6eb873d1a8d752b629d60c0","datavalue":{"value":{"entity-type":"item","numeric-id":7329225,"id":"Q7329225"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329226$B1244274-0E4F-4A53-A7DE-962FEE32DB70","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a3d305b28db5d4e01d452b9fa54b208b8d3ed3fb","datavalue":{"value":{"entity-type":"item","numeric-id":6424198,"id":"Q6424198"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329226$7FDCCCA4-2BF4-4252-91C3-D20A60BD31FF","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":"Q7329226$2B7720EA-ACE7-43C0-B854-7BFFD70553B8","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":"Q7329226$21E3BF91-DB72-47BE-A9E2-EC1652A6AF28","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the Complexity of Counting Orderings in Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_Complexity_of_Counting_Orderings_in_Graphs"}}}}}