Same Problem, Different Field: Cross-Domain Solution Import via Domain-Stripped Computational Fingerprints

• URL: http://arxiv.org/abs/2609.07595v2
• Date: Tue, 15 Sep 2026 17:57:19 GMT
• Title: Same Problem, Different Field: Cross-Domain Solution Import via Domain-Stripped Computational Fingerprints
• Abstract summary: We distill each paper once into a domain- and method-name-stripped faceted computational fingerprint.<n>The goal is solution import: surface cross-field pairs solving the same problem, so a bespoke implementation can be swapped for another field's standard, specialized solver.<n>On a benchmark of 18 method families across 109 papers, the skeleton lifts cross-domain retrieval average precision over the abstract from 0.222 to 0.513, and the whole fingerprint reaches 0.557.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The same underlying computational problem is solved across unrelated fields under different names: recursive Bayesian state estimation appears as a "Kalman filter" in control, "Bayesian forecasting" in pharmacokinetics, and "data assimilation" in geoscience. Topical and citation-based scientific embeddings cannot see this shared problem. We distill each paper once into a domain- and method-name-stripped faceted computational fingerprint, a free-text mechanism skeleton plus controlled computational facets. We define a tunable, facet-selectable similarity over it. The goal is solution import: surface cross-field pairs solving the same problem, so a bespoke implementation can be swapped for another field's standard, specialized solver. On a benchmark of 18 method families across 109 papers, the skeleton lifts cross-domain retrieval average precision over the abstract from 0.222 to 0.513, and the whole fingerprint reaches 0.557. Strikingly, four trained scientific embedders all fall below plain abstract+TF-IDF: they encode topical and citation similarity, the wrong signal for this task. The gain is the representation: the abstract-to-skeleton swap lifts every embedder, and the pipeline is one cached LLM call per paper plus a cheap embedder. An interventional re-skin / math-edit test shows the fingerprint tracks the computation, not the field. On a 501-paper wild corpus, known twins dominate the top of the ranking (23 of the top 30); with planted pairs excluded from the results, three blind LLM judges rate 3 of the top 5 and 8 of the top 30 pairs genuine import candidates, and 0 of 30 random ones. The human verification is the four executed imports: in one, an open standard solver reproduces a bespoke clinical dosing engine's output. We release the benchmark, the code, and the distillation prompt.

Related papers

• Calibrating Interpretability Instruments Before Trusting Their Verdicts [1.0829694003408499]
  Causal claims about large language model (LLM) internals rest on measurements.<n>These measurements fail in specific, diagnosable ways that return a plausible number instead of an error.<n>This note documents six such failures from a causal interpretability program on refusal and moral representation.
  arXiv  Detail & Related papers  (2026-09-13T19:37:02Z)
• ToolGate: An Executable Acceptance Pipeline for Tool-Dependent Scientific Benchmark Construction [5.992855612201743]
  We present ToolGate, which treats every generated item as a proposal and keeps it only if three gates pass.<n>ToolGate turns repeated answer checking and difficulty screening into an auditable process while leaving domain design and final review to experts.
  arXiv  Detail & Related papers  (2026-09-02T03:49:37Z)
• Split the Labor: Separating Evidence Interpretation from Decision Aggregation [0.0]
  Systems that ask a language model to reach a conclusion from many sources usually conflate them into one prompt.<n>We propose a four-field evidence (hypothesis, reliability bucket, rationale, provenance) and show that fixing it determines both halves.<n>The fix is arithmetic rather than architectural, and applies to a class of rules beyond language models.
  arXiv  Detail & Related papers  (2026-08-14T17:24:55Z)
• Automated High-Precision Extraction and Forensic Verification of Data-Bearing Vector Figures [45.39546965981896]
  The quantitative record of science and engineering is increasingly carried by figures rather than text or tables.<n>When a figure is stored as graphics, its data are not approximated by the picture but encoded in it.<n>We turn this into three contributions, one per shortcoming of hand digitization.
  arXiv  Detail & Related papers  (2026-06-30T08:43:32Z)
• Diagnosing Overhead in Dispatch Operations: Cross-architecture Observatory [1.081571058570587]
  AlltoAll dispatch is the dominant bottleneck of MoE expert parallelism.<n>We introduce DODOCO to test two assumptions about the workload.<n> scaling EP changes the per-expert max/mean token ratio by at most 5% within every architecture's measurable range.
  arXiv  Detail & Related papers  (2026-05-20T10:14:00Z)
• How Far Is Document Parsing from Solved? PureDocBench: A Source-TraceableBenchmark across Clean, Degraded, and Real-World Settings [56.70440596502351]
  The past year has seen over 20 open document parsing models, yet benchmarks almost exclusively on OmniDocBench.<n>We present PureDocBench, a benchmark thatrenders document images from HTML/CSS, covering 10 domains, 66 pages, and 1,475 pages.
  arXiv  Detail & Related papers  (2026-05-08T09:30:31Z)
• Benchmarking Complex Multimodal Document Processing Pipelines: A Unified Evaluation Framework for Enterprise AI [0.0]
  We built EnterpriseDocBench to take a swing at parsing fidelity, indexing efficiency, retrieval relevance, and generation groundedness.<n>We ran three pipelines through it -- BM25, dense embedding, and a hybrid -- all with the same GPT-5 generator.<n>One result that genuinely surprised us: factual accuracy on stated claims is 85.5%, but answer completeness averages 0.40.
  arXiv  Detail & Related papers  (2026-04-29T07:48:41Z)
• AlphaLab: Autonomous Multi-Agent Research Across Optimization Domains with Frontier LLMs [14.167136550376497]
  We present AlphaLab, an autonomous research harness that automates the full experimental cycle in computation-intensive domains.<n>It adapts to the domain and explores the data, writing analysis code and producing a research report.<n>It runs large-scale experiments via a Strategist/Worker loop, accumulating domain knowledge in a persistent playbook.
  arXiv  Detail & Related papers  (2026-03-31T21:16:20Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• Large Language Monkeys: Scaling Inference Compute with Repeated Sampling [81.34900892130929]
  We explore inference compute as another axis for scaling, using the simple technique of repeatedly sampling candidate solutions from a model.<n>Across multiple tasks and models, we observe that coverage scales with the number of samples over four orders of magnitude.<n>In domains like coding and formal proofs, where answers can be automatically verified, these increases in coverage directly translate into improved performance.
  arXiv  Detail & Related papers  (2024-07-31T17:57:25Z)
• Fact Checking Beyond Training Set [64.88575826304024]
  We show that the retriever-reader suffers from performance deterioration when it is trained on labeled data from one domain and used in another domain. We propose an adversarial algorithm to make the retriever component robust against distribution shift. We then construct eight fact checking scenarios from these datasets, and compare our model to a set of strong baseline models.
  arXiv  Detail & Related papers  (2024-03-27T15:15:14Z)
• Cherry-Picking Gradients: Learning Low-Rank Embeddings of Visual Data via Differentiable Cross-Approximation [53.95297550117153]
  We propose an end-to-end trainable framework that processes large-scale visual data tensors by looking emphat a fraction of their entries only. The proposed approach is particularly useful for large-scale multidimensional grid data, and for tasks that require context over a large receptive field.
  arXiv  Detail & Related papers  (2021-05-29T08:39:57Z)
• Revisiting Mahalanobis Distance for Transformer-Based Out-of-Domain Detection [60.88952532574564]
  This paper conducts a thorough comparison of out-of-domain intent detection methods. We evaluate multiple contextual encoders and methods, proven to be efficient, on three standard datasets for intent classification. Our main findings show that fine-tuning Transformer-based encoders on in-domain data leads to superior results.
  arXiv  Detail & Related papers  (2021-01-11T09:10:58Z)
• Unsupervised Intra-domain Adaptation for Semantic Segmentation through Self-Supervision [73.76277367528657]
  Convolutional neural network-based approaches have achieved remarkable progress in semantic segmentation. To cope with this limitation, automatically annotated data generated from graphic engines are used to train segmentation models. We propose a two-step self-supervised domain adaptation approach to minimize the inter-domain and intra-domain gap together.
  arXiv  Detail & Related papers  (2020-04-16T15:24:11Z)

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.