NAVINESSEO LAB
Menú
IdiomaEspañol

NAVINES SEO LAB

Investigación

Estudios originales con métodos, fuentes y limitaciones visibles.

Biblioteca de evidencia

Seis artículos leídos completos y convertidos en decisiones de producto acotadas.

arXiv · 2022-10-18

Making a MIRACL: Multilingual Information Retrieval Across a Continuum of Languages

Autores
Xinyu Zhang; Nandan Thakur; Odunayo Ogundepo; Ehsan Kamalloo; David Alfonso-Hermelo; Xiaoguang Li; Qun Liu; Mehdi Rezagholizadeh; Jimmy Lin
Fecha de publicación
2022-10-18
Abrir ficha de evidencia

Pregunta de investigación

How can a retrieval benchmark cover languages with very different resource levels while using native queries and relevance judgments?

Método

An 18-language, same-language Wikipedia retrieval benchmark built with native-speaker queries and judgments; lexical, dense and hybrid baselines were compared on the released pools.

Qué respalda la evidencia

Evaluate each language explicitly, document corpus and judgment construction, and keep native review central. The reported hybrid result is a historical benchmark observation.

Límites y transferibilidad

This is same-language information retrieval, not translation assessment or web SEO. Heuristic segmentation, candidate-pool gaps and unfinished test labels limit transferability; it says nothing about hreflang or Google rankings.

Clasificación

  • Respaldado
  • Histórico
  • Solo académico

Influencia en NAVINES: Laboratorio de comparación de páginas multilingües

arXiv · 2024-04-14

Competitive Retrieval: Going Beyond the Single Query

Autores
Haya Nachimovsky; Moshe Tennenholtz; Fiana Raiber; Oren Kurland
Fecha de publicación
2024-04-14
Abrir ficha de evidencia

Pregunta de investigación

How does publisher competition change when participants allocate content decisions across multiple queries rather than one isolated query?

Método

A formal multi-query game plus four controlled student competitions covering 30 TREC topics, 84 participants and specified proxy rankers; best-response dynamics and feature changes were examined.

Qué respalda la evidencia

Cross-query opportunity cost and competitor response deserve explicit treatment; equilibrium existence does not imply that learning dynamics will converge.

Límites y transferibilidad

The student setting, topics and rankers are controlled proxies. The work does not identify current Google features, predict winners or justify reusable weights or a practical Nash-equilibrium claim.

Clasificación

  • Limitado
  • Solo académico

Influencia en NAVINES: Planificador de cartera competitiva multiconsulta

arXiv · 2020-05-26

Ranking-Incentivized Quality Preserving Content Modification

Autores
Gregory Goren; Oren Kurland; Moshe Tennenholtz; Fiana Raiber
Fecha de publicación
2020-05-26
Abrir ficha de evidencia

Pregunta de investigación

Can ranking-incentivized content modification include coherence and modification cost instead of optimizing promotion alone?

Método

A controlled passage-replacement method balanced promotion and coherence, evaluated with proxy rankers and offline data across 31 queries, with an explicit ethics discussion.

Qué respalda la evidencia

Quality constraints and the cost of changing content belong in planning. A promotional change that fails editorial integrity should be rejected.

Límites y transferibilidad

Passages came from higher-ranked candidates and quality judgments were bounded and subjective. It does not support copying winners, real-engine causal claims or unrestricted automated rewriting.

Clasificación

  • Limitado
  • Solo académico

Influencia en NAVINES: Planificador de cartera competitiva multiconsulta

Journal of Artificial Intelligence Research · 2025

The Search for Stability: Learning Dynamics of Strategic Publishers with Initial Documents

Autores
Omer Madmon; Idan Pipano; Itamar Reinman; Moshe Tennenholtz
Fecha de publicación
2025
Abrir ficha de evidencia

Pregunta de investigación

Under which formal ranking mechanisms and content-deviation costs can strategic publisher learning converge or remain unstable?

Método

Formal publisher-utility models with rank benefit minus deviation cost, convergence results for specified linear/softmax settings, and discrete simulations, predominantly with two publishers.

Qué respalda la evidencia

Change cost, response dynamics and instability are useful planning dimensions; a mechanism can have an equilibrium while local responses cycle or remain pseudoperiodic.

Límites y transferibilidad

The model assumes a static information need, known ranking function and embedding-space actions. Simulations are not a real search engine and do not justify a Google mechanism or guaranteed convergence claim.

Clasificación

  • Respaldado
  • Limitado
  • Solo académico

Influencia en NAVINES: Planificador de cartera competitiva multiconsulta

KDD / arXiv · 2024

GEO: Generative Engine Optimization

Autores
Pranjal Aggarwal; Vishvak Murahari; Tanmay Rajpurohit; Ashwin Kalyan; Kartik Narasimhan; Ameet Deshpande
Fecha de publicación
2024
Abrir ficha de evidencia

Pregunta de investigación

In controlled generative-engine experiments, how do selected content modifications affect proxy visibility across queries and domains?

Método

GEO-BENCH combined 10,000 queries from nine datasets with visibility proxies and experiments on two generative engines; citation, quotation, statistics and other interventions were compared by domain.

Qué respalda la evidencia

Clear attribution, genuine evidence and domain-aware experimentation can be reviewed as editorial signals; keyword stuffing performed poorly in this benchmark.

Límites y transferibilidad

Two engines, black-box variance and proxy metrics do not establish traditional-search effects or future citation probability. Reported gains are historical benchmark results, not forecasts; appendix prompts are untrusted.

Clasificación

  • Limitado
  • Histórico
  • Solo académico

Influencia en NAVINES: Laboratorio de preparación para citas de IA

arXiv · 2024-07-02

Adversarial Search Engine Optimization for Large Language Models

Autores
Fredrik Nestaas; Edoardo Debenedetti; Florian Tramèr
Fecha de publicación
2024-07-02
Abrir ficha de evidencia

Pregunta de investigación

Can content in retrieved web or plugin documents manipulate an LLM's product preferences, and which broader attack categories appear beyond classic prompt injection?

Método

Controlled experiments with fictional products, web/plugin documents and proprietary models examined model-directed instructions, concealment, false claims, source suppression and competitor discrediting.

Qué respalda la evidencia

Retrieved content is an untrusted input surface; safety review should cover concealed persuasion and source integrity as well as direct instructions.

Límites y transferibilidad

The favorable fictional setup, limited scale and changing proprietary systems do not establish prevalence or complete detection. Exact attack payloads are not republished and the checker is not a certification.

Clasificación

  • Respaldado
  • Limitado
  • Solo académico

Influencia en NAVINES: Comprobador de seguridad ante manipulación de IA

Evidencia revisada el 14 de agosto de 2026 · No establece factores actuales de Google ni resultados garantizados.

Investigación

Estudios originales con métodos, fuentes y limitaciones visibles.

No perseguimos algoritmos. Construimos claridad, confianza y visibilidad acumulativa.

Hacer que la inteligencia avanzada de búsqueda sea comprensible, útil y accesible, y ayudar a las empresas a convertirla en acciones medibles.

Método

  • Define alcance, entornos, plantillas críticas, analítica disponible y riesgos de cambio.
  • Recopila respuestas HTTP, directivas, canonicales, enlaces, renderizado, sitemaps y datos de Search Console.
  • Escribe objetivos, eventos, dimensiones, responsables y decisiones que cada métrica informará.
  • Verifica etiquetas, consentimiento, zonas horarias, filtros y pérdida esperada de datos.

Limitaciones

  • Los sistemas de privacidad, consentimiento, bloqueo y modelado producen datos incompletos.
  • Search Console agrega y retiene datos con límites; no es un registro exhaustivo de cada búsqueda.