Pasar al contenido principal

DISCOVERY: COMPUTACION FLUIDA DESCENTRALIZADA CON SEGURIDAD

PID2023-148716OB-C31

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2023
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE VIGO

Resultados relacionados

Resultados totales (Incluyendo duplicados): 11
Encontrada(s) 1 página(s)

Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Decentralized orchestration architecture for fluid computing: a secure distributed AI use case

  • Cajaraville Aboy, Diego
  • Fernández Vilas, Ana
  • Díaz Redondo, Rebeca Pilar
  • Fernández Veiga, Manuel
  • Picallo López, Pablo
Distributed AI and IoT applications increasingly execute across heterogeneous resources spanning end devices, edge/fog infrastructure, and cloud platforms, often under different administrative domains. Fluid Computing has emerged as a promising paradigm for enhancing massive resource management across the computing continuum by treating such resources as a unified fabric, enabling optimal service-agnostic deployments driven by application requirements. However, existing solutions remain largely centralized and often do not explicitly address multi-domain considerations. This paper proposes an agnostic multi-domain orchestration architecture for fluid computing environments. The orchestration plane enables decentralized coordination among domains that maintain local autonomy while jointly realizing intent-based deployment requests from tenants, ensuring end-to-end placement and execution. To this end, the architecture elevates domain-side control services as first-class capabilities to support application-level enhancement at runtime. As a representative proof of concept, we instantiate the architecture through a distributed AI use case; specifically, we consider a multi-domain Decentralized Federated Learning (DFL) deployment under Byzantine threats. Under this setting, we leverage domain-side capabilities to enhance Byzantine security by introducing FU-HST, an SDN-enabled multi-domain anomaly detection mechanism that complements Byzantine-robust aggregation. We validate the use-case workflow via simulation in single- and multi-domain settings, evaluating anomaly detection, DFL performance, and computation/communication overhead., Agencia Estatal de Investigación | Ref. PID2023-148716OB-C31, Xunta de Galicia | Ref. ED431B 2024/41, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Privacy-aware Berrut Approximated Coded Computing for Federated Learning

  • Martínez Luaña, Xavier
  • Díaz Redondo, Rebeca Pilar
  • Fernández Veiga, Manuel
Federated Learning (FL) is a machine learning framework that enhances privacy compared to normal FL, since model training is done across multiple nodes by exchanging only local parameters instead of raw data. Despite this advantage, FL is still vulnerable to some privacy attacks that have been addressed with techniques such as Differential Privacy (DP), Homomorphic Encryption (HE), or Secure Multi-Party Computation (SMPC). These methods need further assumptions that narrow their range of application, exhibiting problems to work with non-linear functions, to perform large matrix multiplications and having high communication and computational costs to manage semi-honest nodes. In this paper, we propose a solution to guarantee privacy in FL schemes that simultaneously solves these shortcomings. Our proposal is based on the Berrut Approximated Coded Computing (BACC), a technique from the coded computing paradigm, adapted here to provide input privacy to FL in a scalable way. In our Private BACC, controlled randomness is introduced into the rational Berrut approximation of a target function so that the input values are hidden and the output function values can still be computed with good approximation. We provide a theoretical bound to the privacy leakage level of private BACC, and further describe its application for computing arbitrary non-linear functions, particularly distributed matrix multiplications. Our numerical results demonstrate that adding privacy in this form outperforms DP in model quality, since it has negligible cost in the precision. Additionally, it beats HE in terms of computational cost, and requires lower computation and communications costs than with SMPC algorithms. Finally, the proposed method supports distributed matrix multiplications, so it can be integrated into a wide class of machine learning systems., Agencia Estatal de Investigación | Ref. PID2020-113795RB-C33, Agencia Estatal de Investigación | Ref. PID2023-148716OB-C31, Instituto Nacional de Ciberseguridad (INCIBE), Xunta de Galicia | Ref. ED431B 2024/41, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Towards efficient compression and communication for prototype-based decentralized learning

  • Fernández Piñeiro, Pablo
  • Fernández Veiga, Manuel
  • Díaz Redondo, Rebeca Pilar
  • Fernández Vilas, Ana
  • González Soto, Martín
In prototype-based federated learning, the exchange of model parameters between clients and the master server is replaced by transmission of prototypes or quantized versions of the data samples to the aggregation server. A fully decentralized deployment of prototype-based learning, without a central aggregator of prototypes, is more robust upon network failures and reacts faster to changes in the statistical distribution of the data, suggesting potential advantages and quick adaptation in dynamic learning tasks, e.g., when the data sources are IoT devices or when data is non-iid. In this paper, we face the challenge of designing an efficient prototype-based decentralized learning network by reducing the overheads in communication and computation. This allows enhancing the scalability of the global system, specially for IoT settings with resource-limited devices. First, we compress the prototype size by applying a clustering algorithm. After that, we filter the prototypes to be disseminate using an information-theoretic measure to share only relevant models or models that provide new knowledge to their neighbors. Then, we define a parallel gossip algorithm to disseminate these models within the learning network. Finally, we define a suitable scheduler able to manage the set of prototypes received to optimize the aggregation phase. In order to validate our proposal we present an analysis of the parallel gossip algorithm regarding the age-of-information (AoI). Our experimental results show the communications load can be substantially reduced without decreasing the convergence rate of the learning algorithm., Universidade de Vigo/CISUG, Agencia Estatal de Investigación | Ref. PID2020-113795RB-C33, Agencia Estatal de Investigación | Ref. PID2023-148716OB-C31, Xunta de Galicia | Ref. ED431B 2024/41
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

HLF-FSL: a decentralized federated split learning solution for IoT on hyperledger fabric

  • Beis Penedo, Carlos
  • Díaz Redondo, Rebeca Pilar
  • Fernández Vilas, Ana
  • Fernández Veiga, Manuel
  • Troncoso Pastoriza, Francisco Manuel
Collaborative machine learning in sensitive domains demands scalable, privacy-aware and access-controlled solutions for enterprise-grade deployment. Conventional federated learning (FL) relies on a central server, introducing single points of failure and privacy risks, while split learning (SL) partitions models for privacy but scales poorly because of sequential training. We present HLF-FSL, a decentralized architecture that combines federated split learning (FSL) with the permissioned blockchain Hyperledger Fabric (HLF). Chaincode orchestrates split-model execution and peer-to-peer aggregation without a central coordinator, leveraging HLF’s transient fields and Private Data Collections (PDCs) to keep raw data and model activations off-chain and access-controlled. On CIFAR-10, MNIST and ImageNet-Mini, HLF-FSL matches the accuracy of a standard server-coordinated FSL baseline while reducing per-epoch training time versus Ethereum-based baselines. Performance and scalability tests quantify the Fabric coordination overhead via a component-level breakdown of SDK-facing latencies and communication volumes; empirically, this overhead increases wall-clock epoch time while preserving the same accuracy-vs-epoch behavior as a FedSplit Learning baseline., Agencia Estatal de Investigación | Ref. PID2020-113795RB-C33, Agencia Estatal de Investigación | Ref. PID2023-148716OB-C31, Xunta de Galicia | Ref. ED431B 2024/41, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Overcoming catastrophic forgetting in tabular data classification: A pseudorehearsal-based approach

  • García Santaclara, Pablo
  • Fernández Castro, Bruno
  • Díaz Redondo, Rebeca Pilar
Continual learning (CL) poses the important challenge of adapting to evolving data distributions without forgetting previously acquired knowledge while consolidating new knowledge. In this paper, we introduce a new methodology, coined the Tabular-data Rehearsal-based Incremental Lifelong Learning framework (TRIL3), designed to address the phenomenon of catastrophic forgetting in an online, task-free setting. TRIL3 utilizes an Incremental Learning Vector Quantization (ILVQ) algorithm as an efficient prototype-based incremental generative model to store and generate synthetic data to preserve knowledge over time, and the Deep Neural Decision Forest (DNDF) algorithm, which was modified to run incrementally to learn supervised classification tasks for tabular data. Based on tests conducted to determine the optimal percentage of synthetic data and comparisons with other available task-free CL proposals, we conclude that TRIL3 outperforms other methods in the literature using only 50% of synthetic data., Agencia Estatal de Investigación | Ref. PID2020-113795RB-C33, Agencia Estatal de Investigación | Ref. PID2023-148716OB-C31, Xunta de Galicia | Ref. ED431B 2024/41, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

CO-DEFEND: Continuous decentralized federated learning for secure DoH-based threat detection

  • Cajaraville Aboy, Diego
  • Moure Garrido, Marta
  • Beis Penedo, Carlos
  • García Rubio, Carlos
  • Díaz Redondo, Rebeca Pilar
  • Campo, Celeste
  • Fernández Vilas, Ana
  • Fernández Veiga, Manuel
The use of DNS over HTTPS (DoH) tunneling by an attacker to hide malicious activity within encrypted DNS traffic poses a serious threat to network security, as it allows malicious actors to bypass traditional monitoring and intrusion detection systems while evading detection by conventional traffic analysis techniques. Machine Learning (ML) techniques can be used to detect DoH tunnels; however, their effectiveness relies on large datasets containing both benign and malicious traffic. Sharing such datasets across entities is challenging due to privacy concerns. In this work, we propose CO-DEFEND (Continuous Decentralized Federated Learning for Secure DoH-Based Threat Detection), a Decentralized Federated Learning (DFL) framework that enables multiple entities to collaboratively train a classification machine learning model for DoH threat detection while preserving data privacy, enhancing scalability and resilience against single points of failure. The proposed DFL framework provides a realistic implementation for DoH threat detection, enabling multiple entities to train their local models online with incoming DoH flows in real-time batches as they are processed – an approach that fits naturally within modern Internet architectures. This framework adapts four classical machine learning algorithms, Support Vector Machines (SVM), Logistic Regression (LR), Decision Trees (DT), and Random Forest (RF), for federated scenarios and efficient training. In addition, a key methodological feature of CO-DEFEND is the use of DT and RF as model selection rather than aggregation mechanisms, allowing each participant to retain interpretable and locally optimal decision structures while benefiting from collective updates. We compare our proposed method by using the dataset CIRA-CIC-DoHBrw-2020 with existing machine learning approaches, including more computationally complex alternatives such as neural networks, to demonstrate its effectiveness in detecting malicious DoH tunnels while improving scalability and computational efficiency., Agencia Estatal de Investigación | Ref. PID2020-113795RB-C32, Agencia Estatal de Investigación | Ref. PID2020-113795RB-C33, Agencia Estatal de Investigación | Ref. PID2023-148716OB-C31, Agencia Estatal de Investigación | Ref. PID2023-148716OB-C33, Agencia Estatal de Investigación | Ref. TED2021-130369B-C31, Agencia Estatal de Investigación | Ref. TED2021-130369B-C32, Xunta de Galicia | Ref. ED431B 2024/41, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

A blockchain solution for decentralized training in machine learning for IoT

  • Beis Penedo, Carlos
  • Troncoso Pastoriza, Francisco Manuel
  • Díaz Redondo, Rebeca Pilar
  • Fernández Vilas, Ana
  • Fernández Veiga, Manuel
  • González Soto, Martín
The rapid growth of Internet of Things (IoT) devices and applications has led to an increased demand for advanced analytics and machine learning techniques capable of handling the challenges associated with data privacy, security, and scalability. Federated learning (FL) and blockchain technologies have emerged as promising approaches to address these challenges by enabling decentralized, secure, and privacy-preserving model training on distributed data sources. In this paper, we present a novel IoT solution that combines the incremental learning vector quantization algorithm (XuILVQ) with Ethereum blockchain technology to facilitate secure and efficient data sharing, model training, and prototype storage in a distributed environment. Our proposed architecture addresses the shortcomings of existing blockchain-based FL solutions by reducing computational and communication overheads while maintaining data privacy and security. We assess the performance of our system through a series of experiments, showing its potential to enhance the accuracy and efficiency of machine learning tasks in IoT settings., Universidade de Vigo/CISUG, Xunta de Galicia | Ref. ED431B 2024/41 (GPC), Agencia Estatal de Investigación | Ref. PID2020-113795RB-C33, Agencia Estatal de Investigación | Ref. PID2023-148716OB-C31, Axencia Galega de Innovación | Ref. 25/IN606D/2021/2612348
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Realistic urban traffic generator using decentralized federated learning for the SUMO simulator

  • Bazán Guillén, Alberto|||0000-0001-8634-6907
  • Beis Penedo, Carlos
  • Cajaraville Aboy, Diego
  • Barbecho Bautista, Pablo
  • Díaz Redondo, Rebeca P.
  • Cruz Llopis, Luis Javier de la|||0000-0003-4171-8310
  • Fernández Vilas, Ana
  • Aguilar Igartua, Mónica|||0000-0002-6518-888X
  • Fernández Veiga, Manuel
Realistic urban traffic simulation is essential for sustainable urban planning and the development of intelligent transportation systems. However, generating high-fidelity, time-varying traffic profiles that accurately reflect real-world conditions, especially in large-scale scenarios, remains a major challenge. Existing methods often suffer from limitations in accuracy, scalability, or raise privacy concerns due to centralized data processing. This work introduces DesRUTGe (Decentralized Realistic Urban Traffic Generator), a novel framework that integrates Deep Reinforcement Learning (DRL) agents with the SUMO simulator to generate realistic 24-hour traffic patterns. A key innovation of DesRUTGe is its use of Decentralized Federated Learning (DFL), wherein each traffic detector and its corresponding urban zone function as an independent learning node. These nodes train local DRL models using minimal historical data and collaboratively refine their performance by exchanging model parameters with selected peers (e.g., geographically adjacent zones), without requiring a central coordinator. Evaluated using real-world data from the city of Barcelona, DesRUTGe outperforms standard SUMO-based tools such as RouteSampler, as well as other centralized learning approaches, by delivering more accurate traffic pattern generation., This work was supported in part by the MICIU/AEI/10.13039/501100011033 (COMPROMISE Project) under Grant PID2020-113795RB-C33; in part by the MCIU/AEI/10.13039/501100011033 (DISCOVERY Project) under Grant PID2023-148716OB-C31; in part by the TRUFFLES: Trusted Framework for Federated Learning Systems, within the Strategic Cybersecurity Projects (INCIBE, Spain); in part by the Recovery, Transformation and Resilience Plan (European Union, Next Generation); in part by the Galician Regional Government under Project ED431B 2024/41 (GPC); in part by the Project Anonymization Technology for AI-Based Analytics of Mobility Data (MOBILYTICS) funded by MCIN/AEI/10.13039/501100011033 under Grant TED2021-129782B-I00; in part by the European Union NextGenerationEU/ PRTR; in part by the Project MultiMO: Datos MultiSectoriales para la Movilidad Obligada (European Union, NextGenerationEU) under Grant TSI-100123-2024-60; in part by the Generalitat de Catalunya under AGAUR Grant 2021 SGR 01413; and in part by the Predoctoral Scholarship for the Training of Research Personnel Associated with the Generación de Conocimiento Project under Grant PRE2021-099830.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Modeling and benchmarking two-wheeler seepage behavior in dense mixed traffic simulations

  • Guin, Agneev
  • Bazán Guillén, Alberto|||0000-0001-8634-6907
  • Kannan, Prashanth
  • Junjun, Lu
  • Postigo Boix, Marcos|||0000-0002-4182-7376
Two-wheeler seepage behavior—the aggressive lane-splitting, lateral maneuvering and small-gap acceptance in dense mixed traffic—poses a significant challenge for traffic simulation and autonomous vehicle development in South Asian urban environments. Despite the dominance of two-wheelers in these regions, existing microscopic traffic simulators rely on generic, largely Western-calibrated parameters that fail to reproduce realistic seepage dynamics almost entirely: the default minimum-gap parameter (2.5 m) exceeds the observed mean Indian seepage gap (0.906 m) by 176%, making most real seepage opportunities physically infeasible in simulation. This study proposes a novel real-to-simulation data-driven calibration framework for modeling twowheeler seepage behavior using 310,110 video frames from the IDD and TIAND real-world traffic datasets. Utilizing a multi-stage quality filtering based on detection confidence, traffic density, and gap realism criteria, we yield 13,219 algorithmically validated seepage events (retained through algorithmic quality scoring across confidence, density, and gap-geometry criteria) with empirical distributions of gap acceptance, lateral positioning, and seepage maneuver types. A percentile-based strategy maps aggressive gap-acceptance thresholds to SUMO simulator parameters, replacing conventional mean-based estimation. Default SUMO produces only 132 seepage events versus 80,553 from the calibrated model—a 610× increase. The calibration targets seepage emergence at scale and faithful reproduction of the aggressive-tail threshold (𝑃10 = 0.272 m) rather than distributional equality across all percentiles. The calibrated mean gap (0.609 m) undershoots the observed mean (0.906 m), a trade-off inherent to parameterized car-following models. On a geo-referenced OpenStreetMap network of Hyderabad the calibrated model generates 49% more seepage events and reproduces the empirical 𝑃10 within 1%. This work provides the first comprehensive, data-driven characterization of two-wheeler seepage behavior and establishes a replicable calibration and validation methodology for realistic mixed-traffic heterogeneous traffic simulation. The framework provides a building block for routing optimization and fleet management where seepage dynamics materially affect travel times and network throughput in different types of traffic environments., This work was supported by the DISCOVERY project (PID2023-148716OB-C31) funded by MCIU/AEI/10.13039/501100011033. Also, by the MultiMO project (TSI-100123-2024-60) funded by the Agencia Estatal de Investigación, European Union, NextGenerationEU. Also, by predoctoral scholarship for the training of research personnel associated with the ‘‘Generación de Conocimiento’’ Project PRE2021-099830. Finally, by the Generalitat de Catalunya under AGAUR grant ‘‘2021 SGR 01413’’., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Modeling and benchmarking two-wheeler seepage behavior in dense mixed traffic simulations

  • Guin, Agneev
  • Bazán Guillén, Alberto
  • Kannan, Prashanth
  • Junjun, Lu
  • Postigo Boix, Marcos
Two-wheeler seepage behavior—the aggressive lane-splitting, lateral maneuvering and small-gap acceptance in dense mixed traffic—poses a significant challenge for traffic simulation and autonomous vehicle development in South Asian urban environments. Despite the dominance of two-wheelers in these regions, existing microscopic traffic simulators rely on generic, largely Western-calibrated parameters that fail to reproduce realistic seepage dynamics almost entirely: the default minimum-gap parameter (2.5 m) exceeds the observed mean Indian seepage gap (0.906 m) by 176%, making most real seepage opportunities physically infeasible in simulation. This study proposes a novel real-to-simulation data-driven calibration framework for modeling twowheeler seepage behavior using 310,110 video frames from the IDD and TIAND real-world traffic datasets. Utilizing a multi-stage quality filtering based on detection confidence, traffic density, and gap realism criteria, we yield 13,219 algorithmically validated seepage events (retained through algorithmic quality scoring across confidence, density, and gap-geometry criteria) with empirical distributions of gap acceptance, lateral positioning, and seepage maneuver types. A percentile-based strategy maps aggressive gap-acceptance thresholds to SUMO simulator parameters, replacing conventional mean-based estimation. Default SUMO produces only 132 seepage events versus 80,553 from the calibrated model—a 610× increase. The calibration targets seepage emergence at scale and faithful reproduction of the aggressive-tail threshold (𝑃10 = 0.272 m) rather than distributional equality across all percentiles. The calibrated mean gap (0.609 m) undershoots the observed mean (0.906 m), a trade-off inherent to parameterized car-following models. On a geo-referenced OpenStreetMap network of Hyderabad the calibrated model generates 49% more seepage events and reproduces the empirical 𝑃10 within 1%. This work provides the first comprehensive, data-driven characterization of two-wheeler seepage behavior and establishes a replicable calibration and validation methodology for realistic mixed-traffic heterogeneous traffic simulation. The framework provides a building block for routing optimization and fleet management where seepage dynamics materially affect travel times and network throughput in different types of traffic environments., This work was supported by the DISCOVERY project (PID2023-148716OB-C31) funded by MCIU/AEI/10.13039/501100011033. Also, by the MultiMO project (TSI-100123-2024-60) funded by the Agencia Estatal de Investigación, European Union, NextGenerationEU. Also, by predoctoral scholarship for the training of research personnel associated with the ‘‘Generación de Conocimiento’’ Project PRE2021-099830. Finally, by the Generalitat de Catalunya under AGAUR grant ‘‘2021 SGR 01413’’., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Realistic urban traffic generator using decentralized federated learning for the SUMO simulator

  • Bazán Guillén, Alberto
  • Beis Penedo, Carlos
  • Cajaraville Aboy, Diego
  • Barbecho Bautista, Pablo
  • Díaz Redondo, Rebeca P.
  • Cruz Llopis, Luis Javier de la
  • Fernández Vilas, Ana
  • Aguilar Igartua, Mónica
  • Fernández Veiga, Manuel
Realistic urban traffic simulation is essential for sustainable urban planning and the development of intelligent transportation systems. However, generating high-fidelity, time-varying traffic profiles that accurately reflect real-world conditions, especially in large-scale scenarios, remains a major challenge. Existing methods often suffer from limitations in accuracy, scalability, or raise privacy concerns due to centralized data processing. This work introduces DesRUTGe (Decentralized Realistic Urban Traffic Generator), a novel framework that integrates Deep Reinforcement Learning (DRL) agents with the SUMO simulator to generate realistic 24-hour traffic patterns. A key innovation of DesRUTGe is its use of Decentralized Federated Learning (DFL), wherein each traffic detector and its corresponding urban zone function as an independent learning node. These nodes train local DRL models using minimal historical data and collaboratively refine their performance by exchanging model parameters with selected peers (e.g., geographically adjacent zones), without requiring a central coordinator. Evaluated using real-world data from the city of Barcelona, DesRUTGe outperforms standard SUMO-based tools such as RouteSampler, as well as other centralized learning approaches, by delivering more accurate traffic pattern generation., This work was supported in part by the MICIU/AEI/10.13039/501100011033 (COMPROMISE Project) under Grant PID2020-113795RB-C33; in part by the MCIU/AEI/10.13039/501100011033 (DISCOVERY Project) under Grant PID2023-148716OB-C31; in part by the TRUFFLES: Trusted Framework for Federated Learning Systems, within the Strategic Cybersecurity Projects (INCIBE, Spain); in part by the Recovery, Transformation and Resilience Plan (European Union, Next Generation); in part by the Galician Regional Government under Project ED431B 2024/41 (GPC); in part by the Project Anonymization Technology for AI-Based Analytics of Mobility Data (MOBILYTICS) funded by MCIN/AEI/10.13039/501100011033 under Grant TED2021-129782B-I00; in part by the European Union NextGenerationEU/ PRTR; in part by the Project MultiMO: Datos MultiSectoriales para la Movilidad Obligada (European Union, NextGenerationEU) under Grant TSI-100123-2024-60; in part by the Generalitat de Catalunya under AGAUR Grant 2021 SGR 01413; and in part by the Predoctoral Scholarship for the Training of Research Personnel Associated with the Generación de Conocimiento Project under Grant PRE2021-099830., Postprint (published version)