{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HIR6YXHL65F62WFSCRJZBL7TR4","short_pith_number":"pith:HIR6YXHL","schema_version":"1.0","canonical_sha256":"3a23ec5cebf74bed58b2145390aff38f1312a18c2b8d755be30c4dab451e7a87","source":{"kind":"arxiv","id":"2507.01755","version":3},"attestation_state":"computed","paper":{"title":"PathDB: A system for evaluating regular path queries","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Renzo Angles, Roberto Garc\\'ia, Sebasti\\'an Ferrada, Vicente Rojas","submitted_at":"2025-07-02T14:33:05Z","abstract_excerpt":"Regular Path Queries (RPQs) are a core mechanism for expressing recursion and reachability in graph databases. However, most systems evaluate RPQs with traversal-based algorithms that repeatedly explore overlapping subpaths and offer limited control over path semantics. We present PathDB, an algebraic query engine for RPQs based on a closed path algebra over multisets of paths with five operators: selection, join, union, recursive join, and projection. PathDB provides (i) a GQL-inspired declarative language that supports RPQs with multiple semantics (walk, trail, simple, and acyclic), (ii) an "},"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":"2507.01755","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-02T14:33:05Z","cross_cats_sorted":[],"title_canon_sha256":"f34e7704f603a0597050a04e232689b149844e31fea894a2141338a4a4397aba","abstract_canon_sha256":"7f70f65a2e22a32cf02c895dc795ab4cfa3369872aa908dbb5f73c86822a013d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:46.174468Z","signature_b64":"tEe1OKff3Y5shrsTMXrtumuWiCE5slOkK1sKCUefLD+6VAtD1HFjKWU0ALs3qjUNwKuwGJIXyL9Q3opwSfLXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a23ec5cebf74bed58b2145390aff38f1312a18c2b8d755be30c4dab451e7a87","last_reissued_at":"2026-06-23T01:12:46.173945Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:46.173945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PathDB: A system for evaluating regular path queries","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Renzo Angles, Roberto Garc\\'ia, Sebasti\\'an Ferrada, Vicente Rojas","submitted_at":"2025-07-02T14:33:05Z","abstract_excerpt":"Regular Path Queries (RPQs) are a core mechanism for expressing recursion and reachability in graph databases. However, most systems evaluate RPQs with traversal-based algorithms that repeatedly explore overlapping subpaths and offer limited control over path semantics. We present PathDB, an algebraic query engine for RPQs based on a closed path algebra over multisets of paths with five operators: selection, join, union, recursive join, and projection. PathDB provides (i) a GQL-inspired declarative language that supports RPQs with multiple semantics (walk, trail, simple, and acyclic), (ii) an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01755","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/2507.01755/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":"2507.01755","created_at":"2026-06-23T01:12:46.174014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.01755v3","created_at":"2026-06-23T01:12:46.174014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01755","created_at":"2026-06-23T01:12:46.174014+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIR6YXHL65F6","created_at":"2026-06-23T01:12:46.174014+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIR6YXHL65F62WFS","created_at":"2026-06-23T01:12:46.174014+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIR6YXHL","created_at":"2026-06-23T01:12:46.174014+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.02553","citing_title":"Efficient Path Query Processing in Relational Database Systems","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4","json":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4.json","graph_json":"https://pith.science/api/pith-number/HIR6YXHL65F62WFSCRJZBL7TR4/graph.json","events_json":"https://pith.science/api/pith-number/HIR6YXHL65F62WFSCRJZBL7TR4/events.json","paper":"https://pith.science/paper/HIR6YXHL"},"agent_actions":{"view_html":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4","download_json":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4.json","view_paper":"https://pith.science/paper/HIR6YXHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.01755&json=true","fetch_graph":"https://pith.science/api/pith-number/HIR6YXHL65F62WFSCRJZBL7TR4/graph.json","fetch_events":"https://pith.science/api/pith-number/HIR6YXHL65F62WFSCRJZBL7TR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4/action/storage_attestation","attest_author":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4/action/author_attestation","sign_citation":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4/action/citation_signature","submit_replication":"https://pith.science/pith/HIR6YXHL65F62WFSCRJZBL7TR4/action/replication_record"}},"created_at":"2026-06-23T01:12:46.174014+00:00","updated_at":"2026-06-23T01:12:46.174014+00:00"}