{"entities":{"Q7125824":{"pageid":21992118,"ns":120,"title":"Item:Q7125824","lastrevid":106895009,"modified":"2026-10-23T08:51:37Z","type":"item","id":"Q7125824","labels":{"en":{"language":"en","value":"An O(n) time algorithm for finding Hamilton cycles with high probability"}},"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":"Q7125824$80FF0D2D-41E2-441A-877F-EB27C8B7420B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"15b8c83b98b5e742706b93d4f05f24acb70b28a2","datavalue":{"value":{"time":"+2020-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":"Q7125824$FF404E01-5C11-47EA-9173-C666572238FE","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"ab55913e28c1345d702f9ddf142ae5dfbd96a88c","datavalue":{"value":"2012.02551","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7125824$60917AC2-9BE2-4176-BE78-79AAFE5CF4C8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e6198021e05f1f6cd4ded3ddf48dc9b0b86db1e","datavalue":{"value":{"entity-type":"item","numeric-id":322225,"id":"Q322225"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7125824$D167D837-9396-467D-9DAA-EE26033E01AE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8a7b1b74b045e21f161107ae2d1ec32cd3fa125c","datavalue":{"value":{"entity-type":"item","numeric-id":173496,"id":"Q173496"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7125824$C746E37D-ACFC-420A-9D25-4BDE4302657F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3a38f28a779329429d300ab44294e5c059e36281","datavalue":{"value":{"entity-type":"item","numeric-id":322238,"id":"Q322238"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7125824$417463E1-705A-4D42-B250-11BEB60A4824","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":"Q7125824$8D80D926-B647-4D34-B70F-301022C2A014","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":"Q7125824$0FC8C95C-F641-4325-8566-5D0070FC94A4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An O(n) time algorithm for finding Hamilton cycles with high probability","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_O(n)_time_algorithm_for_finding_Hamilton_cycles_with_high_probability"}}}}}