Algorithms maintain BFS trees under dynamic updates with worst-case times O(η_v + η_e) incremental, O(min{m, η*_v + η_e}) decremental and fully dynamic, using O(mn) preprocessing.
Assessing metacognitive awareness
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A reinforcement learning agent for timing GenAI access improved post-test performance and metacognitive accuracy over unrestricted or fully restricted conditions in a lab study with 105 students.
A six-node open systems model enumerates 216 metacognitive scenarios in professional contexts, filtered by plausibility, relevance, feasibility, and intervention potential to 24 priority scenarios across three expertise tiers, revealing theoretical gaps.
citing papers explorer
-
Dynamic Breadth First Search with Predictions
Algorithms maintain BFS trees under dynamic updates with worst-case times O(η_v + η_e) incremental, O(min{m, η*_v + η_e}) decremental and fully dynamic, using O(mn) preprocessing.
-
Access Timing as Scaffolding: A Reinforcement Learning Approach to GenAI in Education
A reinforcement learning agent for timing GenAI access improved post-test performance and metacognitive accuracy over unrestricted or fully restricted conditions in a lab study with 105 students.
-
A Taxonomy of Metacognitive Learning Scenarios in Professional Contexts: Integrating Systems Theory with Empirical Constraints
A six-node open systems model enumerates 216 metacognitive scenarios in professional contexts, filtered by plausibility, relevance, feasibility, and intervention potential to 24 priority scenarios across three expertise tiers, revealing theoretical gaps.