Demo Data from SIGIR 2026 / reviewers in the wild / expert
Simone Papicchio
dblp:369/7068
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2025
0009-0005-5361-0042ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
3 papers |
Data models and query languages · 46% Knowledge graphs · 20% Machine learning and data management · 15% | |
| Artificial intelligence
3 papers |
Question answering and dialogue systems · 50% Language models and text generation · 28% Information extraction and text analysis · 22% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
retrieval-augmented generation |
0.9 | 1 | 2025 | CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025 |
Data models and query languages › graph query language › property graph query language
cypher |
0.9 | 1 | 2025 | CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025 |
Knowledge graphs › knowledge graph querying
knowledge graph question answering |
0.9 | 1 | 2025 | CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025 |
Data models and query languages
query language |
0.9 | 1 | 2025 | CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025 |
Natural language and speech › Information extraction and text analysis
semantic parsing |
0.7 | 1 | 2023 | QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your Data · NeurIPS 2023 |
Natural language and speech › Question answering and dialogue systems
table question answering |
0.7 | 1 | 2023 | QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your Data · NeurIPS 2023 |
Information retrieval › evaluation
benchmark |
0.7 | 1 | 2023 | QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your Data · NeurIPS 2023 |
Machine learning and data management
table representation learning |
0.7 | 1 | 2023 | QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your Data · NeurIPS 2023 |
Data models and query languages › SQL
SQL query generation |
0.3 | 1 | 2025 | SQUAB: Evaluating LLM robustness to Ambiguous and Unanswerable Questions in Semantic Parsing · EMNLP 2025 |
Query processing and optimization
SQL query processing |
0.2 | 1 | 2023 | QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your Data · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
text-to-cypher generation · 1.7large language model · 1.7automatic dataset generation · 1.7RDF-to-property graph conversion · 1.7table representation learning · 1.3checklist generation · 1.3SQL query generation · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM EraabstractRetrieval from graph data is crucial for augmenting large language models (LLM) with both open-domain knowledge and private enterprise data, and it is also a key component in the recent GraphRAG system (Edge et al., 2024).Despite decades of research on knowledge graphs and knowledge base question answering, leading LLM frameworks (e.g., Langchain and LlamaIndex) have only minimal support for retrieval from modern encyclopedic knowledge graphs like Wikidata.In this paper, we analyze the root cause and suggest that modern RDF knowledge graphs (e.g., Wikidata, Freebase) are less efficient for LLMs due to overly large schemas that far exceed the typical LLM context window, use of resource identifiers, overlapping relation types and lack of normalization.As a solution, we propose property graph views on top of the underlying RDF graph that can be efficiently queried by LLMs using Cypher.We instantiated this idea on Wikidata and introduced CypherBench, the first benchmark with 11 large-scale, multi-domain property graphs with 7.8 million entities and over 10,000 questions.To achieve this, we tackled several key challenges, including developing an RDF-to-property graph conversion engine, creating a systematic pipeline for textto-Cypher task generation, and designing new evaluation metrics. Yanlin Feng, Simone Papicchio, Sajjadur Rahman |
ACL (1) | 2 |
| 2025 | SQUAB: Evaluating LLM robustness to Ambiguous and Unanswerable Questions in Semantic ParsingabstractLarge Language Models (LLMs) have demonstrated robust performance in Semantic Parsing (SP) for well-defined queries with unambiguous intent and answerable responses.However, practical user questions frequently deviate from these ideal conditions, challenging the applicability of existing benchmarks.To address this issue, we introduce SQUAB, an automatic dataset generator of Ambiguous and Unanswerable questions.SQUAB generates complex, annotated SP tests using a blend of SQL and LLM capabilities.Results show that SQUAB reduces test generation costs by up to 99% compared to human-based solutions while aligning with real-world question patterns.Furthermore, these tests challenge LLM performance while revealing disparities between public and proprietary datasets.This highlights the need for a dynamic, automatic dataset generator as SQUAB.The code is designed for user extension to accommodate new ambiguous and unanswerable patterns and is available at https: //github.com/spapicchio/squab. Simone Papicchio, Luca Cagliero, Paolo Papotti |
EMNLP | 1 |
| 2025 | QATCH: Automatic Evaluation of SQL-Centric Tasks on Proprietary DataabstractTabular Representation Learning (TRL) and Large Language Models (LLMs) have become established for tackling Question Answering (QA) and Semantic Parsing (SP) tasks on tabular data. State-of-the-art models are pre-trained and evaluated on large open-domain datasets. However, the performance on existing QA and SP benchmarks is not necessarily representative of that achieved on proprietary data as the characteristics of the input and the complexity of the posed queries show high variability. To tackle this challenge, our goal is to allow end-users to evaluate TRL and LLM performance on their own proprietary data. We present Query-Aided TRL CHecklist (QATCH), a toolbox to automatically generate a testing checklist tailored to QA and SP. QATCH provides a testing suite highlighting models’ strengths and weaknesses on relational tables unseen at training time. The proposed toolbox relies on a SQL query generator that crafts tests of varying types and complexity including, amongst others, tests on null values, projection, selections, joins, group by, and having clauses. QATCH also supports a set of general cross-task performance metrics providing more insights into SQL-related model capabilities than currently used metrics. The empirical results, achieved by state-of-the-art TRL models and LLMs, show substantial performance differences (1) between existing benchmarks and proprietary data, (2) across queries of different complexity. Simone Papicchio, Paolo Papotti, Luca Cagliero |
ACM Trans. Intell. Syst. Technol. | 1 |
| 2023 | QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your DataabstractTable Representation Learning (TRL) models are commonly pre-trained on large open-domain datasets comprising millions of tables and then used to address downstream tasks. Choosing the right TRL model to use on proprietary data can be challenging, as the best results depend on the content domain, schema, and data quality. Our purpose is to support end-users in testing TRL models on proprietary data in two established SQL-centric tasks, i.e., Question Answering (QA) and Semantic Parsing (SP). We present QATCH (Query-Aided TRL Checklist), a toolbox to highlight TRL models’ strengths and weaknesses on relational tables unseen at training time. For an input table, QATCH automatically generates a testing checklist tailored to QA and SP. Checklist generation is driven by a SQL query engine that crafts tests of different complexity. This design facilitates inherent portability, allowing the checks to be used by alternative models. We also introduce a set of cross-task performance metrics evaluating the TRL model’s performance over its output. Finally, we show how QATCH automatically generates tests for proprietary datasets to evaluate various state-of-the-art models including TAPAS, TAPEX, and CHATGPT. Simone Papicchio, Paolo Papotti, Luca Cagliero |
NeurIPS | 1 |