{"entities":{"Q7329273":{"pageid":31384063,"ns":120,"title":"Item:Q7329273","lastrevid":107837843,"modified":"2026-10-27T12:46:04Z","type":"item","id":"Q7329273","labels":{"en":{"language":"en","value":"An FPT algorithm for cycle rank on semi-complete digraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q7329273$4C5A1CB3-72AE-49FD-8D9E-31B98F059D50","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":"Q7329273$7340E9F3-E761-4129-A3BC-92B1A9A16B01","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"75e750e4edb7093fa56879bb5d816704852f4f8f","datavalue":{"value":"2606.29336","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7329273$36D3D550-10C5-41DC-A3D3-A1435B04CA9A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ef3c0f89b55b34a18f02d728addcaff137c1b0f2","datavalue":{"value":{"entity-type":"item","numeric-id":7198699,"id":"Q7198699"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329273$178F4E8C-3EA5-4146-8C90-910800034C96","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0b36f88e252df7c6b3ae8e0cb3a110ef1cddd520","datavalue":{"value":{"entity-type":"item","numeric-id":6046944,"id":"Q6046944"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329273$E31E21D0-2554-48BF-8783-5D1807DDA0AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9ebf8eff473b66f909fa51528c26b56c22239cf3","datavalue":{"value":{"entity-type":"item","numeric-id":785794,"id":"Q785794"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329273$94D07CB0-7B08-4E13-BF4C-171ED005F783","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":"Q7329273$6F1FBD7B-130A-4FF1-983F-F057796825D9","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":"Q7329273$D4895852-B11F-4D77-998A-0AEAA7E4D7E9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An FPT algorithm for cycle rank on semi-complete digraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_FPT_algorithm_for_cycle_rank_on_semi-complete_digraphs"}}}}}