Metraipolis › archive › dc_8d2f18b472af
Artificial Rosetta Stone: Constrained Maximum A Posteriori (MAP) Reconstruction of Symbolic Raga Sequences via Order-k Markov Models — arXiv:2609.01064
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01064
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T06:52:37.972Z
- SHA-256 of the archived text
4d1cbbef1d7082f2d1be7c35816e85fcb991b11602d4a0af1d5840765300c742- Stable URL of this page
https://metraipolis.com/documento/dc_8d2f18b472af
How to cite
Artificial Rosetta Stone: Constrained Maximum A Posteriori (MAP) Reconstruction of Symbolic Raga Sequences via Order-k Markov Models — arXiv:2609.01064 — arXiv (en), https://arxiv.org/abs/2609.01064 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8d2f18b472af (Metraipolis archive dc_8d2f18b472af, sha256 4d1cbbef1d7082f2d1be7c35816e85fcb991b11602d4a0af1d5840765300c742)
BibTeX
@misc{dc8d2f18b472af,
title = {Artificial Rosetta Stone: Constrained Maximum A Posteriori (MAP) Reconstruction of Symbolic Raga Sequences via Order-k Markov Models — arXiv:2609.01064},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01064},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8d2f18b472af; sha256 4d1cbbef1d7082f2d1be7c35816e85fcb991b11602d4a0af1d5840765300c742},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01064. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Reconstructing a damaged musical fragment is an inverse problem: the observed sequence contains partial information, while a raga encodes constraints limiting allowable completions. This paper formalizes a mathematical framework for this, proposing the Artificial Rosetta Stone (ARS). We separate three claims often conflated: a symbolic sequence can be reconstructed probabilistically; a sequence can be consistent with an explicit grammar; and a historical performance can be authenticated. We only support the first two. We model a raga via a finite alphabet and constraint system, using an order-k Markov model for melodic probabilities. A symmetric Dirichlet prior yields a tractable posterior. We pose missing-note reconstruction as a constrained MAP problem. For fixed-length sequences and finite-order constraints, optimization admits an exact dynamic-programming solution with worst-case time complexity $O(TN^{k+1})$. We derive the parameter count $N^k(N - 1)$, prove a concentration bound under explicit mixing assumptions, and analyze estimation error propagation. A reproducible synthetic experiment uses six raga-inspired alphabets, orders $k \in \{1, 2, 3\}$, and masking rates up to 50%. This is a proof of concept, not historical reconstruction. A real-audio feasibility pilot evaluates 30 usable sequences from 42 Yaman clips via automated pitch extraction, segmentation, and quantization. Lacking documented provenance and relying on automated transcription, this is not expert-validated archival reconstruction. Claims are tied to stated conditions, not universal properties of Hindustani music. Code: this https URL .
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-02 in cs.LG).
Categorie arXiv: Sound (cs.SD) ; Machine Learning (cs.LG); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.01064 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:41:55.916Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).