Structural Pattern Mining in Inka Khipus: Unsupervised Clustering, Provenance Classification, and a Computational Validation of the Santa Valley Match

• URL: http://arxiv.org/abs/2607.00185v1
• Date: Tue, 30 Jun 2026 21:06:38 GMT
• Title: Structural Pattern Mining in Inka Khipus: Unsupervised Clustering, Provenance Classification, and a Computational Validation of the Santa Valley Match
• Abstract summary: We present a machine-learning pipeline applied to the Open Khipu Repository (OKR), a public database of 619 khipus comprising 54,403 cords and 110,677 knots.<n>We engineer 27 structural features per khipu and apply (i) unsupervised clustering via UMAP and HDBSCAN, recovering three structurally distinct groups.<n>We report a negative result: reproducing knot-type sequence order, encoded as n-grams, adds no signal beyond aggregate features.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Khipus--knotted cord devices--were the primary recording medium of the Inka Empire (c. 1400-1532 CE), yet their system remains undeciphered. We present a reproducible machine-learning pipeline applied to the Open Khipu Repository (OKR), a public database of 619 khipus comprising 54,403 cords and 110,677 knots. We engineer 27 structural features per khipu and apply (i) unsupervised clustering via UMAP and HDBSCAN, recovering three structurally distinct groups (silhouette = 0.769); (ii) supervised provenance classification via gradient boosting, reaching F1 = 0.86 for the Inka Late Horizon imperial style; and (iii) SHAP-based interpretability, which identifies cord twist direction as the dominant structural discriminator of imperial khipus. We further report two findings of methodological interest. First, one cluster is dominated not by a geographic region but by nineteenth-century European museum collections, indicating that colonial acquisition and recording practices are structurally encoded in the corpus. Second, we provide an independent computational verification of the recto/verso (moiety) structure of the six Santa Valley khipus reported by Medrano and Urton (2018), reproducing both the aggregate attachment ratio and the identification of the single mixed specimen--using only the public OKR database, without physical access to the objects. We additionally report a negative result: knot-type sequence order, encoded as n-grams, adds no provenance signal beyond aggregate features. All code and data are openly available.

Related papers

• Architecture-Dependent Causal Transfer of Activation States Across Large Language Models [51.56484100374058]
  Internal language activation states can be transferred causally between different large language models.<n>Injecting projected activations into a target model during generation produces a statistically significant, preregistered causal effect.<n>We conclude that end-to-end activation-state transfer between LLMs, as currently implemented, is architecture-dependent rather than universal.
  arXiv  Detail & Related papers  (2026-08-17T09:53:27Z)
• Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles [0.0]
  Predictive models in clinical and regulated settings must be accurate and fully auditable.<n>We introduce Residual Pattern Tree Ensemble (RPTE), a three-stage learning approach.<n>RPTE builds on three key principles: bounded feature budget, source disjointness, and separate coefficient estimation.
  arXiv  Detail & Related papers  (2026-08-16T12:56:49Z)
• Modeling Normal Is All You Need: Joint Latent Clustering for Anomaly Detection in Multimodal Cyber-Physical Systems [47.027290803102666]
  Normal behaviour is the union of many imbalanced, curved, thin-fringed operating regimes.<n>We model the normal law with a jointly learned latent representation plus explicit Gaussian-mixture mode clustering.<n>We evaluate under a deliberately fair protocol: raw point-wise metrics with no point adjustment, a trivial-detector difficulty split, prevalence-matched F1, and train-normal-only calibration.
  arXiv  Detail & Related papers  (2026-07-07T10:10:00Z)
• A Modelling and Evaluation Framework for EuroCrops-Driven Sentinel-2 Crop Segmentation [78.66324246922831]
  This work presents a pipeline for generating semantic-segmentation-ready agricultural datasets from Sentinel-2 imagery and EuroCrops parcel-level annotations.<n>The dataset contains 67,337 patches from five European countries and uses a reduced taxonomy of ten crop classes plus background.<n>A four-level U-Net with Group Normalization was trained using 10 Sentinel-2 spectral bands and a composite loss combining class-weighted cross-entropy and Dice loss.
  arXiv  Detail & Related papers  (2026-05-30T11:20:29Z)
• Learn from your own latents and not from tokens: A sample-complexity theory [53.5821824211418]
  We study networks trained to predict their emphown latent representations of related views or masked regions.<n>We show that latent prediction achieves this with a number of samples emphconstant in $L$, up to logarithmic factors.<n>This suggests that explicit stacking such as H-JEPA is largely redundant.
  arXiv  Detail & Related papers  (2026-05-26T22:16:42Z)
• Fine-Tuning Over Architectural Complexity: Broad-Coverage PII Detection on PIIBench with DeBERTa [0.0]
  PII detection systems are frequently trained within narrow source or domain boundaries, limiting coverage when deployed on heterogeneous text.<n>We study model fine-tuning on a corrected multi-source PIIBench preparation spanning 82 retained entity types across ten source datasets.<n>We evaluate three DeBERTa-based approaches: direct token classification fine-tuning, a source-conditioned hierarchical model (SC+H), and a three-phase curriculum extension (SC+H+Curr)
  arXiv  Detail & Related papers  (2026-05-25T13:12:42Z)
• GLAN-QnA-KR: A Seedless Taxonomy-Driven Korean Instruction Corpus [0.0]
  We release GLAN-QnA-KR, a 303,581-row openly redistributable Korean instruction-QA corpus.<n>The corpus spans a flat taxonomy of 1,084 English-labelled disciplines paired with Korean question/answer text.
  arXiv  Detail & Related papers  (2026-05-12T15:23:59Z)
• PrimeKG-CL: A Continual Graph Learning Benchmark on Evolving Biomedical Knowledge Graphs [19.859134741964805]
  Existing continual graph learning has been studied almost exclusively on synthetic random, generic KGs.<n>We introduce a benchmark built from nine authoritative biomedical databases.<n>We evaluate six CL strategies across four KGE decoders, plus LKGE, an CK-hugging agent, and CMKL.
  arXiv  Detail & Related papers  (2026-05-11T13:14:02Z)
• DiRe-RAPIDS: Topology-faithful dimensionality reduction at scale [47.983130047068165]
  We show that top-performing embeddings invent cycles and disconnected islands absent from the data.<n>On 723K arXiv paper embeddings, DiRe preserves 3-4 times more topological structure than UMAP at comparable wall-clock.
  arXiv  Detail & Related papers  (2026-04-28T04:28:22Z)
• GSAR: Typed Grounding for Hallucination Detection and Recovery in Multi-Agent LLMs [0.0]
  We present a groundedness framework that partitions claims into a four-way typology (grounded, ungrounded, contradicted, complementary)<n>GSAR is the first published groundedness framework coupling evidence-typed scoring with tiered recovery under an explicit compute budget.
  arXiv  Detail & Related papers  (2026-04-25T16:20:28Z)
• How Non-Linguistic Is the Indus Sign System? A Synthetic-Baseline Scorecard [0.913755431537592]
  This paper introduces a multi-metric discrimination framework to test whether the Indus Valley sign system encodes spoken language.<n>Applying this framework to 1,916 deduplicated inscriptions from the ICIT/Yajnadevam digitization, we find that the Indus corpus does not match either baseline cleanly.<n>We also compare against seven real-world non-linguistic corpora including Sproat's (2014) datasets, finding that no attested non-linguistic system reproduces the full Indus statistical profile either.
  arXiv  Detail & Related papers  (2026-04-20T05:29:56Z)
• ATLAS: Constitution-Conditioned Latent Geometry and Redistribution Across Language Models and Neural Perturbation Data [0.0]
  Constitution-conditioned post-training can be analysed as a structured perturbation of a model's learned representational geometry.<n>We introduce ATLAS, a geometry-first program that traces constitution-induced hidden-state structure across charts, models, and substrates.
  arXiv  Detail & Related papers  (2026-04-19T23:26:02Z)
• ECOSoundSet: a finely annotated dataset for the automated acoustic identification of Orthoptera and Cicadidae in North, Central and temperate Western Europe [51.82780272068934]
  We present ECOSoundSet (European Cicadidae and Orthoptera Sound dataSet), a dataset containing 10,653 recordings of 200 orthopteran and 24 cicada species (217 and 26 respective taxa when including subspecies) present in North, Central, and temperate Western Europe.<n>This dataset could serve as a meaningful complement to recordings already available online for the training of deep learning algorithms for the acoustic classification of orthopterans and cicadas in North, Central, and temperate Western Europe.
  arXiv  Detail & Related papers  (2025-04-29T13:53:33Z)
• DynGFN: Towards Bayesian Inference of Gene Regulatory Networks with GFlowNets [81.75973217676986]
  Gene regulatory networks (GRN) describe interactions between genes and their products that control gene expression and cellular function. Existing methods either focus on challenge (1), identifying cyclic structure from dynamics, or on challenge (2) learning complex Bayesian posteriors over DAGs, but not both. In this paper we leverage the fact that it is possible to estimate the "velocity" of gene expression with RNA velocity techniques to develop an approach that addresses both challenges.
  arXiv  Detail & Related papers  (2023-02-08T16:36:40Z)
• Clue Me In: Semi-Supervised FGVC with Out-of-Distribution Data [44.90231337626545]
  We propose a novel design specifically aimed at making out-of-distribution data work for semi-supervised visual classification. Our experimental results reveal that (i) the proposed method yields good robustness against out-of-distribution data, and (ii) it can be equipped with prior arts, boosting their performance.
  arXiv  Detail & Related papers  (2021-12-06T07:22:10Z)
• Robustifying Algorithms of Learning Latent Trees with Vector Variables [92.18777020401484]
  We present the sample complexities of Recursive Grouping (RG) and Chow-Liu Recursive Grouping (CLRG) We robustify RG, CLRG, Neighbor Joining (NJ) and Spectral NJ (SNJ) by using the truncated inner product. We derive the first known instance-dependent impossibility result for structure learning of latent trees.
  arXiv  Detail & Related papers  (2021-06-02T01:37:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.