<?xml version='1.0' encoding='UTF-8'?>
<feed xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:arxiv="http://arxiv.org/schemas/atom" xmlns="http://www.w3.org/2005/Atom">
  <id>https://arxiv.org/api/tb9Ds+EcwM+h5Tnx2gkDegin7no</id>
  <title>arXiv Query: search_query=cat:cs.DL&amp;id_list=&amp;start=0&amp;max_results=60</title>
  <updated>2026-09-06T21:34:19Z</updated>
  <link href="https://arxiv.org/api/query?search_query=cat:cs.DL&amp;start=0&amp;max_results=60&amp;id_list=" type="application/atom+xml"/>
  <opensearch:itemsPerPage>60</opensearch:itemsPerPage>
  <opensearch:totalResults>6299</opensearch:totalResults>
  <opensearch:startIndex>0</opensearch:startIndex>
  <entry>
    <id>http://arxiv.org/abs/2609.03291v1</id>
    <title>Constructing the Field of Philanthropic and Nonprofit Studies: Evidence from Citation Networks</title>
    <updated>2026-09-03T02:38:32Z</updated>
    <link href="https://arxiv.org/abs/2609.03291v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.03291v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Philanthropic and nonprofit studies (PNPS) has grown rapidly as an interdisciplinary field, yet its intellectual structure and boundaries remain only partially visible. This study maps the field by combining journal- and keyword-based retrieval with citation network analysis, natural language processing, and large language model-assisted cluster labeling. Using 60,917 Web of Science articles, we identify major topical communities, examine their structural connections, and assess how well mainstream PNPS journals represent the broader landscape of related scholarship. The results show that PNPS is a loosely connected field dominated by three distinct "power centers": nonprofit organizations, social movements, and voluntary action. The analysis also reveals a broader disciplinary footprint than commonly recognized, extending beyond the social sciences and humanities into areas such as biomedicine and technology. These findings clarify the organization of PNPS and highlight opportunities for stronger integration across research domains.</summary>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-03T02:38:32Z</published>
    <arxiv:comment>31 pages, 10 Figures, 2 Tables</arxiv:comment>
    <arxiv:primary_category term="cs.SI"/>
    <author>
      <name>Jin Ai</name>
    </author>
    <author>
      <name>Richard S. Steinberg</name>
    </author>
    <author>
      <name>Chao Guo</name>
    </author>
    <author>
      <name>Filipi Nascimento Silva</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.03105v1</id>
    <title>FOXDEN: FAIR Services for AI-Ready Scientific Datasets</title>
    <updated>2026-09-02T19:37:27Z</updated>
    <link href="https://arxiv.org/abs/2609.03105v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.03105v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Scientific datasets are most compatible with AI workflows when they are described by rich, machine-readable metadata and provenance information, following the FAIR guiding principles. The FAIR Open-Science Extensible Data Exchange Network (FOXDEN) is a set of cyberinfrastructure building blocks developed at the Cornell High Energy Synchrotron Source (CHESS) for annotating raw, reduced, and analyzed datasets with both structured and unstructured metadata and provenance records. It also allows researchers to publish these records with Digital Object Identifiers (DOIs) to create AI-ready datasets. We describe FOXDEN's architecture and its deployment at CHESS and at the National High Magnetic Field Laboratory, where it serves as a foundation for future agentic scientific workflows.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-02T19:37:27Z</published>
    <arxiv:comment>21 pages, 7 figures</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Valentin Kuznetsov</name>
    </author>
    <author>
      <name>Werner M. Sun</name>
    </author>
    <author>
      <name>Keara Soloway</name>
    </author>
    <author>
      <name>Rolf Verberg</name>
    </author>
    <author>
      <name>Katherine S. Shanks</name>
    </author>
    <author>
      <name>Suchismita Sarker</name>
    </author>
    <author>
      <name>David S. Butcher</name>
    </author>
    <author>
      <name>Kelly E. Nygren</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.02379v1</id>
    <title>MultiGhostBench: A Multilingual Benchmark for Long-Form LLM-Generated Text Attribution under Distribution Shifts</title>
    <updated>2026-09-02T09:52:45Z</updated>
    <link href="https://arxiv.org/abs/2609.02379v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.02379v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>While existing work on LLM authorship attribution (AA) has made progress, available benchmarks remain limited, often focusing on English, controlled settings, or relatively outdated models, with the few multilingual studies considering only relatively short texts. We introduce MultiGhostBench, a multilingual benchmark comprising 928 books generated by five recent LLMs across six languages and three scripts, with an average length of approximately 59K words per book. The benchmark supports evaluation under domain, author, and language shifts. Evaluation of representative AA methods shows that no single method consistently performs best across settings, and performance generally degrades under distribution shifts. Transformer-based detectors can retain generator-related information across languages, although transfer effectiveness varies by language pair, whereas statistical and fingerprint-based detectors are more language-dependent. We envision MultiGhostBench as a valuable resource for the development and evaluation of robust AA methods. The dataset and code can be found at https://github.com/GrecoMT/MultiGhostBench.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-02T09:52:45Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Matteo Greco</name>
    </author>
    <author>
      <name>Anudeex Shetty</name>
    </author>
    <author>
      <name>Andrea Tagarelli</name>
    </author>
    <author>
      <name>Jey Han Lau</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.01905v1</id>
    <title>Guiding LLM Peer Reviewers: The Impact of Score Anchors on Review Evidence and Accuracy</title>
    <updated>2026-09-01T22:05:43Z</updated>
    <link href="https://arxiv.org/abs/2609.01905v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.01905v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large language models (LLMs) are increasingly used for research quality evaluation, with prior work exploring their scoring accuracy and the plausibility of review rationales. However, less is known about whether external score guidance changes the evidence presented in the generated review as well as the final score. This study uses 98 Allied Health Professions research outputs submitted for internal REF-style assessment, with specialist human review reports and adjudicated 1-4 reference scores. No-guidance baseline reviews are compared with oracle-guided reviews, where the supplied score is set to the rounded human reference score; extracted evaluation points are used to compare human and LLM evidence use. Using this design, oracle guidance improves scoring accuracy, with score-following checks showing that models do not simply copy the supplied score. Corrected score mismatches are associated with changes in the generated review frame, showing that the score signal can steer review rationales. This effect is direction-dependent: LLM reviews cover human strength or upgrade points more reliably than human weakness or downgrade points, with the weakest alignment for expert downgrade evidence. The results show that score-guided review generation can be evaluated at the level of review evidence, as well as the final score.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-01T22:05:43Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Judita Preiss</name>
    </author>
    <author>
      <name>Yunhan Yang</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.01895v1</id>
    <title>Beyond Human-Likeness: Mapping the Scientific Critique Profiles of LLMs and Human Reviewers</title>
    <updated>2026-09-01T21:51:07Z</updated>
    <link href="https://arxiv.org/abs/2609.01895v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.01895v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large language models (LLMs) are increasingly discussed as tools for peer review, but their value is often assessed through human-likeness, perceived usefulness, or textual overlap with reviewer comments. This study shifts attention from whether LLMs resemble human reviewers to what functions of scientific critique they perform. Using ICLR 2025 peer-review data, we compare human reviews with LLM reviews generated under baseline and expert prompts. We operationalize scientific critique through two review acts, weakness critique and scientific questioning, and annotate point-level review text using five theory-guided frameworks: Anderson's knowledge types, Toulmin's argumentation model, Graesser's question depth, SOLO cognitive complexity, and Hattie's feedback functions. The results reveal a differentiated critique profile. Human reviews placed greater emphasis on scientific framing and revision guidance, more often identifying higher-order weaknesses and asking questions oriented toward improvement. LLM reviews showed higher rates of explanatory depth, integrative reasoning, and explicit argument structuring. Expert prompting did not make LLM critique uniformly more human-like; it partially narrowed some gaps but mainly amplified LLM-specific tendencies toward integration and formal argumentation. These findings show that LLM-assisted peer review changes the functional composition of review text, making it important to distinguish LLM-amplified critique from areas requiring human prioritization and accountable judgement.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-01T21:51:07Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Yunhan Yang</name>
    </author>
    <author>
      <name>Mike Thelwall</name>
    </author>
    <author>
      <name>Guoxiu He</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.01432v1</id>
    <title>Citing Less Critically: LLMs Reshape the Rhetoric and Reach of Scientific Citation</title>
    <updated>2026-09-01T15:42:04Z</updated>
    <link href="https://arxiv.org/abs/2609.01432v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.01432v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Scientific citations carry rhetorical intent. Scholars may cite prior work positively (supporting), negatively (contrasting), or neutrally (mentioning). As large language models (LLMs) increasingly assist scientific writing, whether they reproduce citations with the same rhetorical intent as humans remains unclear. We introduce a masked-citation task to compare human and LLM-generated citation behavior. For each citation context, an LLM generates a replacement citation sentence, producing a counterfactual corpus directly comparable to human citation. We analyze what, whom, and how models cite, using an LLM-as-a-judge to classify citation intent and a 20-million-edge coauthorship network to measure social distance between cited authors. Across six popular LLMs and 1,746 top NLP conference papers (63k+ contexts, 132k+ citations), three patterns emerge: (1) Compared with human citation, LLMs cite significantly less critically; (2) LLMs over-cite popular and older papers, a tendency amplified for contrasting citations where human writing more often draws on recent, niche work; (3) Whereas humans often cite within their close social network, especially for supporting citations, LLMs tend to draw on more socially distant authors. Together, these differences are double-edged: LLM citation reaches beyond a scholar's close collaborators while being less critical and amplifying visibility bias, reshaping the rhetoric and reach of scientific citation.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-01T15:42:04Z</published>
    <arxiv:comment>Accepted at the EMNLP 2026 main conference</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Yixuan Liu</name>
    </author>
    <author>
      <name>Lin Chen</name>
    </author>
    <author>
      <name>Zhuoqi Liu</name>
    </author>
    <author>
      <name>Jianglin Lu</name>
    </author>
    <author>
      <name>Dakota Murray</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.00969v1</id>
    <title>The zbMATH Open Knowledge Graph: Tracing Centuries of Mathematical Research</title>
    <updated>2026-09-01T09:27:06Z</updated>
    <link href="https://arxiv.org/abs/2609.00969v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.00969v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>We present the zbMATH Open Knowledge Graph, a large-scale RDF knowledge graph (KG) covering more than 250 years of mathematical scholarship. Unlike existing scholarly knowledge graphs that primarily capture bibliographic metadata and citation structures, the zbMATH Open KG integrates expert-curated semantic content, including reviews, keywords, subject classifications, software references, and disambiguated authorship. This combination of domain-specific representation of mathematical knowledge and extensive temporal coverage supports analyses that require fine-grained exploration of mathematical concepts, research fields, and scholarly relationships over time. The resulting graph comprises 34 million entities and 168 million RDF triples represented using established Semantic Web vocabularies, supporting interoperability and FAIR data principles. We further demonstrate its capabilities through query-driven historically grounded scholarly exploration use cases, illustrating how the knowledge graph can surface relationships and patterns that may be difficult to identify from bibliographic and citation information alone. The zbMATH Open KG provides an open semantic infrastructure for studying the development of mathematical knowledge and tracing scholarly connections across centuries of scholarship.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-01T09:27:06Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Yuni Susanti</name>
    </author>
    <author>
      <name>Moritz Schubotz</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2609.00323v1</id>
    <title>Do Large Language Models Favour Any Research Topics?</title>
    <updated>2026-08-31T20:12:58Z</updated>
    <link href="https://arxiv.org/abs/2609.00323v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.00323v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large Language Models (LLMs) can estimate the quality of published journal articles, potentially supporting human assessment when evaluations are needed. Whilst there are reasons to believe that LLMs may have biases in this role, there is no statistically strong evidence yet. The current article addresses this gap with an exploration of the types of articles that attract high or low LLM scores in 73,489 articles from 15 health and life sciences journals. Based on comparing the words in the titles and abstracts of higher and lower scoring articles for two LLMs in various ways, the results suggest that topics favoured by GPT-OSS-120B include viruses, genes and cells and its disfavoured topics include surveys, patients and students. It is not clear whether these patterns reflect underlying quality differences or AI biases, however. The same method found systematic differences between the topics favoured by GPT-OSS-120B and Gemma 3 27B, such as Gemma 3 27B giving relatively higher scores for machine learning research, proving that at least one of the two LLMs has AI bias. Finally, comparing the scores for full-text articles compared to scores for titles and abstracts also finds differences for both LLMs, showing that they both can exhibit AI bias for at least one of these two input types, and probably both. Overall, the results show that it is important to consider LLM biases when deciding whether to use them for research evaluation tasks.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-31T20:12:58Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Mike Thelwall</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.30613v1</id>
    <title>Tracing high-profile attention to questionable research as a case for funder due diligence</title>
    <updated>2026-08-31T11:24:50Z</updated>
    <link href="https://arxiv.org/abs/2608.30613v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.30613v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>When questionable research has entered the scientific record, it stands the same chance as other literature of shaping national and international policy, clinical guidance, and research and development activities. This study uses a known authorship-for-sale network identified in August 2022 to examine whether questionable research influences policy, patents, and clinical guidelines, and whether its authors continue to secure funding and publish after exposure. Across nearly 2,000 publications in our dataset, 57 were cited in policy documents, 12 in clinical guidelines, and 480 in patents. Nearly a quarter of these publications are linked to one or more grants: funding that could otherwise have supported rigorous, ethical science. Among the 278 authors we traced, publishing and funding continued well after the PNN's public exposure in 2022: over 90% continued publishing, and 23% were linked to a grant.
  As our findings show, the participants of paper mills and authorship-for-sale networks can still inform policy and clinical practice and support their authors' career progression even after the questionable practices behind them are exposed. We present a case for funders to consider authorship and network structure as part of a holistic due diligence process, alongside metrics such as citation counts and attention data.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-31T11:24:50Z</published>
    <arxiv:comment>40 pages, 6 figures</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Federica Silvi</name>
    </author>
    <author>
      <name>Leslie D. McIntosh</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.30510v2</id>
    <title>Lot Machine: Multimodal Lot Extraction from Auction Catalogs</title>
    <updated>2026-09-01T20:07:28Z</updated>
    <link href="https://arxiv.org/abs/2608.30510v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.30510v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>For provenance research and art market studies, auction catalogs are an essential resource to trace specific objects over time and space. While historical auction catalogs follow established domain conventions, their internal formatting remains highly variable, and their large-scale analysis is currently restricted by the lack of machine-readable representations of the auction lots. We propose a pipeline to automatically extract structured lot-level metadata from German Sales, a large database of historical auction and sales catalogs from the 19th and 20th centuries. Using a manually annotated test set of representative catalog pages, we evaluate Vision-Language Models (VLMs) under varying prompt strategies and constrained decoding frameworks. To reflect the practical constraints faced by cultural heritage institutions, including budget, compute resources, and data privacy requirements, we benchmark the methods across different deployment modes ranging from commercial providers to locally hosted, quantized models. We find that commercial endpoints establish the performance ceiling, while institutional gateways offer a viable, privacy-preserving alternative. Local deployments remain feasible, but strictly require enforcing the output structure during generation to guarantee a valid JSON format. While varying degrees of human-in-the-loop correction are still necessary, this work demonstrates that a VLM-based pipeline can successfully unlock historical auction catalogs for large-scale automated analysis.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-31T09:44:15Z</published>
    <arxiv:comment>Accepted at the VISART Workshop (Computer Vision for Art Analysis), ECCV 2026. 19 pages, 6 figures, 5 tables. Supplementary material included as an appendix. Code, benchmark data, and prompt templates: https://github.com/mathiaszinnen/auction-lot-extraction</arxiv:comment>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Mathias Zinnen</name>
    </author>
    <author>
      <name>Alisha Mund</name>
    </author>
    <author>
      <name>Sabine Lang</name>
    </author>
    <author>
      <name>Lukas Hüttner</name>
    </author>
    <author>
      <name>Thomas Gorges</name>
    </author>
    <author>
      <name>Vincent Christlein</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.30274v1</id>
    <title>SoniMet - A tool for sonifying and visualizing the performance of single researchers</title>
    <updated>2026-08-31T05:40:50Z</updated>
    <link href="https://arxiv.org/abs/2608.30274v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.30274v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>For centuries, the scientific community has predominantly relied on visual tools to communicate empirical results and complex datasets. While visual representations dominate bibliometric analyses, the human auditory system possesses sensitive capacities for processing complex temporal information, distinguishing intricate patterns, and tracking parallel data streams. Data sonification translates data relations into acoustic signals, offering an alternative method for data exploration, pattern recognition, and scientific communication. This paper applies this concept to the field of bibliometrics through metrics sonification-the auditory translation of bibliometric information-and introduces SoniMet (Sonifying Metrics), a web-based tool designed to visualize and sonify the publication and citation data of individual scientists (see https://sonimet.kennebec.co.uk). SoniMet connects to the OpenAlex database to retrieve bibliometric records and displays them on an interactive chronological timeline. The tool employs direct parameter mapping to translate citation impact indicators into non-speech sound: field-weighted citation impact and citation counts determine the pitch and volume of a synthesized note and are mapped to the acoustic echo strength. Although SoniMet expands the methodological toolkit for research evaluation, current limitations include its restriction to individual scholar profiles and the challenge of integrating transient audio files into traditional, text-based scientific publishing workflows. Future empirical user studies are necessary to systematically evaluate the analytical utility and cognitive benefits of metrics sonification compared to established visual methods.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="physics.soc-ph" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-31T05:40:50Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Tim Waterfield</name>
    </author>
    <author>
      <name>Lutz Bornmann</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.29612v1</id>
    <title>LLMs Interpret, Embeddings Organize, Graphs Emerge: Agent-Driven Compilation of Scientific Knowledge</title>
    <updated>2026-08-30T07:05:49Z</updated>
    <link href="https://arxiv.org/abs/2608.29612v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.29612v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Sustained scientific work requires a knowledge substrate that carries interpretation across tasks and preserves paths to source evidence. We call this process \emph{scientific knowledge compilation} and implement it in ASKS, the \emph{Agent-Driven Scientific Knowledge System}. For each source, an LLM produces a readable Wiki view and machine-facing semantics. Deterministic checks convert the latter into a document-local GraphDelta, and embedding geometry together with explicit graph rules integrates the proposed changes into persistent state. Each ingest is an inspectable state transition over accumulated knowledge, with compiled Wiki and graph views linked to the preserved source record. We examine this process by chronologically compiling 56 published papers from one research program. Branch survival, cross-paper support, lineage, coverage, and churn yield a source-traceable author research portrait centered on tensor-network methods, with branches into quantum many-body research, tensor-network machine learning, and quantum-AI-oriented directions. In this run, higher-level Hub organization remains stable and low-churn. Canonical-node growth is predominantly additive. Graph-level measurements and navigation paths retain links to the source records from which they were compiled.</summary>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-30T07:05:49Z</published>
    <arxiv:comment>15 (main text) + 6 (SM) pages, 4 + 1 figures</arxiv:comment>
    <arxiv:primary_category term="cs.AI"/>
    <author>
      <name>Shi-Ju Ran</name>
    </author>
    <author>
      <name>Kun Zhang</name>
    </author>
    <author>
      <name>Xi Wu</name>
    </author>
    <author>
      <name>Liu-Si Yang</name>
    </author>
    <author>
      <name>Wen-Jun Li</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.28822v1</id>
    <title>Filling holes in science draws collective attention, but most higher-order holes remain unexplored</title>
    <updated>2026-08-28T19:48:28Z</updated>
    <link href="https://arxiv.org/abs/2608.28822v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.28822v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Much scientific discovery involves filling holes between ideas and arguments that unleash techno-scientific advance. Representing knowledge as high-dimensional concept embeddings, we use persistent homology to detect holes of increasing order, from gaps between disconnected ideas to higher-order cavities, and identify the research works that fill them. We find two empirical asymmetries. Researchers who fill anticipated holes are poised to draw collective attention by staging outsized novelty and foresight, indicating that bridging holes anticipates where science will converge, most strongly in empirical fields and least in formal and design fields. Yet as knowledge grows, higher-order holes explode while the fraction science fills collapses, leaving most higher-order combinations unexplored. These results call for a richer science of holes, and mark a frontier where contemporary AI might help fill the high-dimensional gaps human science opens.</summary>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-28T19:48:28Z</published>
    <arxiv:comment>25 pages of main text, 140 with all the supplemental. 4 main figures, many more in the supplement</arxiv:comment>
    <arxiv:primary_category term="cs.CY"/>
    <author>
      <name>Jiajie Luo</name>
    </author>
    <author>
      <name>James A. Evans</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.28819v1</id>
    <title>Visible but Not Yet Curatable: Characterizing the Curatability of Compact and Derived Open LLM Artifacts</title>
    <updated>2026-08-28T19:40:33Z</updated>
    <link href="https://arxiv.org/abs/2608.28819v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.28819v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Open Large Language Model (LLM) research increasingly produces compact and derived artifacts, such as adapters, quantized checkpoints, merged models, and distilled variants, that are distributed across papers, model hubs, model cards, code repositories, and release statements. Although these artifacts are publicly visible, digital libraries often lack sufficient evidence to identify, preserve, and cite them as coherent scholarly objects. We introduce a framework that conceptualizes curatability as a record-level property of distributed scholarly records and operationalizes it through four evidence dimensions: artifact identity, scholarly linkage, upstream evidence, and release assets. Guided by this framework, we conduct the first collection-scale characterization of open LLM curatability using a May 2026 snapshot of 191,375 public Hugging Face repositories and a core corpus of 2,214 scholarly papers. Our results reveal a pronounced visibility-to-curatability funnel. While 90.7% of paper records contain at least one useful curation signal, only 18.1% combine usable upstream evidence with concrete release evidence, and only 6.1% provide sufficiently coordinated evidence to support high-curatability records. Based on these findings, we derive a minimal seven-field curatable record and complementary responsibilities for model hubs, scholarly indexes, and digital libraries, providing practical guidance for improving the preservation and bibliographic control of open LLM artifacts.</summary>
    <category term="cs.HC" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-28T19:40:33Z</published>
    <arxiv:comment>11 pages, 5 figures. Accepted at the ACM/IEEE Joint Conference on Digital Libraries (JCDL 2026). Yiyi Lu and Yilai Qian contributed equally; Yucheng Jin is the corresponding author. Code and results: https://github.com/AndyLu666/VNYC-Open_Source_LLM_Study</arxiv:comment>
    <arxiv:primary_category term="cs.HC"/>
    <author>
      <name>Yiyi Lu</name>
    </author>
    <author>
      <name>Yilai Qian</name>
    </author>
    <author>
      <name>Yucheng Jin</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.28139v2</id>
    <title>China's Shrinking Home Bias and Rising Disruptive Impact: Evidence from a Global Citation Network Analysis</title>
    <updated>2026-08-31T08:53:24Z</updated>
    <link href="https://arxiv.org/abs/2608.28139v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.28139v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>China has become the world's largest producer of scientific publications, yet concerns persist that this growth is inflated by excessive domestic citation practices. In this study, we analyze a citation network of over 45 million publications from Web of Science (1980-2025) to investigate China's home citation bias and research impact. Using a network reshuffling null model to control for the structural effect of publication volume, we find that China's home citation bias is less pronounced than commonly assumed and has been steadily declining over the past two decades. Chinese researchers do not exhibit a significantly stronger home citation preference than other major countries, indicating increasing internationalization rather than insularity. Furthermore, using the persistent disruption framework, we show that Chinese papers are converging toward American papers in their capacity to produce paradigm-shifting work. These findings challenge prevailing narratives about Chinese scientific home bias and suggest that China's advances in research impact.</summary>
    <category term="physics.soc-ph" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-28T10:00:22Z</published>
    <arxiv:comment>Accepted at the 30th Annual International Conference on Science and Technology Indicators (STI-ENID 2026), Antwerp, Belgium</arxiv:comment>
    <arxiv:primary_category term="physics.soc-ph"/>
    <author>
      <name>Nan Deng</name>
    </author>
    <author>
      <name>Zheng Ma</name>
    </author>
    <author>
      <name>Xiaohui Liu</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.27720v1</id>
    <title>Measuring the Installed Base: Nordic Health Dataset Catalogues Against HealthDCAT-AP Release 7</title>
    <updated>2026-08-27T21:23:18Z</updated>
    <link href="https://arxiv.org/abs/2608.27720v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.27720v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>The European Health Data Space requires member states to publish machine readable descriptions of the health datasets available for secondary use, and the European Commission publishes HealthDCAT-AP as the metadata profile those descriptions are meant to satisfy. The profile has been designed and validated against curated examples, never against the catalogues already live. We report that measurement for the Nordic region. On 25 August 2026 the 11 Nordic national catalogues harvested by the European data portal held 2,811 dataset descriptions carrying the EU health theme, and none satisfies all eight properties HealthDCAT-AP Release 7 makes mandatory on a dataset. Three of the eight are present on exactly zero records across five countries. Set beside the portal's own quality assessment, which validates DCAT-AP and never mentions the health profile, this is not a health extension skipped on top of sound generic practice: no Nordic catalogue reaches the assessment's top rating band, 5 of the 11 are reported at zero per cent DCAT-AP compliant, and the properties surviving in both layers are the ones a human types into a form, not the ones needing a value bound to a controlled vocabulary. Two further results follow. Finland contributes 2,259 descriptions to the European portal of which 1,146 carry a theme, and not one uses the EU theme authority vocabulary, so a European health filter returns no Finnish dataset at all. Separately, the authority namespace answers HTTP 200 with a well formed empty document for terms it never defined, letting 1,238 datasets across the wider portal carry theme IRIs that resolve to nothing while passing any status code check. We publish the vocabulary, the shapes and the harvesters, record every verdict as a dated observation rather than a property of the dataset, and report the five errors this discipline caught before publication.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-27T21:23:18Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Fabio Rovai</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.26685v1</id>
    <title>BLANC: Discovering Patent White Space via Changes in Normalized Pointwise Mutual Information Between Multi-View Clusters</title>
    <updated>2026-08-27T06:43:27Z</updated>
    <link href="https://arxiv.org/abs/2608.26685v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.26685v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Identifying white space --- the unexplored but potentially valuable regions of a patent landscape --- is essential for strategic R&amp;D planning, yet existing methods rely on manual patent mapping or apply single-view clustering without quantitative gap detection. We propose BLANC (Blank Landscape Analysis through NPMI Conditioning), a three-phase pipeline combining (1) multi-view neural topic modeling along three semantic dimensions (application/use, novelty, inventive step); (2) Normalized Pointwise Mutual Information (NPMI) to quantify cross-dimensional cluster association; and (3) conditional detection that flags combinations whose NPMI drops when the corpus is filtered by a user-specified keyword. The drop is captured by a new metric, $Δ$NPMI, which identifies combinations "established globally, unexplored locally." Because white space has no ground truth, we evaluate BLANC on two public USPTO corpora --- machine learning/AI (5,417 patents, CPC G06N) and glass compositions (1,982 patents, CPC C03C) --- by artificially depleting known technology combinations and testing recovery. When three-quarters of a target pair's documents are removed, BLANC recovers 34.1% (ML/AI) and 27.3% (glass) of the depleted combinations, whereas size-matched removals not aimed at them (random documents, or those of a different established combination) essentially never do: the target is never recovered in 191 decoy trials. Collapsing the three semantic views into one recovers nothing, while prior co-occurrence measures also flag the target under random removal, offering no specificity. In a proprietary case (302 float glass / glass-ceramics patents), the keyword "fluorine" reveals a fluorine surface treatment $\times$ warpage suppression candidate ($Δ$NPMI up to 0.48) that experts had independently identified.</summary>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-27T06:43:27Z</published>
    <arxiv:comment>15 pages, 4 figures, 10 tables. A preliminary Japanese-language report covering the methodology and the industrial case study is scheduled to appear as AGC Research Report 76 (2026), ISSN 2434-0774. The present article is the full version, containing the entire quantitative evaluation</arxiv:comment>
    <arxiv:primary_category term="cs.IR"/>
    <author>
      <name>Shuichi Miyazawa</name>
    </author>
    <author>
      <name>Kensuke Fujii</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.26409v1</id>
    <title>Gender and the Production of Research Impact</title>
    <updated>2026-08-26T21:22:20Z</updated>
    <link href="https://arxiv.org/abs/2608.26409v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.26409v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Evaluating the impact of scientific research beyond academia --- on policy, health, the economy, and cultural life --- has become a cornerstone of science policy and research-funding allocation worldwide. Yet which researchers produce the research underpinning this impact, and how this production is shaped by gender, remains poorly understood. We combine structured and unstructured records from the United Kingdom's latest Research Excellence Framework, the largest national research assessment currently in operation, with large-scale bibliometric data to quantify gender differences among the researchers underpinning documented impact. Women account for 38.16% of these contributors: underrepresented overall, but with a consistently higher share than in research-output authorships (33.63%), both overall and across all four REF panels. Impact production is also strongly gendered across domains: women are better represented in case studies concerning education, health, cultural, and civil-society impact, whereas those concerning commercialisation pathways such as patenting and manufacturing remain dominated by men. These findings reveal critical inequalities across the pathways that connect research to impact beyond academia, offering crucial evidence for policymakers and academic institutions aiming to build more equitable and representative systems for evaluating scientific contributions.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="stat.AP" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-26T21:22:20Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Sanger Wagner</name>
    </author>
    <author>
      <name>Charles Rahal</name>
    </author>
    <author>
      <name>Melinda C. Mills</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.25663v1</id>
    <title>Data Citation for Large Language Models: A Challenge</title>
    <updated>2026-08-26T11:44:55Z</updated>
    <link href="https://arxiv.org/abs/2608.25663v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.25663v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large language models increasingly mediate access to information, and a growing body of work asks whether they cite the sources behind their outputs. That work treats citation as a verification device and applies it to textual documents. Scholarly citation serves two further functions, credit and provenance, and it applies to data as much as to text. This paper argues that data citation for large language models is an open challenge, distinct from document-level citation grounding and harder to solve. We ask how such models should cite data so that outputs stay verifiable, provenance stays traceable, and credit reaches data creators and curators. We set out three research directions. Training data attribution has to turn influence estimates into references for corpora absorbed into model parameters. Data citation at inference time has to identify datasets, subsets, and query results at the right granularity and fixity. Citing knowledge graph facts has to define what a reference to a single triple denotes and how credit propagates along provenance. Progress on all three depends on joint work across the database, information retrieval, knowledge representation, and artificial intelligence communities.</summary>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DB" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-26T11:44:55Z</published>
    <arxiv:comment>7 pages, journal paper</arxiv:comment>
    <arxiv:primary_category term="cs.IR"/>
    <author>
      <name>Gianmaria Silvello</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.24976v1</id>
    <title>A Comparative Evaluation of Digitization Pipelines for Historiographical Sources</title>
    <updated>2026-08-25T16:03:01Z</updated>
    <link href="https://arxiv.org/abs/2608.24976v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.24976v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Purpose: The digitization of historical documents presents fundamental challenges for modern information retrieval and Artificial Intelligence (AI) systems. Optical character recognition (OCR) errors in source corpora propagate through retrieval-augmented generation (RAG) pipelines, compromising the factual accuracy of generated outputs. Methods: This study presents a systematic evaluation of PDF-to-text extraction pipelines applied to historiographical secondary sources on the Visigothic period. We assess thirteen distinct approaches spanning three methodological families: direct extraction, Large Language Model (LLM) post-correction, and chunk-and-extract. Documents are stratified into five categories based on production method and visual complexity. Performance is measured using character error rate (CER) and word error rate (WER) against manually corrected ground truth. Results: Results demonstrate that direct extraction with Marker achieves superior performance (98.70% CER accuracy; 97.71% WER accuracy overall), while conventional OCR pipelines exhibit substantial degradation on scanned documents and complex layouts. Embedded-text extraction performs well on digital PDFs but fails on scanned documents. LLM post-correction does not provide systematic improvements and frequently degrades accurate extractions. Conclusion: End-to-end document parsing is the most reliable approach for heterogeneous historical collections. Document characteristics such as scan quality, layout complexity, and the presence of embedded text layers have a significant impact on extraction accuracy. LLM-based post-correction should not be assumed beneficial by default and requires validation before large-scale application.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-25T16:03:01Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Marina Gómez Rey</name>
    </author>
    <author>
      <name>Patricia Callejo</name>
    </author>
    <author>
      <name>Mario Muñoz-Organero</name>
    </author>
    <author>
      <name>Carlos Alario-Hoyos</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.24559v1</id>
    <title>COCI: Conference Organisers and Content Identifier</title>
    <updated>2026-08-25T13:43:53Z</updated>
    <link href="https://arxiv.org/abs/2608.24559v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.24559v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Despite the critical role of grey literature in scholarly communication, artefacts such as Calls for Papers (CfPs) remain largely isolated from modern Scholarly Knowledge Graphs. The unstructured and highly heterogeneous nature of these documents has traditionally hindered their large-scale processing. In this demo paper, we present the Conference Organisers and Content Identifier (COCI), an AI-based framework designed to extract fine-grained, structured metadata from raw CfP texts. COCI employs a multi-stage pipeline that combines Large Language Models (LLMs) with semantic mapping techniques to integrate extracted entities with established knowledge bases, including OpenAlex, DBLP, TIB ConfIDent, and the AIDA Dashboard. By disambiguating authors and semantically aligning topics and conference series, COCI bridges the gap between informal scholarly dissemination and structured Semantic Web resources, laying the foundation for systematic analysis of non-publisher-based academic events.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-25T13:43:53Z</published>
    <arxiv:comment>Demo paper accepted at ISWC 2026. To be presented in October 2026</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Angelo Salatino</name>
    </author>
    <author>
      <name>Francesco Osborne</name>
    </author>
    <author>
      <name>Alexis Vizcaino</name>
    </author>
    <author>
      <name>Aliaksandr Birukou</name>
    </author>
    <author>
      <name>Enrico Motta</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.24961v1</id>
    <title>The Gold Rush in AI4Math: Where Are We Now?</title>
    <updated>2026-08-25T07:07:37Z</updated>
    <link href="https://arxiv.org/abs/2608.24961v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.24961v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Recent advances in artificial intelligence (AI) have sparked growing interest in its use for mathematical research. While some view this as a major opportunity for discovery, others have raised concerns about its impact on traditional research practices. Despite extensive debate, empirical evidence on how AI is actually being used in mathematics remains limited. To address this gap, we collected all 32,944 arXiv submissions posted between March 1 and August 20, 2026, whose primary or secondary categories included Mathematics. We identified 3,575 submissions that explicitly disclosed author use of AI, of which 1,712 involved at least one substantive mathematical contribution.
  Our analysis reveals several broad patterns. First, disclosed AI use increased sharply over the study period, with substantive use growing from 1.39% of Mathematics submissions in March to 14.09% through August 20. Second, substantive AI use is highly uneven across fields: Combinatorics has the largest number of such papers, while Metric Geometry has the highest substantive-use rate. Third, substantive AI use is geographically concentrated: under weighted author counts, the United States and China together account for about two-thirds of the recognized country weight. Fourth, AI is already being applied to open research problems: among 717 named open-problem records associated with substantive use, 71% are labeled as fully resolved based on the authors' descriptions, with proofs of the conjectured statement more common than counterexamples or disproofs. Finally, AI-system use is also highly concentrated, with OpenAI systems appearing most frequently, followed by Anthropic. Together, these findings suggest that AI-assisted mathematics is expanding rapidly but remains at an early and uneven stage of adoption.</summary>
    <category term="stat.AP" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="math.HO" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-25T07:07:37Z</published>
    <arxiv:comment>16 pages, 6 figures</arxiv:comment>
    <arxiv:primary_category term="stat.AP"/>
    <author>
      <name>Jiashun Jin</name>
    </author>
    <author>
      <name>Zheng Tracy Ke</name>
    </author>
    <author>
      <name>Bingcheng Sui</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.23760v1</id>
    <title>Towards a Definition of the Computational Architecture of Open Scholarly Infrastructures</title>
    <updated>2026-08-24T18:53:13Z</updated>
    <link href="https://arxiv.org/abs/2608.23760v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.23760v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>This paper proposes a layered framework for defining the architecture of the computational unit of an Open Scholarly Infrastructure (OSI) and presents a concrete implementation possibility through the introduction of OpenCitations, an OSI dedicated to publishing citation data and bibliographic metadata. Grounded in the Principles of Open Scholarly Infrastructure (POSI), the study focuses on the technical dimensions of openness, sustainability, interoperability, and reproducibility that are required for a robust OSI. The proposed approach first identifies the core principles and technical features that a computational block in an OSI should guarantee, including separation of operational domains, orchestration, scalability, observability, automation, and workflow portability. It then maps these requirements onto a layered architectural model composed of Hardware, Virtualization, Orchestration, and Application layers, complemented by a transversal Meta layer. The OpenCitations case study shows how this framework can be instantiated in practice through an on-premises infrastructure. The case is presented with details regarding the technicalities and actual implementations of the proposed methodology. By combining a conceptual definition with a real-world implementation, this work offers both a practical reference and a methodological basis for designing the computational block of an OSI.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-24T18:53:13Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Ivan Heibi</name>
    </author>
    <author>
      <name>Mario Petrella</name>
    </author>
    <author>
      <name>Angelo Di Iorio</name>
    </author>
    <author>
      <name>Silvio Peroni</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.23263v1</id>
    <title>Automated Construction of FAIR Digital Object Knowledge Graphs from Flat Cultural Heritage Records</title>
    <updated>2026-08-24T13:51:39Z</updated>
    <link href="https://arxiv.org/abs/2608.23263v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.23263v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>The FAIR Digital Object (FDO) framework mandates that metadata attribute values be expressed as persistent identifiers (PIDs) wherever possible, to produce a fully machine-actionable graph in which every reference is resolvable. The Europeana Data Model was designed long before the FDO specification, and it stores most metadata values as plain text. This serves human browsing well enough, but gives an automated agent nothing to follow across records or collections. We present a pipeline that transforms flat Europeana records into an FDO-compliant knowledge graph structured with CIDOC-CRM. Following the FDO specification, we model every heritage entity as a discrete FDO with its own PID, type, profile, and metadata layer. The core technical challenge is automating the FDO-prescribed distinction between values that must become PID references (resolvable entities) and those that may remain literals (terminal leaves such as notes, measurements, and dates). We address this with a large language model that classifies each metadata value, routes it to a controlled vocabulary (Getty AAT, Wikidata, VIAF, PeriodO), and links it to a shared entity FDO. We evaluate using 637 archaeological records from five Europeana providers, processing each with the LLM. The pipeline links 86% of metadata slots, resolving 58.5% of values Europeana had not already enriched. It also merges cross-lingual surface forms that byte-identical matching keeps apart, where 17 of 33 such merges are correct on manual review. Graph connectivity does not separate this from string matching; what distinguishes the FDO graph is that every node is typed and resolvable.</summary>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-24T13:51:39Z</published>
    <arxiv:comment>Accepted for publication as a short paper at CIKM 2026 (The 35th ACM International Conference on Information and Knowledge Management)</arxiv:comment>
    <arxiv:primary_category term="cs.AI"/>
    <author>
      <name>Zeyd Boukhers</name>
    </author>
    <author>
      <name>Lingxiao Kong</name>
    </author>
    <author>
      <name>Xenophon Zabulis</name>
    </author>
    <author>
      <name>Georgios Toubekis</name>
    </author>
    <arxiv:doi>10.1145/3799682.3840068</arxiv:doi>
    <link rel="related" href="https://doi.org/10.1145/3799682.3840068" title="doi"/>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.23039v1</id>
    <title>Beyond FAIR Data: Instrument Traces for Active and Autonomous Scientific Experimentation</title>
    <updated>2026-08-24T09:43:48Z</updated>
    <link href="https://arxiv.org/abs/2608.23039v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.23039v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Artificial intelligence is turning scientific instruments into active systems in which observations can determine what is measured next. We argue that this creates an additional scientific record, the experimental trajectory, complementing sample provenance, acquired data and metadata, and analysis workflows. Instrument Traces should ultimately be synchronized with Sample Traces describing specimen evolution and Decision Traces recording human or algorithmic choices. We reconstruct an Instrument Trace retrospectively from a longitudinal AFM/PFM archive containing 118,000 timestamped events from 2023-2026. Conventional saved files reveal material campaigns, latent probe and calibration states, session-level complexity, experimental decision grammar, and composite tuning actions. They also expose what is missing, including unsaved tuning and failures, explicit sample/probe identities, complete timing, exogenous state, and decision rationale. We therefore propose a prospective trace architecture that records synchronized sample, instrument, and decision histories, enabling reproducible autonomy, predictive maintenance, counterfactual analysis, operator training, and transfer across facilities.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-24T09:43:48Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Sergei V. Kalinin</name>
    </author>
    <author>
      <name>Boris N. Slautin</name>
    </author>
    <author>
      <name>Yu Liu</name>
    </author>
    <author>
      <name>Charles Cao</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.22546v1</id>
    <title>Taxonomy-aware distances between scholarly topic profiles via an exact simplex embedding</title>
    <updated>2026-08-23T18:46:12Z</updated>
    <link href="https://arxiv.org/abs/2608.22546v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.22546v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Topic profiles represent publications, authors, and other scholarly entities as probability distributions over a fixed set of topics, but flat total variation treats every pair of distinct pure-topic profiles as maximally separated and therefore ignores taxonomic proximity. From a rooted weighted taxonomy, we derive a cardinality-normalized linear operator that maps the leaf topics to points in the original probability simplex and exactly realizes a normalized lowest-common-ancestor ultrametric under total variation. The operator is doubly stochastic and positive definite; within the class of nonnegative edge-cluster Gram operators, its normalization is uniquely determined on the reduced branching tree. Applying the same invertible operator to arbitrary topic mixtures yields a nondegenerate hierarchy-aware metric that contracts flat total variation, differs from the tree-Wasserstein distance on mixtures, and can be evaluated in O(|V|+L) time and memory without forming the dense matrix. In a frozen OpenAlex taxonomy with 4,516 terminal Topics, raw dissimilarities between Topic texts showed consistent ordinal alignment with taxonomic proximity, while only 3 of 253 calibrated internal nodes required monotonic correction. Encoder choice nevertheless affected individual height estimates. The framework exactly realizes a supplied weighted hierarchy; text is used only to initialize its node heights, and distances between scholarly topic profiles are then computed in the induced geometry.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-23T18:46:12Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Dmitry Gubanov</name>
    </author>
    <author>
      <name>Alexander Chkhartishvili</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.20827v1</id>
    <title>The Legibility Gap: How Gender Equity Interventions Redistribute Recognition Across Cultures</title>
    <updated>2026-08-21T07:45:56Z</updated>
    <link href="https://arxiv.org/abs/2608.20827v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.20827v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Efforts to promote gender equity in science increasingly rely on name-based inference to quantify representation and guide policy and behavior. Yet linguistic cues that signal gender vary across cultures and are often obscured when names are transliterated into English. Here we identify a pattern we call the "legibility gap": when gender is inferred from names, equity interventions systematically benefit women whose names signal gender while bypassing those whose names lose such cues in translation. Using both observational and experimental evidence, we show how this gap reshapes recognition in science. Analyzing citation diversity statements-an emerging practice in which authors report the algorithmically estimated gender composition of their reference lists-we find that papers that include this practice cite women more frequently, but the gains accrue almost entirely to authors with gender-signaling Western names. By contrast, women whose names lose gender cues in English transliteration, predominantly those with East Asian names, receive fewer citations in these same papers. Two preregistered experiments (N = 2,250) corroborate this pattern and identify its mechanism: linguistic legibility, not cultural unfamiliarity, determines who is recognized as a woman and who benefits from policies designed to support women in science. Overall, these findings expose a previously unrecognized layer of inequity embedded in global equity infrastructures. As science becomes increasingly global and equity efforts increasingly algorithmic, the legibility gap reveals how uneven identity recognition reshapes fairness. In global systems of recognition, equity depends not only on whether policies are effective on average, but also on whether they are equitable across cultures.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="physics.soc-ph" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-21T07:45:56Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Binglu Wang</name>
    </author>
    <author>
      <name>Jose Cervantez</name>
    </author>
    <author>
      <name>Jiahui Xue</name>
    </author>
    <author>
      <name>Katherine L. Milkman</name>
    </author>
    <author>
      <name>Dashun Wang</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.20697v1</id>
    <title>From citation intent to knowledge contribution: Classifying what cited papers actually contribute</title>
    <updated>2026-08-21T03:03:54Z</updated>
    <link href="https://arxiv.org/abs/2608.20697v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.20697v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Understanding the flow and evolution of scientific knowledge is essential for assessing research impact. Existing citation analysis methods mainly focus on citing authors' subjective intents, failing to consistently characterize cited papers' knowledge contributions. This study proposes the Knowledge Contribution Taxonomy (KCT), derived from the Scientific Research Logic Model, which identifies the type of knowledge a cited paper contributes based on the citation context. KCT classifies citations into Method, Resource Tool, Empirical Finding, and Background, further distinguishing core from non-core contributions. We propose a Dual-Path Fusion model for the classification task, which achieves an accuracy of 85.5%, outperforming mainstream large language models. An analysis of 802,202 citations from the ACL Anthology reveals that core knowledge contributions account for only 39.09% of all citations. The core knowledge contribution citation count achieves higher hit rates for award-winning papers than the traditional citation count at all ranking cutoffs, reflecting the value of differentiating knowledge contributions for research evaluation and impact prediction. In dissemination prediction experiments, KCT outperforms citation intent classification, demonstrating its stronger predictive validity for scholarly dissemination. By focusing on the knowledge contributions of cited papers, the KCT can support differentiated research evaluation.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-21T03:03:54Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Zhibang Quan</name>
    </author>
    <author>
      <name>Zhentao Liang</name>
    </author>
    <author>
      <name>Ming Ma</name>
    </author>
    <author>
      <name>Jinyu Wei</name>
    </author>
    <author>
      <name>Gang Li</name>
    </author>
    <author>
      <name>Jin Mao</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.20674v1</id>
    <title>Analysis of Potential Generative AI Use in Abstracts of KAKENHI-Funded Projects</title>
    <updated>2026-08-21T02:14:32Z</updated>
    <link href="https://arxiv.org/abs/2608.20674v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.20674v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>This study analyzes the extent to which abstracts of projects funded under the Scientific Research (C) category of the Grants-in-Aid for Scientific Research (KAKENHI) were classified as AI-generated.
  The analysis covers projects funded over the five-year period from FY2022 to FY2026. The number of abstracts classified as AI-generated began to increase in FY2025, and approximately 20% of the abstracts were classified as AI-generated in FY2026. Although the proportions varied to some extent, abstracts classified as AI-generated were observed in many review categories. These findings indicate that the use of generative AI has begun to spread across many research fields represented in Scientific Research (C).</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-21T02:14:32Z</published>
    <arxiv:comment>14 pages, 7 figures, Earlier Japanese version submitted to Jxiv</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Hitoshi Koshiba</name>
    </author>
    <author>
      <name>Miki Ida-Kimura</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.20035v1</id>
    <title>A large-scale dataset of sub-institution name disambiguation and hierarchical structures from OpenAlex</title>
    <updated>2026-08-20T13:42:40Z</updated>
    <link href="https://arxiv.org/abs/2608.20035v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.20035v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Accurate attribution of scholarly work to specific sub-institutional units, such as schools or departments of a university, is crucial for granular research assessment and policymaking. While robust identifiers exist for top-level institutions, standardized data for sub-level units remains scarce due to the linguistic and structural variability of affiliation strings. In this study, we introduce OpenSubAffil, a large-scale dataset mapping raw affiliation strings from OpenAlex to disambiguated sub-institutional entities and their hierarchical structures. We developed a pipeline integrating named entity recognition (NER) with embedding-based clustering. Furthermore, we proposed a multi-signal scoring function that synthesizes lexical and co-occurrence evidence to reconstruct the sub-institutional hierarchy. OpenSubAffil comprises mappings for 40 million affiliation strings to 638,843 disambiguated sub-units across 18,635 top-level institutions, together with their hierarchical relationships. Validation against Wikidata benchmarks and manual investigation show that our method achieves promising performance. Overall, this dataset bridges the granularity gap between individual researchers and top-level institutions, enabling high-resolution analyses of scholarly output and communication at the sub-institutional level. The OpenSubAffil dataset is publicly available at https://doi.org/10.5281/zenodo.19602782.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-20T13:42:40Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <arxiv:journal_ref>Liang, Z., Mao, J. &amp; Li, G. A large-scale dataset of sub-institution name disambiguation and hierarchical structures from OpenAlex. Sci Data (2026)</arxiv:journal_ref>
    <author>
      <name>Zhentao Liang</name>
    </author>
    <author>
      <name>Jin Mao</name>
    </author>
    <author>
      <name>Gang Li</name>
    </author>
    <arxiv:doi>10.1038/s41597-026-08136-9</arxiv:doi>
    <link rel="related" href="https://doi.org/10.1038/s41597-026-08136-9" title="doi"/>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.19194v4</id>
    <title>Qualified Cross-References as a Verification Method: The Normative Environment of the EU AI Act</title>
    <updated>2026-09-01T14:04:50Z</updated>
    <link href="https://arxiv.org/abs/2608.19194v4" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.19194v4" rel="related" type="application/pdf" title="pdf"/>
    <summary>Legal cross-references are commonly represented as links between instruments or provisions. In a curated legal knowledge base, a link must also identify the legal character of the interaction, its supporting provisions and conditions, and remain consistent from either instrument. This paper presents a provision-level model and a protocol for qualified cross-references, developed through a bilingual corpus of fourteen instruments surrounding Regulation (EU) 2024/1689 (the AI Act). The model distinguishes direct textual reference, bounded presumption of conformity, substantive interaction without textual reference, mediated intersection, and institutional analogy; applicative interaction and definitional overlap are independent dimensions. Its methodological contribution is bidirectional inversion: a relationship documented from act A towards act B is reconstructed from B's perspective against both instruments. This verification tests provisions, qualification, direction, and conditions before deciding how to render the relationship from either side. Applied during construction, the protocol surfaced six incorrect article references, three inaccurate legal qualifications, and one divergence between two published descriptions of the same interaction. A reference to Regulation (EU) 2019/881 illustrates why qualification matters: the AI Act's bounded cybersecurity presumption differs from other product legislation's uses of the same certification framework. The contribution is a map of one regulatory environment and an explicitly specified method for making curated cross-reference knowledge bases inspectable and internally testable. A later, separately scoped corpus audit is discussed among the limitations, without pooling its findings with the original measurements; limited access to historical inputs constrains independent reproduction.</summary>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-19T17:58:05Z</published>
    <arxiv:comment>Clarified the scope of validation, the status of the registry sample, and the limits of reproducibility. Added a concise discussion distinguishing source fidelity, technical functionality, and legal verification, informed by a separate local audit. Results of the original inversion study are unchanged</arxiv:comment>
    <arxiv:primary_category term="cs.CY"/>
    <author>
      <name>Nicola Fabiano</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.19026v1</id>
    <title>Institutional Books - Enriched Text: A customizable multilingual open-source pipeline for denoising, deduplicating, and annotating OCR text at scale</title>
    <updated>2026-08-19T15:20:54Z</updated>
    <link href="https://arxiv.org/abs/2608.19026v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.19026v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Released in 2025, Institutional Books: Harvard Library (IB-HL) is a collection of 983,004 volumes (242B o200k_base tokens), originally digitized through Harvard Library's participation in the Google Books Library project. As researchers and developers have begun to use IB-HL, a tension has emerged between standard large-scale preprocessing practices and the goals of careful information stewardship. Many existing pipelines optimize for web text: as a result, they tend to aggressively filter, deduplicate, restrict by language, and sometimes discard meaningful metadata. Meanwhile, researchers seeking to use IB-HL duplicate effort while performing similar processing and analysis.
  We describe an approach that we call Enriched Text. Instead of producing a single 'complete' stream of tokens, we normalize the text while preserving metadata through annotations. We separate endmatter, detect per-paragraph language, identify clusters of duplicate paragraphs, and compute per-paragraph bits-per-byte scores. We provide this information through HTML-like annotations layered on top of the text. By parsing these annotations, users can tailor the output to their own needs instead of accepting a global editorial decision on content. The pipeline applies to all $\approx$250 languages in the collection.
  This report describes this project's goals, implementation, and design rationale. The release includes IB-HL-ET (an enriched-text version of IB-HL containing 217B o200k_base tokens across 983,003 volumes, organized into 1.39B annotated subtopic paragraphs) and the pipeline that produced it. These serve to make the collection easier for machines to parse and for humans to study.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-19T15:20:54Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>David Lowry-Duda</name>
    </author>
    <author>
      <name>Matteo Cargnelutti</name>
    </author>
    <author>
      <name>Catherine Brobston</name>
    </author>
    <author>
      <name>Salwa Ismail</name>
    </author>
    <author>
      <name>Greg Leppert</name>
    </author>
    <author>
      <name>Amanda Watson</name>
    </author>
    <author>
      <name>Jonathan Zittrain</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.18972v1</id>
    <title>Institutional Newspapers Pipeline: Deriving billions of high quality tokens from historical newspapers</title>
    <updated>2026-08-19T14:41:12Z</updated>
    <link href="https://arxiv.org/abs/2608.18972v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.18972v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Historical newspapers are an abundant record of public life, but their dense, irregular and sometimes noisy layouts make computational access to these materials both challenging and limited. We present the Institutional Newspapers Pipeline, a modular system we jointly designed with Boston Public Library to extract high-quality, structured datasets from historical newspaper scans. It was architected so that each step remains interpretable and customizable, and so that the pipeline as a whole remains computationally frugal enough to run on workstation-level hardware. The pipeline runs each scan through a multi-step process: it segments scans into individual type-agnostic crops and performs OCR on each resulting segment before then performing text analysis, type classification, reading order detection, named entities recognition, subject classification, language detection, and pre-computed embeddings generation on every crop. We ran this pipeline against a portion of Boston Public Library's holdings and released the results as an open dataset. The optical character recognition (OCR) output represents 16.3 billion o200k_base tokens across 83.1 million individual crops, extracted from 1,473,635 public domain newspaper scans published between 1795 and 1930. This report describes our methods for each processing step, the small models we trained, as well as the evaluation results and dataset-scale measurements we collected in the process. It accompanies the release of the pipeline, models, and dataset. We position this work as a substantial step towards unlocking high-quality data from tens of millions of newspaper scans.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-19T14:41:12Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Matteo Cargnelutti</name>
    </author>
    <author>
      <name>Catherine Brobston</name>
    </author>
    <author>
      <name>Eben English</name>
    </author>
    <author>
      <name>Jake Sadow</name>
    </author>
    <author>
      <name>Kacie Bailey</name>
    </author>
    <author>
      <name>Greg Leppert</name>
    </author>
    <author>
      <name>Amanda Watson</name>
    </author>
    <author>
      <name>Jessica Chapel</name>
    </author>
    <author>
      <name>Jonathan Zittrain</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.18957v1</id>
    <title>Institutional Books - Visual Elements: An open-source pipeline for extracting, classifying, deduplicating, and captioning visual elements from digital book collections</title>
    <updated>2026-08-19T14:21:56Z</updated>
    <link href="https://arxiv.org/abs/2608.18957v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.18957v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Historical book collections contain rich visual elements - such as illustrations, photographs, engravings, and decorative art - that are frequently under-explored in large-scale digitization projects. While Optical Character Recognition (OCR) has standardized the extraction of textual content, these visual components offer a layer of nuance and context that remains largely untapped by automated text extraction workflows. This technical report introduces Institutional Books - Visual Elements, an open-source end-to-end pipeline for detecting, classifying, deduplicating, and captioning visual elements from historical book collections. Alongside this pipeline, we release an initial dataset of 22.6 million visual elements extracted from the 983,004 scanned volumes that comprise the Institutional Books: Harvard Library dataset. This work contributes to ongoing, community-wide efforts to enable new use cases for digitized library collections through computational access, from artificial intelligence model training to digital humanities research.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-19T14:21:56Z</published>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Jimmy Mendez</name>
    </author>
    <author>
      <name>Matteo Cargnelutti</name>
    </author>
    <author>
      <name>David Lowry-Duda</name>
    </author>
    <author>
      <name>Catherine Brobston</name>
    </author>
    <author>
      <name>Salwa Ismail</name>
    </author>
    <author>
      <name>Greg Leppert</name>
    </author>
    <author>
      <name>Amanda Watson</name>
    </author>
    <author>
      <name>Jonathan Zittrain</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.18895v1</id>
    <title>MediaGraph: A Content-Aware Data Model and Query Framework for Multimodal Knowledge Graphs</title>
    <updated>2026-08-19T13:21:09Z</updated>
    <link href="https://arxiv.org/abs/2608.18895v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.18895v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Multimodal knowledge graphs typically treat multimedia documents as opaque, external entities. This content-agnostic approach constrains retrieval and analysis by isolating media from the graph's core structure, hindering the ability to capture and query complex relationships across media types. To address this, we introduce the MediaGraph Data Model and its prototypical implementation MeGraS, the MediaGraph Store, a novel approach that integrates multimedia content as graph nodes. This paradigm shift enables the query engine to directly access and process a document's intrinsic content, allowing for native operations such as feature-based similarity search, dynamic segmentation, and the inference of non-materialized relations. By extending the SPARQL query language, MeGraS provides a cohesive platform for the storage, management, and expressive querying of multimodal data. MeGraS is open-source software that establishes a new framework, moving the field toward content-aware multimodal knowledge graphs.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.MM" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-19T13:21:09Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Florian Ruosch</name>
    </author>
    <author>
      <name>Luca Rossetto</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.24926v1</id>
    <title>A Pathway for Assessing Grey Literature: Leveraging AI to Extract Conference Metadata and Organiser Information from Calls for Papers</title>
    <updated>2026-08-19T07:24:40Z</updated>
    <link href="https://arxiv.org/abs/2608.24926v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.24926v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Despite its importance, grey literature, including Calls for Papers (CfPs), remains largely overlooked in Metascience and Scientometric analysis due to its unstructured, highly heterogeneous format, which traditional tools struggle to process at scale. However, Large Language Models now offer a pivotal opportunity to devise innovative tools for systematically harvesting and processing such data. In this paper, we introduce COCI, an AI-based framework that automates the extraction of granular, structured metadata from raw CfP text. COCI employs a multi-stage pipeline for entity extraction, followed by author disambiguation against OpenAlex and semantic mapping of topics and conference series. This process identifies key data points, including conference editions, geographic locations, and comprehensive lists of organisers, along with their specific roles and affiliations. By structuring this previously inaccessible information, COCI establishes a foundation for the systematic analysis of grey literature, enabling new research opportunities and shifting the scholarly focus towards non-publisher-based events.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-19T07:24:40Z</published>
    <arxiv:comment>Paper accepted at STI-ENID 2026 https://www.uantwerpen.be/en/conferences/30th-annual-international-conference-on-science-and-technology-indicators/</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Angelo Salatino</name>
    </author>
    <author>
      <name>Francesco Osborne</name>
    </author>
    <author>
      <name>Alexis Vizcaino</name>
    </author>
    <author>
      <name>Aliaksandr Birukou</name>
    </author>
    <author>
      <name>Enrico Motta</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.17915v1</id>
    <title>Computational Prosopography across a Millennium: Mathematically Oriented Lineages Traced from the Fields Medalists</title>
    <updated>2026-08-18T15:41:48Z</updated>
    <link href="https://arxiv.org/abs/2608.17915v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.17915v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>We reconstruct the mentor--student network through which documented scholarly training passed across roughly nine centuries, and subject both the network and the means of reconstructing it to source criticism. From Wikidata, which aggregates the Mathematics Genealogy Project and the MacTutor Archive, we extract approximately 470,000 mentor--student assertions, yielding a directed acyclic graph of 372,853 persons. Using all 64 historical Fields Medalists as a fixed, ex ante tracer set, backward traversal enumerates some 25.5 million distinct paths reaching 57 generations.
  Three structural observations follow. Genealogical traffic through Leibniz forms an hourglass: thin upstream, 5.3 paths per node on average, and thick downstream, 53.4, a ratio near 10:1, with no counterpart at Newton, who lies on only four of the 64 lineages. Across a window centered on Leibniz, seven independently extracted predicate dimensions reorganize together, and recorded learned-society membership rises from 6.5 to 82.1 percent of the cohort. Upstream, 54 of the 64 lineages converge on the same five twelfth- and thirteenth-century Islamic and Byzantine scholars before terminating at an eleventh-century boundary we name the Monastery Wall.
  We argue that such observations cannot be assessed without tool criticism. The traversal engine is algebraically reversible, so every ranking decision it makes can be reconstructed afterward. We characterize its measurement bias in closed form, show that the macro-structures survive switching that bias off, and report the family of lineages the traversal returns at different resolutions rather than a single ranked list.</summary>
    <category term="physics.soc-ph" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.NE" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-18T15:41:48Z</published>
    <arxiv:comment>Substantially rewritten and reframed version of arxiv 2605.31470 which is retained separately</arxiv:comment>
    <arxiv:primary_category term="physics.soc-ph"/>
    <author>
      <name>Hiroyuki Chuma</name>
    </author>
    <author>
      <name>Kanji Otsuka</name>
    </author>
    <author>
      <name>Yoichi Sato</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.17159v1</id>
    <title>A Multi-Surface Consistency Audit of Software Citation Metadata</title>
    <updated>2026-08-17T21:52:02Z</updated>
    <link href="https://arxiv.org/abs/2608.17159v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.17159v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Research software projects describe themselves in many places at once: citation files in the repository, archive deposits, DOI registry records, package registries, and README text. We treat the software as the underlying object and these machine-readable self-descriptions as its surfaces: the points where people and automated systems read what the project declares about the software. Citation guidance, indexing services, and automated agents may read a different subset of these surfaces, so disagreement between them can silently fragment credit and provenance. This paper asks a simple question that has not been measured directly: when a project's own metadata surfaces are compared with each other, how often do they agree? We audited 117 open-source research software projects, comprising an 87-project high-performance computing and quantum computing corpus and a 30-project registered baseline drawn from the JOSS and pyOpenSci accepted-package lists, across up to seven machine-readable surfaces per project. Using a four-level verdict rubric across six metadata fields, with 98.5\% hand-verified verdict precision on a 338-row stratified sample, we found that 52 of the 62 projects exposing at least two comparable surfaces (83.9\%) contain at least one core-field conflict, a result that is insensitive to the fuzzy-matching threshold. Half of hand-adjudicated cross-surface conflicts trace to a single mechanism: surfaces describing the software's paper rather than the software itself. Among projects whose CITATION.cff includes a preferred citation, 28 of 32 route citations to a record that disagrees with the software's own metadata. The author lists and titles disagree the most, and the registry surfaces are the least aligned. We release the audit pipeline as an importable library, the corpus, the registered sampling protocol, all raw snapshots, and the complete verification log.</summary>
    <category term="cs.SE" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-17T21:52:02Z</published>
    <arxiv:comment>10 pages, 2 figures, 3 tables</arxiv:comment>
    <arxiv:primary_category term="cs.SE"/>
    <author>
      <name>Pengyin Shan</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.16602v1</id>
    <title>Declining Modularity of Intellectual Bases During the Emergence of Research Areas</title>
    <updated>2026-08-17T13:59:21Z</updated>
    <link href="https://arxiv.org/abs/2608.16602v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.16602v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Understanding how research areas emerge can help identify nascent areas early and inform research strategy, yet how the intellectual base of a field restructures as an area takes shape remains unclear. We hypothesize that the emergence of a research area is accompanied by the integration of largely separate knowledge communities, observable as a decline in the modularity of its co-citation network, which represents its intellectual base. We propose a framework that tracks this modularity over time, evaluates the statistical robustness of its changes, and identifies the papers highly associated with the decline. We applied it to three areas with different modes of growth: higher-order network science, superstring theory, and graph representation learning. In all three, modularity declined in correspondence with each area's emergence or transformation, and in superstring theory, the decline aligns with an independently documented transition. Further analysis of higher-order network science shows that its decline reflects a cross-disciplinary integration. In graph representation learning, the gradual decline is followed by a rise, which we interpret as a re-differentiation after the emergence period. Our results suggest that a decline in the modularity of a co-citation network can serve as a structural signature that retrospectively characterizes this integrative mode of emergence.</summary>
    <category term="physics.soc-ph" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-17T13:59:21Z</published>
    <arxiv:comment>21 pages, 6 figures; supplementary information included as ancillary file</arxiv:comment>
    <arxiv:primary_category term="physics.soc-ph"/>
    <author>
      <name>Kazuki Nakajima</name>
    </author>
    <author>
      <name>Yuya Sasaki</name>
    </author>
    <author>
      <name>Masaki Aida</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.16322v1</id>
    <title>Estimating global article processing charges paid to 14 publishers for open access between 2019 and 2025</title>
    <updated>2026-08-17T09:28:37Z</updated>
    <link href="https://arxiv.org/abs/2608.16322v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.16322v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>This study presents estimates of the global expenditure on article processing charges (APCs) paid to 14 publishers for open access (OA) between 2019 and 2025. APCs are charged for publishing in fully OA journals (gold) and making individual articles OA in subscription journals (hybrid), but how much is paid, and for which articles, is not publicly known. We therefore curated an open dataset of publicly listed APC prices from 14 academic publishers (ACS, CUP, De Gruyter, EDP, Elsevier, Frontiers, IEEE, IOP, MDPI, OUP, PLOS, Sage, Springer Nature, and Wiley) and combined it with counts of OA articles from OpenAlex. We estimate that \$15.08 billion (in 2025 USD) was spent globally on APCs between 2019 and 2025. Adjusted for inflation, annual spending quadrupled from \$0.9 billion in 2019 to \$3.7 billion in 2025, with &gt;85% concentrated among a few large publishers. Hybrid OA fees exceed gold fees, and the median fee paid is higher than the median price listed for both. Our approach addresses major limitations in previous efforts to estimate APC spending, offering much-needed insight into an opaque aspect of scholarly publishing, especially as transformative agreements make it more challenging to understand the costs of publishing OA.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-17T09:28:37Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Lisa Matthias</name>
    </author>
    <author>
      <name>Eric Schares</name>
    </author>
    <author>
      <name>Juan Pablo Alperin</name>
    </author>
    <author>
      <name>Leigh-Ann Butler</name>
    </author>
    <author>
      <name>Sherry Kuang</name>
    </author>
    <author>
      <name>Nina Schönfelder</name>
    </author>
    <author>
      <name>Stefanie Haustein</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.15697v1</id>
    <title>The Geometric Function Atlas: A Software System for Radius and Coefficient Problems</title>
    <updated>2026-08-16T12:04:20Z</updated>
    <link href="https://arxiv.org/abs/2608.15697v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.15697v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Let $\D=\{z\in\C:|z|&lt;1\}$, and let $\mathcal A$ be the class of analytic functions normalized by $f(0)=0$ and $f'(0)=1$. For an admissible Ma--Minda generator $\varphi$, write $\Sstar{\varphi}=\{f\in\mathcal A:zf'(z)/f(z)\prec\varphi(z)\}$. Given two generators $\varphi_1$ and $\varphi_2$, we study the largest $R\in(0,1]$ for which $f(rz)/r\in\Sstar{\varphi_2}$ whenever $f\in\Sstar{\varphi_1}$ and $0&lt;r\le R$. We present the Geometric Function Atlas, a software system that records these directed radius problems and coefficient problems by their exact generators, parameter domains, normalizations, and sharpness statements. This representation identifies the same class across alternative names and transliterations while keeping the two directions of an inclusion problem distinct. The coefficient engine recovers all 216 Fekete--Szegő values predicted by the general Ma--Minda formula across 36 registered classes. The directed-radius atlas contains 702 ordered comparisons; omitting direction merges unequal constants in 253 of the 262 class-pair families represented in both directions. Using boundary contact, analytic majorants, and explicit Ma--Minda extremals, we prove nineteen exact sharp inclusion radii. In particular, the sine-to-modified-sigmoid radius is $\arcsin((e-1)/(e+1))$, improving the published sufficient radius $\operatorname{arsinh}((e-1)/(e+1))$ by 7.45\%. For the crescent and exponential classes, the reciprocal sharp radii are $\sin1$ and $\log(1+\sqrt2)$; the latter corrects a published constant. The Python package, exact certificates, and registry records accompany the paper.</summary>
    <category term="math.CV" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-16T12:04:20Z</published>
    <arxiv:primary_category term="math.CV"/>
    <author>
      <name>Prasanna Devadiga</name>
    </author>
    <author>
      <name>Kishan Gurumurthy</name>
    </author>
    <author>
      <name>Arya Suneesh</name>
    </author>
    <author>
      <name>Pushparaj Devadiga</name>
    </author>
    <author>
      <name>Asha Sebastian</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.14116v1</id>
    <title>A dataset of article processing charges from 14 scholarly publishers, 2019-2025</title>
    <updated>2026-08-14T09:19:09Z</updated>
    <link href="https://arxiv.org/abs/2608.14116v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.14116v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>This paper introduces a dataset of APCs produced from the price lists of 14 large scholarly publishers between 2019 and 2025. APC price lists were downloaded from publisher websites each year as well as via Wayback Machine snapshots to retrieve fees per journal per year. The dataset includes journal metadata, APC collection method, and annual APC price list information in several currencies (USD, EUR, GBP, CHF, JPY, CAD, AUD) for 12,540 unique journals and 69,856 journal-year combinations. The dataset was generated to allow for more precise analysis of APCs and can support library collection development and scientometric analysis estimating APCs paid in gold and hybrid OA journals.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-14T09:19:09Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Lisa Matthias</name>
    </author>
    <author>
      <name>Diego Chavarro</name>
    </author>
    <author>
      <name>Eric Schares</name>
    </author>
    <author>
      <name>Juan Pablo Alperin</name>
    </author>
    <author>
      <name>Margaret Rose</name>
    </author>
    <author>
      <name>Molly Frost</name>
    </author>
    <author>
      <name>Flavia Camargo</name>
    </author>
    <author>
      <name>Jonas Höfting</name>
    </author>
    <author>
      <name>Leigh-Ann Butler</name>
    </author>
    <author>
      <name>Nina Schönfelder</name>
    </author>
    <author>
      <name>Stefanie Haustein</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.14075v1</id>
    <title>A Pathway to General-Purpose Scientific AI: Multimodal Comprehension of Scientific Images</title>
    <updated>2026-08-14T08:34:33Z</updated>
    <link href="https://arxiv.org/abs/2608.14075v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.14075v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Scientific figures and tables encode essential experimental evidence, yet remain difficult for digital libraries and multimodal AI systems to retrieve and interpret. The ALD/E-ImageMiner benchmark and ICDAR 2026 Competition on Information Extraction from Atomic Layer Deposition/Etching Scientific Figures provide 1,951 figures from 205 publications, expert-annotated for classification, data table extraction, summarization, and visual question answering. In these companion proceedings, we present a forward-looking perspective on how the benchmark can guide future scientific-image challenges. We examine how its tasks probe capabilities from visual and quantitative reading to domain-grounded reasoning and evidential justification, and how Bloom-informed question design can support deeper scientific understanding. We propose "scientific conceptual understanding from images" as a long-term benchmark objective, with future directions including broader domains and figure types, contextual and cross-document synthesis, hypothesis evaluation, provenance, uncertainty, counterfactual grounding, and open-ended multimodal research. This perspective connects the ICDAR 2026 challenge to a broader agenda for machine-actionable scientific visual knowledge and verifiable multimodal scientific AI.</summary>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-14T08:34:33Z</published>
    <arxiv:comment>15 pages, 1 figure</arxiv:comment>
    <arxiv:primary_category term="cs.AI"/>
    <author>
      <name>Jennifer D'Souza</name>
    </author>
    <author>
      <name>Fahad Ahmed</name>
    </author>
    <author>
      <name>Cecilia Andrea Bustamante Andrade</name>
    </author>
    <author>
      <name>Lina Frolova</name>
    </author>
    <author>
      <name>Poorani Gnanasambandan</name>
    </author>
    <author>
      <name>Dilshad Hussain</name>
    </author>
    <author>
      <name>Muhammad Uzair Khan</name>
    </author>
    <author>
      <name>Nkembeng Kevin Nkengfoa</name>
    </author>
    <author>
      <name>Paul Praveen J.</name>
    </author>
    <author>
      <name>Fabio Priante</name>
    </author>
    <author>
      <name>Sjoerd Franciscus van der Werf</name>
    </author>
    <author>
      <name>Thomas Frederik Jan van Roeden</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.13842v1</id>
    <title>The MPB Corpus: A Dataset of Melody, Rhythm, Harmony, and Melody-Harmony Relationships in Brazilian Popular Music</title>
    <updated>2026-08-14T00:17:10Z</updated>
    <link href="https://arxiv.org/abs/2608.13842v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.13842v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>This paper presents the MPB Corpus, a collection of 500 musical pieces encoded across four musical parameters: melodic contour, melodic rhythm, harmony, and the relationship between melody and harmony. It constitutes the most comprehensive and detailed dataset to date for computational musicology of Brazilian music. To support the encoding process, we introduce specific analytical models designed to capture rhythmic and melodic information with precision, alongside tailored visualizations and metrics summarizing key musical parameters. Finally, we provide a brief qualitative exploratory analysis of the dataset, illustrating its potential to both formulate and systematically address musicological questions concerning the genre.</summary>
    <category term="cs.SD" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="eess.AS" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-14T00:17:10Z</published>
    <arxiv:comment>22 pages, 13 figures</arxiv:comment>
    <arxiv:primary_category term="cs.SD"/>
    <author>
      <name>Carlos de L. Almada</name>
    </author>
    <author>
      <name>Hugo T. de Carvalho</name>
    </author>
    <author>
      <name>Felipe D. Martins</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.13195v1</id>
    <title>Co-leading Teams Drive Scientific Novelty in Large-scale Research Infrastructures</title>
    <updated>2026-08-13T12:59:38Z</updated>
    <link href="https://arxiv.org/abs/2608.13195v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.13195v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large-scale research infrastructures (LSRIs) have become the engine of modern scientific discovery. While these big machines predominantly operate under a user-oriented model where external teams conduct research with support from in-house researchers, the structural integration of staff scientists into user teams and its association with scientific novelty remains unclear. By leveraging a dataset of 273,109 publications across 76 global LSRIs and applying a hybrid machine-learning framework to classify papers into three collaboration patterns: external user only, staff participating, and staff co-leading, we find a distinct novelty premium for external teams that formally integrate staff as co-authors, especially when staff scientists play co-leading rather than participating roles. Further, the premium peaks at a relatively balanced user-staff team composition, potentially due to an "epistemic lock-in" by either party. Crucially, we find that the ideal collaboration architecture evolves with user experience: while newcomers can obtain a large novelty premium from mere staff participation, experienced users only benefit from staff co-leading teams. This result suggests a "knowledge saturation effect" for which a deeper intellectual partnership is needed to sustain novelty. By revealing how user-staff collaboration structure drives scientific creativity, our study offers practical policy implications for the strategic management and intervention of LSRIs in the era of human-machine collaboration.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-13T12:59:38Z</published>
    <arxiv:comment>32 pages, 4 figures, and 7 tables</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Mingze Zhang</name>
    </author>
    <author>
      <name>Yizhan Li</name>
    </author>
    <author>
      <name>Hao Peng</name>
    </author>
    <author>
      <name>Zexia Li</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.14731v1</id>
    <title>Emergence of Transfer Learning towards Specific Identification of Alzheimer's Disease A Prospective Approach</title>
    <updated>2026-08-13T02:01:51Z</updated>
    <link href="https://arxiv.org/abs/2608.14731v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.14731v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Worldwide, millions of senior citizens are suffering from Alzheimer disease abbreviated as AD, a well- versed form of dementia. AD is featured by amnesia, intellectual disability, and difficulty with consciousness. DL and ML models are undoubtedly explored to identify AD related patterns on large dimensional neuroimaging data but they need global optimization and are suffering from overfitting issue that might yield dissatisfactory result in testing data set. DL overcomes the issue by convolution of input image with kernel but any sudden change in the MRI image or human manipulation, limited pre- processing of the images can mislead CNN in achieving highly accurate detection. Transfer Learning (TL) has proved itself in AD diagnosis by utilizing pre-trained models on large data sets to guide novice model in a new neuroimaging dataset. This review provides an inclusive glimpse of TL implication in classification, identification including the conversion of AD. Keeping in view, we have assessed the strengths and limitations of TL in improvising diagnostic accuracy even with limited data. The uniqueness of the present review is the incorporation of explainable AI in TL based AD diagnosis system. Finally, it can be claimed that the review will guide the new re-searchers in the area of TL induced neurodegenerative disease detection.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-13T02:01:51Z</published>
    <arxiv:primary_category term="cs.CV"/>
    <arxiv:journal_ref>2025 AI-Driven Smart Healthcare for Society 5.0, Kolkata, India, 2025</arxiv:journal_ref>
    <author>
      <name>Soumik Podder</name>
    </author>
    <author>
      <name>Chandramouli Haldar</name>
    </author>
    <arxiv:doi>10.1109/IEEECONF64992.2025.10962879</arxiv:doi>
    <link rel="related" href="https://doi.org/10.1109/IEEECONF64992.2025.10962879" title="doi"/>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.12571v1</id>
    <title>Is this Citation on Point?</title>
    <updated>2026-08-12T20:28:55Z</updated>
    <link href="https://arxiv.org/abs/2608.12571v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.12571v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>In 2023, a New York judge sanctioned two attorneys in Mata v. Avianca for filing a brief with hallucinated citations generated by ChatGPT. Such failures are largely caught by database lookups; the harder problem is detecting citations that point to real cases but do not support the propositions for which they are offered -- a failure mode that existing evaluations of LLMs for legal use cases largely overlook. In this paper, we study proposition-level citation support verification through controlled perturbations of real legal citations obtained from two legal corpora, either replacing the cited case or changing only the pinpoint page within the same case. We evaluate fourteen model configurations on the resulting examples. Models catch 93-100% of wrong-case corruptions. They catch only 37-61% of wrong-pinpoint corruptions on court opinions and 52-83% on legal briefs. When models fail to catch wrong-pinpoint corruptions, they accept the citation based on topical overlap rather than page-level support. Scale and extended reasoning narrow the gap but do not close it: GPT-5.4 with high reasoning effort still misses 40% of pinpoint mismatches on court opinions and 18% on briefs. Prompting the model to verify support at the cited page improves recall, but it also raises the false positive rate. Recognizing the right legal topic and verifying support for the cited proposition are distinct capabilities, and current models conflate them.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-12T20:28:55Z</published>
    <arxiv:comment>Accepted to the 1st Workshop on AI for Law at ICML 2026</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Apurv Verma</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.12566v1</id>
    <title>Domus: An Open-Data Web Platform for House History Research</title>
    <updated>2026-08-12T20:15:48Z</updated>
    <link href="https://arxiv.org/abs/2608.12566v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.12566v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>House history -- the record of who lived in a building, who owned it, and how its address changed over time -- is a central concern of genealogical and local history research. Wikidata and OpenHistoricalMap together provide an open-data infrastructure, CC0-licensed and capable of representing this data: Wikidata through its linked-data property model with temporal qualifiers, OpenHistoricalMap through historical building footprints with start and end dates. What has been missing is a domain-specific tool that makes contributing and discovering building history accessible to genealogists and local historians. Domus fills this role: a map-based web platform that guides users through structured, crowdsourced editing of building records in Wikidata and displays corresponding OpenHistoricalMap footprints. The application requires no custom backend -- authentication, data reading, and data writing all operate through public APIs in the browser, and all data are stored under CC0 in public collaborative databases. This paper describes the genealogical data model, the architecture, and key technical design decisions.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-12T20:15:48Z</published>
    <arxiv:comment>7 pages, 2 figures, 1 table. Software: https://domus.genealogy.net; source code: https://github.com/compgen-ev/domus</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>David M. Straub</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.11843v1</id>
    <title>When the Knowledge Base Becomes the Gold Standard: Measuring Resource-Shared Evaluation Loops in Entity-Level Machine Translation</title>
    <updated>2026-08-12T09:33:59Z</updated>
    <link href="https://arxiv.org/abs/2608.11843v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.11843v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>The Seungjeongwon Ilgi, a UNESCO Memory of the World record, is only 37.4% translated, and the most conspicuous failure mode in automatic translation is the person name -- a misread name corrupts the historical fact rather than merely the surface. Low-resource historical domains have no expert gold standard for entity translation, so practitioners substitute a knowledge base (KB) for the gold. That KB is the same resource injected into the system: scoring becomes self-referential and the metric measures instruction compliance rather than translation quality.
  We measure this loop. Using expert person-name annotations from the National Institute of Korean History as a gold independent of the injection pipeline, we hold the entity set fixed and vary only the provenance of the correct reading. Of 527 expert-annotated mentions, only 31.1% lie outside the injection pipeline, and the residual loop is not uniform -- in the overlapping segment the injected reading agrees with the human translation 97.8% of the time against 70.1% in the independent one, so the segment that looks healthiest is the one the loop is holding up.
  Across four models, a difference-in-differences analysis shows the gain from KB injection is confined to the segment whose gold shares the injected resource; in the independent segment it is at or below zero. Post-injection preservation clusters in a narrow 0.910-0.996 band even though baseline capability differs fivefold, so the reported gain is the complement of prior performance and weaker models appear to improve more dramatically. On an independent sample built by removing the construction filter, the measure replicates within model (overlapping intervals) while discriminating between models (non-overlapping intervals) -- it reflects a property of the model, not of the sample.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-12T09:33:59Z</published>
    <arxiv:comment>21 pages, 3 figures. Code and model outputs: https://github.com/nepersoned/malmoi-sjw-eval</arxiv:comment>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Jinhyung Bae</name>
    </author>
    <author>
      <name>Dain Kil</name>
    </author>
    <author>
      <name>Seongmin Oh</name>
    </author>
    <author>
      <name>Seungmin Lee</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.28642v1</id>
    <title>From Extraction to Governed Memory: Multi-Agent Knowledge Graph Construction with Domain-Expert Review</title>
    <updated>2026-08-12T01:45:23Z</updated>
    <link href="https://arxiv.org/abs/2608.28642v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.28642v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Knowledge graphs used by agentic systems are often treated as flat stores of extracted triples, with little record of who owns a fact, why it was admitted, or how it should be used downstream. We argue that reliable agentic knowledge systems require governance as an essential component of graph construction to bridge this gap. We propose MAGG, a principled multi-agent framework for constructing Governed Knowledge Graphs that introduces explicit governance decisions for reliable and trustworthy knowledge sharing. A domain classifier first induces entity and relation types directly from document content, enabling operation in open-world settings without fixed schemas. Candidate triples are assigned to domain owners, reviewed against supporting evidence, admitted through governance decisions, and stored with audit metadata. The same ownership structure is reused during question answering, where queries are routed to domain-specific graph experts rather than answered through undifferentiated retrieval. Our evaluation demonstrates MAGG's effectiveness: On SciERC, MAGG improves strict triple F1 by 47% and mapped triple F1 by 51% over flat insertion. A blinded review of 120 triples finds governed-only triples more often source-supported than flat-only ones, and revised triples supported in 100% of cases. Finally, on MuSiQue, MAGG outperforms Microsoft GraphRAG by 9.0 exact-match points and 11.2 token-F1 points.</summary>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CE" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.ET" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.LG" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-12T01:45:23Z</published>
    <arxiv:comment>23 pages total, 10 pages main text, 12 pages of appendix, 2 figures, 6 tables</arxiv:comment>
    <arxiv:primary_category term="cs.AI"/>
    <author>
      <name>Pranav Bykampadi</name>
    </author>
    <author>
      <name>Neel Mokaria</name>
    </author>
    <author>
      <name>Vishesh Narayan</name>
    </author>
    <author>
      <name>Faizan Wajid</name>
    </author>
    <author>
      <name>Ashok Agrawala</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.11484v1</id>
    <title>Patterns of Research Funding Across Research Subjects: The Case of NSERC</title>
    <updated>2026-08-11T22:51:11Z</updated>
    <link href="https://arxiv.org/abs/2608.11484v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.11484v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Funding agencies aim to maximize scientific output from the resources they allocate, a goal that may inadvertently reinforce cumulative advantage within funding systems. Focusing on research areas within Natural Sciences and Engineering (NSE), this study examines the distribution of Canadian research funding over time, with particular attention to the extent to which certain subjects gain prominence as emerging or high-growth fields, while others experience relative stagnation or decline. The results indicate that many research subject groups receiving decreased funding in recent years are concentrated in the pure sciences and mathematics. In contrast, social sciences and medical sciences, which initially had relatively low average funding per grant application, have demonstrated increasing funding trends over time. These findings offer valuable insights for funding agencies seeking to design policies that promote more effective and equitable allocation of resources.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T22:51:11Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Rabeeh Parhizkari</name>
    </author>
    <author>
      <name>Gita Ghiasi</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.11478v1</id>
    <title>Characterizing Peace Through Scientific Keywords</title>
    <updated>2026-08-11T22:40:40Z</updated>
    <link href="https://arxiv.org/abs/2608.11478v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.11478v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>This study aims to show that peace, as reflected in scientific research, is not a neutral or uniform concept but is constructed differently across disciplines and geopolitical contexts. To do this, this study analyzes differences in the use of keywords among scholarly publications aligned with SDG 16 across various disciplinary, societal, and national contexts, and identifies which keywords are most strongly associated with countries exhibiting higher versus lower levels of societal peace. Results show that while peace-related research is strongly centered on violence, it is interpreted through distinct lenses: technological and forensic approaches in biomedical and NSE fields, and institutional, legal, and societal perspectives in the social sciences. At the country level, violence remains a central anchor, but its framing varies with levels of peace, with higher-peace countries embedding it within welfare, health, and social systems, and lower-peace countries emphasizing conflict, security, and geopolitics. These results could contribute to shaping both research priorities and science policy initiatives.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T22:40:40Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Gita Ghiasi</name>
    </author>
    <author>
      <name>Rabeeh Parhizkari</name>
    </author>
    <author>
      <name>Tanja Tajmel</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.10858v1</id>
    <title>Auditable AI-Assisted Research Writing: An Engineering Discipline with Pre-Registered Process Observation</title>
    <updated>2026-08-11T12:30:42Z</updated>
    <link href="https://arxiv.org/abs/2608.10858v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.10858v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Language models now draft, classify and criticise inside research production, yet the artifacts they help produce carry little accountable history. Rather than detecting machine involvement afterwards, we specify an auditability discipline built at production time: git sealing with an anchor lineage, hash-bound provenance, red-line gates that refuse non-compliant artifacts and log every refusal, cross-model role separation, and programmatic assembly from registered sources. Adherence is instrumented by metric cards, each carrying a pre-registered blind spot and evidential standing, frozen before the prospective case it observes. In that case the observed project's pre-registered confirmatory test was executed under seal and returned No-Go, and that project's frozen stopping rule halted the work, against its own operators. A lower-graded retrospective case covers families whose machinery predates the protocol. Current observations are provisional; we release a package from which a third party can recompute every primary metric.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.HC" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T12:30:42Z</published>
    <arxiv:comment>25 pages, 2 figures</arxiv:comment>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Yang Zhou</name>
    </author>
    <author>
      <name>Chengqun Yu</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.10774v1</id>
    <title>A Graph Approach to the Academic Publishing Network: A Heterogeneous Model and Structural Screening over OpenAlex Open Data</title>
    <updated>2026-08-11T10:28:05Z</updated>
    <link href="https://arxiv.org/abs/2608.10774v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.10774v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>The academic publishing ecosystem is a vast, heterogeneous network of works, authors, institutions, journals, and topics. Traditional scientometrics reduces it to isolated tabular indicators (h-index, Impact Factor) that ignore topological context and are not designed to capture coordinated illegitimate practices. Building on our companion review, which proposed graph analysis of publishing integrity, this paper implements that approach. We define a heterogeneous multivariate graph model over OpenAlex open data (seven node types, seven edge types) and a methodology based on projections (citation and co-authorship networks), interpretable structural metrics, community detection, and three screening detectors of anomalous publishing patterns. We deliberately avoid binary classification: detectors return ranked candidates with explicit structural evidence for human assessment. On the institutional corpus of VSB - Technical University of Ostrava (2020-2025) with its one-hop citation neighbourhood, community detection recovers real research groups, centralities identify cross-disciplinary bridges, and the screenings flag dense co-authorship cliques, locally closed citation loops, and thematically isolated venues. On a second, venue-centric corpus with external ground truth (journals delisted by Scopus and DOAJ) and size-matched controls, a naive case-control design yields seemingly strong but spurious detectors (a prominence confound), whereas after matching the only robust signal is the breadth of disciplinary scope (AUC 0.70); an open graph-based prestige measure (PageRank over the journal citation network) tracks a JIF proxy while being an order of magnitude more resistant to citation gaming than count-based indicators. We release the method as the open-source library apnet with a reproducible CLI workflow and a web interface; the analysis runs on commodity hardware in minutes.</summary>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="stat.AP" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T10:28:05Z</published>
    <arxiv:primary_category term="cs.SI"/>
    <author>
      <name>Robert Šamárek</name>
    </author>
    <author>
      <name>Radek Martinek</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.10739v1</id>
    <title>Unveiling the Predators: Contemporary Approaches to Identifying Illegitimate Open Access Journals in the Academic Publishing Ecosystem</title>
    <updated>2026-08-11T09:56:13Z</updated>
    <link href="https://arxiv.org/abs/2608.10739v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.10739v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Predatory journals pose a significant challenge to the integrity of the Open Access (OA) publishing model by exploiting its framework for financial gain while bypassing essential editorial and peer-review standards. This study critically evaluates existing methodologies for identifying such journals, ranging from manual blacklist checks to advanced automated approaches utilizing machine learning. The analysis highlights critical limitations, including the lack of a universally accepted definition of predatory journals, over-reliance on binary classification systems (e.g., blacklists and whitelists), and issues with scalability, reliability and interpretability. To address these shortcomings, this paper introduces a novel methodology based on multivariate graph analysis. By modeling the academic publishing ecosystem as a network of interconnected entities (such as authors, articles, journals, and publishers), this approach provides broader insights into the dynamics of scholarly communication and could help identify illegitimate publishing practices by utilizing graph algorithms like centrality measures, community detection, and anomaly detection. The proposed framework aims to enhance the accuracy, scalability, and transparency of detection of illegitimate journals and publishing practices while fostering a more comprehensive understanding of the academic publishing landscape.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T09:56:13Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Robert Šamárek</name>
    </author>
    <author>
      <name>Radek Martinek</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.10715v1</id>
    <title>Most biomedical publications show signs of LLM-assisted writing</title>
    <updated>2026-08-11T09:34:18Z</updated>
    <link href="https://arxiv.org/abs/2608.10715v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.10715v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Over the past several years, LLM-powered chatbots and agents have become widely used as a tool for academic writing. LLM-assisted writing can be valuable by removing language barriers but at the same time causes concerns about misconduct and fraud. To inform policy decisions, it is necessary to monitor the prevalence of LLM-altered texts in scholarly publications. Despite some recent progress in this direction, no existing method can produce reliable estimates. Here we suggest and validate a new unbiased approach to estimate LLM usage in a corpus of texts based on changing word frequencies. We apply our method to the full texts of open-access biomedical papers from Pubmed Central, and show that by the end of 2025, 89% of papers show excess of LLM-associated vocabulary. We also find that LLMs are twice as likely to be used when writing a paragraph in the Discussion section (68%) compared to a paragraph in the Methods section (32%), but even inside the Methods section, the overall prevalence of LLM usage is over 50%. We believe that our estimates are crucial to shape future guidelines and policies.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.CY" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.SI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T09:34:18Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <author>
      <name>Lena Holzwarth</name>
    </author>
    <author>
      <name>Rita González-Márquez</name>
    </author>
    <author>
      <name>Dmitry Kobak</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.10688v1</id>
    <title>Leveraging Human Reading Behavior for Keyphrase Extraction: A Webcam-based Eye-tracking Corpus</title>
    <updated>2026-08-11T09:11:42Z</updated>
    <link href="https://arxiv.org/abs/2608.10688v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.10688v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Purpose: Keyphrases are statistically and semantically important textual units that can also attract readers' attention during comprehension. However, existing keyphrase extraction (KPE) studies mainly focus on improving textual representation while largely overlooking human reading behavior. This study examines whether lightweight webcam-based eye-tracking features can improve KPE from Chinese academic abstracts in Library and Information Science (LIS).
  Methodology: To address the limited availability of eye-tracking data for Chinese academic reading, we developed a lightweight webcam-based data collection platform using the open-source SearchGazer library and constructed the Chinese LIS Eye-Tracking Corpus (CLIS-ET). Three character-level eye-tracking features, first fixation duration (FFD), fixation number (FN), and total fixation duration (TFD), were incorporated into KPE models to evaluate their effects on extraction performance.
  Findings: Eye-tracking features consistently improved KPE performance. The combination of FN and TFD achieved the best results on the Att-BiLSTM+CRF model, indicating that readers' fixation behavior provides useful signals for identifying keyphrases in academic abstracts.
  Originality/value: This study introduces a cost-effective webcam-based eye-tracking approach for KPE and presents CLIS-ET, a Chinese academic eye-tracking corpus containing FFD, FN, and TFD features. The results demonstrate the value of incorporating human reading behavior into keyphrase extraction. Dataset and code: https://github.com/yan-xinyi/ET_AKE and https://github.com/yan-xinyi/Reading_ET_System.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.HC" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T09:11:42Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <arxiv:journal_ref>aslib JIM, 2026</arxiv:journal_ref>
    <author>
      <name>Chengzhi Zhang</name>
    </author>
    <author>
      <name>Xinyi Yan</name>
    </author>
    <author>
      <name>Wenqi Yu</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.10584v2</id>
    <title>HexEval: An Evidence-Driven Hexagonal Framework for Multidimensional Scholar Assessment</title>
    <updated>2026-08-12T09:09:14Z</updated>
    <link href="https://arxiv.org/abs/2608.10584v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.10584v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>Scholar assessment plays a fundamental role in faculty recruitment, funding allocation, academic promotion, and talent discovery. Existing scholar assessment methods predominantly rely on bibliometric indicators and reputation proxies, while recent large language model (LLM)-based approaches mainly focus on evaluating individual research papers rather than comprehensively assessing scholars. We argue that scholar assessment should be formulated as an evidence-driven reasoning problem that jointly considers intrinsic research quality and externally verifiable scholarly behavior. To this end, we propose HexEval, an evidence-driven hexagonal framework for multidimensional scholar assessment. HexEval explicitly organizes scholar assessment into two complementary evidence layers. The intrinsic layer evaluates anonymized representative works along three dimensions, namely research rigor, methodological innovation, and scientific contribution, whereas the external layer characterizes scholars through knowledge translation, research coherence, and academic impact using heterogeneous evidence collected from GitHub, Lens, OpenAlex, and other publicly verifiable sources. Instead of producing opaque aggregate scores, HexEval preserves intermediate evidence, dimension-specific rationales, and verification signals throughout the evaluation process, enabling interpretable and auditable scholar profiles. Experiments across all six dimensions show dimension-dependent agreement with human or external reference criteria: structured calibration improves absolute agreement for intrinsic quality, while the external modules recover broad trajectory and ordinal impact signals. These results support evidence-driven reasoning over heterogeneous scholarly evidence as a promising paradigm for auditable AI-assisted scholar assessment, while exposing the coverage and attribution limitations of public scholarly data.</summary>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-11T07:11:49Z</published>
    <arxiv:comment>remove copyright information</arxiv:comment>
    <arxiv:primary_category term="cs.AI"/>
    <author>
      <name>Xiaokang Qu</name>
    </author>
    <author>
      <name>Yiting Lin</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.09552v1</id>
    <title>Does ChatGPT score research quality differently by gender?</title>
    <updated>2026-08-10T12:50:03Z</updated>
    <link href="https://arxiv.org/abs/2608.09552v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.09552v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Large Language Models (LLMs) are being considered for research evaluation, raising concerns about the introduction of AI bias. This study investigates whether ChatGPT research quality scores differ by first-author gender using 89,744 journal articles from the UK Research Excellence Framework (REF) 2021. Author information was withheld from ChatGPT to avoid direct gender bias. Nevertheless, male first-authored papers had slightly higher ChatGPT scores in most Units of Assessment (UoAs), especially in health, science and engineering-related subjects, and this pattern was often stronger for ChatGPT than for REF scores, based on a departmental-level proxy. Rank-based ChatGPT gains relative to REF scores were also more favourable for male first-authored papers in most UoAs, although the differences were generally small. Gender differences were not evident for solo research in the social sciences, arts and humanities, however. The male-favouring pattern for first-authored research was not explained by gender differences in writing styles, at least as reflected in abstract complexity. Some ChatGPT-REF differences may also reflect the departmental averaging process used to generate the REF proxy scores. Average ChatGPT scores may differ by first-author gender indirectly through other factors, such as field, topic, method, journal context or authorship structure. Thus, this is an additional reason to be cautious with AI-based research evaluation.</summary>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-10T12:50:03Z</published>
    <arxiv:primary_category term="cs.DL"/>
    <author>
      <name>Kayvan Kousha</name>
    </author>
    <author>
      <name>Mike Thelwall</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2608.08636v2</id>
    <title>Enhancing Scientific Named Entity Recognition via Large Language Models: A Type-driven Multi-task Learning Approach</title>
    <updated>2026-08-14T04:03:09Z</updated>
    <link href="https://arxiv.org/abs/2608.08636v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2608.08636v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>Scientific named entity recognition (SciNER) plays a crucial role in information extraction and knowledge discovery from scientific texts. Recently, large language models (LLMs) have demonstrated the capacity to achieve competitive SciNER performance with minimal human effort. Existing research highlights the importance of incorporating candidate entity type information for accurate entity recognition and classification by LLMs. However, when too many candidate entity types are provided in the prompt, LLMs struggle to accurately recognize and label entities in scientific texts, where entity types are more complex than in general domains. To address this challenge, we propose TdSciNER, a type-driven approach that effectively leverages entity type information to enhance SciNER performance. In TdSciNER, we first design an entity type filter model to identify the most likely entity types present in a given sentence. Subsequently, we introduce an auxiliary multi-class entity typing task within a multi-task learning framework alongside SciNER to obtain richer contextual representations. Then, we develop a novel demonstration selection strategy based on sentence similarity and entity type diversity to activate the in-context learning capabilities of LLMs, thereby improving entity recognition accuracy across diverse scientific domains. Experiments on three datasets demonstrate that our method achieves performance comparable to fully supervised models. Further analysis validates that each entity type-driven component in TdSciNER contributes to the improvement of SciNER performance. This work provides valuable insights for future advancements in SciNER and broader information extraction tasks in scientific text mining.</summary>
    <category term="cs.CL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DL" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.IR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-08-09T10:59:37Z</published>
    <arxiv:primary_category term="cs.CL"/>
    <arxiv:journal_ref>Expert Systems With Applications, 2026</arxiv:journal_ref>
    <author>
      <name>Tong Bao</name>
    </author>
    <author>
      <name>Yi Zhao</name>
    </author>
    <author>
      <name>Heng Zhang</name>
    </author>
    <author>
      <name>Chengzhi Zhang</name>
    </author>
    <arxiv:doi>10.1016/j.eswa.2026.133983</arxiv:doi>
    <link rel="related" href="https://doi.org/10.1016/j.eswa.2026.133983" title="doi"/>
  </entry>
</feed>
