{"entities":{"Q1613675":{"pageid":1624415,"ns":120,"title":"Item:Q1613675","lastrevid":43246885,"modified":"2025-07-22T18:50:44Z","type":"item","id":"Q1613675","labels":{"en":{"language":"en","value":"Automata, languages and programming. 29th international colloquium, ICALP 2002, M\u00e1laga, Spain, July 8--13, 2002. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1793867"}},"aliases":{},"claims":{"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":"Q1613675$DE7D0B70-8680-4506-B8D0-7B136185F1A1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8a100ccd59fd9a3c9996472e2312e038427a42f0","datavalue":{"value":{"text":"Automata, languages and programming. 29th international colloquium, ICALP 2002, M\u00e1laga, Spain, July 8--13, 2002. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1613675$FB701734-13F8-4CD0-819F-575B3CBC4216","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f02f6c63d2097b11bf47c29a0ce0bb3d70fe741b","datavalue":{"value":"0993.00041","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613675$EDE80D34-8D6D-43FE-9416-40BF851E9163","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1613675$92C2CC80-FBB4-4BB7-B173-3AD88FF0FC58","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"53fcb96a7cb4f5e8cbd012770cf049a4dffd75df","datavalue":{"value":{"time":"+2002-09-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1613675$C7396BE9-5E1C-4894-AE39-D27CDDF417F7","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"0330ad4bd659e4dd138f9ada5d9390ff50a5538d","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding colloquium (28th, 2001) has been reviewed (see Zbl 0967.00069).  Indexed articles:  \\textit{Reif, John H.}, Molecular assembly and computation: From theory to experimental demonstrations, 1-21 [Zbl 1056.68544]  \\textit{Marathe, Madhav V.}, Towards a predictive computational complexity theory, 22-31 [Zbl 1056.68546]  \\textit{Pitts, Andrew M.}, Equivariant syntax and semantics, 32-36 [Zbl 1056.68508]  \\textit{S\u00e9nizergues, G\u00e9raud}, \\(L(A) \\)=\\( L(B)\\)? decidability results from complete formal systems, 37 [Zbl 1056.68548]  \\textit{Del Lungo, Alberto; Frosini, Andrea; Nivat, Maurice; Vuillon, Laurent}, Discrete tomography: Reconstruction under periodicity constraints, 38-56 [Zbl 1056.68592]  \\textit{Mannila, Heikki}, Local and global methods in data mining: Basic techniques and open problems, 57-68 [Zbl 1056.68516]  \\textit{Hermenegildo, M.; Puebla, G.; Bueno, F.; L\u00f3pez-Garc\u00eda, P.}, Program debugging and validation using semantic approximations and partial specifications, 69-72 [Zbl 1056.68509]  \\textit{Engebretsen, Lars; Holmerin, Jonas; Russell, Alexander}, Inapproximability results for equations over finite groups, 73-84 [Zbl 1056.68545]  \\textit{Pettie, Seth}, A faster all-pairs shortest path algorithm for real-weighted sparse graphs, 85-97 [Zbl 1056.68111]  \\textit{Colcombet, Thomas}, On families of graphs having a decidable first order theory with reachability, 98-109 [Zbl 1056.68107]  \\textit{Fabrikant, Alex; Koutsoupias, Elias; Papadimitriou, Christos H.}, Heuristically optimized trade-offs: A new paradigm for power laws in the internet, 110-122 [Zbl 1056.68503]  \\textit{Fotakis, Dimitris; Kontogiannis, Spyros; Koutsoupias, Elias; Mavronicolas, Marios; Spirakis, Paul}, The structure and complexity of Nash equilibria for a selfish routing game, 123-134 [Zbl 1056.68028]  \\textit{Khanna, Sanjeev; Naor, Joseph (Seffi); Raz, Dan}, Control message aggregation in group communication protocols, 135-146 [Zbl 1056.68506]  \\textit{Jurdzi\u0144ski, Tomasz; Lorys, Krzysztof}, Church-Rosser languages vs. UCFL., 147-158 [Zbl 1056.68095]  \\textit{Bala, Sebastian}, Intersection of regular languages and star hierarchy, 159-169 [Zbl 1056.68093]  \\textit{Lombardy, Sylvain}, On the construction of reversible automata for reversible languages, 170-182 [Zbl 1056.68097]  \\textit{Elmasry, Amr}, Priority queues, pairing, and adaptive sorting, 183-194 [Zbl 1056.68515]  \\textit{Bender, Michael A.; Cole, Richard; Raman, Rajeev}, Exponential structures for efficient cache-oblivious algorithms, 195-207 [Zbl 1056.68511]  \\textit{Impagliazzo, Russell; Segerlind, Nathan}, Bounded-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations (extended abstract)., 208-219 [Zbl 1056.03504]  \\textit{Esteban, Juan Luis; Galesi, Nicola; Messner, Jochen}, On the complexity of resolution with bounded conjunctions (extended abstract)., 220-231 [Zbl 1056.03503]  \\textit{Kiayias, Aggelos; Yung, Moti}, Cryptographic hardness based on the decoding of Reed-Solomon codes, 232-243 [Zbl 1062.94039]  \\textit{Ishai, Yuval; Kushilevitz, Eyal}, Perfect constant-round secure computation via perfect randomizing polynomials, 244-256 [Zbl 1056.68088]  \\textit{Grigoriev, Dima; Hirsch, Edward A.; Pasechnik, Dmitrii V.}, Exponential lower bound for static semi-algebraic proofs, 257-268 [Zbl 1056.03037]  \\textit{Jakoby, Andreas; Liskiewicz, Maciej}, Paths problems in symmetric logarithmic space, 269-280 [Zbl 1056.68108]  \\textit{Damaschke, Peter}, Scheduling search procedures, 281-292 [Zbl 1056.68507]  \\textit{Iwama, Kazuo; Taketomi, Shiro}, Removable online knapsack problems, 293-305 [Zbl 1056.68588]  \\textit{Epstein, Leah; Seiden, Steve; van Stee, Rob}, New bounds for variable-sized and resource augmented online bin packing, 306-317 [Zbl 1056.68586]  \\textit{Ollinger, Nicolas}, The quest for small universal cellular automata, 318-329 [Zbl 1056.68104]  \\textit{Papazian, Christophe; R\u00e9mila, Eric}, Hyperbolic recognition by graph automata, 330-342 [Zbl 1056.68098]  \\textit{Ablayev, Farid; Moore, Cristopher; Pollett, Christopher}, Quantum and stochastic branching programs of bounded width (Track A)., 343-354 [Zbl 1056.68085]  \\textit{Gargano, Luisa; Hell, Pavol; Stacho, Ladislav; Vaccaro, Ugo}, Spanning trees with bounded number of branch vertices, 355-365 [Zbl 1056.68587]  \\textit{Beier, Ren\u00e9; Sanders, Peter; Sivadasan, Naveen}, Energy optimal routing in radio networks using geometric data structures, 366-376 [Zbl 1056.68501]  \\textit{Christersson, Malin; Gasieniec, Leszek; Lingas, Andrzej}, Gossiping with bounded size messages in ad hoc radio networks (extended abstract)., 377-389 [Zbl 1056.68502]  \\textit{Merkle, Wolfgang}, The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences, 390-400 [Zbl 1056.68090]  \\textit{Hearn, Robert A.; Demaine, Erik D.}, The nondeterministic constraint logic model of computation: Reductions and applications, 401-413 [Zbl 1056.68086]  \\textit{Dalmau, V\u00edctor}, Constraint satisfaction problems in non-deterministic logarithmic space, 414-425 [Zbl 1056.68130]  \\textit{Brodal, Gerth St\u00f8lting; Fagerberg, Rolf}, Cache oblivious distribution sweeping, 426-438 [Zbl 1056.68543]  \\textit{\u00d6stlin, Anna; Pagh, Rasmus}, One-probe search, 439-450 [Zbl 1056.68514]  \\textit{Charikar, Moses; Indyk, Piotr; Panigrahy, Rina}, New algorithms for subset query, partial match, orthogonal range searching, and related problems, 451-462 [Zbl 1056.68512]  \\textit{Martin, Keye; Mislove, Michael; Worrell, James}, Measuring the probabilistic powerdomain, 463-475 [Zbl 1056.68100]  \\textit{Ong, C.-H. L.; Di Gianantonio, P.}, Games characterizing Levy-Longo trees., 476-487 [Zbl 1056.68101]  \\textit{Bauer, Andrej; Escard\u00f3, Mart\u00edn H\u00f6tzel; Simpson, Alex}, Comparing functional paradigms for exact real-number computation, 488-500 [Zbl 1056.68057]  \\textit{Duchon, Philippe; Flajolet, Philippe; Louchard, Guy; Schaeffer, Gilles}, Random sampling from Boltzmann principles (extended abstract)., 501-513 [Zbl 1056.68549]  \\textit{Duch, Amalia; Mart\u00ednez, Conrado}, On the average performance of orthogonal range search in multidimensional data structures, 514-524 [Zbl 1056.68513]  \\textit{Kick, Marco}, Bialgebraic modelling of timed processes, 525-536 [Zbl 1056.68105]  \\textit{van Breugel, Franck; Shalit, Steven; Worrell, James}, Testing labelled Markov processes, 537-548 [Zbl 1057.68074]  \\textit{Hitchcock, John M.; Lutz, Jack H.}, Why computational complexity requires stricter martingales, 549-560 [Zbl 1057.68039]  \\textit{Hitchcock, John M.}, Correspondence principles for effective dimensions, 561-571 [Zbl 1057.68038]  \\textit{Meseguer, Jos\u00e9; Rosu, Grigore}, A total approach to partial algebraic specification, 572-584 [Zbl 1057.68064]  \\textit{Lohrey, Markus; D'Argenio, Pedro R.; Hermanns, Holger}, Axiomatising divergence, 585-596 [Zbl 1057.68069]  \\textit{Cardelli, Luca; Gardner, Philippa; Ghelli, Giorgio}, A spatial logic for querying graphs, 597-610 [Zbl 1057.68606]  \\textit{Radzik, Tomasz}, Improving time bounds on maximum generalised flow computations by contracting the network, 611-622 [Zbl 1057.90501]  \\textit{Berman, Piotr; Karpinski, Marek}, Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION, 623-632 [Zbl 1057.68646]  \\textit{Demetrescu, Camil; Italiano, Giuseppe F.}, Improved bounds and new trade-offs for dynamic all pairs shortest paths, 633-643 [Zbl 1057.68648]  \\textit{Henzinger, Thomas A.; Krishnan, Sriram C.; Kupferman, Orna; Mang, Freddy Y. C.}, Synthesis of uninitialized systems, 644-656 [Zbl 1057.68060]  \\textit{Genest, Blaise; Muscholl, Anca; Seidl, Helmut; Zeitoun, Marc}, Infinite-state high-level MSCs: Model-checking and realizability (extended abstract), 657-668 [Zbl 1057.68625]  \\textit{Wich, Klaus}, Universal inherence of cycle-free context-free ambiguity functions, 669-680 [Zbl 1057.68053]  \\textit{Guha, Sudipto; Indyk, Piotr; Muthukrishnan, S.; Strauss, Martin J.}, Histogramming data streams with fast per-item processing, 681-692 [Zbl 1064.94515]  \\textit{Charikar, Moses; Chen, Kevin; Farach-Colton, Martin}, Finding frequent items in data streams, 693-703 [Zbl 1057.68600]  \\textit{Cachat, Thierry}, Symbolic strategy synthesis for games on pushdown graphs, 704-715 [Zbl 1057.68046]  \\textit{Srba, Ji\u0159\u00ed}, Strong bisimilarity and regularity of basic process algebra is PSPACE-hard, 716-727 [Zbl 1057.68071]  \\textit{Brodal, Gerth St\u00f8lting; Lyngs\u00f8, Rune B.; \u00d6stlin, Anna; Pedersen, Christian N. S.}, Solving the string statistics problem in time \\(\\mathcal{O}(n\\log n)\\), 728-739 [Zbl 1057.68599]  \\textit{Deng, Xiaotie; Li, Guojun; Li, Zimao; Ma, Bin; Wang, Lusheng}, A PTAS for distinguishing (sub)string selection, 740-751 [Zbl 1057.68134]  \\textit{Kuske, Dietrich; Lohrey, Markus}, On the theory of one-step rewriting in trace monoids, 752-763 [Zbl 1057.68045]  \\textit{Bielecki, Micha\u0142; Hidders, Jan; Paredaens, Jan; Tyszkiewicz, Jerzy; Van den Bussche, Jan}, Navigating with a browser, 764-775 [Zbl 1057.68729]  \\textit{Kumar, V. S. Anil; Marathe, Madhav V.}, Improved results for Stackelberg scheduling strategies, 776-787 [Zbl 1057.90018]  \\textit{Adamy, Udo; Ambuehl, Christoph; Anand, R. Sai; Erlebach, Thomas}, Call control in rings, 788-799 [Zbl 1057.68506]  \\textit{Chrobak, Marek; Epstein, Leah; Noga, John; Sgall, Ji\u0159\u00ed; van Stee, Rob; Tich\u00fd, Tom\u00e1\u0161; Vakhania, Nodari}, Preemptive scheduling in overloaded systems, 800-811 [Zbl 1057.68542]  \\textit{Karhum\u00e4ki, J.; Lisovik, L. P.}, The equivalence problem of finite substitutions on \\(ab^*c \\), with applications, 812-820 [Zbl 1057.68048]  \\textit{Stirling, Colin}, Deciding DPDA equivalence is primitive recursive, 821-832 [Zbl 1057.68052]  \\textit{Boja\u0144czyk, Miko\u0142aj}, Two-way alternating automata and finite models, 833-844 [Zbl 1057.03029]  \\textit{Berman, Piotr; Karpinski, Marek; Nekrich, Yakov}, Approximating Huffman codes in parallel, 845-855 [Zbl 1057.68743]  \\textit{Fantozzi, Carlo; Pietracaprina, Andrea; Pucci, Geppino}, Seamless integration of parallelism and memory hierarchy (extended abstract), 856-867 [Zbl 1057.68617]  \\textit{Nisan, Noam}, The communication complexity of approximate set packing and covering, 868-875 [Zbl 1057.68645]  \\textit{Doerr, Benjamin}, Antirandomizing the wrong game, 876-887 [Zbl 1059.91013]  \\textit{Akcoglu, Karhan; Drineas, Petros; Kao, Ming-Yang}, Fast universalization of investment strategies with provably good relative returns, 888-900 [Zbl 1057.91038]  \\textit{Adler, Micah; R\u00e4cke, Harald; Sivadasan, Naveen; Sohler, Christian; V\u00f6cking, Berthold}, Randomized pursuit-evasion in graphs, 901-912 [Zbl 1057.91015]  \\textit{Wells, J. B.}, The essence of principal typings, 913-925 [Zbl 1057.03023]  \\textit{Adsul, Bharat; Sohoni, Milind}, Complete and tractable local linear time temporal logics over traces, 926-937 [Zbl 1057.68055]  \\textit{Gastin, Paul; Mukund, Madhavan}, An elementary expressively complete temporal logic for Mazurkiewicz traces, 938-949 [Zbl 1057.68058]  \\textit{Brattka, Vasco}, Random numbers and an incomplete immune recursive set, 950-961 [Zbl 1057.03052]  \\textit{Hertling, Peter}, A Banach-Mazur computable but not Markov computable function on the computable real numbers, 962-972 [Zbl 1057.03054]  \\textit{Czumaj, Artur; Lingas, Andrzej; Zhao, Hairong}, Polynomial-time approximation schemes for the Euclidean survivable network design problem, 973-984 [Zbl 1057.90053]  \\textit{Bj\u00f6rklund, Andreas; Husfeldt, Thore}, Finding a path of superlogarithmic length, 985-992 [Zbl 1057.68647]  \\textit{Uehara, Ryuhei}, Linear time algorithms on chordal bipartite and strongly chordal graphs, 993-1004 [Zbl 1057.68654]  \\textit{Holmerin, Jonas}, Improved inapproximability results for vertex cover on \\(k\\)-uniform hypergraphs, 1005-1016 [Zbl 1057.68079]  \\textit{Kohayakawa, Yoshiharu; Nagle, Brendan; R\u00f6dl, Vojt\u011bch}, Efficient testing of hypergraphs (extended abstract), 1017-1028 [Zbl 1057.68649]  \\textit{Wu, Xiaodong; Chen, Danny Z.}, Optimal net surface problems with applications, 1029-1042 [Zbl 1057.68723]  \\textit{Bonichon, Nicolas; Le Sa\u00ebc, Bertrand; Mosbah, Mohamed}, Wagner's theorem on realizers, 1043-1053 [Zbl 1058.05057]  \\textit{Liberatore, Vincenzo}, Circular arrangements, 1054-1065 [Zbl 1057.68009]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$0D9A93AD-1C25-4F00-9EB5-24E758DBD1B3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613675$D2D319B4-9C98-44F8-A003-1C804A4C4BF3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613675$E6DACB68-1B46-424E-BB95-7CDF9F646E46","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d6c97431e3e07b4ff4b34fa4bfb8ea453b269478","datavalue":{"value":"1793867","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613675$66103A1F-E14E-4295-AF79-7C8A9B1E1B64","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"81d6e65c642ba1ced2b840315319649675c7a2e0","datavalue":{"value":"M\u00e1laga (Spain)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$1D714A3A-26F9-4BEE-A74D-9683F4A8534C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$7BA95482-258D-4317-8EB8-08189E6A8A4E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"85413872e180f82c5b8a578e96e74f0315026938","datavalue":{"value":"Colloquium","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$85AAE1F4-217D-4C00-9A2F-D4DF2E430459","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7f2c84ba5ee9dbcb8ae21787f6c81dfb52a8ecd9","datavalue":{"value":"ICALP 2002","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$1CC062A1-732D-4A2E-BE70-0B7DF1DE8766","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1fff7125545fcdacaefe3808a1a5f0e0a281b403","datavalue":{"value":"Automata","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$A99D96BE-9DA0-4B3F-A2B5-E5F6FE91D23A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9ec8e8b0049b2993c302f718ff35544cfb0150a0","datavalue":{"value":"Languages","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$383BC67A-0A3E-42F2-BB66-6492CCBDE108","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"39c11b645d72aab44f88706dc65aaed7361e2cc1","datavalue":{"value":"Programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613675$7E72C91E-7046-48BD-AC67-67F9B9A0C744","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":"Q1613675$55282425-15C6-4763-899B-6329F89D1FB1","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"32f1de53b24c16fb25269ba03428d08259e9b476","datavalue":{"value":{"entity-type":"item","numeric-id":433697,"id":"Q433697"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0474b62ce973b9b8826e97004422b43002c91a0d","datavalue":{"value":{"amount":"+0.9265925","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$74FE5BFD-3B5A-419D-93A8-B70E357E77DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4872ec7803630ec290b8753fe5bc8ef9ffba741c","datavalue":{"value":{"entity-type":"item","numeric-id":5941726,"id":"Q5941726"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e0d926f886211fa1b2ed5cd1523b50673a294ede","datavalue":{"value":{"amount":"+0.92591065","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$23BA069C-FEB5-4547-9439-499E1809996D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3fd9c92c5298524f6a748830491b9804944025f1","datavalue":{"value":{"entity-type":"item","numeric-id":1572745,"id":"Q1572745"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d55d9d9e54508ccc4c04cfbb52e99b614743076d","datavalue":{"value":{"amount":"+0.92381847","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$77B054A7-F843-4700-9F06-13DF19CD0000","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f5823e03c7ca0fdebf321fcba303433e936c6a39","datavalue":{"value":{"entity-type":"item","numeric-id":433734,"id":"Q433734"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"aa4f1f6f36380843f349df819074f21100586beb","datavalue":{"value":{"amount":"+0.92301846","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$0A2E8552-F392-43B4-8380-FB0ACED0A963","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1883330f0cc4639e84b95d0fc61e16beba8e0b99","datavalue":{"value":{"entity-type":"item","numeric-id":2577427,"id":"Q2577427"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"db24a7dd1496cc4dedcb7bb5e915fca2cd961e25","datavalue":{"value":{"amount":"+0.9216707","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$17686D34-6C72-41FF-BB45-F67A7C0CB75B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cd659c69189bd5077c0e1257e163187f05e35065","datavalue":{"value":{"entity-type":"item","numeric-id":1309676,"id":"Q1309676"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0a3c08439c866e32ef48c5676cd5f716ba346471","datavalue":{"value":{"amount":"+0.9214364","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$716BFDED-042D-4412-B2E9-689593AC8C39","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8b3d06bfae132a056f0b72108efea89d56d5b243","datavalue":{"value":{"entity-type":"item","numeric-id":2364433,"id":"Q2364433"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ab17b32254bf2fb9c43917cb82f07db4021b3caa","datavalue":{"value":{"amount":"+0.9211398","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$04FC8D32-0E00-48D2-A171-08FF69094494","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3f9f541a0d5ef756455acf1fc8f4a0555785932e","datavalue":{"value":{"entity-type":"item","numeric-id":1202060,"id":"Q1202060"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ab9a2a14e46d4ce1f7b5ccaa169d07e112bd6f32","datavalue":{"value":{"amount":"+0.92025936","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$9B6D2C94-645D-47A6-AE86-DC236A689830","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"86530f11108cccdd9e988a85b00f81833ae7dbf4","datavalue":{"value":{"entity-type":"item","numeric-id":1391757,"id":"Q1391757"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a54d864775f052a0beec8301c9d62296d6180f4d","datavalue":{"value":{"amount":"+0.9191536","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$E3996566-F0B9-4E1F-8F31-A132C424461B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9b5cc37553cc58c55e7892fb031aff26150d46d0","datavalue":{"value":{"entity-type":"item","numeric-id":1028779,"id":"Q1028779"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dbb74594439b1188bc17164f270a7752818f1de2","datavalue":{"value":{"amount":"+0.9170888","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1613675$70B4E7D4-2258-47DC-9204-2CE9BC9C9BE3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:1613675","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:1613675"}}}}}