Mohammad Amir Khusru Akhtar
Research Subjects
Mohammad Amir Khusru Akhtar has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Arvind Hans
8 shared publications- Gadadhar Sahoo
Birla Institute of Technology
4 shared publications Anand Nayyar
3 shared publications- Amrita Prakash
Usha Martin University, Faculty of Computing and IT, Ranchi, India
2 shared publications Sahoo G
2 shared publicationsDenny Daniel Binod Xalxo
1 shared publication
Latest Publications
- Open Access
- 18 November 2026
- Published by Elsevier in SSRN Electronic Journal
Computational Unknownogenesis: Certifying Observation Gaps and Reproducing Software Defects Through Cost-Aware Measurement Design
Software diagnosis depends on the measurements through which competing program behaviors are observed. We develop a finite, cost-aware framework for recognizing observational equivalence, certifying a measurement-language gap, and selecting executable probes that distinguish candidate behaviors. The framework establishes finite-search guarantees and connects them to a traceable experimental workflow. In a three-family synthetic comparison, a learned selector and a precommitted fixed probe each achieved three successful separations; a random eligible-probe control succeeded in 1,414 of 3,000 draws (0.4713). A complementary historical study audited ten targeted buggy–fixed regressions across four Python projects and reexecuted one formatter contrast using a separately coded internal checker. We extend this evidence with a project-disjoint, five-case BugsInPy pilot spanning Ansible, FastAPI, Luigi, Scrapy, and Tornado. Historical Python container images were built for all five cases, and an exploratory study recorded 100 policy attempts across four methods and five seeds, with 65 attempts executing three node-level probes each (195 probes in total). CU instrumentation recorded 124,665 source-line events across 45 executed probes, while the three comparison policies executed 150 probes in total. Separate fixed-revision evaluation covered 24 distinct selected node identifiers; no defect satisfied the study’s independent-confirmation criterion. Together, the studies establish a transparent connection between finite measurement theory, executable probes, historical regression analysis, and trace collection across heterogeneous Python projects.
- 18 November 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessComputational Unknownogenesis: Certifying Observation Gaps and Reproducing Software Defects Through Cost-Aware Measurement Design
Software diagnosis depends on the measurements through which competing program behaviors are observed. We develop a finite, cost-aware framework for recognizing observational equivalence, certifying a measurement-language gap, and selecting executable probes that distinguish candidate behaviors. The framework establishes finite-search guarantees and connects them to a traceable experimental workflow. In a three-family synthetic comparison, a learned selector and a precommitted fixed probe each achieved three successful separations; a random eligible-probe control succeeded in 1,414 of 3,000 draws (0.4713). A complementary historical study audited ten targeted buggy–fixed regressions across four Python projects and reexecuted one formatter contrast using a separately coded internal checker. We extend this evidence with a project-disjoint, five-case BugsInPy pilot spanning Ansible, FastAPI, Luigi, Scrapy, and Tornado. Historical Python container images were built for all five cases, and an exploratory study recorded 100 policy attempts across four methods and five seeds, with 65 attempts executing three node-level probes each (195 probes in total). CU instrumentation recorded 124,665 source-line events across 45 executed probes, while the three comparison policies executed 150 probes in total. Separate fixed-revision evaluation covered 24 distinct selected node identifiers; no defect satisfied the study’s independent-confirmation criterion. Together, the studies establish a transparent connection between finite measurement theory, executable probes, historical regression analysis, and trace collection across heterogeneous Python projects.
- Open Access
- 16 November 2026
- Published by Elsevier in SSRN Electronic Journal
What Does an Integer-Factorization Experiment Prove? Exact Bounded-Search Records, Independent Checking, and Fault Attribution
A factorization report may assert a valid divisor, a complete bounded search, faithful intermediate arithmetic, public-input provenance, or computational superiority; these assertions require different evidence. We examine exact, non-succinct Fermat-search records and canonical Euclidean greatest-common-divisor transcripts through a two-kernel verification interface with strict decoding and explicit resource-policy outcomes. The original fixed-budget experiment used six synthetic semiprimes and 60 controlled mutations; two separately coded Fermat checkers and a conventional recomputation baseline agreed on every outcome. An expanded evaluation includes 227 cross-language Fermat comparisons, 749 matched Euclidean decisions, and an 812-case corpus yielding 260 accepted, 544 rejected, and eight resource-limited inputs, with complete agreement against conventional recomputation. The reported first failed invariant belonged to the independently recomputed violated-invariant set for all 544 rejected records, although 260 multi-mutant cases admit no unique causal interpretation. Eighteen benchmark configurations yielded 1,386 timing observations and 72 memory observations without establishing an end-to-end speed advantage. A pinned separate checkout reproduced 22 evidence-file hashes and three deterministic datasets. The results establish bounded record consistency under stated assumptions and reproducibility of selected tests, not historical execution provenance, a new factoring method, or superiority over conventional checking.
- 16 November 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessWhat Does an Integer-Factorization Experiment Prove? Exact Bounded-Search Records, Independent Checking, and Fault Attribution
A factorization report may assert a valid divisor, a complete bounded search, faithful intermediate arithmetic, public-input provenance, or computational superiority; these assertions require different evidence. We examine exact, non-succinct Fermat-search records and canonical Euclidean greatest-common-divisor transcripts through a two-kernel verification interface with strict decoding and explicit resource-policy outcomes. The original fixed-budget experiment used six synthetic semiprimes and 60 controlled mutations; two separately coded Fermat checkers and a conventional recomputation baseline agreed on every outcome. An expanded evaluation includes 227 cross-language Fermat comparisons, 749 matched Euclidean decisions, and an 812-case corpus yielding 260 accepted, 544 rejected, and eight resource-limited inputs, with complete agreement against conventional recomputation. The reported first failed invariant belonged to the independently recomputed violated-invariant set for all 544 rejected records, although 260 multi-mutant cases admit no unique causal interpretation. Eighteen benchmark configurations yielded 1,386 timing observations and 72 memory observations without establishing an end-to-end speed advantage. A pinned separate checkout reproduced 22 evidence-file hashes and three deterministic datasets. The results establish bounded record consistency under stated assumptions and reproducibility of selected tests, not historical execution provenance, a new factoring method, or superiority over conventional checking.
- Open Access
- 4 November 2026
- Published by Elsevier in SSRN Electronic Journal
The First Spin-resolved Spectral Discrepancy in a Narain Two-torus Family: Exact Thresholds, Symmetry Boundaries, and Stability
Two toroidal backgrounds can have identical unlabelled energy spectra while differing in the distribution of states over spin. Identifying the first energy at which this distinction becomes visible is a finer problem than establishing spectral inequivalence. We study a rational two-dimensional Narain metric with opposite antisymmetric backgrounds and obtain an exact, parameter-dependent first-separation threshold. For a real field parameter b, writing t = dist(b, ℤ), the first energy at which the joint energy–spin zero-mode multiplicities differ is (133 − 6t + 18t²)/53 when 0 < t < 1/2; at integer and half-integer parameters the complete refined spectra coincide. The proof combines an analytic finite-charge completeness bound, an exact quadratic-polynomial certificate for nonzero-spin states, and the standard integral B-shift symmetry. A separate exact calculation gives a uniform competing-state gap of 6/265 on 1/10 ≤ b ≤ 2/5. This gap, together with an exact identity for paired witness energies at a general positive-definite metric, yields a quantitative persistence theorem under small symmetric perturbations. We further identify the first nonvanishing Fourier–Laplace coefficient of the difference of zero-mode spin-refined theta sums, making the spectral distinction explicit at the partition-function level. The first detectable refined spectral difference varies continuously within open chambers yet disappears at their symmetry boundaries. The construction is specific to the displayed family and does not assert a new duality or a generic inverse-spectral classification.
- 4 November 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessThe First Spin-resolved Spectral Discrepancy in a Narain Two-torus Family: Exact Thresholds, Symmetry Boundaries, and Stability
Two toroidal backgrounds can have identical unlabelled energy spectra while differing in the distribution of states over spin. Identifying the first energy at which this distinction becomes visible is a finer problem than establishing spectral inequivalence. We study a rational two-dimensional Narain metric with opposite antisymmetric backgrounds and obtain an exact, parameter-dependent first-separation threshold. For a real field parameter b, writing t = dist(b, ℤ), the first energy at which the joint energy–spin zero-mode multiplicities differ is (133 − 6t + 18t²)/53 when 0 < t < 1/2; at integer and half-integer parameters the complete refined spectra coincide. The proof combines an analytic finite-charge completeness bound, an exact quadratic-polynomial certificate for nonzero-spin states, and the standard integral B-shift symmetry. A separate exact calculation gives a uniform competing-state gap of 6/265 on 1/10 ≤ b ≤ 2/5. This gap, together with an exact identity for paired witness energies at a general positive-definite metric, yields a quantitative persistence theorem under small symmetric perturbations. We further identify the first nonvanishing Fourier–Laplace coefficient of the difference of zero-mode spin-refined theta sums, making the spectral distinction explicit at the partition-function level. The first detectable refined spectral difference varies continuously within open chambers yet disappears at their symmetry boundaries. The construction is specific to the displayed family and does not assert a new duality or a generic inverse-spectral classification.
- Open Access
- 27 October 2026
- Published by Elsevier in SSRN Electronic Journal
Finite Spectral Reconstruction and Robust Non-Identifiability in Two-Dimensional Narain Compactifications
To what extent can the momentum-winding spectrum of a toroidal conformal field theory determine its background geometry? We study this inverse question for two-dimensional Narain compactifications, distinguishing labelled quadratic-form evaluations, unlabelled total energy levels, and the joint energy-spin spectrum. Five specified charge-labelled energies reconstruct an arbitrary positive-definite metric and antisymmetric field in a fixed integral basis. For rectangular metrics in a bounded domain, the unlabelled spectrum below an explicit finite cutoff reconstructs both radii and the magnitude of the antisymmetric field. In contrast, we exhibit a rational pair of backgrounds whose complete unlabelled zero-mode energy spectra agree but whose spin-resolved spectra differ, giving an exact obstruction to orientation-preserving integral T-duality. An exhaustive, analytically complete charge bound certifies the witness; rational interval arithmetic extends it to a four-parameter neighbourhood. A local-finiteness argument further shows that a fixed spin-asymmetry witness persists on an open, dense, full-measure set. Finally, no background-independent finite cutoff of even spin-refined spectral data distinguishes all duality classes on unrestricted moduli space. The results identify which spectral information suffices for reconstruction, which information is lost by forgetting charge or spin, and where finite-window inference necessarily fails. They concern exact zero-mode data and do not assert a new worldsheet-parity mechanism or an experimental reconstruction procedure.
- 27 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessFinite Spectral Reconstruction and Robust Non-Identifiability in Two-Dimensional Narain Compactifications
To what extent can the momentum-winding spectrum of a toroidal conformal field theory determine its background geometry? We study this inverse question for two-dimensional Narain compactifications, distinguishing labelled quadratic-form evaluations, unlabelled total energy levels, and the joint energy-spin spectrum. Five specified charge-labelled energies reconstruct an arbitrary positive-definite metric and antisymmetric field in a fixed integral basis. For rectangular metrics in a bounded domain, the unlabelled spectrum below an explicit finite cutoff reconstructs both radii and the magnitude of the antisymmetric field. In contrast, we exhibit a rational pair of backgrounds whose complete unlabelled zero-mode energy spectra agree but whose spin-resolved spectra differ, giving an exact obstruction to orientation-preserving integral T-duality. An exhaustive, analytically complete charge bound certifies the witness; rational interval arithmetic extends it to a four-parameter neighbourhood. A local-finiteness argument further shows that a fixed spin-asymmetry witness persists on an open, dense, full-measure set. Finally, no background-independent finite cutoff of even spin-refined spectral data distinguishes all duality classes on unrestricted moduli space. The results identify which spectral information suffices for reconstruction, which information is lost by forgetting charge or spin, and where finite-window inference necessarily fails. They concern exact zero-mode data and do not assert a new worldsheet-parity mechanism or an experimental reconstruction procedure.
- Open Access
- 24 October 2026
- Published by Elsevier in SSRN Electronic Journal
Conditional Frequency and Protection Screens for Microgrid Restoration: Robust Bounds, Relay-Timer Counterexamples, and IEEE 123-Bus Model Evidence
A restoration switching action may satisfy static power-flow requirements yet fail frequency or protection constraints. We develop a model-relative joint certificate combining a sign-aware frequency envelope, primary and counterfactual backup clearing deadlines, inverse-time relay coordination and breaker-delay uncertainty. For fixed scalar-scaled piecewise-current traces and stipulated monotone full, hold or linear-reset timers, we prove an exact independent-rectangle endpoint criterion. An analytic counterexample demonstrates that the two endpoints of correlated common-current derating can pass coordination while an interior realization fails. A reproducible synthetic benchmark of 90 cases compares nominal, common-endpoint, rectangular and finite time-domain screens: the respective false approvals against the rectangular model reference are 19, 3, 0 and 0. Controlled ablations identify the coordination margin and frequency gate as major observed contributors to excluding false approvals. Pinned IEEE 123-bus OpenDSS probes provide feeder-model evidence but do not establish energized phase continuity through transformer/regulator windings, installed protection orientation or an authorized restoration sequence; disabling a named switch yields zero reported voltage at two monitored buses despite numerical convergence. The resulting certificates and numerical comparisons are restricted to their stated models and do not constitute electromagnetic-transient or field safety validation.
- 24 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessConditional Frequency and Protection Screens for Microgrid Restoration: Robust Bounds, Relay-Timer Counterexamples, and IEEE 123-Bus Model Evidence
A restoration switching action may satisfy static power-flow requirements yet fail frequency or protection constraints. We develop a model-relative joint certificate combining a sign-aware frequency envelope, primary and counterfactual backup clearing deadlines, inverse-time relay coordination and breaker-delay uncertainty. For fixed scalar-scaled piecewise-current traces and stipulated monotone full, hold or linear-reset timers, we prove an exact independent-rectangle endpoint criterion. An analytic counterexample demonstrates that the two endpoints of correlated common-current derating can pass coordination while an interior realization fails. A reproducible synthetic benchmark of 90 cases compares nominal, common-endpoint, rectangular and finite time-domain screens: the respective false approvals against the rectangular model reference are 19, 3, 0 and 0. Controlled ablations identify the coordination margin and frequency gate as major observed contributors to excluding false approvals. Pinned IEEE 123-bus OpenDSS probes provide feeder-model evidence but do not establish energized phase continuity through transformer/regulator windings, installed protection orientation or an authorized restoration sequence; disabling a named switch yields zero reported voltage at two monitored buses despite numerical convergence. The resulting certificates and numerical comparisons are restricted to their stated models and do not constitute electromagnetic-transient or field safety validation.
- Open Access
- 23 October 2026
- Published by Elsevier in SSRN Electronic Journal
When Does Information Help Network Repair? Decision Sufficiency, Physical Path Probes, and the Limits of Diagnosis
A failed network need not be fully diagnosed before service can be restored. The relevant decision is whether available observations support a feasible repair across all remaining physical failure states. We formulate this question for finite networks with admissible path measurements, overlapping repair-validity regions, intervention costs, and explicit post-repair transitions. Building on established decision-region determination, we characterize robust terminal repair sufficiency, construct indistinguishability counterexamples, and present an exhaustive finite-horizon decision recursion. For a restricted single-failure series path with one irreversible repair, the optimal success probability under a uniform prior is exactly 1/n. An independently checked finite-state implementation evaluated 30 synthetic instances, producing 180 policy records; four deterministic heuristics matched the exact Bayesian-success oracle, while a random comparator was inferior on three instances. Experiments on three historical network topologies generated 720 fixed-route synthetic-failure records and 960 sensitivity records. Baseline restoration counts were 12/40 for Abilene, 7/40 for GEANT 2012, and 6/40 for ARPANET 1972. These conditional outcomes do not establish field reliability or the value of adaptive sensing, because the evaluated fixed-route policies use no informative probes. The analysis identifies the physical feasibility, decision criteria, and experimental controls required to assess when network information improves restoration.
- 23 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessWhen Does Information Help Network Repair? Decision Sufficiency, Physical Path Probes, and the Limits of Diagnosis
A failed network need not be fully diagnosed before service can be restored. The relevant decision is whether available observations support a feasible repair across all remaining physical failure states. We formulate this question for finite networks with admissible path measurements, overlapping repair-validity regions, intervention costs, and explicit post-repair transitions. Building on established decision-region determination, we characterize robust terminal repair sufficiency, construct indistinguishability counterexamples, and present an exhaustive finite-horizon decision recursion. For a restricted single-failure series path with one irreversible repair, the optimal success probability under a uniform prior is exactly 1/n. An independently checked finite-state implementation evaluated 30 synthetic instances, producing 180 policy records; four deterministic heuristics matched the exact Bayesian-success oracle, while a random comparator was inferior on three instances. Experiments on three historical network topologies generated 720 fixed-route synthetic-failure records and 960 sensitivity records. Baseline restoration counts were 12/40 for Abilene, 7/40 for GEANT 2012, and 6/40 for ARPANET 1972. These conditional outcomes do not establish field reliability or the value of adaptive sensing, because the evaluated fixed-route policies use no informative probes. The analysis identifies the physical feasibility, decision criteria, and experimental controls required to assess when network information improves restoration.
- Open Access
- 20 October 2026
- Published by Elsevier in SSRN Electronic Journal
The Geometry of Natality: Creation Obligations, Attainable Futures, and Costed Structural Transformation
We study how optional component creation changes the attainable futures of costed dependency systems. A transition model distinguishes restoration, creation, and rewiring, and defines budgeted future sets, natality gain, pairwise capability interactions, minimal creation obligations, and obstruction sets. We establish a budget-interval identity for natality gain, decompose interaction signs into joint-only and overlapping outcomes, and characterize minimal blockers through hypergraph transversal duality. These results specialize established shortest-path and set-function principles. Independent Floyd–Warshall and Bellman–Ford checks agree across 393,600 distance-vector comparisons in 98,400 bounded cases, yielding 842 negative, 96,950 zero, and 608 positive interactions. A separate oracle examines 65,812 capability families. Exact enumeration and uniform-cost search recover two optimal cost-three plans in a dependency-repair fixture; guarded decomposition and fresh-name quotient results specify conditions for sound structural reduction. An independently checked three-relay GROOVE grammar yields 28 states and 64 raw rule-labelled transitions, with 60 canonical transitions and independently computed optimal cost 12. The results provide reproducible finite evidence and precise applicability boundaries, without claiming a new general calculus or performance superiority over established graph-transformation tools.
- 20 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessThe Geometry of Natality: Creation Obligations, Attainable Futures, and Costed Structural Transformation
We study how optional component creation changes the attainable futures of costed dependency systems. A transition model distinguishes restoration, creation, and rewiring, and defines budgeted future sets, natality gain, pairwise capability interactions, minimal creation obligations, and obstruction sets. We establish a budget-interval identity for natality gain, decompose interaction signs into joint-only and overlapping outcomes, and characterize minimal blockers through hypergraph transversal duality. These results specialize established shortest-path and set-function principles. Independent Floyd–Warshall and Bellman–Ford checks agree across 393,600 distance-vector comparisons in 98,400 bounded cases, yielding 842 negative, 96,950 zero, and 608 positive interactions. A separate oracle examines 65,812 capability families. Exact enumeration and uniform-cost search recover two optimal cost-three plans in a dependency-repair fixture; guarded decomposition and fresh-name quotient results specify conditions for sound structural reduction. An independently checked three-relay GROOVE grammar yields 28 states and 64 raw rule-labelled transitions, with 60 canonical transitions and independently computed optimal cost 12. The results provide reproducible finite evidence and precise applicability boundaries, without claiming a new general calculus or performance superiority over established graph-transformation tools.
- Open Access
- 19 October 2026
- Published by Elsevier in SSRN Electronic Journal
Exact Certificate-aware Nonpreemptive Scheduling with General Availability Calendars and Additive-frequency Bounds
Nonpreemptive scheduling under fragmented availability is governed by contiguous feasible intervals rather than total available time. We study rational single-machine calendars with arbitrary downtime and the arithmetic subclass defined by the three coupled frequencies a, b, a + b. An exact subset dynamic program maximizes the total weight of heterogeneous jobs with individual release times, deadlines, and processing durations; a proof establishes that retaining only the earliest completion time for each selected subset preserves optimality. An independent checker validates rational schedules, while exact recomputation provides a finite, although exponential, optimality check. For the additive subclass, we establish the sharp availability inequality μ(S(a, b)) ≥ 13/20 by combining a torus integral, an explicit grid-discrepancy bound, and exhaustive integer-arithmetic verification of all 11,698 primitive pairs below the analytic cutoff; equality occurs at (1, 14). This yields a certified uninterrupted interval of length at least 13/[40(a + b)], while distinguishing individual job feasibility from simultaneous schedulability. The implementation integrates exact calendar normalization, constructive admission, a restricted packing formula, certificate verification, and bounded timing-translation analysis. Exhaustive small-instance comparisons validate the generalized optimizer’s results, providing computational support for the exact scheduling framework.
- 19 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessExact Certificate-aware Nonpreemptive Scheduling with General Availability Calendars and Additive-frequency Bounds
Nonpreemptive scheduling under fragmented availability is governed by contiguous feasible intervals rather than total available time. We study rational single-machine calendars with arbitrary downtime and the arithmetic subclass defined by the three coupled frequencies a, b, a + b. An exact subset dynamic program maximizes the total weight of heterogeneous jobs with individual release times, deadlines, and processing durations; a proof establishes that retaining only the earliest completion time for each selected subset preserves optimality. An independent checker validates rational schedules, while exact recomputation provides a finite, although exponential, optimality check. For the additive subclass, we establish the sharp availability inequality μ(S(a, b)) ≥ 13/20 by combining a torus integral, an explicit grid-discrepancy bound, and exhaustive integer-arithmetic verification of all 11,698 primitive pairs below the analytic cutoff; equality occurs at (1, 14). This yields a certified uninterrupted interval of length at least 13/[40(a + b)], while distinguishing individual job feasibility from simultaneous schedulability. The implementation integrates exact calendar normalization, constructive admission, a restricted packing formula, certificate verification, and bounded timing-translation analysis. Exhaustive small-instance comparisons validate the generalized optimizer’s results, providing computational support for the exact scheduling framework.
- Open Access
- 9 October 2026
- Published by Elsevier in SSRN Electronic Journal
Evidence in Networked Metaverse Systems: Comparability, Reproducibility, and Deployment
Metaverse research now spans immersive networking, edge computing, digital twins, semantic communication, artificial intelligence, security, interoperability, sustainability, and deployment. The field is technically rich, yet apparently similar results are frequently produced under incompatible workloads, hardware, networks, baselines, metric semantics, and evaluation protocols. This survey therefore treats evidence rather than technology labels as the unit of synthesis. We developed a mechanism-first evidence architecture, implemented the associated validation and provenance workflow as research software, executed the workflow on a frozen 200-record corpus, and used the resulting artifacts as the empirical basis of the synthesis. The framework combines the comparability tuple C = (P, W, D, H, N, B, M, E), C0–C3 comparison classes, a multidimensional evidence vector, R0–R4 artifact-reproducibility states, denominator-aware reporting, and contrary-evidence gap falsification. The corpus contains 38 networking/edge/XR records, 21 digital-twin records, 18 semantic-communication records, 25 AI/GenAI records, 32 security/privacy records, 9 standards/interoperability records, 18 sustainability records, 12 datasets/testbeds records, and 27 foundations/applications/other records. Coder B completed and approved a second-review validation of 50 of 200 records (25%), and the approved workbook is preserved unchanged as a raw audit artifact. Because this validation used an approve/modify/reject review of pre-populated codes rather than a blind, independently generated second label vector, Cohen’s κ would not measure independent inter-rater reliability and is therefore not reported. A source-coded 21-pair validation subset yields C0 = 2 (9.5%), C1 = 6 (28.6%), C2 = 13 (61.9%), and C3 = 0; these values are explicitly bounded to that subset rather than extrapolated to the 180-pair prospective frame. All 15 closest surveys were source-verified at review level, which falsifies broad claims that resource-allocation benchmarking, sustainability research, AI, security/privacy, interoperability, blockchain, fault management, or applied Metaverse evidence are absent. The defensible residual gaps are narrower: cross-paper comparability, artifact provenance and independent reproduction, standards conformance and adoption, native immersive-security transfer, direct sustainability measurement, and cross-layer experimental evidence. The result is an auditable survey architecture that separates what the literature contains from what its evidence can actually support.
- 9 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessEvidence in Networked Metaverse Systems: Comparability, Reproducibility, and Deployment
Metaverse research now spans immersive networking, edge computing, digital twins, semantic communication, artificial intelligence, security, interoperability, sustainability, and deployment. The field is technically rich, yet apparently similar results are frequently produced under incompatible workloads, hardware, networks, baselines, metric semantics, and evaluation protocols. This survey therefore treats evidence rather than technology labels as the unit of synthesis. We developed a mechanism-first evidence architecture, implemented the associated validation and provenance workflow as research software, executed the workflow on a frozen 200-record corpus, and used the resulting artifacts as the empirical basis of the synthesis. The framework combines the comparability tuple C = (P, W, D, H, N, B, M, E), C0–C3 comparison classes, a multidimensional evidence vector, R0–R4 artifact-reproducibility states, denominator-aware reporting, and contrary-evidence gap falsification. The corpus contains 38 networking/edge/XR records, 21 digital-twin records, 18 semantic-communication records, 25 AI/GenAI records, 32 security/privacy records, 9 standards/interoperability records, 18 sustainability records, 12 datasets/testbeds records, and 27 foundations/applications/other records. Coder B completed and approved a second-review validation of 50 of 200 records (25%), and the approved workbook is preserved unchanged as a raw audit artifact. Because this validation used an approve/modify/reject review of pre-populated codes rather than a blind, independently generated second label vector, Cohen’s κ would not measure independent inter-rater reliability and is therefore not reported. A source-coded 21-pair validation subset yields C0 = 2 (9.5%), C1 = 6 (28.6%), C2 = 13 (61.9%), and C3 = 0; these values are explicitly bounded to that subset rather than extrapolated to the 180-pair prospective frame. All 15 closest surveys were source-verified at review level, which falsifies broad claims that resource-allocation benchmarking, sustainability research, AI, security/privacy, interoperability, blockchain, fault management, or applied Metaverse evidence are absent. The defensible residual gaps are narrower: cross-paper comparability, artifact provenance and independent reproduction, standards conformance and adoption, native immersive-security transfer, direct sustainability measurement, and cross-layer experimental evidence. The result is an auditable survey architecture that separates what the literature contains from what its evidence can actually support.
- Open Access
- 8 October 2026
- Published by Elsevier in SSRN Electronic Journal
Evidence in Virtual Reality Research: Comparability, Reproducibility, and Geometry-Dependent Redirected Walking
Virtual-reality (VR) evidence is difficult to compare when studies differ in problem definition, intervention, outcome, environment, constraints, measurement, and validation design. We developed an evidence architecture before implementing a reproducible software workflow that tests those comparison obligations in a controlled redirected-walking (RDW) benchmark. The frozen evidence library contains 174 verified records, 173 canonical reports, 171 retrieved and assessed reports, 165 direct eligible VR/XR reports, six supporting/context reports, and two reports not retrieved. We operationalize a seven-dimension comparability model and a six-level reproducibility taxonomy. Among eight pre-specified contradiction families, seven were comparability-limited and one was a controlled regime effect; an independent second coder reproduced every dimension-level and family-level classification (8/8 agreement; Cohen’s κ = 1.00 for each coded field). In the RDW benchmark, Vis.-Poly, S2C, and P2R completed 384/400, 378/400, and 381/400 runs, respectively. Every controller pair reversed the sign of its conditional reset-burden difference across four declared geometries, while completion behavior also changed. Median controller-decision cost was 251.448, 2.022, and 3.938 μs on the common runner. The results support regime-aware, failure-aware, and provenance-preserving comparison rather than context-free rankings; no new RDW controller or live-user outcome is claimed.
- 8 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessEvidence in Virtual Reality Research: Comparability, Reproducibility, and Geometry-Dependent Redirected Walking
Virtual-reality (VR) evidence is difficult to compare when studies differ in problem definition, intervention, outcome, environment, constraints, measurement, and validation design. We developed an evidence architecture before implementing a reproducible software workflow that tests those comparison obligations in a controlled redirected-walking (RDW) benchmark. The frozen evidence library contains 174 verified records, 173 canonical reports, 171 retrieved and assessed reports, 165 direct eligible VR/XR reports, six supporting/context reports, and two reports not retrieved. We operationalize a seven-dimension comparability model and a six-level reproducibility taxonomy. Among eight pre-specified contradiction families, seven were comparability-limited and one was a controlled regime effect; an independent second coder reproduced every dimension-level and family-level classification (8/8 agreement; Cohen’s κ = 1.00 for each coded field). In the RDW benchmark, Vis.-Poly, S2C, and P2R completed 384/400, 378/400, and 381/400 runs, respectively. Every controller pair reversed the sign of its conditional reset-burden difference across four declared geometries, while completion behavior also changed. Median controller-decision cost was 251.448, 2.022, and 3.938 μs on the common runner. The results support regime-aware, failure-aware, and provenance-preserving comparison rather than context-free rankings; no new RDW controller or live-user outcome is claimed.