pith. sign in

Title resolution pending

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

fields

cs.AI 1 cs.DB 1

years

2026 2

verdicts

UNVERDICTED 2

clear filters

representative citing papers

Validation of graph databases against PG-Schema

cs.DB · 2026-06-04 · unverdicted · novelty 5.0

PG-Schema validation is NP-complete in combined complexity and PTIME in data complexity; combined complexity becomes PTIME under restricted alternation of type combinations and unions.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • Evaluation of Pipelines for Data Integration into Knowledge Graphs cs.AI · 2026-05-21 · unverdicted · none · ref 2

    KGI-Bench evaluates data integration pipelines into knowledge graphs using coverage, correctness, and consistency metrics on movie domain datasets with 12 pipelines tested.

  • Validation of graph databases against PG-Schema cs.DB · 2026-06-04 · unverdicted · none · ref 2

    PG-Schema validation is NP-complete in combined complexity and PTIME in data complexity; combined complexity becomes PTIME under restricted alternation of type combinations and unions.