MétaCan
Menu
Back to cohort
Record W4411797260 · doi:10.1145/3735546

Proceedings of the 8th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)

2025· paratext· en· W4411797260 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

Venuenot available
Typeparatext
Languageen
FieldComputer Science
TopicGraph Theory and Algorithms
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaIsrael Science FoundationCanada Excellence Research Chairs, Government of CanadaNational Science FoundationGovernment of CanadaAgence Nationale de la Recherche
KeywordsComputer scienceAnalyticsData analysisData scienceData managementGraphJoint (building)World Wide WebData miningTheoretical computer scienceEngineering

Abstract

fetched live from OpenAlex

GRADES-NDA 2025 is the eighth joint meeting of the GRADES and NDA workshops, which were each independently organized at previous SIGMOD-PODS meetings: GRADES since 2013, and NDA since 2016.The focus of the GRADES-NDA workshop is the application areas, usage scenarios, and open challenges in managing large-scale graph-shaped data.The workshop is a forum for exchanging ideas and methods for mining, querying, and learning with real-world network data, developing new common understandings of the problems at hand, sharing of data sets and benchmarks where applicable, and leveraging existing knowledge from different disciplines.GRADES-NDA aims to present technical contributions in graph, RDF, and other data management systems on massive graphs.The purpose of this workshop is to bring together researchers from academia, industry, and government to create a forum for discussing recent advances in large-scale graph data management and analytics systems, as well as propose and discuss novel methods and techniques towards addressing domain-specific challenges and handling noise in real-world graphs.We received 18 submissions, and each was reviewed by 3 members of the program committee.Based on the reviews, the program chairs decided on each submission.Six full papers and two short papers were chosen to appear at the workshop and in these proceedings, amounting

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science
Consensus categoriesOpen science
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.376
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0100.010
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.079
GPT teacher head0.291
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicGraph Theory and AlgorithmsFrench-language works237,207