{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5XLIF4NXFYWRNUBJH7NYJFSL3X","short_pith_number":"pith:5XLIF4NX","schema_version":"1.0","canonical_sha256":"edd682f1b72e2d16d0293fdb84964bddec773c83828f76eacd7e492cd3d26e27","source":{"kind":"arxiv","id":"2112.06217","version":1},"attestation_state":"computed","paper":{"title":"Graph Pattern Matching in GQL and SQL/PGQ","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alastair Green, Alin Deutsch, Bei Li, Domagoj Vrgo\\v{c}, Filip Murlak, Fred Zemke, Hannes Voigt, Jan Michels, Keith Hare, Leonid Libkin, Mingxi Wu, Nadime Francis, Oskar van Rest, Petra Selmer, Stefan Plantikow, Tobias Lindaaker, Victor Marsault, Wim Martens","submitted_at":"2021-12-12T12:39:09Z","abstract_excerpt":"As graph databases become widespread, JTC1 -- the committee in joint charge of information technology standards for the International Organization for Standardization (ISO), and International Electrotechnical Commission (IEC) -- has approved a project to create GQL, a standard property graph query language. This complements a project to extend SQL with a new part, SQL/PGQ, which specifies how to define graph views over an SQL tabular schema, and to run read-only queries against them.\n  Both projects have been assigned to the ISO/IEC JTC1 SC32 working group for Database Languages, WG3, which co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2112.06217","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-12-12T12:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"02a375c83ed9e84611e55b514a908c763fdc4635018547edbf5185678c349157","abstract_canon_sha256":"24b8e958196116ce2af5dffc7a2dbee8053445bac65877927b820ab7d0e0ccf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:11.600288Z","signature_b64":"ibB+df903ZRAN8frvAvnYKHnVEyIw5gWnPA4+2szeMRjQZUMoR8P2ieDfQeuCrvrnOgfHWJm7+v3b1Xxt8p8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edd682f1b72e2d16d0293fdb84964bddec773c83828f76eacd7e492cd3d26e27","last_reissued_at":"2026-07-05T03:40:11.599670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:11.599670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Pattern Matching in GQL and SQL/PGQ","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alastair Green, Alin Deutsch, Bei Li, Domagoj Vrgo\\v{c}, Filip Murlak, Fred Zemke, Hannes Voigt, Jan Michels, Keith Hare, Leonid Libkin, Mingxi Wu, Nadime Francis, Oskar van Rest, Petra Selmer, Stefan Plantikow, Tobias Lindaaker, Victor Marsault, Wim Martens","submitted_at":"2021-12-12T12:39:09Z","abstract_excerpt":"As graph databases become widespread, JTC1 -- the committee in joint charge of information technology standards for the International Organization for Standardization (ISO), and International Electrotechnical Commission (IEC) -- has approved a project to create GQL, a standard property graph query language. This complements a project to extend SQL with a new part, SQL/PGQ, which specifies how to define graph views over an SQL tabular schema, and to run read-only queries against them.\n  Both projects have been assigned to the ISO/IEC JTC1 SC32 working group for Database Languages, WG3, which co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06217","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.06217/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.06217","created_at":"2026-07-05T03:40:11.599742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.06217v1","created_at":"2026-07-05T03:40:11.599742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06217","created_at":"2026-07-05T03:40:11.599742+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XLIF4NXFYWR","created_at":"2026-07-05T03:40:11.599742+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XLIF4NXFYWRNUBJ","created_at":"2026-07-05T03:40:11.599742+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XLIF4NX","created_at":"2026-07-05T03:40:11.599742+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11375","citing_title":"Graph Neural Networks on Graph Databases","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X","json":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X.json","graph_json":"https://pith.science/api/pith-number/5XLIF4NXFYWRNUBJH7NYJFSL3X/graph.json","events_json":"https://pith.science/api/pith-number/5XLIF4NXFYWRNUBJH7NYJFSL3X/events.json","paper":"https://pith.science/paper/5XLIF4NX"},"agent_actions":{"view_html":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X","download_json":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X.json","view_paper":"https://pith.science/paper/5XLIF4NX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.06217&json=true","fetch_graph":"https://pith.science/api/pith-number/5XLIF4NXFYWRNUBJH7NYJFSL3X/graph.json","fetch_events":"https://pith.science/api/pith-number/5XLIF4NXFYWRNUBJH7NYJFSL3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X/action/storage_attestation","attest_author":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X/action/author_attestation","sign_citation":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X/action/citation_signature","submit_replication":"https://pith.science/pith/5XLIF4NXFYWRNUBJH7NYJFSL3X/action/replication_record"}},"created_at":"2026-07-05T03:40:11.599742+00:00","updated_at":"2026-07-05T03:40:11.599742+00:00"}