The governor decides three clusters at once - #461
Merged
Merged
Conversation
Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Signed-off-by: WaylandYang <wayland0916@gmail.com>
…ree-cluster round Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Signed-off-by: WaylandYang <wayland0916@gmail.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Closes #458. Revises decision 3 of record 0025 with a dated note; the status line and the table gain a row.
What changes
join_all), the round's uncertain pairs get their second look together, and the results are applied in order, cluster by cluster, because chained merges must stay sequential.settleis split intowants_second_look,second_lookandapplyfor that.llm_util's gate still hands out the permits, so a base cannot exceed what the endpoint allows however many clusters a round holds.name_shape: "sorting algorithms" contains "sorting algorithm", "Financial Times" contains "Time" as an abbreviation. The run showed one merge that slipped through the old boundary.Measured on the labeled base (589 pairs, three concurrent calls)
The score is the same within the model's run-to-run noise (four of the six wrong merges are one pair, "OpenAI, Inc." ≟ "OpenAI", on which the model flips between runs); the wall clock halves. No rate limiting was logged at three concurrent calls.
Verified
Unit tests for the shapes with the plural boundary; the governor's real-database test; the timed run above.
🤖 Generated with Claude Code