{"entities":{"Q7215558":{"pageid":22290623,"ns":120,"title":"Item:Q7215558","lastrevid":107637797,"modified":"2026-10-27T11:18:01Z","type":"item","id":"Q7215558","labels":{"en":{"language":"en","value":"Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds"}},"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":"Q7215558$E83F903E-1E90-467F-9619-EBC5E6CA945E","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":"Q7215558$EB8E3B87-FB30-4611-95D5-5AAC0B6D1FAB","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"181495ae24e0ec6ddb2e05177dbcaa794c7e93d6","datavalue":{"value":"2602.00657","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7215558$D091A44B-DA2A-447B-BD12-030EC44A4500","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"42e8adfd724f238e68c8384cce70f5fd11860ed9","datavalue":{"value":{"entity-type":"item","numeric-id":779175,"id":"Q779175"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7215558$4EB4BC6E-48F0-4208-8B1A-DAF2270E9712","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c8490279eab6fb235f4d12ad39a41cd0b4a189d8","datavalue":{"value":{"entity-type":"item","numeric-id":6072290,"id":"Q6072290"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7215558$61F0F96D-F096-4590-B5E5-08B0B1713F66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d0283b7eb1d89d8f463bca5e79ada4538ef5293c","datavalue":{"value":{"entity-type":"item","numeric-id":1748986,"id":"Q1748986"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7215558$7D34DA1F-A381-43CE-A9A1-E19D61C5A8FE","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":"Q7215558$A9D68A5C-1116-44E4-9074-5B298059114C","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":"Q7215558$B6E9C644-E9A6-4970-8FF4-8C04935824DA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Non-Clashing_Teaching_in_Graphs:_Algorithms,_Complexity,_and_Bounds"}}}}}