ƭjH 2UdZddlmZddlmZmZmZmZmZm Z m Z e hdZ de d<dZde d <d Zd e d <d Zde d<dZde d<dZde d<e eehZde d<e ddhZde d<e hdZde d<dZde d<ddddZd e d!<Gd"d#eZdd$Z dd%Zd&d' dd(Z dd)Zd&d* dd+Zdd,Z dd-Z dd.Z! dd/Z"dd0Z# dd1Z$ dd2Z% dd3Z& dd4Z' dd5Z( dd6Z) dd7Z*dd8Z+ dd9Z, dd:Z- dd;Z. dd<Z/d&d&d= dd>Z0 dd?Z1 dd@Z2 ddAZ3dBd dCdDZ4d e dE<dFZ5de dG< ddHZ6 ddIZ7 ddJZ8ddKZ9dLZ:dMe dN<e dOdPhZ;de dQ<e dRdShZe:f ddZZ? dd[Z@d&d&e:d\ dd]ZAd^ZBde d_< dd`ZCdaZDde db<d Zd e d <dcdcdddddeZEdfe dg< ddhZFdiZGde dj<dkZHde dl<dmZIde dn<dcZJde do< ddpZK ddqZL ddrZMdsZNde dt< dduZO ddvZPd&dw ddxZQe dy ddzZR dd{ZSd|ZT dd}ZUd&d&d&d&d&d~ ddZVy&)uCW20B: shot-aware background render plan (LLM planner contract). Per-fp dwelling-scoped reference graph DAG + per-bg camera + reference decisions, all LLM-emitted, code-validated. **No image / VLM / DB / ImageAsset writes here.** The module exposes pure helpers; LLM calls are dependency-injected via an ``llm_provider`` callable so default production paths run with zero external API calls. Inputs (consumed from upstream checkpoints, all exact-ID joined): - base_location_dossier (W20A) — dwelling identity + per-bg facts. - floor_plan_geometry_readback (W20A2) — readback status + cell candidates. - floor_plan_overlay_payload (W19B-1) — already folded into the dossier; kept available for sanity. - background_master_plan — bg DAG + applies_to_shots. - shot_staging — committed shot staging payload. Output (one entry per fp_id with ≥1 renderable bg): - dwelling-scoped graph DAG (ordered nodes). - per-bg ``reference_decision`` (LLM mode + selected_refs + physical_space_id_per_ref + ...). - per-bg ``camera_decision`` (LLM cell + lens picks, validated against the W20A2 geometry candidate sets). - validators block enumerating which contracts passed/failed + structured blockers. - real_api_call_counts (image / llm / vlm) — always 0 unless an llm_provider is wired AND invoked. W20 boundaries enforced in this module: - exact-ID only — every join uses exact integer / string equality. - no semantic label / description parsing. - no deterministic top-K reference selection (LLM-owned). - no same-space judgement by code (LLM emits ``physical_space_id_per_ref``; code only checks set cardinality). - max_refs_per_bg = 2. - exactly one ``is_dwelling_identity_anchor = True`` per fp_id. - synthetic readback never promotes to ``production_ready = True``. - shot readiness is a structural gate; **no readiness LLM classifier** — if the staging cp does not carry the required fields, fail-closed with a precise blocker. ) annotations)AnyCallableDict FrozenSetListOptionalTuple>fp_seeded_anchorreference_derivedrelated_style_new_spacesame_physical_space_viewtwo_refs_distinct_spacesFrozenSet[str]ALLOWED_REF_MODESrstr TWO_REFS_MODEintMAX_REFS_PER_BGdistinct_visible_spacesTWO_REFS_DEDUP_TOKENrender_new_plateRENDER_ACTION_NEWreuse_existing_plateRENDER_ACTION_REUSEALLOWED_RENDER_ACTIONSrr REUSE_ELIGIBLE_MODES>widenormal telephotoALLOWED_LENS_ENUMS)visible_space_directivecamera_framing_directivesubject_position_directivestate_cue_directivenegative_continuity_directivezTuple[str, ...]RENDER_GUIDANCE_FIELDSZ2)rr r!zDict[str, int]_FALLBACK_LENS_FOV_MAPceZdZdZy)ShotAwareBgRenderPlanErrorz+Fail-closed signal for the planner builder.N)__name__ __module__ __qualname____doc__d/Users/manta/Documents/Projects/TheRoad-I1/backend/app/modules/pipeline/shot_aware_bg_render_plan.pyr.r.js5r4r.cFt|xsijdxsiS)Ndossiers)dictget)dossier_cp_datas r5_index_dossiersr;ss" &B++J7=2 >>r4ci}|xsijdxsi}|jD] \}}t|tsd|vs|||<"|S)Nper_fpgeometry)r9items isinstancer8)geometry_cp_dataoutr=fp_identrys r5_index_geometryrEwsX&(C$" ) )( 3 9rF  u eT "zU':CJ' Jr4N diagnosticsc ,i}d}d}g}g}g}t|xsijdxsgD]\}} t| ts|j d|d-| jdxs| jd} t| t r | r| } |dz }n| jd} | jd } t| t r>t| ts.t| t rt| tsd | d | } |dz }n|j d |d | d| | |vr|j |  | || <|||d<||d<||d<||d<||d<|S|s|s|r-ddl}|jtjd||||||S)uBuild ``shot_id → staging entry`` exact-ID map. W20F1 — shot_staging cp 가 ``shot_id`` / ``id`` 를 carry 하지 않고 ``scene_index`` + ``shot_index`` 정수만 가지는 합법 입력 경로를 지원한다. fallback 합성 ID 형식 = ``f"S{scene_index}_Shot{shot_index}"`` (shot_extract / scene_detail violation message 의 명명과 동일, Codex 2026-05-28 confirmed). entry 가 명시 ``shot_id`` / ``id`` 를 들고 있으면 그 값을 그대로 우선 사용. bool 은 int subclass 라 ``isinstance(x, bool)`` 별도 reject. 결손/타입불량 entry 는 silent drop 금지 — ``diagnostics`` dict 가 주어졌으면 카운터에 누적, 없으면 logger.warning 으로 surface 한다. rshotsz shot_idid scene_index shot_indexS_Shotzraw_idx=z scene_index=z shot_index=Nshot_staging_index_explicit_id!shot_staging_index_synthesized_id shot_staging_index_dropped_no_id)shot_staging_index_dropped_bad_index_typeshot_staging_index_collisionsz]_index_shot_staging: explicit=%d synth=%d dropped_no_id=%r dropped_bad_index=%r collisions=%r) enumerater9r@r8appendrrboollogging getLoggerr/warning)shot_staging_cp_datarGrBcounter_explicit_idcounter_synth_idcounter_dropped_no_id_no_indexcounter_dropped_bad_index_typecounter_collisionraw_idxrD explicit_sidsidrNrO_loggings r5_index_shot_stagingrgs$&(C02"02"#%#%9%?R$D$DW$M$SQST%& * 1 1M'!2L M yy+>uyy lC (\C 1 $ ))M2K<0J;,Z T5Rz3/ :t8T+eJ<8 A% .55wi}[OD"",1 #:  $ $S ) C5U68K 45;K 78:X 67Ca ?@7H 34 J *-KO` &   x ( 0 05# ..!  Jr4cg}g}g}|s|jdd|||fS|D];}|j|}||j|(|j||d=|s|jd|dd|||fSd|||fS)uStructural readiness gate — code only verifies presence of the bg's consuming shot_ids in the staging cp. NO LLM classifier. W20E6-B contract: ``shot_staging`` is the staged/selected subset of the project's shots, not the full ``applies_to_shots`` universe. A BG with ANY staged shot is renderable; missing-from-staging shots are surfaced as ``omitted_unstaged_shots`` for diagnostic context, **not** as structural blockers. Only the empty / fully-unstaged cases carry structural blockers (the BG cannot be planned without at least one staged consuming shot). Returns ``(ok, blockers, surfaced_shot_entries, omitted_unstaged_shots)``. zbg has empty applies_to_shotsF)rKstagingz9bg has no staged consuming shots (omitted_unstaged_shots=)T)rXr9)applies_to_shots staging_indexblockerssurfacedomittedrerDs r5_consuming_shot_readinessrps H%'HG 78h'11!!#& = NN3         ''.k 4 h'11 8W ,,r4)shot_staging_diagnosticsc lt|}t|}t||}i} |jD]s\} } | |vr || } | j dxsi} | j dxs"| j dij dd}| j dxsi}i}g}d}g}|jD]p\}t |j d xsg}t || \}}}}|||||d |<|rd }|jW|jfd |Dr|xsij dxsijDcic],\}}t|tr|j d| k(r||.}}}| | | ||||t|dg|d| | <v| Scc}}w)aBuild per-fp planner input bundles. Each fp_id present in the dossier checkpoint and the geometry checkpoint produces one bundle: { "fp_id": str, "dossier": , "geometry": , "readback_status": str, "shot_readiness": { "ok": bool, "blockers": [str], "per_bg": { bg_id: { "applies_to_shots": [str], "surfaced_shots": [{"shot_id": str, "staging": {...}}], "ok": bool, "blockers": [str], } } }, "candidate_catalog": [], # W20B: empty seed catalog; future wave may grow. "raw_overlay": , } fp_ids missing from either dossier or geometry are not surfaced (the planner step turns that into a fp-level skip + diagnostic). rFr>readback_statusreadbackstatusunknownper_bg_render_facts_by_bg_idFrk)rkrl)rksurfaced_shotsomitted_unstaged_shotsokrmTc3.K|] }dd|yw)bg_id=: Nr3).0bbg_ids r5 z*assemble_planner_inputs..Ns"#5@fUIRs+[soverlaysrC)rzrmper_bgrenderable_bg_ids)rCdossierr>rsshot_readinesscandidate_catalog raw_overlay) r;rErgr?r9listrprXextendr@r8sorted)r:rAoverlay_cp_datamaster_plan_cp_datar]rqr7 geometriesrlrBrCr geom_entryr>rs per_bg_factsper_bg_readiness fp_blockersany_okrenderable_bg_ids_listfactsappliesrz bg_blockersrnrorpayloadoverlay_subsets ` r5assemble_planner_inputsrs#L/H !12J'*BM&(C"..*w  " & >>*-3 NN, - G~~j"-11(IF  KK6 7 =2 79!# ,.(..0LE5599%78>B?G1J!( 2 .B Xw%,"*+2'' U #&--e4""#5@#)16!&B++J7=2eg# #w'4(W[[-AU-J 7N#   .'*&,,B%C"$) E c+D J3 s1F0ct|trt|dk7ry|D]$}t|tst|tr$yy)z;``[row, col]`` shape with two non-negative ints (no bools).rFT)r@rlenrYr)valuevs r5_is_int_pair_listrss> eT "c%jAo  a jC&8 r4c  g}t|tr|s|jdd|fSt|D]\}}d|d}t|ts|j|d2|j d}t|t r|s|j|d|j d}t|tst|tr|d kr|j|d |j d }t|t r|s|j|d |j d }t|ts|j|d|j d} t| t s|j|d|j d} t| ts|j|dn| j d} t| ts|j|dnt| D]\} } |d| d}t| ts|j|d3t| j dt r| j ds|j|dt| j dt r| j dr|j|d| j d}t|ts|j|ddD]9}t| j |t r#|j|d|d;t| j dts|j|d | j d!}t|ts|j|d"n=t|D]/\}}t|t r|r|j|d#|d$1|j d%}t|ts|j|d&n d'D]K}|j |}t|tst|tr5|j|d(|d)Md*D]4}t|j |r|j|d(|d+6|j d,}t|t r|s|j|d-|j d.}t|tst|tr|d kr|j|d/|j d0}t|ts|j|d1tt|jttz }|r&|j|d2|d3tttD]K}|j |}t|t r|jr5|j|d4|d5M| |fS)6uStructural / type-only schema-lite check. The W20B prompt pack carries a JSON Schema, but the production validator must also fail-closed on missing / wrong-typed fields so a malformed LLM output cannot quietly default through the other validators. **No semantic parsing** — code checks only that the keys exist and the types match. Allowed types mirror the ``schema.json`` shape exactly. z$graph.nodes must be a non-empty listFz graph.nodes[]z not a dictrz.bg_id must be non-empty string node_indexrz$.node_index must be non-negative intmodez.mode must be non-empty stringis_dwelling_identity_anchorz).is_dwelling_identity_anchor must be bool rationalez.rationale must be stringreference_decisionz .reference_decision must be dict selected_refsz..reference_decision.selected_refs must be listz".reference_decision.selected_refs[ ref_bg_idz#.ref_bg_id must be non-empty stringphysical_space_idz+.physical_space_id must be non-empty string rejected_refsz..reference_decision.rejected_refs must be list)"same_physical_space_dedup_decisionwhy_single_ref_or_two_refslow_delta_reuse_target_bg_idlow_delta_rationalez.reference_decision.z must be string'same_physical_space_low_delta_candidatezH.reference_decision.same_physical_space_low_delta_candidate must be boolphysical_space_id_per_refz:.reference_decision.physical_space_id_per_ref must be listz..reference_decision.physical_space_id_per_ref[z] must be non-empty stringcamera_decisionz.camera_decision must be dict) camera_unit look_at_unitz.camera_decision.z must be int) camera_cell look_at_cellz must be [int, int] lens_enumz).camera_decision.lens_enum must be stringfov_degz-.camera_decision.fov_deg must be positive intrender_guidancez.render_guidance must be dictz".render_guidance has unknown keys z ; allowed=z.render_guidance.z must be non-empty string)r@rrXrWr8r9rrYrrrsetkeysr(strip)nodesrmidxnodeprefixrnir is_anchorrref_decsels_idxrDs_prefixrejfnamepsip_idxpcamrlensfovrg extra_keysrs r5_validate_required_shaper}sH eT "%>?hu% TuA&$% OOvhk2 3 !%%U OOvh&EF G XXl # b$ z"c':b1f OOvh&JK Lxx$$D OOvh&DE FHH:; )T* OO(CD HH[) )S) OOvh&?@ A((/0'4( OOvh&FG H++o.Cc4(hLM%.cNLE5"()KE7RSTH%eT2 8*K(@A %eii &@78!/hh()#t$ OOvh&CD E8GGENa&jC.@OO!("3E7,G9 9(8OO!("3E7;%&9 77;'DdC(hGH'')$C#t$JsC,@C1HhKLXX' ("d# OOvh&CD EBGGI5K1L LMJh@!l*T2H-I,JL0u !%-U[[]OO!("3E7;+,0u&BL8 ##r4c jg}t}t|D]\}}|jd}t|tst|t s|j d|dM||k7r|j d|d|d|||vr|j d|d|j|| |fS)z<``node_index`` must equal the entry's position in ``nodes``.rnode[u7].node_index missing or non-int — order check skippedz ].node_index=z" does not equal its list position z node_index=z appears more than once in graph)rrWr9r@rYrrXadd)rrmseenrrrs r5_validate_node_index_orderrsHDu% T XXl # b$ z"c': OOuST   9 OOuM".5"  : OObT!AB   !&"L8 ##r4c8g}g}|D]8}|jd}t|ts%|s(|j|:t |}t ||z }t ||z }|r|jd|d|r|jd|d| |fS)aExact-string set equality between graph node bg_ids and the fp's **renderable** bg_ids (W20E6-B). Renderable = the BG has at least one staged consuming shot in ``shot_staging``. Non-renderable BGs (no staged shots) are deliberately excluded from the LLM-emitted graph; this validator enforces that contract -- any missing renderable bg_id, or any emitted bg_id outside the renderable set, is a hard fail. rz.graph completeness: missing renderable bg_ids zO (dwelling-scoped graph must include every staged-shot renderable BG of the fp)z!graph completeness: extra bg_ids zF (graph emitted bg_ids that are not in the staged-shot renderable set))r9r@rrXrr) rrrmrrrseen_setmissingextras r5_validate_graph_completenessr,sHD! eS !e KK 4yH&12G 8// 0E||vr|j d|dX|||<|jdxsi}|jdxsgD]}|jd}t|ts|j d|d :||k(r|j d|d U|j|} | |j d|d |d | |k\s|j d|d |d *| |fS)z5No cycles, every parent appears earlier in the order.rrz].bg_id missing or non-stringr|z appears twice in graphrrrz ref entry missing ref_bg_idz references itself (self-loop)z references z< which has not appeared earlier in the graph (DAG violation)z2 that is not earlier in walk order (DAG violation))rWr9r@rrX) rrmbg_seenrrrrrefref_bg parent_idxs r5 _validate_dagrPs|H Gu% T!%% OOeC5(EF G  G  OOfUI-DE F ((/06B;;/525CWW[)Ffc*UI%ABUI%CD V,J!UI\& )r9rrrX)rrmrrselecteds r5_validate_max_refs_per_bgrxsH((/06B;;/52 x=? * OO'*--Bx=/_$57  L8 ##r4cg}|D]b}|jd}|jd}|jdxsi}|jd}|jd}t|tr t|ng}t|tr t|ng} t|trTt|trDt| t|k7r-|j d|dt| dt|d t t || D]r\} \} } t| ts| jd } t| ts.s @Z:a%+!+Z rrMz# two selected_refs share ref_bg_id=z (must be exact-string distinct)c3DK|]}t|txr|ywrr)r~ss r5rz5_validate_two_refs_distinct_spaces..s C(Q 1c*0q0(rzR two-ref mode requires exactly 2 non-empty physical_space_id_per_ref entries (got zF physical_space_id_per_ref entries are not exact-string distinct (got rz: two-ref mode requires same_physical_space_dedup_decision=z (got rz; two-ref mode requires non-empty why_single_ref_or_two_refs)r9r@rrrXrWzipr8rrallrrr)rrmrrrrrrsel_listpsi_listi sel_entrypsi_idsel_psie ref_bg_idsdedupwhys r5"_validate_two_refs_distinct_spacesrs*H!xx((/06B;;/kk56 &0$%?4>R *3 5492 h %*S$*?8}H -UI&H 'H a)'0Hh0G&H "A" 6i.mm$78G'3'Jvs,Cf$OO  <--4K8556Cr&E 'I = 8}!UIVM+<=447M?!E]a JtS$9 OO !?xH),A/  x=A "!A'1D&9k"tC! @Z@@a=JqM1OO  *%%/]$55UW H "C(CCUI&$rmrecordsby_lensrrrpriors r5_derive_lens_fov_maprsHll./52G G !T" uu[!eeI$$JsC,@  D! =GDM c\ OO$$(82eWD?  *+X55 H r4c rg}|D]}|jd}t|tr||vr|jd|d||jdxsi}|jdxsgD]A}|jd}t|ts%||vs*|jd|d|dC| |fS) Nrr|z' in graph is not a same-fp bg of fp_id=rrrz references ref_bg_id=z outside same-fp set)r9r@rrX) rCrsame_fp_bg_idsrmrrrrrs r5_validate_same_fp_onlyr#s H! eS !e>&A OO " # ((/06B;;/525CWW[)F&#&6+GUI%;F:F*+6L8 ##r4cTg}|Dcgc]}|jds|}}t|dk7r|jdt|dnO|r|dnd}|d|ur|jd|djd}|dk7r|jd |d| |fScc}w) NrrMz.graph requires exactly one anchor node (found rjrz6anchor node must be the first node in graph walk orderrr z*anchor mode must be fp_seeded_anchor (got )r9rrX)rrmnanchors first_node anchor_modes r5_validate_anchor_exactly_oner<sHH%Q155)F#Gq%GH 7|q'l^1 & "'U1XD 1:Z ' OOH ajnnV, , , OO#a) L8 ##%Is B%B%c^|dgfSg}|Dcgc]}|jds|}}t|dk7rdgfS|djd}t|tr|sdgfS|s|j dd|fS||vr%|j d|d t |d d|fSd|fScc}w) uW20E7-C: anchor BG must be drawn from the dossier's clean anchor candidate surface (``anchor_selection_metadata.candidate_bg_ids`` — every BG in that list satisfies ``clean_background_expected=True``). Caller contract: - ``clean_anchor_candidate_bg_ids is None``: validator is a no-op (back-compat for unit-test call sites pre-dating the W20E7-C wiring). Production paths NEVER pass ``None`` — they always derive the set from the dossier. - ``clean_anchor_candidate_bg_ids == frozenset()``: empty surface is a hard fail (no clean anchor candidate exists for this fp; the LLM cannot legitimately pick an anchor). - non-empty set: the anchor's ``bg_id`` MUST be an exact-string member of the set. Cross-validator interaction: when ``_validate_anchor_exactly_one`` already fails (zero / multiple anchors, or anchor not at index 0), this validator no-ops so the operator sees the primary anchor shape error without a redundant diagnostic chain. TrrMrrzclean anchor candidate set is empty -- dossier surfaced no clean_background_expected=True bg_ids for this fp; the LLM cannot pick an anchor without a clean candidate.Fz anchor bg_id=z* is not in the clean anchor candidate set z; the anchor MUST be drawn from the dossier's anchor_selection_metadata.candidate_bg_ids subset (clean_background_expected=True only).)r9rr@rrXr)rclean_anchor_candidate_bg_idsrmrr anchor_bg_ids r5'_validate_anchor_in_clean_candidate_setr Us4%,RxHH%Q155)F#Gq%GH 7|qRx1:>>'*L lC ( Rx ( ? h88L+,#$ABEF5 6 h >1Is B*B*c g}|jdxsi}|jdxsi}t|\}}|j||D]t}|jdxsi}|jd} |jd} |jd} |jd} |jd } |jd }t| tst| t s|j d | d t| }||vr|j d | d | d||xsgDcgc] }t|}}t| trt| dk(r t| |vs|j d | d| d|d|j|xsgDcgc] }t|}}t| trt| dk(r t| |vs|j d | d| d|d| tvr)|j d | d| dtt|j| }||j d | d| dt|t rt|tr |j d | d|d|d| d Q||k7sX|j d | d|d|d| w| |fScc}wcc}w)Ncamera_cell_candidates_per_unit look_at_cell_candidates_per_unit)r>rrrrrrrr|z$ camera_decision.camera_unit not intz camera_unit=z' not in camera_cell_candidates_per_unitrz camera_cell=z( not in camera_cell_candidates_per_unit[rz look_at_cell=z) not in look_at_cell_candidates_per_unit[z lens_enum= not in z= has no fov mapping in geometry.view_cone_records or fallbackz fov_deg=z not int (expected z for lens=rjz does not match expected z for lens_enum=) r9rrr@rYrrXrtuplerrr"r)rr>rm cam_cands look_cands lens_fov_maplens_map_blockersrrrcam_unitcam_cell look_cellrrunit_keycvalid_cam_cellsvalid_look_cells expected_fovs r5_validate_camera_in_candidatesrs+ H >?E2I@AGRJ&:H&M#L# OO%&hh()/R!77=)77=)GGN+ GGK( '')$ h %Z#-F OO !EF  x= 9 $ OO xj923  -6x-@-FB-FG-F58-FG x &H "h?2 OO xl;33;*A? /9nnX.F.L".LM.LE!H.LM y$ 'I!#i $44 OO  }=44<:Q@  . . OO YM,-.0  (++I6L#UI[ >LM 7C(GT1JUIYwk:!!-j QHL(UIYwi8 ,~_YMK{BL8 ##YHNs 7K (Kcjt|txr"t|dk(xrtd|DS)uHA grid cell is a ``[int, int]`` pair (bool excluded — bool is an int).rc3bK|]'}t|txrt|t )ywrr@rrYr~rs r5rz_is_int_cell..s*M1 1c">:a+>'>>-/)r@rrr)cells r5 _is_int_cellr%s8 4 N IN N MM Mr4c t|sy|xsgDcgc]B}t|ttfr*t |dk(rt d|Dr |d|dfD}}|sy|d|df|vryt |fd}|d|dgScc}w)uNearest valid candidate to ``cell`` (Manhattan distance, stable tie-break), or ``None`` when no snap should happen. Returns ``None`` (no repair — left for the validator to fail-fast) when: - ``cell`` is not a ``[int, int]`` pair (malformed), - the candidate set is empty, - ``cell`` is already a valid candidate (no-op). Tie-break is ``(distance, row, col)`` so the choice is deterministic. Nrc3bK|]'}t|txrt|t )ywrr!r"s r5rz(_snap_cell_to_nearest..s*J1 1c">:a+>'>>r#rrMcht|ddz t|ddz z|d|dfS)NrrM)abs)candcell_ts r5z'_snap_cell_to_nearest..sB Q&)# $s47VAY+>'? ? G G r4key)r%r@rrrrmin)r$ candidatesrvalidbestr+s @r5_snap_cell_to_nearestr3s  "" "A a$ ' FaK JJ J 1qt "   1gtAw F     D GT!W ) sAB c|jdxsi}|jdxsi}g}g}|D]}t|}t|jdxsi}|jd} t| trt| tst | } d|fd|ffD]\} } |j| } t | | j| }|5|j|jd| | | d| d g|t|d| dz t|d | d z zd ||| <||d<|j|||fS) aDeterministically repair out-of-candidate ``camera_cell`` / ``look_at_cell`` to the nearest valid candidate. PURE: returns ``(repaired_nodes, repairs)`` and never mutates the input nodes. ``repairs`` carries one entry per snapped field:: {"bg_id", "field", "unit", "from", "to", "distance"} The function repairs ONLY the constrained-choice cell fields and ONLY when a snap is unambiguous (valid ``camera_unit``, non-empty candidate set, ``[int, int]`` cell). Malformed cells / invalid units / empty candidate sets are left untouched so the validator fail-fasts. It is the caller's responsibility to gate this behind a camera-only failure so non-camera defects are never masked. rrrrrrrrrM)rfieldunitfromtodistance) r9r8r@rrYrr3rXr))rr>rrrepairedrepairsrnew_noderrrr5cand_mapr$snappeds r5snap_camera_cells_to_candidatesr? sl( >?E2I@AGRJ%'H$&G:488-.4"577=) h $Z$-G8}H *,$xwwu~/hll86LM&NN%)XXg%6%*$,%)!Wd1g$6") #GAJa$8 9"%gaj47&:";!<  ")CJ)$*'*"#!9: W r4c hg}|D]}|jd}t|tr|js$|j d|jdd|jd}|t vsr|j d|jdd|dt t | |fS)Nrr|rz rationale missing or emptyrrr)r9r@rrrXrr)rrmrrrs r5_validate_rationale_nonemptyrABsHHH[) )S)1B OO'*--HI xx ( ( OO'*-VD88+,-/ L8 ##r4c&|dk7r dd|dgfSdgfS)uWhen readback is synthetic, the plan must NOT be marked production-clear. We surface that as a *constraint diagnostic* — the plan can still be authored, but a real smoke is blocked.rzFzreadback_status=ud — plan cannot be promoted to production_ready until a real VLM readback (status='ok') is wired upTr3rss r5"_validate_synthetic_readback_blockrDUs;$12( )   8Or4)rr cjg}t|\}} |j| ||n|} t|| \} } |j| t|\} } |j| t |\} } |j| t |\}} |j| t |\}} |j| t|||\}} |j| t|\}} |j| t||\}} |j| t||\}} |j| t|\}} |j| t|\}} |j| t|| | | |||||||g }|| | | ||||||||||dS)a'Validate the LLM-emitted shot-aware bg render plan graph. W20E6-B: ``renderable_bg_ids`` is the staged-shot subset of ``same_fp_bg_ids`` and drives graph-completeness. When omitted (no caller supplied a subset), the broader ``same_fp_bg_ids`` is used as a backward-compatible default -- preserves call sites that have not yet been updated. W20E7-C: ``clean_anchor_candidate_bg_ids`` is the dossier's ``anchor_selection_metadata.candidate_bg_ids`` (the ``clean_background_expected=True`` subset). When provided, the anchor's bg_id MUST be a member; an empty set fails closed (no clean anchor available). When ``None``, the validator is a no-op (back-compat for unit tests pre-dating the wiring). Production paths always pass a frozenset, possibly empty. )r)rr)rCrr)rr )rr>rC)required_shape_okgraph_completeness_oknode_index_order_okdag_okmax_refs_per_bg_oktwo_refs_distinct_spaces_oksame_fp_only_okanchor_exactly_one_ok anchor_in_clean_candidate_set_okcamera_in_candidates_okrationale_and_mode_ok#synthetic_readback_production_clearall_validators_passedrG)rrrrrrrrrr rrArDr)rCrrr>rsrr rGshape_okrcompleteness_targetcompleteness_ok node_index_okrIrefs_oktwo_okfp_ok anchor_okanchor_clean_okcam_okrat_oksynth_okall_oks r5validate_llm_outputr`es4 K*7KHaq/:6':OQq1>M1qE*IFAq*7JGQq2?IFAq%5HE1q/er4c |jdxsijd}|jdxsijd}t|ts5t|ts%t|trt|tr||k7ry|jdxsijd}|jdxsijd}t|txrt|t xr||k(}tt ||jdt ||jdz}|xs|S)uDeterministic same-physical-space corroboration between a reuse candidate and its target plate. ``camera_unit`` equality is the hard floor — a reuse may never cross units. On top of that we require EITHER the same ``look_at_unit`` OR an overlap in the dossier target-unit markers, so that two plates that sit in the same unit but face genuinely different walls/targets (the "same space, very different view" failure mode) are NOT collapsed. rrFrr)r9r@rYrrf) currenttargetrcur_camtgt_camcur_looktgt_look same_lookoverlaps r5_corroborates_same_spacerps&{{,-388GGzz+,277 FG7D! gt $'3''3' g  -.4"99.IH ,-388HH8S! !8T* * !   lGKK,@A  fjj.A B CG  r4c |xsijdxsi}g}d}d}d#fd }ttt|}dgtz}i} |D]<} t | } | jdxsi} | jd} | jd }| jd du}| jd du}| jd }| jd }t |t r|nd}t |t r|nd}t| d<d| d<|r|sd}|jd| d|s|s|rd}|jd| d|tvr=| jd}t |tr|sd}|jd| d|d|r|r|s|tvr|jd| d|d|dn|| k(rd}|jd| dn| j|}|d}|jd| d|dnh|jdtk7r|jd| d|dn7t| ||s|jd| d nt| d<|| d<|d!z }| || <t | t s8| | | <?t|Dcgc]\}}||n t |}}}|||||d"fScc}}w)$u=Stamp canonical ``render_action`` / ``reuse_target_bg_id`` onto each plan node after LLM-output validation, before the checkpoint write. A node is routed to ``reuse_existing_plate`` ONLY when ALL hold: - it is not the dwelling identity anchor, - its ``mode`` is in :data:`REUSE_ELIGIBLE_MODES`, - the LLM set ``same_physical_space_low_delta_candidate=true`` with a non-empty ``low_delta_reuse_target_bg_id`` (LLM signal — required), - that target is an EARLIER same-fp node whose own canonical ``render_action`` is ``render_new_plate`` (no reuse-of-reuse; the earlier-only rule makes the reuse graph acyclic by construction), - deterministic same-space corroboration passes (code signal — required). Neither the LLM flag nor the code overlap may trigger reuse on its own. Otherwise the node stays ``render_new_plate`` with an empty ``reuse_target_bg_id``. Contract/structure violations (candidate↔target coupling, invalid target, text-only same-space follow-up) fail the routing (``render_action_routing_ok=False``); a valid-but-uncorroborated candidate, an over-signalled ineligible node, **or a reuse-of-reuse request** is a non-fail downgrade with a diagnostic — the node keeps its references and renders a new plate. rwTrct|jd}t|trt|ts|S|S)Nrr9r@rrY)rrrs r5_idx_keyz&route_render_actions.._idx_key5s2 1X\\, 'C(B1ErL1Lr4r-Nrrrrrrr render_actionreuse_target_bg_idFr|zE candidate=true but low_delta_reuse_target_bg_id is empty (malformed)z` candidate=false but low_delta target/rationale non-empty (v2 empty-sentinel contract violation)rrzN requires a non-empty selected_refs (text-only same-space follow-up forbidden)z6 low-delta candidate on reuse-ineligible node (anchor=z, mode=u$) → downgraded to render_new_platez/ reuse target is self (must be an earlier node)z reuse target z is not an earlier same-fp nodeuU is itself a reuse node (reuse-of-reuse forbidden) → downgraded to render_new_plate)rhriru LLM low-delta candidate not corroborated by deterministic same-space overlap (camera_unit + look_at_unit / target-marker) → downgraded to render_new_platerM)render_action_routing_okreuse_plate_count reuse_countrG)rrreturnr)r9rrangerr8r@rrrXrrrprrW)rrrrG routing_okrzrtorderrouted decided_by_bgrrrrrr candidate target_id ld_rationalertgtrr routed_nodess` r5route_render_actionsrs4Mr&&'EFL"LKJKM 5U$( 3E.2Vc%j-@F/1M E!H~hh+,2!xxHH:;tC GG= >$ F GG:; ww45 !+Is!;I '1,'D|" 1_%' !" YJ    "DE  \J    "  ' '''/*Cc4(" ""UIVD84!" D(<<""UI&//8kI9: e#" ""UI&$% $'' 2;!&J&&   }E67WW_-1BB &&   }E=> 2 < &&  *=>-@D)1:D-.1$Kq eS !#'M% GN ''FC]U3Z 00' $.(""   s'KrM)pass needs_reviewblocked_CARD_STATE_PRIORITYanchor_shot_idprojection_card_idprojection_card_hashprojection_card_stateprojection_card_fallback_reasonprojection_card_source_bg_idprojection_card_inheritedPROJECTION_CARD_FIELDScp|xsij|xsi}|j|xsijdxsg}d}d}d}|D]g}|jt|} t| ts.tj| jdd} | |kDsY| }t|}| }i||fS)aIPick the anchor ``(shot_id, card)`` for one bg from its shot cards. Among the bg's ``applies_to_shots`` that carry a card entry, choose the best ``card_state`` (pass > needs_review > blocked); ties break on ``applies_to_shots`` order (earliest wins). Returns ``(None, None)`` when the bg has no card target. rkN card_stater)r9rr@r8r) r card_indexrby_shotr best_shot best_cardbest_prirKcardpris r5_select_anchor_cardrsR$$U+1rG##E*0b556HIORG#I*.IH{{3w<($% "&&txx '=qA >HG II i r4cV| ddddd|ddSt|||\}}| ddddd|ddS|jd }t|jd xsd}t|jd xsd}|tvr d }|xsd }n|dvr|sd }d}n |dk(rd}n|}|xsd|||||ddS)z?Resolve the non-reuse (self) projection fields for one bg node.ru not_available projection_subsystem_unavailableFrrrrnot_applicableno_projection_card_targetrcard_idfallback_reasonrprojection_card_invalid)rrmissing_projection_card_idr)rr9rr) rrrrrstater raw_fallbackfallbacks r5_resolve_self_projectionrs "$$&%4/Q,1).  / =MND | "$$&%5/J,1).   HH\ "E$((9%+,Gtxx 128b9L ((<#< * *7 / &(.B%!(!&+3(-%*  r4c i}i}t|dD]}t|jdxsd}|jd}t|jdxsd}|tk(rL|rJ|j|} | ddddd|d d } n:| d tvr ddddd |d d } n$t | } || d <d | d<nt |||} tD] } | | || < | ||<| d } |j| ddz|| <|d|ifS)uStamp per-node projection-card fields onto a routed plan (C3). ``card_index``: ``{bg_id: {shot_id: {card_state, card_id, fallback_reason}}}`` assembled by the step from the ``shot_projection_card`` checkpoint, or ``None`` when the projection subsystem is unavailable (card step OFF / checkpoint absent). No card content is re-derived here — the C2 gate already ran. Reuse inheritance (wiring brief §8 decision-lock, Codex C3 consensus #2) is FAIL-CLOSED: a ``reuse_existing_plate`` node copies the resolved projection fields of its render target (the bg that actually produced the pixels), then re-points provenance with ``projection_card_source_bg_id=reuse_target_bg_id`` and ``projection_card_inherited=true``. It NEVER forges a ``pass`` — a blocked / needs_review target is inherited verbatim, and a target whose projection cannot be resolved yields ``not_available``. Returns ``(nodes, summary)``. Nodes are mutated in place — additive fields only; the existing node shape is untouched. Iteration runs in ``node_index`` order so a reuse target (always an earlier render_new_plate node, per the router) is resolved before any child that inherits from it. c&|jddSNrrr9)rs r5r,z4enrich_nodes_with_projection_cards..PsAEE,,Br4r-rrurvrwrreuse_target_missingTrrreuse_target_projection_missingrrrrrMprojection_card_state_counts)rrr9rrr8rr) rrrresolved_by_bgcountsrrrv reuse_targetrifieldsr.rs r5"enrich_nodes_with_projection_cardsr1s]:13NFu"BCDHHW%+,1 488$89?R@ / /L#'' 5F~')*,,.-<7M4@15/08LL')*,,.-<7X4@15f9E566:23-%!1F *Cs DI* &u./ 5!,q0u aDb 16: ::r4c|xsijdxsijdxsi}i}|jdxsgD]}|jddk7r|jd}t|trt|trJ|jd|jd|jd |jd f||<|S) z{marker_number: (horizontal_band, depth_band, visibility, confidence)} for the ``base`` markers of a C2 card envelope. transient / ignored_state_overlay markers are dropped; only integer marker_number entries are kept.r vlm_output visible_items marker_layerbase marker_numberhorizontal_band depth_band visibility confidencers) card_entryvlmrBitmns r5extract_base_bandsrs  " ! !& ) /R 4 4\ B HbC02Cww'-2- 66. !V +  VVO $"c"jT&:  FF$ % FF< FF< FF<  B . Jr4g333333?floatBAND_CONFIDENCE_THRESHOLDvisiblepartial_BAND_VISIBILITY_OK)leftright)rrzFrozenSet[Tuple[str, str]]_HORIZONTAL_OPPOSITE) foreground background)rr_DEPTH_OPPOSITEc Zt|t|z}g}g}g}t|D]}||\}} } } ||\} } }}|| ftv}| | ftv}|s|s0| tvs|tvr|j |d| |fVt | ttfr@t | ts0t |ttfrt |ts | |ks||kr|j |d| |f|r|j |d|| f| | f| |ff|j |d|| f| | f| |ff|||fS)u?D5 corroboration between two cards' base bands. Returns ``(hard, depth_diagnostics, guarded)``: - ``hard``: horizontal ``left↔right`` contradictions that pass the D5 gate (same base marker both sides, both visibility∈{visible,partial}, both confidence>=threshold). These DO withhold a reuse. - ``depth_diagnostics``: depth ``foreground↔background`` contradictions that pass the same gate. DIAGNOSTIC-ONLY — canonical render_action unchanged. - ``guarded``: opposite-band markers excluded by visibility / confidence. rr horizontaldepth) rrrrrrXr@rrrY) cur_bands tgt_bandsconf_thresholdsharedhard depth_diagguardedrh1d1v1c1h2d2v2c2opp_hopp_ds r5base_band_contradictionsrsU^c)n ,FD JGVn"2BB"2BBR00RO+  ( (B6I,I NNB b"5 6 2U|,"d#b3,/"d#N"N" NNB b"5 6   KK\B8b"XBxH I   r7RHr2hRI J12 W $$r4cZd}t|t|zD]}||\}}}}||\} } } } |tvs| tvr(t|ttfr@t|t s0t| ttfrt| t s ||ks| |kr|| ft vr|dz }|S)u Count base markers that POSITIVELY corroborate two cards' shared POV. A marker counts only when it is present on both sides, both visibility∈{visible,partial}, both confidence>=threshold, and its ``horizontal_band`` does NOT conflict (left↔right). This is the positive evidence ``shareable_card_corroborated`` requires (brief §5) — two pass cards with no shared base marker, or only guarded markers, yield 0 (geometry-only). depth agreement is not required (depth is diagnostic-only). rrM)rrr@rrrYr) rrrcountrr_d1rrr_d2rrs r5 count_corroborating_base_markersrs E)ns9~-#B-CR#B-CR ( (B6I,I 2U|,"d#b3,/"d#N"N"  8+ +   !." Lr4c t|||\}}t|tsy|jddk7ry|jd}|jdxsi}|r|jd|k7ryt |}|xsdS)u③ self-card band prep — base bands of one bg's anchor card, or None. Returns ``None`` (band evidence unavailable → withhold impossible, fail-safe to reuse) UNLESS the anchor card is a trustworthy ``pass`` card whose envelope ``card_id`` re-joins the index entry's ``card_id`` (brief §7-C, D2: pass only, no forged-pass band). Reuse is decided BEFORE C3 enrich, so this selects the anchor itself rather than reading a stamped ``anchor_shot_id``. rNrrrr)rr@r8r9r)rcard_content_indexr_shotrDrenvelopebandss r5_self_card_base_bandsrs' 2EULE5 eT " yy&(ii "Gyy &BH hll9-8 u %E =Dr4)rrrc t||\}}d|d<s||fS|xsiidfd }g}|D]} | jdtk7r|| jd} || jd} | r| sOt| | |\} } }| rZ| jd}t| d<d| d<d | d <|j | jd|| Dcgc]}|d c}d t | | |dkDrd | d <| s| Dcgc]}|d c}| d<t||d<|r!||d<td|D}||d<||d<||fScc}wcc}w)uk④ card-aware router — geometry route + horizontal-band withhold. Runs the deterministic geometry/LLM-signal router first, then (only when a projection card content index is available) re-decides each ``reuse_existing_plate`` node: if the reuse node's anchor card and its render target's anchor card carry a D5 horizontal ``left↔right`` contradiction, the canonical render_action is WITHHELD to ``render_new_plate`` (the withhold is the canonical SOT — brief §4 order ④). depth conflicts are recorded as a diagnostic only. With no card index this is a behavioral no-op == baseline ``route_render_actions`` (brief §10 default byte-identical). A reuse node is never the reuse target of another node (router earlier-only rule), so withholding it never invalidates a downstream inheritance. WITHHOLD-ONLY (Finding 2, 2a lock): this pass only CLOSES reuses; it never re-opens a reuse the baseline router already rejected. If A→new, B reuses A but is card-withheld to new, and C low-delta-targets B, the baseline router has already downgraded C→B as reuse-of-reuse (render_new_plate + diagnostic, 2026-09-19: **내림이지 실패가 아니다**); that is PRESERVED here — C stays render_new_plate, fail-closed. Re-opening a withheld target's downstream reuse is future route_v3 / 2-pass router work. )rrrcard_withhold_countc^t|tr|sy|vrt||<|S)N)rrr)r@rr)bg band_by_bgr readinesss r5_bandsz'route_render_actions_v2.._bandsGs="c"" Z 2-?!*JrN"~r4rvrrwruhorizontal_band_conflictcard_withhold_reason)rwithheld_reuse_target_bg_idmarkerscard_corroboratedplate_corroborationdepth_band_conflict_diagnosticcard_withhold_eventsc3RK|]}|jdtk(sd!ywrvrMNr9rr~rs r5rz*route_render_actions_v2..vs% !!7;N!NAv''ryrz)rz Optional[str]r{.Optional[Dict[int, Tuple[Any, Any, Any, Any]]]) rr9rrrrXrrsum)rrrrrrsummaryreventsrcur_btgt_brr_guardedrhd final_reuserrs ` @@r5route_render_actions_v2r!s<+HOFG%&G !" w &BILNJ$&F  55 !%8 8 quuW~&quu123E %= 5.& "j( %%,-C!2Ao &(A" #(BA$ % MMw/2*./$QAaD$/ 0unMPQQ+>'(EO6PZqtZ6P239<&)[G !" *0&'   (3#$!,  7?/07Qs  E E)plate_group_idplate_anchor_bg_idplate_anchor_shot_idplate_shareabilityneeds_new_platePLATE_PARTITION_FIELDSci}i}|D]}|jd}|jdtk(}|r|jdn|}t|tr|r|n|}||d<||d<| |d<|r"|j |gj ||jdr||k(s|||<|D]}|d}|j|}|rt|jdxsd nt|jdxsd |d <|jdrd |d <q|j|xsg}|dr$|sd |d <t d|D} | rdnd|d <|jddk(rdnd|d <ddlm} t|Dchc]}|d c}t| d|Dd} || fScc}w)uStamp PLATE_PARTITION_FIELDS as a mirror of the canonical render_action. ``plate_group_id`` / ``plate_anchor_bg_id`` = the bg that produces the plate pixels (self for ``render_new_plate``, the reuse target for ``reuse_existing_plate``). ``needs_new_plate`` = ``render_action == render_new_plate``. ``plate_shareability`` (brief §5 vocab): - ``not_shareable_card_withheld`` — a node carrying ``card_withhold_reason`` (a reuse that horizontal-band conflict flipped to render_new_plate), - ``exclusive`` — a solo render_new_plate group (no reuse member), - ``shareable_card_corroborated`` / ``shareable_geometry_only`` — a group with ≥1 reuse member; ``card_corroborated`` iff any member resolved its reuse via a passing card on both sides (``plate_corroboration`` stamped by ``route_render_actions_v2``), else geometry-only. Nodes are mutated in place (additive). The render_action SOT is untouched. rrvrwrrrrrrurnot_shareable_card_withheldr exclusivec3DK|]}|jddk(yw)rrNr)r~ms r5rz)mirror_plate_partition..s(#$EE/04GG$rshareable_card_corroboratedshareable_geometry_onlyrrrCounterc3&K|] }|d ywrNr3rs r5rz)mirror_plate_partition..s "Fs F>)ref_tree_parentsref_role_per_parentrender_order_indexmax_refsREFERENCE_DAG_FIELDSspace_continuitystyle)rr r rzDict[str, str]_MODE_REF_ROLEc P|Dcgc]}|jds|}}dd}tt||D] \}}||d< |Dcic]K}t|jdtr*|dr%|dt |jdxs|dM}}|D]}|jdxsi}|jdxsg}t j|jd }|jd} g} i} |D]n} | jd } t| tr| s'|j| | }|| k(s|| vrC| j ||r|| |<t| tk\snn| |d <| |d <t|d <|dt|ifScc}wcc}w)ufStamp REFERENCE_DAG_FIELDS onto the fresh-plate nodes (⑦). Only ``needs_new_plate`` nodes are DAG nodes. ``ref_tree_parents`` are the ``selected_refs`` canonicalized to their rendered-plate anchor bg ids (each ref mapped through ⑥ ``plate_anchor_bg_id`` so a reuse alias resolves to the fresh plate it copies), deduped and capped at ``MAX_REFS_PER_BG`` distinct parents; ``ref_role_per_parent`` maps each parent to ``style`` / ``space_continuity`` derived deterministically from the node ``mode``; ``render_order_index`` is the node_index topological order among fresh plates. rcl|jd}t|trt|ts|SdSrrsrrs r5_idxz!build_reference_dag.._idx- UU< C(B1ErL1Lr4r-r4rrrrrrr2r3r5dag_node_countrDict[str, Any]r{r) r9rWrr@rr9rXrr)rrfreshr=order_iplate_anchor_by_bgrrroleself_bgparentsrolesrrbcanons r5build_reference_dagrKs :1'8!9QE :M u$ 78 ") 9*A aeeGnc *qz ' C23AqzBB* %%,-3;;/52!!!%%-0%%. "C%Bb#&b&**2r2E5G#3 NN5 !#e 7|.!( #(  '* /2 #SZ0 00_ ;"*sFF AF#) rvrwrr2r3r4r5rrr_PARTITION_CANONICAL_FIELDSspace_partition_planRENDER_ACTION_SOURCE_PARTITIONgeometry_routeRENDER_ACTION_SOURCE_GEOMETRY_PARTITION_REF_ROLEct|tsy|jd}t|tr|sy|Dcgc] }||vs| }}|r"dddjt |ddfS|jd }t|tsy |Dcgc] }||vs| }}|r"dd djt |ddfS|jd xsgDchc]4}t|tr"|jd r|jd6}}t |Dchc]}|| c}|z } | r'dddjt t | ddfSycc}wcc}wcc}wcc}w)u_Decide whether the plan can drive the canonical surface (fail-closed). Usable iff it is a dict whose ``render_actions`` AND ``node_assignments`` both cover EVERY plan-node bg, AND ``plate_groups`` provides an anchor for every group those bgs are assigned to. The override consumes all three, so checking only ``render_actions`` would let a partial plan proceed with silent fallback-like defaults (``gid=bg`` / ``anchor=bg``) — a half-consume that can mis-group a reuse node (Codex review hardening). Returns ``(usable, fallback_reason)``; the reason is empty when usable. )Fpartition_plan_missingrender_actions)F partition_plan_no_render_actionsFzpartition_plan_uncovered_bgs:,Nnode_assignments)F"partition_plan_no_node_assignmentszpartition_plan_unassigned_bgs: plate_groupsr rz$partition_plan_missing_group_anchor:Tru)r@r8r9joinrmapr) rM node_bg_idsrTr uncoveredrX unassignedganchored_groupsmissing_groupss r5_partition_plan_is_usablerdYs *D 1.)--.>?N nd +>8)FkR~-EkIF5chhvi?P6Q5RSTXUXYYY+//0BC & -:*I{b8H.H"{JI6sxxz@R7S6TUVZWZ[[['**>:@b@@A a 155#8 @ (34 " "  4FN_diagnostic`` and then — * ``render_action`` / ``reuse_target_bg_id`` / ``needs_new_plate`` KEEP the shot_aware camera-aware decision; partition NEVER promotes ``render_new_plate`` -> reuse. It only vetoes a reuse whose target lands in a DIFFERENT partition group (cross-zone false reuse) back to render_new_plate. Same-group reuse is preserved; same-group NEW stays NEW with anchor lineage (= derive: same physical space, different angle, fresh plate referencing the anchor). ``partition_cross_group_reuse_vetoed`` flags a vetoed node. * ``plate_group_id`` from ``plan.node_assignments``; ``plate_anchor_bg_id`` = the group's anchor, * ``ref_tree_parents`` from ``plan.ref_tree_parents`` (already capped at max 2 anchors, copy-less reuse aliases excluded), ``ref_role_per_parent`` = ``space_continuity`` per parent, ``max_refs`` = 2, * ``plate_shareability`` = ``exclusive`` (solo group) / ``shareable_partition`` (grouped), * ``render_order_index`` recomputed topologically over the NEW fresh set. Each node is stamped ``render_action_source = space_partition_plan``. fail-closed: an unusable / uncovered plan leaves every field exactly as the wave4 pipeline produced it and stamps ``render_action_source = geometry_route`` + ``partition_fallback_reason`` (Codex condition 4 — no half-consume). Returns ``(nodes, summary)`` where summary carries the post-partition canonical counts (Codex condition 3) plus the applied/fallback decision. c3K|]E}t|jdtr$|jdr|jdGywrNr@r9rrs r5rz-apply_space_partition_plan..;, %1 aeeGnc *quuW~ gA A render_action_sourcepartition_fallback_reasonFappliedrr2rXrZrr rurM member_bg_idsrrvrw geometry_ _diagnosticTrrNr3r5shareable_partitionrr"partition_cross_group_reuse_vetoedcl|jd}t|trt|ts|SdSrrsr<s r5r=z(apply_space_partition_plan.._idxr>r4r4r-r@)rdrdrP_partition_summaryr9r@rrrrLrrrQrNrWr)rrMr^usablerrplanplan_ref_parentsrXr) size_by_groupragidr sa_action sa_targetfr-veto_cross_group target_gid final_action final_targetr+rrGrBr=rCs r5apply_space_partition_planrsD#,, %,#K8kFO A(EA$ %-B?QUU?%;%Ar!BB c , UU7^EE/*?.? 239r: ,A,-EE!HA !K( )-""2&S)ccr $$S"- ! + + )--i8J*c*zS/@-@)l ->l #' ):B,L#66)/". #+| ! "(  033B7=2=0= C(Q=00@B ' DK#LGqA':$:G#L  '* %2%6%6sA%>%B !  %C !)+ %&2B ./gn :1'8!9QE :M uu&'&*A" # u$ 78 ") 9 $UD"M MM70$M ;s-L L%.L*L*c ddlm}td|D}td|D}||||t|Dchc]}|j dc}|t |d|DdScc}w)usPost-partition canonical counts (Codex condition 3) recomputed from the FINAL nodes — never the legacy basis.rr c3RK|]}|jdtk(sd!ywrrrs r5rz%_partition_summary.. "R5aAEE/$:>Q$Q5rc3DK|]}|jdsdywrrMNrrs r5rz%_partition_summary.. =5aAEE*;$<5  rc3>K|]}|jdywr#rrs r5rz%_partition_summary.. @%QQUU/0%)space_partition_appliedspace_partition_fallback_reasonryrzr$r?r%)r(r!r rr9r8)rrnrr0reuserBrs r5ruru s} 0 R5R RE =5= =E#*+:" 5!I5a!%%(8"95!IJ%) @%@ @&    "JsA1dwelling_zone_mapRENDER_ACTION_SOURCE_ZONE_MAPcxt|tsy|jdry|jd}t|tr|sy|Dcgc] }||vs| }}|r"dddjt |d d fS|Dcgc]Y}t|j|tr6t||jd t r||jd s|[}}|r"dd djt |d d fS|Dchc] }||d  }}t |d kryycc}wcc}wcc}w)uDecide whether the dwelling zone map can drive the canonical surface. Usable iff ``zone_plan`` is a NON-synthetic dict whose ``bg_zone_assignments`` cover EVERY plan-node bg with a non-None ``zone_id``, AND those node bgs span >= 2 DISTINCT zones. A single zone has nothing to consolidate, so the legacy ``apply_space_partition_plan`` path stays byte-identical (Codex: single_zone skip). The synthetic fixture asserts nothing and must never drive the surface. Judged over the node bgs only — a zone_map may carry bgs with no staged shot. Returns ``(usable, fallback_reason)``; the reason is empty when usable. )Fzone_plan_missing synthetic)Fzone_plan_syntheticbg_zone_assignments)Fzone_plan_no_assignmentsFzzone_plan_uncovered_bgs:rVNrWzone_idzzone_plan_null_zone:r)Fzone_plan_single_zoner[)r@r8r9r\rrr) zone_planr^ bg_assignrr_ null_zonedistinct_zoness r5_zone_plan_is_usabler6 sU i &)}}[!+ 34I i &i0)AkRy-@kIA0&:K1L0MNtPSTTTB y}}R($ /9R=,,Y7=" !!), ,SXXfY6G-H,IJ4CPPP9DE2imI.NE >Q- #BFs D-D-AD2 D7cdfd d fd }tfd|Ds|jd|tt||dj dS) uPick the single plate anchor for one zone from its member nodes. Preference (each tier breaks the prior tie), per the Phase 2 design: 1. a dossier clean-background candidate (the anchor plate must be clean); 2. a node already routed to a fresh plate — an identity anchor or a ``render_new_plate`` render_action — over one routed to reuse; 3. lower ``node_index`` (stable, earlier in the graph walk); 4. higher VLM zone-assignment confidence; 5. stable ``bg_id``. When NO member is a clean candidate this does NOT fail — it still returns a stable anchor and appends ``zone_anchor_no_clean_candidate:`` to ``diagnostics`` so the visual gate sees it (never hidden like a synthetic). cj|xsijd}t|ttfrt|ts t|SdS)Nrg)r9r@rrrY)rrrs r5_confz!select_zone_anchor.._confu sI $ $R ( .B 3 3L A%a#u6z!T?RuQx[X[[r4cP|jd}|v}t|jdxs|jdtk(}|jd}t|trt|ts|nd}|rdnd|rdnd|t | t |fS)NrrrvrrrM)r9rYrr@rr)rrin_cleanis_freshrrr s r5_rankz!select_zone_anchor.._ranky s UU7^66;<= EE/ "&7 7 UU< b#&z"d/CRAqAq  3r7^O G   r4c3DK|]}|jdvywrgr)r~rr s r5rz%select_zone_anchor.. s#AHAg77s zzone_anchor_no_clean_candidate:r-rr)rrr{r)rrAr{r )r'rXrrr9)r.rr rrGrrs `` @r5select_zone_anchorr_ s_,\ AH  . rrc3DK|]}|jdsdywrrrs r5rz _zone_summary.. rrrc3>K|]}|jdywr#rrs r5rz _zone_summary.. rr) rrryrzr$r?r%zone_map_appliedzone_anchor_diagnostics)r(r!r rr9r8r)rrnrrr0rrBrs r5 _zone_summaryr s0 R5R RE =5= =E#*+:" 5!I5a!%%(8"95!IJ%) @%@ @& $#'(:(@b#A   "JsBr ctd|D}t||\}}|s%|D]}t|d<||d<|t|d|fS|d}i}|D]:}||j dd} |j | gj |<g} i} t|D]} t|| | ||| | | <|D]}|j d} || d} | | } tD]}|j ||d |d <| | k(}|rtnt|d <|rd n| |d<||d<| |d<| |d<g|d<i|d<t|d<t|| dkDrdnd|d<t|d<d |d<| |d<| |d<|Dcgc]}|j ds|}}d d}|D]}|j drd|d<tt||D] \}}||d< |t|dd | fScc}w)!uhApply the dwelling zone map: EXACTLY ONE plate per zone (Phase 2). Per zone, ``select_zone_anchor`` picks the single plate anchor. The anchor renders a fresh plate (``render_new_plate`` / ``needs_new_plate=True``); every same-zone non-anchor bg ALIASES it (``reuse_existing_plate``, ``reuse_target_bg_id`` = anchor) and carries NO ``ref_tree_parents`` — the alias is a reference, not a derive (the user's hard rule: one physical space = one plate; per-shot angle/character is Phase 3 i2i off the one plate). Each node snapshots its prior canonical fields under ``geometry_ _diagnostic`` (same visual-gate traceability as the partition path) and is stamped ``render_action_source = dwelling_zone_map``. Additionally each node gets the Phase 3 contract ``zone_id`` + ``zone_plate_bg_id`` (the one plate every bg in the zone resolves to). ``render_order_index`` is recomputed over the fresh anchor set only; aliases are not DAG nodes (``None``). fail-closed: an unusable / uncovered / single-zone / synthetic plan is a NO-OP — every field is left as the upstream pipeline produced it and stamped ``render_action_source = geometry_route`` + ``partition_fallback_reason``. (In production this path is selected only when the plan is usable; the NO-OP is a defensive guard.) Returns ``(nodes, summary)``. c3K|]E}t|jdtr$|jdr|jdGywrgrhrs r5rz/apply_dwelling_zone_map_plan.. rirjrkrlFrmrrr)r.rr rrGrprqrvrurwrrrr2r3r5rMrrrrzone_plate_bg_idcl|jd}t|trt|ts|SdSrrsr<s r5r=z*apply_dwelling_zone_map_plan.._idx r>r4Nr4r-T)rnrrr@)rdrrPrr9r&rXrrrLrrrrrrW)rrr r^rvrrrmembers_by_zonezidranchor_by_zonerr-r}rrBr=rCs r5apply_dwelling_zone_map_planr s8#,, %,#K39kJFO A(EA$ %-%B !  %B !)+ %&) & 16 :1'8!9QE :Muu&'&*A" # u$ 78 ") 9 - tR-  ;s 6G) G)c D||sdnddgidt|ddddd|dgdS) NrfailedrFrRrGrimagellmrrC shot_aware_bg_render_plan_statusgraph validatorsreal_api_call_countsrsproduction_clearrG)rrCrsrms r5 _empty_planr sEDL,< 2%*> +,Aa @*!  r4no_viable_camera_look_at_pairc  t|ts"tdt|jdi}dD]@}|j |}t|ts%td|dt|jdi}|j D]\}}d}t|tr t|}t||k(}|std|d|d t|ts(td|d |d t|jd|D]M} t| ttfr!t| d k(rtd | Dr:td|d |d| dt|||<|||<C|d} |d t fd| j D} t!| | | dS#ttf$rYwxYw)uPviable unit 존재 여부 — validator 와 동일한 same-unit pair SOT. validator 는 한 노드의 camera_unit 하나로 camera/look_at 두 후보 배열을 함께 조회하므로, 전역 합계가 아니라 **같은 u** 에서 양쪽이 비어 있지 않은 unit 이 하나는 있어야 계획 가능하다 (Codex: camera= {1:[..]}, look_at={2:[..]} 처럼 전역 nonzero 여도 공통 unit 0 이면 불가). malformed(비 dict/비 list/비 정수쌍 cell)=ShotAwareBgRender PlanError fail-closed — 상류 계약 위반을 not_applicable 로 세탁 금지. z'geometry malformed: expected dict, got z (fail-closed))rrz geometry.z malformed: expected dict, got u@ (fail-closed — upstream contract failure, not not_applicable)Fz unit key ur malformed: expected canonical integer string (validator str(camera_unit) 조회로 도달 불가 — fail-closed)[z ] malformed: expected list, got rc3pK|].}t|txrt|t xr|dk\0ywrNr!)r~xs r5rz1assess_camera_lookat_viability..w sF"&A#1c*# *1d 33#F#"&s46z] malformed cell uZ: expected [int>=0, int>=0] — 응답 schema minimum=0 이라 선택 불가 (fail-closed)rrc3\K|]#\}}|dkDrj|ddkDr|%ywrr)r~ur look_countss r5rz1assess_camera_lookat_viability.. s6(da q5[__Q*Q. (s),)viable viable_unitscamera_candidate_countslook_at_candidate_counts)r@r8r.typer/r9r?rr TypeError ValueErrorrrrrrrY) r>rnamemappingper_unitr6cells canonical parsed_unitr$ cam_countsrrs @r5assess_camera_lookat_viabilityr8 sD$ h %(5H~&&'~ 7  )+F,,t$'4(,D6!@=))*+88  $&"==?KD%I$$9"%d)K!$K 0D 8I0vZx8PP eT*0vQth/!!%e!5!5 6nFtdE]3D Q"& 5#D64(2C(#NN !ZHTNO+P t ij9:J;xsg|d>z|z|d><t7|d?xr|d/|d?<|d?rd nd}|j9d@d}g} d}!t|t"r| jdA|idB}!|j9dCd}"t|"t"r| jdD|"idB}!||dt |i|d$|!d$d%| t7|d?xr|dE| d&S#t$rN}tt|dd}|ddgid d!t|j d"|gd#d$|d$d%| d gd&cYd}~Sd}~wwxYw)FuBuild the per-fp shot-aware bg render plan. ``llm_provider`` is a dependency-injected callable. When ``None`` (default in production) the planner returns a structurally-empty plan with ``status='not_applicable'`` and a diagnostic — i.e. no LLM call is made. When provided, it is invoked as:: llm_provider( fp_id=..., dossier=..., geometry=..., shot_readiness=..., candidate_catalog=..., ) -> {"graph": {"nodes": [...]}} The output is validated against ``validate_llm_output``; on failure the plan is marked ``failed`` with the validator diagnostics surfaced. ``projection_card_index`` (metadata-only ``{bg:{shot:{card_state, card_id, fallback_reason}}}``) feeds the C3 enrich pass (⑤). ``card_content_index`` (the envelope-bearing ``{bg:{shot:{card_state, card_id, card}}}``) feeds the card-aware router (④) for D5 horizontal-band withhold. Both default ``None`` (projection subsystem OFF) — the router is then a baseline no-op and enrich stamps ``not_available``. The 3a/3b mirrors (⑥/⑦) run regardless. rr>rsrvrrwrc3BK|]}t|ts|ywrr)r~bgids r5rz+build_render_plan_for_fp.. s6 ,T 40ED_sc3HK|]\}}|jdr|yw)rzNr)r~rrDs r5rz+build_render_plan_for_fp.. s.& =eyy rrcompletion_call_countrMrrFzllm_provider raised: r}rrrrz llm_provider returned non-dict (rjrc3DK|]}t|tr|r|ywrr)r~bids r5rz+build_render_plan_for_fp..; s- >   c3 C  ranchor_selection_metadatacandidate_bg_ids)rCrrr>rsrr )rrrrrxryr)rrrrr$r%r?c3K|]E}t|jdtr$|jdr|jdGywrgrhrs r5rz+build_render_plan_for_fp.. s;1 %1 aeeGnc *quuW~ grjrrrTrrrGrR_w20f9_retry_metadataw20f9_camera_validator_retryr_graph_anchor_retry_metadata#w20f10_graph_anchor_validator_retryrQ)r9rdrr@rrr?rXrrr#CAMERA_LOOKAT_NOT_APPLICABLE_REASON Exceptionrgetattrrr/r8r.r`rrr1rKrrrrYpop)#rC planner_inputrrrrMrrr>rsrrrenderable_listrrmrB viability llm_outputexc_fail_llm_callsrr rroutingprojection_summarypartition_summary dag_summaryzone_node_bg_ids sp_summary zone_diagsru retry_metadiagnostics_blockllm_call_count ga_retry_metas# r5build_render_plan_for_fpr sTI&GZ(H#''(99EO"#34N%. 3 4 :@@B&N %(()<=O/D%=1,56 ,6 - &&  ##H-3::<&  H   d #+<  H  **:6<"=+  3C ./ /x8I X +A 3C ./ / ()(1)(+(1*),*  %&  +,  3C ./  !)+//0CDJ  : j$ '(.tJ/?/H/H.I K  ^^G $ * / / 8 >BE 5> >[[4 5 ; @ @"    > 5!%%'+&CJ--(,,X6<" NE7 .5".J)*'..A&BJ"#(/ 4I1(MJ$% !C((,,X6<"!E  2D&2J-. 6e<E ,U3E;&78K&LJ"#.?#/J*+$//?#@J (11 %1(!5#"" 9 9*G z 7 ' z-77P,QJ()4>)5J01+,+55H*I &'*45H*I &'2< '3 ./(22B'C #$15 -.?W?8$? JZ')34F)G %&*..)BCIrJ 0: ,- Z^^M * 0b1 -  !  } +/*+ 0 . /+J&' - .   7>J.0N*d#  "@*!MNNN#A4HM-&  2M B D,24;' *+N1 M*! . / B@A ) _  gc+BAFG08r]).+DI,>,>+?r#G ?1% / %   s0 Q?? SAS SS)r:rAr{Dict[str, Dict[str, Any]])rArAr{r)r]rArGOptional[Dict[str, Any]]r{r)rk List[str]rlrr{z7Tuple[bool, List[str], List[Dict[str, Any]], List[str]])r:rArArArrArrAr]rArqrr{r)rrr{rY)rList[Dict[str, Any]]r{Tuple[bool, List[str]])rr rrr{r )r>rAr{z Tuple[Dict[str, int], List[str]])rCrrr rrr{r )rr r Optional[FrozenSet[str]]r{r )rr r>rAr{r )r$rr{rY)r$rr0rr{zOptional[List[int]])rr r>rAr{z1Tuple[List[Dict[str, Any]], List[Dict[str, Any]]])rsrr{r )rCrrr rrr>rArsrrr r r r{rA)rrArrr{zFrozenSet[int])rhrArirArrAr{rY)rr rrAr{+Tuple[List[Dict[str, Any]], Dict[str, Any]])rrr$Dict[str, Dict[str, Dict[str, Any]]]rrr{z.Tuple[Optional[str], Optional[Dict[str, Any]]])rrr.Optional[Dict[str, Dict[str, Dict[str, Any]]]]rrr{rA)rr rrrrr{r )rrAr{$Dict[int, Tuple[Any, Any, Any, Any]])rrrrrrr{z,Tuple[List[Tuple], List[Tuple], List[Tuple]])rrrrrrr{r)rrrrrrr{r) rr rrArrrz#Optional[Dict[str, Dict[str, Any]]]rrr{r )rr r{r )rMrr^rr{Tuple[bool, str])rr rMrr{r )rr rnrYrrr{rA)rrr^rr{r) r.r rrr rrrArGr r{r) rr rnrYrrrzOptional[List[str]]r{rA)rr rrr rr{r )rCrrsrrmr r{rA)r>rAr{rA)rCrrrArz'Optional[Callable[..., Dict[str, Any]]]rrrrrMrrrr{rA)Wr2 __future__rtypingrrrrrr r rdr__annotations__rrrrrrrr"r(r,rr.r;rErgrprrrrrrrrrrrr rr%r3r?rArDr`rfrprrrrrrrrrrrrrrrrr1r6r9rKrLrNrPrQrdrrurrrrrrrrrr3r4r5rs'P#HHH%.%>0 s/5c5 ,3+1S1)2+,*(1!45(n&//N%ONO+ *66?$-1E(E*E EP/-"/-3L/-</-r:>o#o%o$ o ( o ) o7oonR$"R$R$j$"$$4!$"!$7E!$!$H%$P $" $ $p$"p$p$f&&%&R$ $ $# $  $2$"$$25 5$<5 5pK$ K$K$ K$\# ###L5 557 5p$"$$&   .37>Bm m m# m  m  m0m$<mmj ),&$ $  $ ! $  $ NW"W-;W0Wd121QR'SnS+  5 0  4  << <?<0 <  <~P; P;?P;0 P; 1 P;@,$'5&&/I0F&G^G3<)*40/8!#?@/+6,%3,%3,%,%2 ,%d6 3 3   F =0  4 DJN<@5 Z ZZG Z : Z  Z1ZL+J J0Jn)o  2+& ' "<1 <10<1b 0_ '=<%5s5-S-&2&AO&&RGN GN2GN1GNT -1DGN&9s8&'&6D&&R.; !.;.;$2 .; ( .;  .; .;l/3    ,   B5>K g g'g$2 g 1 g^$'3<2'F#XXXB   59*.E E"E EEE3E(EEr4