r/place A fruit fly for organization science

B1 · Coding: third-order scheme

Build a shared set of categories

B1 asks which kinds of organizing recur across communities. Its task is to turn many local descriptions into a common coding scheme without erasing differences that matter.

Where this stage starts

A1 has read the communities and recorded their context. Each community already has local themes, meaning groups of concepts from that case. B1 compares these themes across cases. The common categories it builds are called “third-order themes”: one level above the themes made within communities.

What the aggregator does

The aggregator writes expectations and stopping rules before building categories, then works through communities in a recorded order. A useful category identifies a specific kind of action or pattern. It needs a name, examples, a rule for what belongs, and a rule for what does not. Where two categories look alike, the scheme must explain how to choose between them.

For example, a label as broad as “coordination” would leave a later reader guessing which acts it includes. The scheme needs distinctions that readers can apply to the underlying participant evidence, rather than simply matching the words in a local theme’s title.

The aggregator records when new kinds appear, rereads selected uncertain material, and checks whether further reading keeps changing the scheme. Rare patterns stay visible instead of being forced into common categories. Categories supported across communities are distinguished from those with limited support. Two communities describing the same joint episode do not automatically provide two independent examples.

This stage organizes description. It does not yet explain how all the parts form an organizational model. Its category boundaries remain provisional until B2 tests whether other readers can use them.

What the next stage receives

B2 receives a written scheme, membership rules, examples and known trouble spots. It can test whether another reader understands the distinctions the author intended. A long category list alone would not provide that testable starting point.

What the output files contain

Open a file group for its purpose. These are descriptions of the stage’s outputs. Markdown files hold prose; JSONL files hold one structured record per line.

The categories and their membership rulesscheme.md, scheme.jsonl, scheme/scheme_current.jsonl, families.jsonl

scheme.md explains the categories for people; scheme.jsonl records them for tools. scheme/scheme_current.jsonl holds the working categories and members during development. families.jsonl groups categories for navigation, not as an extra theoretical level.

Expectations and likely confusionsprior.md, confusions.md, ideas-B1.jsonl

prior.md records expectations and decision rules. confusions.md names categories readers may confuse and material that can test the distinction. ideas-B1.jsonl preserves ideas before they become categories.

Evidence for continuing or stoppingtheme_discovery.jsonl, kinds-B1.jsonl, saturation-B1.md, stopping-B1.md, stopping-B1-decision.jsonl

theme_discovery.jsonl records when categories first appeared. kinds-B1.jsonl supplies the discovery counts. saturation-B1.md and stopping-B1.md explain what further reading changed and how the stopping rule was assessed. stopping-B1-decision.jsonl records the investigator’s decision to continue or stop.

The second reading and material left asidepass2-chosen-B1.txt, pass2-B1.jsonl, episodes-B1.jsonl, unplaced-B1.jsonl

pass2-chosen-B1.txt names communities selected for rereading; pass2-B1.jsonl records that pass. episodes-B1.jsonl identifies linked accounts of the same episode. unplaced-B1.jsonl preserves local themes that have not found a category.

Changes and reasonstier_history.jsonl, findings.jsonl, notes-B1.md

tier_history.jsonl records changes to the category structure. findings.jsonl records claims with their evidence. notes-B1.md explains choices, uncertainty and what the pilot should examine.

Full stage description

Read the complete technical card for exact tasks, reading boundaries, checks and closing rules. The explanation above is a guide; the card holds the instructions.

How the stage is divided into legs
  • B1a: prior. Repeats: no. Interview point: -.
  • B1b: getting lost. Repeats: yes. Interview point: -.
  • B1c: saturation test. Repeats: no. Interview point: -.
  • B1d: second pass. Repeats: yes. Interview point: -.
  • B1e: scheme standing. Repeats: no. Interview point: end.
Changes recorded for this run

Historical instructions and settings

The three shared B1 checkpoints retain the earlier card. B1e closed at 14:49Z on 11 October, before decision row 75 at 15:51Z. The gate and member-recheck amendment was sent at 16:25Z for the next B2 leg. Do not apply those later checks retroactively to B1. Saved card SHA-256: 246c890d13c93007d92a27d29c76be7814281d946bc014c23dc96496e0819f97. Current canonical card SHA-256: a2b733dded3046ba611c65e979beb597ef8ef26e8b625dea28469a254219f8a0.

Historical context and evidence.

Source versions and hashes identify the exact technical documents reproduced here.

Chat Online