Searcharxiv⌕ Search

arXiv · 2611.20338

Frac-BKT Under Mechanism Scrutiny: Response Assimilation and a Failed Fractional-Memory Test

Abstract

Long-horizon knowledge tracing requires more than an evocative memory mechanism: the implementation must assimilate observed responses non-anticipatorily, and the mechanism must survive matched controls. We subject Frac-BKT, a BKT-style model with an elapsed-time-scaled truncated fractional history, to both tests. The repaired model predicts response $n$ from a prior mastery state and uses response $n$ only to update the posterior state for later events. A five-seed evaluation uses 676,848 ASSISTments 2017 interactions from 1,694 learners and 19,249 learner--skill trajectories, with chronological 80/10/10 suffix splits. The response-aware model reaches AUC .5860 overall, .5638 after gaps of at least 30 minutes, and .5668 after at least 14 days. Relative to the earlier non-response implementation, the gains are .0473, .0316, and .0277 AUC, respectively. However, the fractional mechanism gate fails: the full model is not better than the matched $α=1$ control and is worse than the matched $τ=0$ control by .0090 AUC on both long-gap slices. Student-cluster wild-bootstrap intervals exclude zero, both Holm-adjusted $p$-values are .00006, and all five per-seed differences favor $τ=0$. Compact AKT-, SAKT-, and DAS3H-style references also remain stronger on long gaps. The contribution is therefore a response-assimilation repair and a falsifiable audit showing that response assimilation helps while the evaluated fractional-history term does not---not a state-of-the-art or causal-retention claim.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nizam Kadir. 2026-11-16. Frac-BKT Under Mechanism Scrutiny: Response Assimilation and a Failed Fractional-Memory Test. https://searcharxiv.com/abs/2611.20338

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Asymmetric Discourse Homogenization on Reddit Was a Text-Length Artifact: A Reanalysis

In the first version of this paper I reported that conservative Reddit users began writing more alike after ChatGPT was released while progressive users did not. That result came from a similarity measure that rises and falls with comment length. I redo every analysis of the original paper on all 6,056,593 comments with a sentence encoder and a dispersion measure computed within length strata, and the conservative break goes away. The two camps show no reliable difference in how within-group similarity changed after late 2022, and the ChatGPT date behaves like any of the more than two thousand other cutoffs I test. The matched flair comparison, the cumulative AI index, the stayer panel and the entropy signature each lose their support once length is held fixed. The one change that survives is older. Left and right comments drew closer to each other between 2019 and 2022, and that convergence was complete before ChatGPT arrived. I end with what this implies for studies that measure homogenization with embeddings.

cs.CY↗

Can Power Draw Constrain Covert Compute? Limits of Analogue Verification for AI Governance

Frontier AI treaties or agreements on limiting computation require external verification; an external auditor must be able to confirm how much computation actually ran and that parties are adhering to the agreement. Analogue, off-chip measurements such as power draw provide an information channel for verification. It is unknown how well these analogue channels can constrain the amount of computation against an adversary who actively tries to subvert the audit. We derive a closed form for $β$, the largest hidden computation a power trace cannot exclude, as a fraction of the declared machine capacity. Measurements on NVIDIA A100 GPUs give $β= 1.16$ in the worst case, while an adversarial matched-energy schedule hides at least $0.41$. Analogue power measurements alone therefore constrain compute weakly. Additional restrictions granted by the threat model, such as the ability of the verifier to re-execute the declared work at an observed operating point, let the verifier push $β$ down to $0.059$ in the maximally restricted case. This gives a quantitative estimate of what analogue measurements can contribute to compute verification.

cs.CY↗

Can AI Judge You? An Empirical Audit of Deployment Readiness in LLM-assisted Hiring Systems

Delegating resume screening to large language models (LLMs) requires organizations to establish whether they can distinguish candidates by relevant qualifications while allowing only authorized users to change screening rules or approve exceptions. To this end, we develop a system architecture that separates candidate evidence, evaluation, permission controls, and assessment record, and empirically examine two complementary dimensions of its deployment readiness. First, we assess its operational readiness on four LLMs using a controlled experiment on 210 resumes across 14 job roles and six decision interfaces. Second, we assess its compliance readiness by testing how it handles unauthorized user requests and instructions embedded in resumes. We find that operational performance depends on the choice of evaluation interface: scalar scores generally distinguish qualification changes better than simple pass/fail judgments, while comparative judgments are sensitive to presentation order. Explicit permission rules and separation of resume content from instructions reduce unauthorized compliance, to a varying degree of effectiveness across LLMs and usage contexts. Finally, we find that LLM evaluators often diverge between their decisions and offered justifications. Going beyond simply evaluating LLMs for hiring tasks, our framework supports an audit of a fully configured resume evaluation system to enable its deployment decision.

cs.CY↗