{"batchcomplete":"","continue":{"rccontinue":"20261012074207|69032","continue":"-||"},"query":{"recentchanges":[{"type":"edit","ns":0,"title":"Inproceedings3484","pageid":17398,"revid":45227,"old_revid":45226,"rcid":69042,"timestamp":"2026-10-13T09:41:35Z"},{"type":"edit","ns":0,"title":"Inproceedings3484","pageid":17398,"revid":45226,"old_revid":45190,"rcid":69041,"timestamp":"2026-10-13T09:33:47Z"},{"type":"log","ns":6,"title":"Datei:Ruleml26-eflp.pdf","pageid":17413,"revid":45225,"old_revid":0,"rcid":69040,"timestamp":"2026-10-13T09:33:42Z"},{"type":"log","ns":6,"title":"Datei:KG2026-Lecture-01-print.pdf","pageid":17408,"revid":45224,"old_revid":0,"rcid":69039,"timestamp":"2026-10-13T09:09:30Z"},{"type":"log","ns":6,"title":"Datei:KG2026-Lecture-01-overlay.pdf","pageid":17407,"revid":45223,"old_revid":0,"rcid":69038,"timestamp":"2026-10-13T09:09:21Z"},{"type":"new","ns":0,"title":"Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High","pageid":17411,"revid":45221,"old_revid":0,"rcid":69037,"timestamp":"2026-10-13T08:58:47Z"},{"type":"new","ns":0,"title":"A Guided Tour of Sequent Formalisms for Modal Logics","pageid":17409,"revid":45219,"old_revid":0,"rcid":69036,"timestamp":"2026-10-12T14:39:47Z"},{"type":"edit","ns":0,"title":"Knowledge Graphs (WS2026)","pageid":17359,"revid":45218,"old_revid":45172,"rcid":69035,"timestamp":"2026-10-12T08:05:15Z"},{"type":"log","ns":6,"title":"Datei:KG2026-Lecture-01-print.pdf","pageid":17408,"revid":45217,"old_revid":0,"rcid":69034,"timestamp":"2026-10-12T08:05:11Z"},{"type":"log","ns":6,"title":"Datei:KG2026-Lecture-01-overlay.pdf","pageid":17407,"revid":45216,"old_revid":0,"rcid":69033,"timestamp":"2026-10-12T08:05:03Z"}]}}