Procedurally reducing complexity. The practices of German EU policy coordination
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Policy coordination in federal states is inherently complex because it includes a multitude of actors at the federal and the sub-state level. If the sub-states want their interests to be included in the final decision, they need to coordinate with the federal level but also amongst themselves. Several individual interests areoverlooked easier than coordinated interests of a group of sub-states. This paper puts forward the argument that during the coordination process, the actors from both levels meet in different constellations where they focus on different aspects of coordination, especially on different actors’ interests separately. This is a strategy which enables them to procedurally reduce the complexity of the decision-making process. In order to empirically investigate this argument, first a thorough definition of coordination as process is provided and operationalized for empirical investigation. It is accentuated that coordination as a process has different dimensions which are relevant for the understanding of the coordination process. This argument is analyzedwith the example case of German EU policy. The empirical data used are original expert interviews with German civil servants responsible for EU policy coordination at the sub-state level. It will be demonstrated that the actors strategically form voluntary coordination constellations which enables them to reduce complexity during the process.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it