{"graphSha256":"f29d7b1eedeb88387238d2abda347f810d2179c5fdbead47c3ef48507ab20ca5","node":{"id":"N1833","type":"ficha","title":"Phylons dynamic combinations","url":"https://dakleyer.github.io/perspective-beyond/sources/phylons-dynamic-combinations-n1833/","original":"https://jubap.net/phylons-dynamic-combinations/","aliases":[],"clusters":["net"],"tags":["casos","control-minimo","decision","documentacion","evidencia","memoria-territorio"],"summary":"","commit":null,"sourcePath":null,"commitUrl":null,"documentId":"doc-eba299095fb82d2ea3","tagWeights":{"casos":0.1053,"control-minimo":0.3684,"decision":0.1053,"documentacion":0.1053,"evidencia":0.2105,"memoria-territorio":0.1052},"reading":"JUBAP/Phylons did not attempt an exhaustive evaluation of all predictive-factor states and all of their combinations. It built a dynamic, budgeted search system in which the representation, candidate set, evaluation depth, temporal evidence and active rule portfolio changed over time. The supplied source snapshot confirms four especially important mechanisms. Quantitative factors were expanded into one-sided and bounded predicates at multiple granularities; active predicates were materialized on waves; positive combinations were extended only when every pair of states satisfied a positive performance-interaction relation; and negative exceptions were extended only under complete adverse pairwise constraints. These mechanisms operated alongside occupancy-constrained discretization, multi-horizon occurrence filters, timed worker hand-offs, persistent rule statistics and residual-focused combination discovery.\n\nThe paper formalizes this architecture as an anytime, coarse-to-fine, selectively incremental search over interpretable context rules. The actual cost object is not a simple 2^N space: it depends on the size of the predicate lattice, graph density, maximum rule depth, temporal memories, books, targets and compute budget. Support supplies a safe anti-monotone pruning rule; performance interactions constrain search heuristically; positive bases become cliques in a positive-interaction graph; and exception sets form adverse structures relative to their bases. The result is a code-grounded explanation of how a large semantic-context space was made operational without claiming exhaustive completeness, global optimality or proven minimal contextual sufficiency.\n\nThe optimization was not one pruning trick. It was a stack: encode compactly, materialize once, screen both supportive and adverse states, prune by anti-monotone support, expand only along empirically useful relations, construct exceptions separately, allocate bounded compute, update sufficient statistics incrementally, and keep a slow recovery path running behind the fast path.","readingSource":{"url":"https://jubap.net/phylons-dynamic-combinations/","section":"Abstract","observed":"2026-11-04","sourceSha256":"8a4cc68a2eaa7a0f2f5735aa26bf9b8abcf02d07021c69a765180286bd954165"},"readingSummary":"JUBAP/Phylons did not attempt an exhaustive evaluation of all predictive-factor states and all of their combinations.","contextTokens":466},"relations":[["apoyo:N1833:C03","N1833","C03","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C06","N1833","C06","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C07","N1833","C07","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C08","N1833","C08","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C17","N1833","C17","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C18","N1833","C18","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C23","N1833","C23","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C25","N1833","C25","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C69","N1833","C69","documenta el concepto","",null,"apoyo",""],["apoyo:N1833:C120","N1833","C120","documenta el concepto","",null,"apoyo",""],["documento:D004","N1833","E1654","analogy only","The distinction between safe pruning and heuristic ranking clarifies why application retirement requires its own evidence.",null,"documento","La anti-monotonicidad de soporte no se traslada al valor empresarial. Una aplicación de poco uso puede sostener una capacidad crítica o complementar otras."],["documento:D005","N1833","E1538","hypothesis","An interaction graph could help screen consolidation candidates, provided whole-group constraints are checked separately.",null,"documento","La compatibilidad por pares no garantiza compatibilidad conjunta ni legal. No tratar un clique como autorización para consolidar."],["documento:D007","N1833","E1954","candidate transfer","Residual-focused search could complement Mobility OS repair by revisiting only the part whose validity has changed.",null,"documento","Es una propuesta de correspondencia de mecanismos. Reutilizar estado requiere clave de versión de política, disponibilidad y ventana temporal; cachear sin invalidar puede fallar."],["documento:D012","N1833","E1563","hypothesis","Multiple memory horizons could help distinguish an event-specific reaction from a durable client preference.",null,"documento","No toda ausencia de compra es rechazo; stock, invitación, exposición y precio son confundidores. Los horizontes financieros no fijan los comerciales."],["documento:M025","N1833","T1475","analogy only","A safe search-pruning rule does not justify treating low usage or recognition as evidence that a business capability is dispensable.",null,"documento","Las unidades y propiedades matemáticas son distintas; no trasladar la antimonotonía del algoritmo al valor empresarial."],["documento:G059","GH059","N1833","candidate transfer","A pruning guard should preserve the exact conditions supporting rejection; rounding must not turn inconsistent evidence into a certificate that removes a valid candidate.",null,"documento","Revisión propuesta de código; no se afirma que Phylons contenga ese defecto ni que usara esta reparación de 2026."],["documento:G064","GH064","N1833","analogy only","A changed search question may require only the distinctions not already supplied by the existing observation, under a separately qualified query menu.",null,"documento","El criterio pertenece a la rama PR60 y a modelos finitos; no demuestra optimalidad global de la heurística de 2018."],["documento:R107","N1828","N1833","editorial comparison","For a complementary reading, see [The dynamic combinatorial-search mechanism](https://jubap.net/phylons-dynamic-combinations/).",null,"documento",""],["documento:R110","N1833","N1835","editorial comparison","For a complementary reading, see [Dependency-aware rebuilding after event revision](https://jubap.net/phylons-relabeling-cascades/).",null,"documento",""],["documento:R111","N1833","T1387","editorial comparison","For a complementary reading, see [The sufficient-detector and context-boundary problem](https://tegrity.ai/minimalistic-regime-aware-early-warning-systems/).",null,"documento",""],["documento:sac-rel-1386e021da8f73","GH001","N1833","referencia de la fuente","La fuente enlaza esta lectura en «Phylons» con el rótulo «Dynamic Combinatorial Search».","https://github.com/dakleyer/structural-awareness-contributions/blob/3b4bd71d7f013b6c461d6fc75331008998d65bfb/README.md","documento",""]]}