{"batchcomplete":"","continue":{"facontinue":"2018-existential-rules.pdf|20181211134418|198","continue":"-||"},"query":{"filearchive":[{"id":76,"name":"01-introduction_handout.pdf","ns":6,"title":"Datei:01-introduction handout.pdf","timestamp":"2016-03-23T10:56:33Z"},{"id":75,"name":"01-introduction_handout.pdf","ns":6,"title":"Datei:01-introduction handout.pdf","timestamp":"2016-04-08T13:00:37Z"},{"id":66,"name":"02-approximation-complexity.pdf","ns":6,"title":"Datei:02-approximation-complexity.pdf","timestamp":"2016-05-10T11:48:35Z"},{"id":61,"name":"03-interactive-protocols.pdf","ns":6,"title":"Datei:03-interactive-protocols.pdf","timestamp":"2016-06-27T14:36:17Z"},{"id":60,"name":"03-interactive-protocols.pdf","ns":6,"title":"Datei:03-interactive-protocols.pdf","timestamp":"2016-06-27T14:39:50Z"},{"id":59,"name":"04-counting-complexity.pdf","ns":6,"title":"Datei:04-counting-complexity.pdf","timestamp":"2016-07-11T15:07:40Z"},{"id":153,"name":"0x01ff778f.asc","ns":6,"title":"Datei:0x01ff778f.asc","timestamp":"2015-07-13T08:11:17Z"},{"id":190,"name":"2018-amsterdam-shortened.pdf","ns":6,"title":"Datei:2018-amsterdam-shortened.pdf","timestamp":"2018-10-01T09:43:14Z"},{"id":191,"name":"2018-amsterdam-shortened.pdf","ns":6,"title":"Datei:2018-amsterdam-shortened.pdf","timestamp":"2018-10-01T13:18:57Z"},{"id":201,"name":"2018-dl-digg-fresh-handout.pdf","ns":6,"title":"Datei:2018-dl-digg-fresh-handout.pdf","timestamp":"2018-12-13T08:18:04Z"}]}}