In the subcritical preferential attachment process without vertex growth, the largest component equals (1+o_p(1))·2(α+2)/(α+1)·ε^{-2} log(ε^3 n).
hub Mixed citations
(Springer Berlin Heidelberg, 2009)
Mixed citation behavior. Most common role is background (60%).
30
Pith papers citing it
Background
60% of classified citations
hub tools
citation-role summary
background 3
dataset 1
method 1
citation-polarity summary
representative citing papers
Arbitrary-depth k-stage masked NTT pipelines with fresh inter-stage masking and PF-PINI(≤2) gadgets satisfy a universal 2/q per-observation leakage bound, machine-checked in Lean 4.
SMX explains spectral ML classifiers by summarizing expert zones with PCA, testing quantile predicates via perturbation, aggregating via directed graph centrality, and reconstructing thresholds back onto original spectra.
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
Multirate SVGD improves robustness and efficiency over standard SVGD by updating attraction and repulsion on independent time scales, with strongest gains on hierarchical and multimodal targets.
A categorical duality links algebraic and birelational semantics for constructive modal logic CK, enabling Sahlqvist correspondence, completeness, and Goldblatt-Thomason definability theorems.
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
Introduces 2-HRFA and B2-HRFA for picture languages, proves incomparability with CFMG, proper subset relations with RPDA and RFA, and examines closure properties.
A method recasts exact output distribution computation for small programs with random inputs as a cylindrical algebraic decomposition problem plus integration.
Shield synthesis is repositioned as a design-time defensibility analysis framework for adversarial networks, generating verdicts, winning regions, and fingerprints that separate formal safety from operational behavior under adaptive play.
Systematizes constant time models, identifies a specification gap in private key loading, and confirms timing leaks in OpenSSL and BoringSSL where BoringSSL leaks more strongly despite a stricter model.
Geo is a framework for optimizing graph pattern matching queries via rewrite rules and equality saturation that discovers equivalences and reduces costs by up to 99%.
CuLifter recovers types from untyped GPU register files via constraint propagation to lift 99.98% of 24,437 functions across 919 cubins to valid LLVM IR.
An explicit A_infinity description of the Hochschild homology transfer yields a rational model for the Becker-Gottlieb transfer and proves vanishing of certain rational characteristic classes for manifold bundles while modeling fiberwise THH-simple structures.
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.
Reinforcement learning with spectest completeness rewards lifts a 7B model’s Dafny specification verification success and completeness over supervised fine-tuning by about 50% and 26%.
Signature-linear trading rules reduce path-dependent statistical-arbitrage execution to one concave quadratic programme; fitted rules beat a z-score benchmark (9 vs 6 bps synthetic; 9 vs 2 bps on one pair).
Reservoir engineering modifies the susceptibility of a weakly driven two-level medium to control transmission modulation and angular selectivity in electromagnetically induced gratings.
A design proposal for a VR interactive narrative that uses face-tracking to create emotional perspective-taking between player and character.
Evidence-based taxonomy of security properties with first-order logic definitions and ProVerif/Tamarin executable examples derived from a 2022-2025 literature review of 53 studies.
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
U-Schema acts as a common pivot representation that reduces the number of direct mappings needed for schema and data migration across heterogeneous database paradigms while preserving structure and query behavior.
For the figure-eight knot complement, the real part of the semi-classical limit of its QHI sequence is rigid and equals 0 or vol(M)/(2 pi) depending on parity of log holonomy eigenvalues on the canonical longitude.
Nine care-trajectory clusters derived from Dynamic Time Warping and hierarchical clustering independently predict mortality in cancer patients and show an inverse link to baseline anxiety in high-utilization groups.
citing papers explorer
-
Sharp Asymptotics for the Largest Component in the Subcritical Regime of Preferential Attachment Without Vertex Growth
In the subcritical preferential attachment process without vertex growth, the largest component equals (1+o_p(1))·2(α+2)/(α+1)·ε^{-2} log(ε^3 n).
-
The 1-Bit Barrier is Universal: k-Stage Pipeline Composition and Unified Leakage Bounds for Standard Modular Reductions in PQC Hardware
Arbitrary-depth k-stage masked NTT pipelines with fresh inter-stage masking and PF-PINI(≤2) gadgets satisfy a universal 2/q per-observation leakage bound, machine-checked in Lean 4.
-
Spectral Model eXplainer: a chemically-grounded explainability framework for spectral-based machine learning models
SMX explains spectral ML classifiers by summarizing expert zones with PCA, testing quantile predicates via perturbation, aggregating via directed graph centrality, and reconstructing thresholds back onto original spectra.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
Multirate Stein Variational Gradient Descent for Efficient Bayesian Sampling
Multirate SVGD improves robustness and efficiency over standard SVGD by updating attraction and repulsion on independent time scales, with strongest gains on hierarchical and multimodal targets.
-
Duality for Constructive Modal Logics: from Sahqlvist to Goldblatt-Thomason
A categorical duality links algebraic and birelational semantics for constructive modal logic CK, enabling Sahlqvist correspondence, completeness, and Goldblatt-Thomason definability theorems.
-
A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
-
2-Head 2D Returning Finite Automata
Introduces 2-HRFA and B2-HRFA for picture languages, proves incomparability with CFMG, proper subset relations with RPDA and RFA, and examines closure properties.
-
Exact Evaluation of Probabilistic Programs with Cylindrical Algebraic Decomposition
A method recasts exact output distribution computation for small programs with random inputs as a cylindrical algebraic decomposition problem plus integration.
-
Beyond Runtime Enforcement: Shield Synthesis as Defensibility Analysis for Adversarial Networks
Shield synthesis is repositioned as a design-time defensibility analysis framework for adversarial networks, generating verdicts, winning regions, and fingerprints that separate formal safety from operational behavior under adaptive play.
-
SoK: The Constant Time Model
Systematizes constant time models, identifies a specification gap in private key loading, and confirms timing leaks in OpenSSL and BoringSSL where BoringSSL leaks more strongly despite a stricter model.
-
Geo: A Query Rewrite Framework for Graph Pattern Mining
Geo is a framework for optimizing graph pattern matching queries via rewrite rules and equality saturation that discovers equivalences and reduces costs by up to 99%.
-
CuLifter: Lifting GPU Binaries to Typed IR
CuLifter recovers types from untyped GPU register files via constraint propagation to lift 99.98% of 24,437 functions across 919 cubins to valid LLVM IR.
-
A rational model for the fiberwise THH transfer II: $A_\infty$-algebras
An explicit A_infinity description of the Hochschild homology transfer yields a rational model for the Becker-Gottlieb transfer and proves vanishing of certain rational characteristic classes for manifold bundles while modeling fiberwise THH-simple structures.
-
Analysis of Search Heuristics in the Multi-Armed Bandit Setting
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.
-
SpecRL: Reinforcement Learning with Test-Based Completeness Rewards for Formal Specification Synthesis
Reinforcement learning with spectest completeness rewards lifts a 7B model’s Dafny specification verification success and completeness over supervised fine-tuning by about 50% and 26%.
-
Signature-Based Optimal Execution for Statistical Arbitrage with Path-Dependent Trading Signals
Signature-linear trading rules reduce path-dependent statistical-arbitrage execution to one concave quadratic programme; fitted rules beat a z-score benchmark (9 vs 6 bps synthetic; 9 vs 2 bps on one pair).
-
Reservoir-controlled electromagnetically induced gratings in a weakly driven two-level medium
Reservoir engineering modifies the susceptibility of a weakly driven two-level medium to control transmission modulation and angular selectivity in electromagnetically induced gratings.
-
Fostering Emotional Perspective-Taking: An Exploration of Affective Face-Tracking Interactions in the VR Narrative Rekindle
A design proposal for a VR interactive narrative that uses face-tracking to create emotional perspective-taking between player and character.
-
Bridging Theory and Practice: An Executable Taxonomy of Security Properties for ProVerif and Tamarin
Evidence-based taxonomy of security properties with first-order logic definitions and ProVerif/Tamarin executable examples derived from a 2022-2025 literature review of 53 studies.
-
Resource Management in Heterogeneous Quantum Repeater Networks
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
-
A Model-Driven Approach to Database Migration with a Unified Data Model
U-Schema acts as a common pivot representation that reduces the number of direct mappings needed for schema and data migration across heterogeneous database paradigms while preserving structure and query behavior.
-
Volume Conjecture and quantum hyperbolic invariants: the figure eight knot complement
For the figure-eight knot complement, the real part of the semi-classical limit of its QHI sequence is rigid and equals 0 or vol(M)/(2 pi) depending on parity of log holonomy eigenvalues on the canonical longitude.
-
Care Trajectories Are Linked to Mental Health and Mortality in Cancer Patients
Nine care-trajectory clusters derived from Dynamic Time Warping and hierarchical clustering independently predict mortality in cancer patients and show an inverse link to baseline anxiety in high-utilization groups.
-
From Paradigm Shift to Audit Rift: Empirical Analysis and Validation of Security Audit Methodologies for Asynchronous Smart Contract Systems
Empirical review of 233 real-world vulnerabilities from 34 TON audits produces a specialized checklist for asynchronous message handling, supported by case studies and an 11-person practitioner survey.
-
Domain Diversity, Motivation, Inclusion, and Feedback in Software Modelling Education
Surveys reveal students prefer socially relevant domains for motivation in software modelling education and value choice in selection, contrary to educator assumptions, recommending student-centered domain selection.
-
AI-Enabled Serious Games: Integrating Intelligence and Adaptivity in Training Systems
The chapter synthesizes the history of adaptive learning systems and examines how AI can provide instructional intelligence and real-time adaptivity in serious games while highlighting challenges such as explainability and limited long-term outcome data.
-
A machine learning framework for computationally expensive transient models
Hybrid DEM-ARIMA-ML framework accelerates transient particle simulations while claiming to retain accuracy and match literature results.
- Rational Weyl group elements of odd type D
- Computational Complexity of Model-Checking Quantum Pushdown Systems