{"id":"https://openalex.org/W7127892516","doi":"https://doi.org/10.48550/arxiv.2602.05503","title":"Repairing Property Graphs under PG-Constraints","display_name":"Repairing Property Graphs under PG-Constraints","publication_year":2026,"publication_date":"2026-02-05","ids":{"openalex":"https://openalex.org/W7127892516","doi":"https://doi.org/10.48550/arxiv.2602.05503"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.05503","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056098347","display_name":"Christopher Spinrath","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Spinrath, Christopher","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Bonifati, Angela","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bonifati, Angela","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124990472","display_name":"Rachid Echahed","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Echahed, Rachid","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056098347"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.46939998865127563,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.46939998865127563,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.17159999907016754,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.05869999900460243,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5698000192642212},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.48910000920295715},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4700999855995178},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4668000042438507},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.3801000118255615},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.3725000023841858},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.36039999127388},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.3549000024795532},{"id":"https://openalex.org/keywords/standardization","display_name":"Standardization","score":0.35089999437332153}],"concepts":[{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5698000192642212},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5109999775886536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5022000074386597},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.48910000920295715},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4700999855995178},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4668000042438507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3984000086784363},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3801000118255615},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.3725000023841858},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.36039999127388},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C188087704","wikidata":"https://www.wikidata.org/wiki/Q369577","display_name":"Standardization","level":2,"score":0.35089999437332153},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3296999931335449},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32589998841285706},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2858999967575073},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2851000130176544},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.25920000672340393},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.2563000023365021},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.05503","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.05503","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.05503","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.05503","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recent":[0],"standardization":[1],"efforts":[2],"for":[3,68,95],"graph":[4,79],"databases":[5],"lead":[6],"to":[7,71,83,132,146,149],"standard":[8],"query":[9],"languages":[10,17],"like":[11,18],"GQL":[12],"and":[13,15,47,81,107],"SQL/PGQ,":[14],"constraint":[16],"Property":[19,73],"Graph":[20],"Constraints":[21],"(PG-Constraints).":[22],"In":[23],"this":[24],"paper,":[25],"we":[26],"embark":[27],"on":[28,100,114],"the":[29,78,96,136,150,155],"study":[30],"of":[31,42,60,144],"repairing":[32,120],"property":[33],"graphs":[34],"under":[35],"PG-Constraints.":[36],"We":[37,62,90],"identify":[38],"a":[39,51,64,105,126,141],"significant":[40],"subset":[41],"PG-Constraints,":[43],"encoding":[44],"denial":[45],"constraints":[46,70],"including":[48],"recursion":[49],"as":[50],"key":[52],"feature,":[53],"while":[54,153],"still":[55],"permitting":[56],"automata-based":[57],"structural":[58],"analyses":[59],"errors.":[61],"present":[63],"comprehensive":[65],"repair":[66,72,97],"pipeline":[67],"these":[69],"Graphs,":[74],"involving":[75],"changes":[76],"in":[77,129],"topology":[80],"leading":[82],"node,":[84],"edge":[85],"and,":[86],"optionally,":[87],"label":[88,122],"deletions.":[89,134],"investigate":[91],"three":[92],"algorithmic":[93],"strategies":[94],"procedure,":[98],"based":[99],"Integer":[101],"Linear":[102],"Programming":[103],"(ILP),":[104],"naive,":[106],"an":[108],"LP-guided":[109,137],"greedy":[110,138],"algorithm.":[111],"Our":[112],"experiments":[113],"various":[115],"real-world":[116],"datasets":[117],"reveal":[118],"that":[119],"with":[121],"deletions":[123,130],"can":[124],"achieve":[125],"59%":[127],"reduction":[128],"compared":[131,148],"node/edge":[133],"Moreover,":[135],"algorithm":[139],"offers":[140],"runtime":[142],"advantage":[143],"up":[145],"97%":[147],"ILP":[151],"strategy,":[152],"matching":[154],"same":[156],"quality.":[157]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-07T00:00:00"}