{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SRHN7VIO2KJGN7624Z72AXBKE5","short_pith_number":"pith:SRHN7VIO","schema_version":"1.0","canonical_sha256":"944edfd50ed29266ffdae67fa05c2a277736e5ac771808241d2484473484264f","source":{"kind":"arxiv","id":"2406.17871","version":3},"attestation_state":"computed","paper":{"title":"Revisiting the Expressiveness Landscape of Data Graph Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anthony Widjaja Lin, Di-De Yen, Michael Benedikt","submitted_at":"2024-06-25T18:19:14Z","abstract_excerpt":"The study of graph queries in database theory has spanned more than three decades, resulting in a multitude of proposals for graph query languages. We can identify three main families of languages, with the canonical representatives being: (1) regular path queries, (2) walk logic, and (3) first-order logic with transitive closure operators. This paper provides a complete picture of the expressive power of these languages in the context of data graphs. Specifically, we consider a graph data model that supports querying over both data and topology. For example, ``Does there exist a path between "},"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":"2406.17871","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-06-25T18:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"b74ceee91ba3280a5e92191bc17095f25012e07b4d9de6b72e881dfefab0206c","abstract_canon_sha256":"0f565484046c7ecb126674a921e8b2f78375dcdaacec11f2439ecc5d8362cce2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:17.818092Z","signature_b64":"ZCtAxHUXb4Tn6qZvp7B9cnIaJw3pGHToDPbLaCZbIjQ54vTb1Q3N0eLCYe7oQhNBZiQHoBcZimaTJzbPpvWUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"944edfd50ed29266ffdae67fa05c2a277736e5ac771808241d2484473484264f","last_reissued_at":"2026-06-01T02:03:17.817108Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:17.817108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting the Expressiveness Landscape of Data Graph Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anthony Widjaja Lin, Di-De Yen, Michael Benedikt","submitted_at":"2024-06-25T18:19:14Z","abstract_excerpt":"The study of graph queries in database theory has spanned more than three decades, resulting in a multitude of proposals for graph query languages. We can identify three main families of languages, with the canonical representatives being: (1) regular path queries, (2) walk logic, and (3) first-order logic with transitive closure operators. This paper provides a complete picture of the expressive power of these languages in the context of data graphs. Specifically, we consider a graph data model that supports querying over both data and topology. For example, ``Does there exist a path between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.17871","kind":"arxiv","version":3},"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/2406.17871/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":"2406.17871","created_at":"2026-06-01T02:03:17.817243+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.17871v3","created_at":"2026-06-01T02:03:17.817243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.17871","created_at":"2026-06-01T02:03:17.817243+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRHN7VIO2KJG","created_at":"2026-06-01T02:03:17.817243+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRHN7VIO2KJGN762","created_at":"2026-06-01T02:03:17.817243+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRHN7VIO","created_at":"2026-06-01T02:03:17.817243+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5","json":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5.json","graph_json":"https://pith.science/api/pith-number/SRHN7VIO2KJGN7624Z72AXBKE5/graph.json","events_json":"https://pith.science/api/pith-number/SRHN7VIO2KJGN7624Z72AXBKE5/events.json","paper":"https://pith.science/paper/SRHN7VIO"},"agent_actions":{"view_html":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5","download_json":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5.json","view_paper":"https://pith.science/paper/SRHN7VIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.17871&json=true","fetch_graph":"https://pith.science/api/pith-number/SRHN7VIO2KJGN7624Z72AXBKE5/graph.json","fetch_events":"https://pith.science/api/pith-number/SRHN7VIO2KJGN7624Z72AXBKE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5/action/storage_attestation","attest_author":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5/action/author_attestation","sign_citation":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5/action/citation_signature","submit_replication":"https://pith.science/pith/SRHN7VIO2KJGN7624Z72AXBKE5/action/replication_record"}},"created_at":"2026-06-01T02:03:17.817243+00:00","updated_at":"2026-06-01T02:03:17.817243+00:00"}