Kj{_UdZddlmZddlmZddlmZmZmZm Z m Z m Z m Z dZ ded<dZd ed <d Zd Zd ZdZdZdZded<dZd ed<dZdZdZdZd9dZd:dZ d;dZeed dd/Z'd?d0Z(d1e d2 d@d3Z)e fdAd4Z*dBd5Z+e,e,e ed6 dCd7Z-y8)Du W21B-w5 — BG space partition (pure module). Turns pass-2 edge judgements (the LLM/VLM space-adjudication of bg-pair relationships) into a deterministic ``space_partition_plan``: which bgs share a plate (same physical space), which anchor each plate, the render action per bg, and the bounded reference tree. This REPLACES the dwelling-level ``same_physical_space_view`` reference SOURCE that incorrectly chained cross-zone plates (an enclosed zone inheriting an adjacent open zone's plate within a multi-zone dwelling). Design (Codex + Claude consensus, 2026-05-31): * The deterministic floor / edge judge already classified each pair. This module is PURE clustering + assignment — NO LLM/VLM/image/IO, NO text parsing. * Clustering is **anchor-centered constrained**, NOT connected-components (a plain transitive closure would re-merge cross-zone spaces via bridges): - a node joins a group only if it has a DIRECT strong edge to the anchor AND has no ``different_space`` edge with ANY current member, - so an A~B / B~C strong pair with A~C ``different_space`` never collapses into one group, and an establishing/wide hub never bridges two clusters. * Edge eligibility (Codex strong-parent gate v0, conservative — the failure mode we fix is false reuse): ``same_space`` AND ``confidence >= 0.75`` AND ``strong_parent_allowed`` true. ``different_space`` is a hard negative; ``adjacent_related`` / ``style_only`` / ``uncertain`` never form a group and never become a strong spatial parent (they may surface as weak cross-group context only). * Anchor selection prefers an existing production anchor, then highest strong degree, then confidence-sum, then a NON-hub over a hub, then stable bg_id. * Reference tree: within a group, non-anchor members reuse/derive from the anchor (``ref_tree_parents`` capped at ``max_refs``). Across groups there is NO spatial parent (the substrate keeps FP-first; cross-group context, if any, is weak/style/text only — never a parent PNG across a cross-zone edge). NOTE (Codex caveat): the edge judgements consumed here are the SOT for the *partition*, but if the FP / projection-card substrate is later simplified the judgements must be regenerated before a production run — this module's contract is stable across that, only its inputs change. ) annotations) combinations)AnyDict FrozenSetIterableListOptionalTupleg?floatSTRONG_CONF_THRESHOLDintMAX_REFSstrong differentweakrender_new_platereuse_existing_plateg?UBIQUITY_FRACTIONHUB_NODE_UNIT_COUNTdifferent_space same_space uncertain hub_uncertainct}t|ttttfs|S|D]5}t|t st|t r%|j|7|S)z@Filter an iterable down to genuine ints (drop bools / non-ints).)set isinstancelisttuple frozensetrbooladd)valuesoutns ]/Users/manta/Documents/Projects/TheRoad-I1/backend/app/modules/pipeline/bg_space_partition.py_int_setr)GsPuC ftUC; <  a jD&9 GGAJ Jci}t|ts|S|D]o}t|ts|jddk7r)|jd}t|tsKt|t r\|jd||<q|S)u+Map ``base_structural_unit`` marker number -> its label. ``base_layer_decision`` is a closed enum produced upstream; we read it and the integer ``number`` only. No label/text parsing (absolute rule) — the label is carried through as opaque passthrough evidence, never matched on. base_layer_decisionbase_structural_unitnumberlabel)rr dictgetrr#)base_marker_inventoryr&mnums r(_structural_unit_numbersr5Rs~C +T 2 "!T"  55& '+A A eeHo c3  3(=uuW~CH# Jr*cR|rtS|stS|r|dk\r |dk\rtStS)aDeterministic borderline classification for one candidate edge. Conservative v0 (the failure mode being fixed is *false* cross-zone reuse): deterministic only decides the hard negative, the hub isolation, and an OBVIOUS positive. Everything else defers to the pass-2 edge judge. * hub view -> hub_uncertain * no shared structural unit -> different_space (negative) * distinctive non-empty AND jaccard==1 AND overlap_min==1 -> same_space (obvious) * else (shares only common/hub zone, partial distinctive, or small-dwelling degeneracy) -> uncertain ?)CAND_HUB_UNCERTAINCAND_DIFFERENT CAND_SAMECAND_UNCERTAINshared distinctivejaccard overlap_minhubs r(_classify_candidate_edgerBgs2  !! w#~+*< r*)ubiquity_fractionhub_node_unit_countDict[str, Any]c  t|}t|}t|tr|ni}g}i}|j D]F\} } t| t rt| ts't | jd|z|| <Ht|xsd} |D cic]% t fd|jD'} } | j D chc]\} }|| z |k\s| }} }|j Dchc]\}}t||k\s|}}}g}tt|dD]\}}||||}}|r|s|j|s|n|d|d|d3||z}||z}|rt|t|z nd}t|tt|t|z }||z }||vxs||v}t||||| }|t k(r|j|||t|t|t#|d t#|d |d |j Dcic]\}}|t|c}}t|t|t|||d Scc} wcc}} wcc}}wcc}}w) uGenerate bounded pairwise candidate edges for one floor plan. PURE deterministic floor — NO LLM/VLM/image/IO, NO text/label parsing. Both inputs come from the ``base_location_dossier`` checkpoint (upstream of the plan), so this can run in a step placed *before* shot_aware_bg_render_plan: * ``base_marker_inventory`` — the dossier's flat marker list; we read only ``base_layer_decision == "base_structural_unit"`` integer numbers. * ``per_bg_render_facts_by_bg_id`` — per-bg exact-ID facts; we read only ``target_unit_marker_numbers`` (the camera-target floor) per bg. A bg's *signature* is its target-unit floor intersected with the dwelling's structural units. Pairwise edges whose deterministic state is a hard negative (no shared structural unit) are dropped; every other pair with any shared structural signal becomes a candidate the pass-2 judge must rule on (over-generation is fine — the judge is the SOT; under-generation is not). Returns ``{signatures, structural_units, ubiquitous_units, hub_bg_ids, candidate_edges, diagnostics}``. Each candidate edge carries the deterministic ``state`` plus the shared/distinctive marker sets and the jaccard / overlap_min metrics for the judge's prompt context. target_unit_marker_numbersc3,K|] }|vsd yw)rHN).0sus r( z(build_candidate_edges..sA#6a!q&#6s ru) has empty structural signature — edge ~z not deterministically generatedr<)bg_abg_bstate shared_unitsdistinctive_unitsr?r@rA) signaturesstructural_unitsubiquitous_units hub_bg_idscandidate_edges diagnostics)r5rrr0itemsstrr)r1lensumr%rsortedappendminrBr9round)r2per_bg_render_facts_by_bg_idrCrDunitsunit_setfactsr\rWbg_idfnbrM unit_freqc ubiquitousbgrLrZr[abABr=unionr?r@r>rArTs ` r(build_candidate_edgesrus: %%: ;E5zH,67SUY,Z (`bEK"$JKKMq%%Z4-@ $QUU+G%HIHT 5" Z ABKST8aCA:#4#4#6AAA8IT ) 1Q 11QV?P5P! 1JQ"((**ur1c!f8K.K*-/OVJ/31!}jm1   11%&s!A3>@  QA.3#f+E *&kCAA$77 z) :o0j(##   N "  &v%+K%8 !,$[!4  54P3=2B2B2DE2DQr6!9}2DE"8,":.Z(*"  ]UQZFs$*I8I=-I=JJ<J )radjacent_related style_onlyrrjudgedskippedinvalida!You are a spatial reasoning judge for film background plates. Two background plates (bg_a, bg_b) from the same dwelling are given, each with a projection card describing what is VISIBLE in that shot (visible_items). Decide their spatial relationship from the visible evidence ONLY. States: - same_space: the two plates show the SAME physical room/zone (possibly a different angle). Requires shared DISTINCTIVE features, not just a common corridor or shared open zone. - adjacent_related: different rooms that are spatially connected (one visible through a doorway from the other). - style_only: only generic style/material similarity, no spatial continuity. - different_space: clearly different rooms with no spatial continuity. - uncertain: insufficient visible evidence. Rules: - Ground every judgement in visible_items evidence; cite it. - Sharing only a common/circulation zone (corridor, shared living-kitchen) is NOT enough for same_space. - A wide/establishing 'hub' view that sees many zones must NOT auto-merge with a specific narrower zone. - Label text is NOT evidence; only what is visibly shown. - Be conservative: when in doubt use uncertain, never same_space. - shared_distinctive_features must list ONLY concrete distinctive items visible in BOTH plates (empty if none). Output strict JSON only.objectFstring)typeenumr}r.array)r}r]) edge_state confidenceevidenceshared_distinctive_features)r}additionalProperties propertiesrequiredEDGE_JUDGE_SCHEMAct|tsy|jddk7ry|jddus|jddury|jd}t|txrt |dkDS) uR3 precondition: a card may seed a judge call only if it is a real, passed projection card with visible items — never a synthetic placeholder, a non-pass card, or a card lacking visible evidence.F card_statepass syntheticT is_synthetic visible_itemsr)rr0r1r r_)cardviss r(card_is_judgeabler$sq dD ! xx ' xx $(@D(H ((? #C c4 1SX\1r*c .ddl}|jd|jd|jd|jd|jd|jd|jdd }t|j|d td S) u4Assemble the strict prompt bundle (system/user/schema) for one edge. Carries the deterministic candidate ``state`` as a non-binding hint and the two cards' ``visible_items`` as the only evidence. No text/label matching here — the visible_items pass through verbatim for the model to read. rNrRrSrTrUrVr)rRrSdeterministic_hintrUrVcard_a_visible_itemscard_b_visible_itemsF) ensure_ascii)systemuserschema)jsonr1EDGE_JUDGE_SYSTEMdumpsr)edgecard_acard_b_jsonrs r(build_edge_judge_promptr2s  "hhw/0!XX&9: & ? ; & ? ; D$ Du 5# r*c ~|jd|jd|jdt|dddgdd S) u"A non-result for an edge that could not be judged (e.g. a partial card). Codex lock: a missing card must NOT fail the whole step — it yields a ``skipped`` judgement that can never become a same-space strong parent, so the rest of the dwelling's partition still proceeds. rRrSrTrrPF) rRrSdeterministic_state judge_status skip_reasonrrrrstrong_parent_allowed)r1JUDGE_STATUS_SKIPPED)rreasons r(skipped_edge_judgementrPsG  #xx0,!')!&  r*T)both_cards_passstrong_conf_thresholdc |jd|jd|jdd}t|ts|jtdddgddd |S|jd }|t vrd}|jd }t|t tfr0t|ts tdtd t|}nd}|jdxsgDcgc]$}t|tr|jr|&} }|jd} t| tr| nd} |dk(xr"||k\xrt| dkDxr t|} |jt||| | | d|Scc}w)u_Validate one raw judge response into a canonical edge judgement. Enforces the closed state vocabulary and a numeric confidence in [0,1]. Computes the R2 strong-parent gate WITHOUT any semantic reading of the free text: ``strong_parent_allowed`` is true iff ``edge_state == same_space AND confidence >= threshold AND shared_distinctive_features is non-empty AND both_cards_pass`` (Codex lock — the gate is a validator computation, never trusted from provider output). The free-text ``evidence`` and the feature strings are carried through as opaque passthrough audit only. rRrSrT)rRrSrrrPrFznon-dict judge output)rrrrrr validation_okvalidation_errorrrr7rrrrT)rrrrrrr)r1rr0updateJUDGE_STATUS_INVALIDEDGE_JUDGE_STATESrr r#maxrcr^stripr_JUDGE_STATUS_JUDGED) rrawrrbaserTconf_rawconfrjfeatsrrs r(validate_edge_judge_outputres$  #xx0 D c4  -"(*"'4   GGL !E %%ww|$H(S%L)*Xt2L3Cx12GG9:@b@ @a a !'') @  wwz"H%h4x"H  " ) ) " JN "  !   KK($)3 K- s.)Fc|jd}|dk(rtS|jd}|dk(rDt|ttfr.t|t s||k\r|jddurt StS)u$Map one edge judgement to ``strong`` / ``different`` / ``weak``. Strong requires ALL of: ``same_space`` AND confidence >= threshold AND ``strong_parent_allowed`` (the bool the judge layer already computed — we do NOT re-parse ``shared_distinctive_features`` content here). rrrrrT)r1EDGE_DIFFERENTrrr r# EDGE_STRONG EDGE_WEAK)jrrTrs r( classify_edgersv EE, E !! 55 D  tc5\ *4& ) ) EE) *d 2 r*c||kr||fS||fSNrJ)rprqs r( _pair_keyrs!VAq6'!Q'r*)rZexisting_anchor_bg_idsrmax_refsc #$%&'()t|Dchc] }t|c}}t|}g} i} t&g} g} |D]} | jd| jd}}||vs ||vs||k(r3t | |}| j i| d|it ||}|tk(r"t| jdxsd| |<|tk(r&j|| j |d$&fd '|Dcic]}|ic})| jD]\\}}}|)||<|)||<d%)fd %d&)fd $d'$%fd }i}g}t|| D]##|vrg}t)##)fd  D]W((|vr'(#st'(fd |Dr!'(#r| j (d #dG|j (Yd#}||#<|D](||(< |j #||d|Dcic] }|d|d }}|D]Y}|||})|Dcgc]}|j|||k7r|}}|s7| j |dt|d|d[|D]o}|dh|d}| jDcgc]!\}}|d|vr|d|vrt||d#}}}||d<ttd|Ddd|d<qi} i}!|D]7}|d#t dd | #<g|!#<|dD](t"#d | (<#gd!||!(<9t| Dchc]5\}}|j||j|k7s*t ||7c}}}"|"r| j t%|"d"| |t'|| |!|"Dcgc] }t|c}| d#Scc}wcc}wcc}wcc}wcc}}wcc}}wcc}w)(aBuild the deterministic ``space_partition_plan`` from edge judgements. Returns a dict with ``edge_judgements`` (echoed, classified), ``plate_groups`` ``[{plate_group_id, anchor_bg_id, member_bg_ids, share_score, evidence_edges}]``, ``node_assignments`` ``{bg: group_id}``, ``render_actions`` ``{bg: {render_action, reuse_target_bg_id}}``, ``ref_tree_parents`` ``{bg: [parent_bg_ids]}``, and ``diagnostics``. rRrS edge_kindrrPc t||vSr)r)xydifferent_pairss r( is_differentz0build_space_partition_plan..is_differentsA/11r*c t|Sr)r_ro strong_nbrss r(degreez*build_space_partition_plan..degrees;r?##r*c<t|jSr)r`r%rs r(conf_sumz,build_space_partition_plan..conf_sums;r?))+,,r*cJ|vrdnd| | |vrd|fSd|fS)NrrHrJ)rorrrrZs r( anchor_rankz/build_space_partition_plan..anchor_ranksK--A1 BZK b\Mz!A    ()    r*)keyc| |fSrrJ)ranchorrs r(z,build_space_partition_plan.. s[=PQR=S.s-TGbl1b.AGsz% both strong and different vs anchor u — skippedzgrp::) anchor_bg_id member_bg_idsplate_group_idrrz had strong edge(s) to z outside its group (anchor u3) — resolved by anchor order; review if ambiguousrrrH)pairrevidence_edgesc3&K|] }|d yw)rNrJ)rKes r(rNz-build_space_partition_plan...s%Br!a ors)defaultrQ share_scorer) render_actionreuse_target_bg_idNz` weak (adjacent/style/uncertain) cross-group edges available as context only, not strong parents)edge_judgements plate_groupsnode_assignmentsrender_actionsref_tree_parentscross_group_context_edgesr\)rr^rr^returnr#)ror^rr)ror^rr )ror^rr )rar^rr1rrbrrr rr$r]anyr rdrc RENDER_NEW RENDER_REUSEr_r0)*bg_idsrrZrrrrqbgsbg_setr\ strong_conf weak_pairs classifiedrrpkindrrormrassignedgroupsmembersgroup_idg anchor_of my_anchorr'crossgsetkevrr cross_ctxrrrrrr3rs* `` @@@@@@@r(build_space_partition_planrs"V4VSVV45C XFK13K5O(*J')J uuV}aeeFm1 F?avoa Q 562Q2 T231o ; $QUU<%8%?C@K  ^ #    $   c "2BE/E2B/EK &&( A Aq Aq)$-    "H#%F+. X   F+1WXAH}Av&#-TG-T*T6*&&!,QRXQYYe'fg NN1 Y6(##A"HQK v[cde%/,BHHA#$a&77IHhrl+ 'O5OqLLOx|3O5    $-fUm_=$+%XZ [ .!7Ao$67%++-P-$!Q1!A$$,Awa0- P   %Br%BC!PRST- 13N-/ >"3=UW!Xv#% ?#A2>V\ ]N1 #)(9H"5 Q $ '1XzVaX\\!_ UV5W1azXZI9~< = > & N(,7@%Ay!d1gy%A" _560F^I5P$ Y&Bs/O OO= O*&O$+O* 1O* 8O0N)r%rrr)r2rrzDict[int, Any]) r=rr>rr?r r@r rAr#rr^) r2rrerrCr rDrrrE)rrrr#)rrErrErrErrE)rrErr^rrE) rrErrrr#rr rrE)rrErr rr^)rpr^rqr^rzTuple[str, str])rz Iterable[str]rzList[Dict[str, Any]]rZFrozenSet[str]rrrr rrrrE).__doc__ __future__r itertoolsrtypingrrrrr r r r __annotations__rrrrrrrrr9r:r;r8r)r5rBrurrrrrr rrrrrrrr"rrJr*r(r s`%L#"HHH#u##    % 5S#  $*!$/4CHOS: 12 __#&_ _  _  _H  : !'6G1HIx(X&h'( %>* 2      <2!#8 A A A A ! A  AHEZ,("+-6[#8H H*H H + H ! HHHr*