Datasets:
id int64 21.6k 24.9k | key stringlengths 54 95 | method stringclasses 1
value | name stringlengths 1 146 | provenance stringclasses 1
value | retrieved_at stringdate 2026-10-07 00:00:00 2026-10-07 00:00:00 | source stringclasses 1
value | source_date stringdate 2026-09-10 00:00:00 2026-09-10 00:00:00 | source_url stringlengths 131 172 | text stringlengths 25 619 | violated stringclasses 4
values |
|---|---|---|---|---|---|---|---|---|---|---|
21,649 | problem:01-tokenization/adversarial-tokenization-attacks#assumption-1 | parsed | $T$ is applied to whole prompts | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/adversarial-tokenization-attacks.md | $T$ is applied to whole prompts — false: chat templates tokenize segments separately, so token boundaries depend on role markers and on whether the client pre-tokenizes. | violated |
21,650 | problem:01-tokenization/adversarial-tokenization-attacks#assumption-2 | parsed | $D(T(x)) = x$ | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/adversarial-tokenization-attacks.md | $D(T(x)) = x$ — false in practice for tokenizers with NFKC normalization or byte-fallback quirks, which are lossy. | violated |
21,651 | problem:01-tokenization/adversarial-tokenization-attacks#assumption-3 | parsed | Semantic equivalence is well defined | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/adversarial-tokenization-attacks.md | Semantic equivalence is well defined — false for homoglyph text, whose meaning depends on the renderer. | violated |
21,652 | problem:01-tokenization/bpe-merge-optimality-gap#assumption-1 | parsed | Pre-tokenization boundaries are fixed | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/bpe-merge-optimality-gap.md | Pre-tokenization boundaries are fixed. Violated in practice: GPT-2-style regex splits, digit-grouping rules and whitespace handling change $rho$ by more than most merge-order effects. | violated |
21,653 | problem:01-tokenization/bpe-merge-optimality-gap#assumption-2 | parsed | Corpus counts are the deployment distribution | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/bpe-merge-optimality-gap.md | Corpus counts are the deployment distribution. Violated: tokenizers trained on web English are used on code, other languages and long digits. | violated |
21,654 | problem:01-tokenization/bpe-merge-optimality-gap#assumption-3 | parsed | Non-overlapping left-to-right occurrence counting | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/bpe-merge-optimality-gap.md | Non-overlapping left-to-right occurrence counting. An approximation; the true maximum matching for self-overlapping pairs (aa in aaaaa) differs. | unstated |
21,655 | problem:01-tokenization/bpe-merge-optimality-gap#assumption-4 | parsed | Token count is a proxy for model loss | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/bpe-merge-optimality-gap.md | Token count is a proxy for model loss. Not established (§4). | unstated |
21,656 | problem:01-tokenization/byte-level-parity-at-scale#assumption-1 | parsed | Equal-FLOP implies equal cost | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/byte-level-parity-at-scale.md | Equal-FLOP implies equal cost. Violated. Byte models are memory-bandwidth-bound at short context and their entropy-based or dynamic chunkers add a serial dependency at decode; FLOP parity understates their latency. | violated |
21,657 | problem:01-tokenization/byte-level-parity-at-scale#assumption-2 | parsed | BPB is tokenizer-independent | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/byte-level-parity-at-scale.md | BPB is tokenizer-independent. Holds as an arithmetic identity, but only if both models are scored on byte-identical text with identical normalization (NFC, whitespace, BOM). Silent normalization inside a tokenizer breaks it. | holds |
21,658 | problem:01-tokenization/byte-level-parity-at-scale#assumption-3 | parsed | The BPE baseline is optimal | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/byte-level-parity-at-scale.md | The BPE baseline is optimal. Violated in the other direction — most reported comparisons use one off-the-shelf vocabulary size, unswept. | violated |
21,659 | problem:01-tokenization/byte-level-parity-at-scale#assumption-4 | parsed | Chinchilla-style scaling laws transfer across granularity | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/byte-level-parity-at-scale.md | Chinchilla-style scaling laws transfer across granularity. Unverified. Data-optimal $T$ is quoted in tokens; the byte model's token is not the same object. | unstated |
21,660 | problem:01-tokenization/canonicality-bias#assumption-1 | parsed | Vocabulary is prefix-free or segmentation is unique | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/canonicality-bias.md | Vocabulary is prefix-free or segmentation is unique — false for all BPE and UnigramLM vocabularies. | violated |
21,661 | problem:01-tokenization/canonicality-bias#assumption-2 | parsed | Canonical mass $kappa approx 1$ | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/canonicality-bias.md | Canonical mass $kappa approx 1$ — approximately true for English prose in-distribution, empirically false for rare words, code identifiers, non-Latin scripts, and numerals. | partly |
21,662 | problem:01-tokenization/canonicality-bias#assumption-3 | parsed | Proposal $q$ covers the support of $p_theta$ | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/canonicality-bias.md | Proposal $q$ covers the support of $p_theta$ — BPE-dropout proposals put zero mass on some fibers; the estimator is then biased low without indicating it. | unstated |
21,663 | problem:01-tokenization/canonicality-bias#assumption-4 | parsed | The canonical encoder is deterministic across implementations | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/canonicality-bias.md | The canonical encoder is deterministic across implementations — false in practice; HuggingFace fast/slow tokenizers and byte-fallback settings disagree on some inputs. | violated |
21,664 | problem:01-tokenization/character-knowledge-in-subword-models#assumption-1 | parsed | Tokens have a single spelling | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/character-knowledge-in-subword-models.md | Tokens have a single spelling. Violated: byte-fallback tokens, unicode normalization, leading-space variants ( dog vs dog), and case pairs give one string several ids with different frequencies. | violated |
21,665 | problem:01-tokenization/character-knowledge-in-subword-models#assumption-2 | parsed | Probe generalization implies model-internal availability | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/character-knowledge-in-subword-models.md | Probe generalization implies model-internal availability. Violated whenever probe capacity exceeds the model's read-out; a linear probe on $E$ can exploit frequency correlates of orthography rather than orthography itself. | violated |
21,666 | problem:01-tokenization/character-knowledge-in-subword-models#assumption-3 | parsed | Character tasks measure character knowledge | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/character-knowledge-in-subword-models.md | Character tasks measure character knowledge. Violated: counting also needs arithmetic and positional tracking; failures confound the two. | violated |
21,667 | problem:01-tokenization/character-knowledge-in-subword-models#assumption-4 | parsed | Test tokens are unseen | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/character-knowledge-in-subword-models.md | Test tokens are unseen. Violated by morphological overlap between splits (walk/walking), which leaks spelling. | violated |
21,668 | problem:01-tokenization/code-vs-text-vocabulary#assumption-1 | parsed | Segmentation is deterministic and optimal | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/code-vs-text-vocabulary.md | Segmentation is deterministic and optimal. Violated: BPE's greedy merge sequence is not the compression-optimal segmentation; subword regularization (Kudo 2018) shows the segmentation distribution matters. | violated |
21,669 | problem:01-tokenization/code-vs-text-vocabulary#assumption-2 | parsed | Fertility on held-out data predicts fertility in deployment | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/code-vs-text-vocabulary.md | Fertility on held-out data predicts fertility in deployment. Violated for code: indentation conventions, minified files, and non-English identifiers shift $phi$ by tens of percent. | violated |
21,670 | problem:01-tokenization/code-vs-text-vocabulary#assumption-3 | parsed | Domain labels are clean | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/code-vs-text-vocabulary.md | Domain labels are clean. Violated: docstrings, comments, Markdown READMEs, and notebooks are code-file text; the code/text partition is not a partition of the byte stream. | violated |
21,671 | problem:01-tokenization/code-vs-text-vocabulary#assumption-4 | parsed | $6N$ per token holds | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/code-vs-text-vocabulary.md | $6N$ per token holds. Violated at long context, where attention is a large share, and for large $V$, where the softmax dominates at small $N$. | violated |
21,672 | problem:01-tokenization/compression-rate-downstream-predictor#assumption-1 | parsed | $C$ is corpus-stable | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compression-rate-downstream-predictor.md | $C$ is corpus-stable — violated: a tokenizer's bytes-per-token shifts by 20–40% between web text, code, and non-Latin scripts, so $C$ is a property of the pair $(tau, D)$, not $tau$. | violated |
21,673 | problem:01-tokenization/compression-rate-downstream-predictor#assumption-2 | parsed | Downstream tasks are tokenization-neutral | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compression-rate-downstream-predictor.md | Downstream tasks are tokenization-neutral — violated: arithmetic and character-level tasks depend on digit and character segmentation, not on aggregate compression (Singh & Strouse, 2024). | violated |
21,674 | problem:01-tokenization/compression-rate-downstream-predictor#assumption-3 | parsed | Rank correlation at 350M transfers to 70B | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compression-rate-downstream-predictor.md | Rank correlation at 350M transfers to 70B — untested; this is the empirical gap in §5. | unstated |
21,675 | problem:01-tokenization/compression-rate-downstream-predictor#assumption-4 | parsed | Tokenizers in $mathcal{T}$ are otherwise matched | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compression-rate-downstream-predictor.md | Tokenizers in $mathcal{T}$ are otherwise matched — usually violated: candidates differ in vocabulary size, pre-tokenization regex, and byte-fallback simultaneously. | violated |
21,676 | problem:01-tokenization/compute-optimal-vocabulary-size#assumption-1 | parsed | $6N$ FLOPs accounting | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compute-optimal-vocabulary-size.md | $6N$ FLOPs accounting. Violated: the softmax/logit matmul over $V$ and the embedding lookup have very different arithmetic intensity and memory traffic. At $V=256$K the output projection is a large fraction of measured wall-clock but is counted as ordinary FLOPs. Compute-optimal $ne$ time-optimal. | violated |
21,677 | problem:01-tokenization/compute-optimal-vocabulary-size#assumption-2 | parsed | Fertility independent of the model | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compute-optimal-vocabulary-size.md | Fertility independent of the model. Holds by construction, but $f$ is corpus-dependent; a tokenizer fit on web English has different $f$ on code and on Telugu (Petrov et al. 2023). | holds |
21,678 | problem:01-tokenization/compute-optimal-vocabulary-size#assumption-3 | parsed | Loss-per-byte is monotone in downstream quality | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compute-optimal-vocabulary-size.md | Loss-per-byte is monotone in downstream quality. Contested — Goldman et al. (2024) find compression correlates with performance only within limited ranges. | unstated |
21,679 | problem:01-tokenization/compute-optimal-vocabulary-size#assumption-4 | parsed | Data is not repeated and is not scarce | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compute-optimal-vocabulary-size.md | Data is not repeated and is not scarce. Under repetition, shorter sequences change the effective epoch count, and the trade-off shifts. | unstated |
21,680 | problem:01-tokenization/compute-optimal-vocabulary-size#assumption-5 | parsed | Fixed depth/width | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/compute-optimal-vocabulary-size.md | Fixed depth/width. $N_v$ depends on $d$, so vocabulary and aspect ratio are entangled; papers usually fix the shape. | unstated |
21,681 | problem:01-tokenization/continual-vocabulary-adaptation#assumption-1 | parsed | Segmentation is deterministic and cheap | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/continual-vocabulary-adaptation.md | Segmentation is deterministic and cheap. Holds for BPE/Unigram merges; violated by subword regularization (Kudo, 2018) and by any learned segmenter. | violated |
21,682 | problem:01-tokenization/continual-vocabulary-adaptation#assumption-2 | parsed | Adding a token leaves other tokens' distributions unchanged | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/continual-vocabulary-adaptation.md | Adding a token leaves other tokens' distributions unchanged. Violated — BPE merge order is global; inserting a merge re-segments unrelated strings. | violated |
21,683 | problem:01-tokenization/continual-vocabulary-adaptation#assumption-3 | parsed | The embedding matrix is the only vocabulary-dependent parameter | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/continual-vocabulary-adaptation.md | The embedding matrix is the only vocabulary-dependent parameter. Violated in tied-embedding models, where the change also perturbs the output head and its logit scale. | violated |
21,684 | problem:01-tokenization/continual-vocabulary-adaptation#assumption-4 | parsed | $mathcal{D}_t$ is observable before adaptation | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/continual-vocabulary-adaptation.md | $mathcal{D}_t$ is observable before adaptation. Violated in deployment: the shift is detected from traffic that has already been mis-tokenized, so the sample is filtered by the model's own failure mode. | violated |
21,685 | problem:01-tokenization/cross-tokenizer-distillation#assumption-1 | parsed | Bijective span alignment exists | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/cross-tokenizer-distillation.md | Bijective span alignment exists. Violated whenever token boundaries cross (_tokeniz vs _token|iz); byte-level fallbacks and unicode normalization differences (NFC vs NFKC, LLaMA's ▁ handling) break byte offsets outright. | violated |
21,686 | problem:01-tokenization/cross-tokenizer-distillation#assumption-2 | parsed | Sorted logits carry transferable information | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/cross-tokenizer-distillation.md | Sorted logits carry transferable information. Violated when vocabularies differ in size ($32{,}000$ vs $256{,}000$): sorted tails are dominated by vocabulary-size-dependent mass, so $mathcal{L}_{mathrm{ULD}}$ conflates different beliefs with different vocabulary size. | violated |
21,687 | problem:01-tokenization/cross-tokenizer-distillation#assumption-3 | parsed | Canonical segmentation carries nearly all mass | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/cross-tokenizer-distillation.md | Canonical segmentation carries nearly all mass. Approximately true for trained models but unquantified above 1B parameters. | unstated |
21,688 | problem:01-tokenization/cross-tokenizer-distillation#assumption-4 | parsed | Teacher and student see the same context | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/cross-tokenizer-distillation.md | Teacher and student see the same context. Violated by differing chat templates and special tokens. | violated |
21,689 | problem:01-tokenization/digit-grouping-arithmetic#assumption-1 | parsed | Compute matching | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/digit-grouping-arithmetic.md | Compute matching. Schemes differ in tokens-per-number ($n$ vs $lceil n/3rceil$), so equal-token training is not equal-numeral training. Violated by construction — no scheme choice can satisfy both. | violated |
21,690 | problem:01-tokenization/digit-grouping-arithmetic#assumption-2 | parsed | Vocabulary neutrality | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/digit-grouping-arithmetic.md | Vocabulary neutrality. Assumed the extra 1100 tokens do not shift BPE merges elsewhere. Violated: at fixed total vocabulary, digit tokens displace text merges. | violated |
21,691 | problem:01-tokenization/digit-grouping-arithmetic#assumption-3 | parsed | Corpus independence | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/digit-grouping-arithmetic.md | Corpus independence. Web text contains years, IDs and prices whose frequency drives merges; naive BPE gives 2020 one token and 2021 possibly two. Violated in every model that does not force digit splits. | violated |
21,692 | problem:01-tokenization/digit-grouping-arithmetic#assumption-4 | parsed | Exact match is the right metric | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/digit-grouping-arithmetic.md | Exact match is the right metric. It conflates a single carry error with a total failure. Known to be violated as a proxy for understands addition. | violated |
21,693 | problem:01-tokenization/dynamic-token-pooling#assumption-1 | parsed | Pooling is lossless enough that upsampling recovers byte-level detail | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/dynamic-token-pooling.md | Pooling is lossless enough that upsampling recovers byte-level detail. Violated: reconstruction error grows with segment length; this is why residual/skip connections from the local encoder are mandatory in every working system. | violated |
21,694 | problem:01-tokenization/dynamic-token-pooling#assumption-2 | parsed | $rho$ is stationary across the corpus | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/dynamic-token-pooling.md | $rho$ is stationary across the corpus. Violated hard. Entropy-driven boundaries fire far more often on code, non-Latin scripts, and numbers than on English prose; $rho$ can vary 2–3× across domains within one corpus. | violated |
21,695 | problem:01-tokenization/dynamic-token-pooling#assumption-3 | parsed | Straight-through gradients are a usable estimator of $partial mathcal{L}/partial phi$ | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/dynamic-token-pooling.md | Straight-through gradients are a usable estimator of $partial mathcal{L}/partial phi$. Violated in the sense that the bias is unbounded and unmeasured; no paper reports the variance of this estimator. | violated |
21,696 | problem:01-tokenization/dynamic-token-pooling#assumption-4 | parsed | Causality holds | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/dynamic-token-pooling.md | Causality holds. A boundary predictor that uses $h_t$ to decide $b_t$ and then pools $h_{s_k:t}$ is causal; one that uses next-byte entropy computed by a separate model is causal only if that model is itself causal. | holds |
21,697 | problem:01-tokenization/intrinsic-tokenizer-metrics#assumption-1 | parsed | Fixed compute across arms | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/intrinsic-tokenizer-metrics.md | Fixed compute across arms. Violated in most published comparisons: equal token budgets give unequal byte budgets, so a high-compression tokenizer sees more text at the same nominal cost. | violated |
21,698 | problem:01-tokenization/intrinsic-tokenizer-metrics#assumption-2 | parsed | Embedding parameters are negligible | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/intrinsic-tokenizer-metrics.md | Embedding parameters are negligible. Violated below ~1B parameters, where a $m=250text{k}$ embedding table dominates $P$. | violated |
21,699 | problem:01-tokenization/intrinsic-tokenizer-metrics#assumption-3 | parsed | Downstream metrics are tokenizer-neutral | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/intrinsic-tokenizer-metrics.md | Downstream metrics are tokenizer-neutral. Violated for likelihood-scored multiple choice (MMLU, HellaSwag), where answer-string length in tokens changes the normalization. | violated |
21,700 | problem:01-tokenization/intrinsic-tokenizer-metrics#assumption-4 | parsed | One corpus | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/intrinsic-tokenizer-metrics.md | One corpus. Violated across languages: the same tokenizer's $F$ varies by an order of magnitude between scripts. | violated |
21,701 | problem:01-tokenization/learned-end-to-end-segmentation#assumption-1 | parsed | Held-out text is drawn from the same $mathcal{D}$ as training | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/learned-end-to-end-segmentation.md | Held-out text is drawn from the same $mathcal{D}$ as training. Violated for code, non-Latin scripts, and math, where BPE compression ratios differ by 2–4×. | violated |
21,702 | problem:01-tokenization/learned-end-to-end-segmentation#assumption-2 | parsed | BPB is monotone in downstream utility | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/learned-end-to-end-segmentation.md | BPB is monotone in downstream utility. Known violated — Schmidt et al. (EMNLP 2024) show compression and task accuracy dissociate. | violated |
21,703 | problem:01-tokenization/learned-end-to-end-segmentation#assumption-3 | parsed | FLOP matching implies wall-clock matching | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/learned-end-to-end-segmentation.md | FLOP matching implies wall-clock matching. Violated: variable-length chunking gives ragged batches; realized throughput can be 20–40% below the FLOP-implied figure. | violated |
21,704 | problem:01-tokenization/learned-end-to-end-segmentation#assumption-4 | parsed | The segmenter's $rho$ is stable across the run | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/learned-end-to-end-segmentation.md | The segmenter's $rho$ is stable across the run. Violated without an auxiliary ratio loss; segmenters collapse to all-boundaries or no-boundaries. | violated |
21,705 | problem:01-tokenization/low-resource-vocabulary-curse#assumption-1 | parsed | Sentence-aligned parity corpora are translations, so low-resource sides carry translationese and are typically translated from English | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/low-resource-vocabulary-curse.md | Sentence-aligned parity corpora are translations, so low-resource sides carry translationese and are typically translated from English — this deflates $R_ell$ relative to native text. | unstated |
21,706 | problem:01-tokenization/low-resource-vocabulary-curse#assumption-2 | parsed | $p_ell$ from web crawls is contaminated | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/low-resource-vocabulary-curse.md | $p_ell$ from web crawls is contaminated: large fractions of low-resource CommonCrawl subsets are machine-translated or misidentified by language ID (Kreutzer et al., TACL 2022). | unstated |
21,707 | problem:01-tokenization/low-resource-vocabulary-curse#assumption-3 | parsed | Fertility assumes a word boundary exists | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/low-resource-vocabulary-curse.md | Fertility assumes a word boundary exists. | unstated |
21,708 | problem:01-tokenization/low-resource-vocabulary-curse#assumption-4 | parsed | Constant loss-to-accuracy transfer across languages | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/low-resource-vocabulary-curse.md | Constant loss-to-accuracy transfer across languages. | unstated |
21,709 | problem:01-tokenization/morphological-alignment-performance#assumption-1 | parsed | A gold segmentation exists and is unique | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/morphological-alignment-performance.md | A gold segmentation exists and is unique. Violated: -ing in building (noun) versus building (verb); fusional morphs in Semitic templatic morphology have no contiguous boundary at all. | violated |
21,710 | problem:01-tokenization/morphological-alignment-performance#assumption-2 | parsed | Alignment is language-independent | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/morphological-alignment-performance.md | Alignment is language-independent. Violated: $A$ is computed against a lexicon whose coverage differs by two orders of magnitude between English and, say, Amharic. | violated |
21,711 | problem:01-tokenization/morphological-alignment-performance#assumption-3 | parsed | The tokenizer is deterministic and context-free | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/morphological-alignment-performance.md | The tokenizer is deterministic and context-free. Violated by subword regularization (Kudo, 2018) and by any inference-time sampling. | violated |
21,712 | problem:01-tokenization/morphological-alignment-performance#assumption-4 | parsed | Downstream tasks probe morphology | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/morphological-alignment-performance.md | Downstream tasks probe morphology. Mostly false: MMLU-style benchmarks are dominated by knowledge, not composition. | partly |
21,713 | problem:01-tokenization/multimodal-discrete-vocabulary#assumption-1 | parsed | Losses across modalities are comparable in nats/token | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/multimodal-discrete-vocabulary.md | Losses across modalities are comparable in nats/token. Violated: text at $sim 2.2$ nats/token over a 65k BPE vocabulary and image codes at $sim 5$ nats/token over an 8k codebook carry different bits per unit of semantic content. Cross-modality loss comparison is not meaningful. | violated |
21,714 | problem:01-tokenization/multimodal-discrete-vocabulary#assumption-2 | parsed | Token count is a fair unit of compute allocation | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/multimodal-discrete-vocabulary.md | Token count is a fair unit of compute allocation. Violated: a $512times512$ image is 1024 Chameleon tokens; a paragraph of comparable information is ~200. | violated |
21,715 | problem:01-tokenization/multimodal-discrete-vocabulary#assumption-3 | parsed | Codebook indices are exchangeable | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/multimodal-discrete-vocabulary.md | Codebook indices are exchangeable. Violated: VQ codes are geometric neighbors in a learned embedding space, BPE ids are arbitrary. A shared softmax mixes two incompatible index geometries. | violated |
21,716 | problem:01-tokenization/multimodal-discrete-vocabulary#assumption-4 | parsed | Reconstruction distortion predicts generative quality | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/multimodal-discrete-vocabulary.md | Reconstruction distortion predicts generative quality. Violated — see §4. | violated |
21,717 | problem:01-tokenization/new-token-embedding-initialization#assumption-1 | parsed | New-token frequencies in $mathcal{D}$ match deployment | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/new-token-embedding-initialization.md | New-token frequencies in $mathcal{D}$ match deployment. Violated: adaptation corpora are usually narrower than deployment. | violated |
21,718 | problem:01-tokenization/new-token-embedding-initialization#assumption-2 | parsed | $Sigma$ is isotropic enough that a diagonal fit is faithful | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/new-token-embedding-initialization.md | $Sigma$ is isotropic enough that a diagonal fit is faithful. Violated: LM embedding spaces are strongly anisotropic, with a dominant common direction (Ethayarajh, EMNLP 2019). | violated |
21,719 | problem:01-tokenization/new-token-embedding-initialization#assumption-3 | parsed | Existing rows are well-trained, so their statistics are a sane target | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/new-token-embedding-initialization.md | Existing rows are well-trained, so their statistics are a sane target. Violated: Land & Bartolo (EMNLP 2024) find thousands of under-trained tokens in production vocabularies; $mu$ and $Sigma$ are contaminated by them. | violated |
21,720 | problem:01-tokenization/new-token-embedding-initialization#assumption-4 | parsed | Tied embeddings make input and output init the same problem | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/new-token-embedding-initialization.md | Tied embeddings make input and output init the same problem. False even when weights are tied — the input role wants what does this token mean and the output role wants when should I emit this token, and the tie forces one compromise. | violated |
21,721 | problem:01-tokenization/optimal-tokenizer-construction-hardness#assumption-1 | parsed | Objective = token count | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/optimal-tokenizer-construction-hardness.md | Objective = token count — violated: the model's loss is not a function of sequence length alone. | violated |
21,722 | problem:01-tokenization/optimal-tokenizer-construction-hardness#assumption-2 | parsed | Word-boundary independence | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/optimal-tokenizer-construction-hardness.md | Word-boundary independence — violated by SuperBPE-style superword tokenizers and by whitespace-free scripts. | violated |
21,723 | problem:01-tokenization/optimal-tokenizer-construction-hardness#assumption-3 | parsed | Held-out corpus matches the training corpus distribution | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/optimal-tokenizer-construction-hardness.md | Held-out corpus matches the training corpus distribution — violated for code, multilingual, and post-2024 web mixes. | violated |
21,724 | problem:01-tokenization/optimal-tokenizer-construction-hardness#assumption-4 | parsed | Vocabulary cost is uniform in $k$ | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/optimal-tokenizer-construction-hardness.md | Vocabulary cost is uniform in $k$ — violated: embedding/softmax parameters scale as $k cdot d$, so $k$ trades against $N$. | violated |
21,725 | problem:01-tokenization/post-hoc-vocabulary-expansion#assumption-1 | parsed | Embeddings compose additively | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/post-hoc-vocabulary-expansion.md | Embeddings compose additively: $e(v') approx sum_i w_i, e(v_i)$ for the old-tokenizer decomposition $T(v') = (v_1,dots,v_k)$. Approximately true for input embeddings, measurably worse for unembeddings (Hewitt 2021; Minixhofer et al. 2024). | unstated |
21,726 | problem:01-tokenization/post-hoc-vocabulary-expansion#assumption-2 | parsed | The body is tokenizer-agnostic | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/post-hoc-vocabulary-expansion.md | The body is tokenizer-agnostic. Violated: attention heads specialize to positional token-boundary patterns induced by the original segmentation. | violated |
21,727 | problem:01-tokenization/post-hoc-vocabulary-expansion#assumption-3 | parsed | New embeddings should be distributionally matched to old ones | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/post-hoc-vocabulary-expansion.md | New embeddings should be distributionally matched to old ones. Only weakly justified; it is a regularizer against out-of-distribution norms, not a correctness argument. | unstated |
21,728 | problem:01-tokenization/post-hoc-vocabulary-expansion#assumption-4 | parsed | Tied embeddings halve the problem | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/post-hoc-vocabulary-expansion.md | Tied embeddings halve the problem. False in the direction that matters — tying forces one vector to serve two roles with different optimal geometry. | violated |
21,729 | problem:01-tokenization/speculative-decoding-vocabulary-mismatch#assumption-1 | parsed | Acceptance is i.i.d. across positions | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/speculative-decoding-vocabulary-mismatch.md | Acceptance is i.i.d. across positions — assumed by $S(alpha,gamma,c)$; violated: acceptance is strongly autocorrelated (bursty), so $S$ overestimates variance-free gain and mis-predicts optimal $gamma$. | violated |
21,730 | problem:01-tokenization/speculative-decoding-vocabulary-mismatch#assumption-2 | parsed | Detokenize–retokenize is an identity on model outputs | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/speculative-decoding-vocabulary-mismatch.md | Detokenize–retokenize is an identity on model outputs — violated whenever the target can emit non-canonical token sequences (it can, with nonzero probability) and by byte-fallback/UTF-8 splits. | violated |
21,731 | problem:01-tokenization/speculative-decoding-vocabulary-mismatch#assumption-3 | parsed | $V_p cap V_q$ carries most probability mass | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/speculative-decoding-vocabulary-mismatch.md | $V_p cap V_q$ carries most probability mass — often violated across tokenizer families; string-identical entries may differ in byte-level escaping (Ġ vs ▁) so the naive string intersection undercounts. | violated |
21,732 | problem:01-tokenization/speculative-decoding-vocabulary-mismatch#assumption-4 | parsed | Target and draft prompts are the same tokens | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/speculative-decoding-vocabulary-mismatch.md | Target and draft prompts are the same tokens — vacuously false here; prompt segmentation differs, which changes $q$ itself. | violated |
21,733 | problem:01-tokenization/subword-regularization-at-scale#assumption-1 | parsed | $q$ is a fixed, string-independent noise process | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/subword-regularization-at-scale.md | $q$ is a fixed, string-independent noise process. Violated: $q_alpha$ depends on $p_u$, which is fitted to the same corpus, so the noise is correlated with the data. | violated |
21,734 | problem:01-tokenization/subword-regularization-at-scale#assumption-2 | parsed | Train and test segmentation distributions match | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/subword-regularization-at-scale.md | Train and test segmentation distributions match. Deliberately violated — that is the point of the method, and it makes $mathcal{L}_{text{SR}}$ a biased estimator of test bpb. | violated |
21,735 | problem:01-tokenization/subword-regularization-at-scale#assumption-3 | parsed | Segmentation is the only thing varying | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/subword-regularization-at-scale.md | Segmentation is the only thing varying. Violated in most published comparisons, which change tokenizer algorithm (BPE vs unigram) at the same time as adding stochasticity. | violated |
21,736 | problem:01-tokenization/subword-regularization-at-scale#assumption-4 | parsed | Effective vocabulary is unchanged | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/01-tokenization/subword-regularization-at-scale.md | Effective vocabulary is unchanged. Violated: BPE-dropout raises token-frequency entropy and effectively upweights short tokens, so sequences lengthen by 5–20% at $p=0.1$, changing FLOPs per document. | violated |
21,737 | problem:02-attention/attention-adversarial-context-injection#assumption-1 | parsed | Provenance $rho$ is known and correct | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-injection.md | Provenance $rho$ is known and correct. Violated in practice: tool outputs get concatenated into a single user turn; multi-agent pipelines lose labels at hop boundaries. | violated |
21,738 | problem:02-attention/attention-adversarial-context-injection#assumption-2 | parsed | The injected span is contiguous and bounded | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-injection.md | The injected span is contiguous and bounded. Violated: attacks are distributed across many retrieved documents, and many-shot conditioning uses $10^2$–$10^3$ shots (Anil et al., 2024). | violated |
21,739 | problem:02-attention/attention-adversarial-context-injection#assumption-3 | parsed | Attention weight is a proxy for information flow | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-injection.md | Attention weight is a proxy for information flow. Known false in general — attention weights are not identifiable as explanations (Jain & Wallace, NAACL 2019; Wiegreffe & Pinter, EMNLP 2019), and residual/MLP paths carry effect that $alpha_S$ misses. | violated |
21,740 | problem:02-attention/attention-adversarial-context-injection#assumption-4 | parsed | Instruction and data are separable categories | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-injection.md | Instruction and data are separable categories. Zverev et al. (ICLR 2025) show the separation itself lacks an agreed formal definition; models score poorly on any of the candidates. | unstated |
21,741 | problem:02-attention/attention-adversarial-context-robustness#assumption-1 | parsed | Perturbation lives in a continuous ball around embeddings | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-robustness.md | Perturbation lives in a continuous ball around embeddings — violated: insertion is discrete, changes sequence length, and shifts positional indices of all downstream tokens. | violated |
21,742 | problem:02-attention/attention-adversarial-context-robustness#assumption-2 | parsed | Bounded input domain, so self-attention is Lipschitz | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-robustness.md | Bounded input domain, so self-attention is Lipschitz — violated in general: Kim, Papamakarios & Mnih (ICML 2021) show standard dot-product self-attention is not Lipschitz on an unbounded domain; bounds require an explicit input-norm cap. | violated |
21,743 | problem:02-attention/attention-adversarial-context-robustness#assumption-3 | parsed | Trusted/untrusted boundary is known | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-robustness.md | Trusted/untrusted boundary is known — holds by construction in agent frameworks, but is violated whenever untrusted text is summarized into the trusted channel. | violated |
21,744 | problem:02-attention/attention-adversarial-context-robustness#assumption-4 | parsed | $Phi$ is a faithful proxy for harm | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-adversarial-context-robustness.md | $Phi$ is a faithful proxy for harm — usually violated; see §6. | violated |
21,745 | problem:02-attention/attention-as-faithful-explanation#assumption-1 | parsed | Baseline $b$ is off-manifold-neutral | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-as-faithful-explanation.md | Baseline $b$ is off-manifold-neutral. Violated — masking creates inputs outside the training distribution; measured $Delta$ mixes attribution with distribution shift (Hooker et al., ROAR, NeurIPS 2019). | violated |
21,746 | problem:02-attention/attention-as-faithful-explanation#assumption-2 | parsed | Contributions are additive over positions | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-as-faithful-explanation.md | Contributions are additive over positions. Violated — attention heads compose multiplicatively across layers; single-token $Delta$ misses interactions. | violated |
21,747 | problem:02-attention/attention-as-faithful-explanation#assumption-3 | parsed | Attention is the only routing channel | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-as-faithful-explanation.md | Attention is the only routing channel. Violated — residual stream, LayerNorm scaling, and value-vector norms all carry magnitude that $A$ does not (Kobayashi et al., EMNLP 2020). | violated |
21,748 | problem:02-attention/attention-as-faithful-explanation#assumption-4 | parsed | One true explanation exists | real | 2026-10-07 | ai_research | 2026-09-10 | https://github.com/samyama-ai/ai_research/blob/a02e87b368016fd9568ba5ae8561ea601a8dee41/topics/02-attention/attention-as-faithful-explanation.md | One true explanation exists. Violated under redundancy: two duplicated evidence tokens each have zero individual causal effect. | violated |
AI Research Open-Problems Knowledge Graph
29,707 nodes. 62,842 edges. A catalog of 1,000 open and hard research problems in AI and machine learning as a graph: each problem with its topic, the papers it cites and their authors and venues, the assumptions it rests on, the open questions it leaves, what blocks it, and the next experiment that would move it.
Built with Samyama Graph.
Source catalog: samyama-ai/ai_research, commit
a02e87b368016fd9568ba5ae8561ea601a8dee41 (source date 2026-09-10, retrieved 2026-10-07).
Licence: not yet chosen. The source repository states no licence. This card will be updated when one is chosen. Until then, do not assume any reuse rights.
What is in it
Every problem page in the source catalog follows a 10-section template. The graph keeps its structure:
- Problem (1,000) — title, statement, and status:
open401,empirically-open295,partially-solved189,methodologically-blocked96,solved-but-impractical19. - Topic (35) — the catalog's taxonomy, from tokenization onward.
- Paper (4,932), Person (15,102), Venue (527) — the literature each problem cites, parsed from the pages' references.
- Assumption (3,263) — what a problem rests on, with whether it is violated.
- OpenQuestion (3,790) — classified as theoretically open (1,152), empirically open (1,509), methodologically blocked (1,088), or unclassified (41).
- Obstruction (6) — recurring reasons progress is blocked, e.g. confounded measurement.
- FutureDirection (1,000) — the concrete next experiment, one per problem, with its scale.
- Institution (51) — groups active on a problem.
Provenance — read this
- Problem pages are
synthesized, notverified. The source template marks each pagesynthesized | verified; all 1,000 here aresynthesized(catalog_provenancecolumn). Treat statements, assumptions, open questions and proposed experiments as a structured draft, not as reviewed expert consensus. - Citations are intended to be real. The source catalog's rules forbid fabricated identifiers and
its audit checks titles against the arXiv API. Paper nodes carry
arxiv_idordoiwhere present. They have not been independently re-verified for this release. - Every node carries
source_urlpointing at the exact file and commit it was parsed from, andmethodsaying how it was derived (parsed,name-matched,keyword-classified). - Person nodes are author names as printed in citations, not resolved identities. Two people with the same name may share a node, and one person cited two ways may have two.
Why a graph
// Which papers underpin the most open problems?
MATCH (p:Problem)-[:CITES]->(paper:Paper)
WHERE p.status IN ['open', 'empirically-open']
RETURN paper.title, count(p) AS problems ORDER BY problems DESC LIMIT 10
// Problems that are empirically open — the experiment is runnable — and what it would cost
MATCH (p:Problem)-[:HAS_GAP]->(q:OpenQuestion {kind: 'empirically_open'}),
(p)-[:HAS_NEXT_EXPERIMENT]->(f:FutureDirection)
RETURN p.title, f.scale LIMIT 20
// Shared hidden assumptions across topics
MATCH (t1:Topic)<-[:IN_TOPIC]-(:Problem)-[:RESTS_ON]->(a:Assumption)<-[:RESTS_ON]-(:Problem)-[:IN_TOPIC]->(t2:Topic)
WHERE t1 <> t2
RETURN a.name, collect(DISTINCT t1.name) AS topics LIMIT 20
Files
Nodes carry an id; edges reference those ids as src and tgt. A node's own key from the
source (e.g. person:rico_sennrich) is in the key column. List-valued properties are JSON strings.
nodes/
| File | Rows |
|---|---|
person.csv |
15,102 |
paper.csv |
4,932 |
openquestion.csv |
3,790 |
assumption.csv |
3,263 |
problem.csv |
1,000 |
futuredirection.csv |
1,000 |
venue.csv |
527 |
institution.csv |
51 |
topic.csv |
35 |
obstruction.csv |
6 |
datasource.csv |
1 |
edges/
| File | Rows | Connects |
|---|---|---|
authored_by.csv |
28,757 | Paper → Person |
cites.csv |
12,615 | Problem → Paper |
appeared_at.csv |
4,365 | Paper → Venue |
has_gap.csv |
3,790 | Problem → OpenQuestion |
rests_on.csv |
3,263 | Problem → Assumption |
related_to.csv |
3,128 | Problem → Problem |
active_on.csv |
2,476 | Institution → Problem |
blocked_by.csv |
1,448 | Problem → Obstruction |
has_next_experiment.csv |
1,000 | Problem → FutureDirection |
from_source.csv |
1,000 | Problem → DataSource |
in_topic.csv |
1,000 | Problem → Topic |
Usage
from datasets import load_dataset
problems = load_dataset("VaidhyaMegha/ai-research-kg", "problem")
docker run --rm -p 8080:8080 -p 6379:6379 public.ecr.aws/f9f6l5u4/samyama-graph:1.1.0
curl -X POST localhost:8080/api/snapshot/import -F "file=@ai-research.sgsnap"
Verification
- Totals reconcile against the snapshot header: 29,707 nodes, 62,842 edges, 11 labels, 11 edge types.
- 0 dangling edges. 0 orphan nodes.
- CSVs were exported from the same snapshot that is published here.
Limitations
- Problem content is synthesized and unreviewed (above).
- Edge creation timestamps are not in the snapshot; node timestamps are.
- Author names are not disambiguated.
- A point-in-time export of one commit; the source catalog keeps changing.
Citation
AI Research Open-Problems Knowledge Graph, v1.0 (29,707 nodes, 62,842 edges).
Built with Samyama Graph. https://huggingface.co/datasets/VaidhyaMegha/ai-research-kg
Source: https://github.com/samyama-ai/ai-research-kg.git
- Downloads last month
- 37