{"id":"9b8b2e9f-fae5-414b-9754-70bd683b62d0","arxiv_id":"2606.11391","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Orthogonal Subspace Carving decouples tensor order from recursion depth by null-space projections, enabling deep symbolic binding in constant-size memories and framing TPR as a Clifford algebra case.","lead":"The paper proposes Orthogonal Subspace Carving (OSC) to bind role-filler pairs in fixed-size order-p tensors by projecting onto null spaces of role bases before aggregation. This keeps memory constant for deep recursion while allowing smaller component vectors via recognition-based retrieval.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Successive exact null-space projections assumed; capacity may collapse if subspaces become too sparse at depth d>3","rationale":"The reader's weakest_assumption directly identifies the same geometric-capacity risk that must be true for the decoupling claim to hold at arbitrary depth. Because the manuscript is now accessible, the concern can be stated more precisely in terms of subspace dimension after successive projections, but the core issue remains unchanged. A single numerical check on subspace volume decay would settle whether the assumption is merely technical or actually fatal to the headline result.","tokens_in":1655,"tokens_out":356,"duration_ms":9208,"concrete_test":"Fix role vectors in R^D with D=1024, bind a balanced binary tree of depth 5 (31 leaves) using the OSC procedure described in §3.2; after each projection recompute the fraction of the null-space volume still available for new fillers (via Monte-Carlo sampling of random vectors orthogonal to the accumulated basis). If the available fraction falls below 1/2^depth at any step, the constant-footprint claim fails for that depth.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim requires that each recursive binding step projects onto the orthogonal complement of the current role basis while leaving a subspace whose dimension still supports superposition of the remaining fillers at the target capacity. The construction implicitly treats these successive projections as preserving sufficient volume for high-fidelity recognition retrieval; if the effective dimension after k projections drops faster than the number of bound items, the superposition noise floor rises and recognition fails. No explicit bound on the minimal subspace dimension after d recursion steps is supplied, nor is a capacity scaling law derived that would guarantee the claim holds for arbitrary depth.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript introduces Orthogonal Subspace Carving (OSC), a binding mechanism for order-p tensor memories in which fillers are projected onto the null space of the current role basis before superposition into a fixed-size tensor. This is claimed to decouple tensor order from recursion depth, permitting arbitrarily deep recursive structures within constant memory while supporting retrieval by recognition rather than reconstruction; component vectors can therefore be orders of magnitude smaller than the memory tensor. The work also presents TPR as a special case of binding in Clifford algebra and supplies a Clifford-algebraic formulation of OSC.","tokens_in":1782,"tokens_out":487,"duration_ms":12615,"significance":"If the capacity bounds hold, the construction would constitute a genuine advance over both classical Tensor Product Representations (exponential growth with depth) and Vector Symbolic Architectures (capacity loss from noisy superposition), enabling high-fidelity symbolic recursion at fixed dimensionality. The Clifford-algebraic unification is a conceptual strength that may open further algebraic generalizations.","major_comments":[{"comment":"Abstract and §3 (method): the central claim that successive null-space projections preserve sufficient subspace volume for high-capacity superposition at arbitrary depth is load-bearing, yet no explicit lower bound on the dimension of the orthogonal complement after d projections, nor a capacity scaling law relating remaining dimension to the number of fillers, is supplied. Without such a bound the recognition-retrieval guarantee cannot be verified.","section":"Abstract, §3"},{"comment":"§4 (capacity analysis): the statement that recognition remains reliable under high superposition is asserted without a derivation showing that the effective dimension after k projections declines slower than the number of bound items; the skeptic's concern that the noise floor rises for d>3 is therefore unaddressed by any quantitative argument.","section":"§4"}],"minor_comments":[{"comment":"Notation for the projection operator P_⊥ is introduced without an explicit definition in terms of the role basis matrix; a one-line equation would remove ambiguity.","section":"§2.2"},{"comment":"Figure 2 caption refers to 'component vectors' but the axis labels use a different symbol; consistency would improve readability.","section":"Figure 2"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the careful reading and constructive critique. The two major comments correctly identify places where the capacity analysis can be made more rigorous; we address each point below and will revise the manuscript accordingly.","responses":[{"response":"We agree that an explicit lower bound on the dimension of the remaining orthogonal complement after successive projections is needed to make the capacity claim fully rigorous. In the revised manuscript we will add a short derivation in §3 showing that, when each role basis has rank at most r and the ambient space has dimension n, the carved subspace after d steps has dimension at least n − d r (under linear independence). We will then state a simple volume-based capacity scaling that relates the number of admissible fillers to the dimension of this carved subspace, thereby supplying the missing recognition-retrieval guarantee.","revision_made":"yes","referee_comment":"[Abstract, §3] Abstract and §3 (method): the central claim that successive null-space projections preserve sufficient subspace volume for high-capacity superposition at arbitrary depth is load-bearing, yet no explicit lower bound on the dimension of the orthogonal complement after d projections, nor a capacity scaling law relating remaining dimension to the number of fillers, is supplied. Without such a bound the recognition-retrieval guarantee cannot be verified."},{"response":"We will expand §4 with a quantitative argument that compares the linear decline in effective dimension (n − k r) against the exponential growth in the number of distinguishable fillers permitted by the tensor-product structure inside the carved subspace. The added derivation will show that the inner-product noise floor remains bounded for d > 3 provided the total carved dimension stays below n, directly addressing the concern about reliability under high superposition.","revision_made":"yes","referee_comment":"[§4] §4 (capacity analysis): the statement that recognition remains reliable under high superposition is asserted without a derivation showing that the effective dimension after k projections declines slower than the number of bound items; the skeptic's concern that the noise floor rises for d>3 is therefore unaddressed by any quantitative argument."}],"tokens_in":1332,"tokens_out":453,"duration_ms":15777,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper's central move is Orthogonal Subspace Carving: before each binding step it projects the filler onto the orthogonal complement of the current role basis, then aggregates into a fixed order-p tensor. This is presented as a way to keep memory size independent of recursion depth. They also show that ordinary tensor-product binding is a special case inside Clifford algebra and give the corresponding OSC version.\n\nThe geometric framing is the clearest new piece. Projecting out the role null space before superposition is a direct way to enforce separation without increasing tensor order, and the recognition retrieval route does let the component vectors stay small relative to the memory trace. That efficiency angle is worth looking at if the projections actually preserve enough volume.\n\nThe soft spot is the one the stress-test flags. Each projection reduces the available subspace dimension. The claim that this still supports high-capacity superposition at arbitrary depth rests on the assumption that the remaining space stays large enough; the abstract and the stress-test note give no explicit bound or scaling law for how fast the effective dimension drops with depth. Without that, or without experiments that track recognition error past depth three or four, it is hard to judge whether the decoupling holds in practice.\n\nThe work is aimed at people already working on neural-symbolic binding and vector-symbolic architectures. A reader who cares about fixed-size structured representations would find the construction useful to think about, even if the capacity math needs tightening.\n\nI would send it to peer review. The motivation is solid and the Clifford reformulation is a clean angle; the referees can check whether the projection argument actually delivers the claimed scaling.","headline":"OSC uses null-space projections to hold recursion depth fixed while keeping the tensor order constant, but the capacity after repeated projections is the part that still needs checking.","tokens_in":2259,"tokens_out":401,"would_cite":false,"duration_ms":17941,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Orthogonal Subspace Carving decouples tensor order from recursion depth for constant-memory deep binding.","keywords":["orthogonal subspace carving","tensor product representations","vector symbolic architectures","recursive binding","null space projections","memory efficiency","Clifford algebra","superposition"],"falsifier":"Measure the number of distinct bound structures that can be reliably recognized after k recursive levels; if recognition accuracy collapses after only a few levels even with exact arithmetic, the constant-footprint claim fails.","tokens_in":2560,"feed_emoji":"🧠","tokens_out":638,"duration_ms":14858,"temperature":0.7,"pith_summary":"Tensor product representations deliver structural fidelity for symbolic reasoning but grow exponentially with recursion depth, while vector symbolic architectures keep fixed size at the cost of noisy superposition. The paper introduces Orthogonal Subspace Carving to bind fillers to roles by projecting each new role basis into the null space of prior roles before summing into a fixed order-p tensor. This geometric separation keeps bound structures orthogonal inside the same memory trace, so tensor order no longer scales with depth. Retrieval switches to recognition of the bound components rather than direct extraction, which in turn permits the component vectors themselves to be far smaller than the overall memory. The construction also recovers ordinary tensor products as a special case inside a Clifford-algebra formulation.","feed_headline":"Fixed-size tensor supports arbitrary recursion depth","feed_subtitle":"Null-space projections carve orthogonal slots so memory order stays constant while binding depth grows.","key_machinery":"Orthogonal Subspace Carving (OSC): successive null-space projections of each new role vector before it is bound and added into the fixed-order memory tensor.","core_discovery":"By projecting role vectors onto successive null spaces before aggregation, OSC maintains a fixed-size order-p tensor while supporting recursive binding to arbitrary depth; retrieval occurs through recognition of the carved subspaces rather than noisy unbinding, and traditional TPR binding appears as the special case in which no projections are applied.","pith_inferences":["The same carving technique might be applied to other binding operations that currently rely on explicit concatenation or concatenation-like growth.","Approximate rather than exact projections could still suffice for moderate depths if the orthogonality requirement is relaxed to near-orthogonality.","Recognition-based retrieval opens a route to hybrid symbolic-neural systems that store structure in fixed hardware memory budgets."],"forward_implications":["Recursive structures of arbitrary depth fit inside a memory tensor whose size is independent of depth.","Component vectors can be orders of magnitude smaller than the memory tensor while still supporting reliable recognition.","High levels of superposition become feasible without the usual capacity penalty of vector-symbolic superposition.","Tensor-product binding is recovered exactly when the projection step is omitted, placing TPR inside the same Clifford-algebra framework."],"fun_headline_variants":["Carving subspaces for constant tensor recursive binding","Orthogonal projections fix tensor size amid deep recursion","Recursive binding in fixed order-p via null-space carving","Decoupling recursion from tensor order with OSC projections"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Exact null-space projections remain feasible and the carved subspaces stay sufficiently populated to sustain high-capacity superposition as recursion depth grows.","fun_headline_variants_meta":{"raw":{"variants":["Carving subspaces for constant tensor recursive binding","Orthogonal projections fix tensor size amid deep recursion","Recursive binding in fixed order-p via null-space carving","Decoupling recursion from tensor order with OSC projections"]},"model":"grok-4.3","cost_usd":0.009867,"raw_usage":{"total_tokens":4347,"prompt_tokens":585,"num_sources_used":0,"completion_tokens":50,"cost_in_usd_ticks":98674500,"prompt_tokens_details":{"text_tokens":585,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3712,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":585,"tokens_out":50,"duration_ms":21584,"temperature":1.0,"reasoning_tokens":3712,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-27T13:54:53.360539+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Measure the number of distinct bound structures that can be reliably recognized after k recursive levels; if recognition accuracy collapses after only a few levels even with exact arithmetic, the constant-footprint claim fails.","supporting_citations":[],"review_version":1}