{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OGWIFU55LJ7HTDU7GYO4BFVR42","short_pith_number":"pith:OGWIFU55","schema_version":"1.0","canonical_sha256":"71ac82d3bd5a7e798e9f361dc096b1e6a8fb4c2ca4f6352e87b9a86d99b4c96c","source":{"kind":"arxiv","id":"2412.07729","version":2},"attestation_state":"computed","paper":{"title":"Output-Sensitive Evaluation of Regular Path Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Dan Olteanu, Dan Suciu, Mahmoud Abo Khamis","submitted_at":"2024-12-10T18:26:40Z","abstract_excerpt":"We study the classical evaluation problem for regular path queries: Given an edge-labeled graph and a regular path query, compute the set of pairs of vertices that are connected by paths that match the query.\n  The Product Graph (PG) is the established evaluation approach for regular path queries. PG first constructs the product automaton of the data graph and the query and then uses breadth-first search to find the accepting states reachable from each initial state in the product automaton. Its data complexity is O(|V|.|E|), where V and E are the sets of vertices and respectively edges in the"},"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":"2412.07729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-10T18:26:40Z","cross_cats_sorted":[],"title_canon_sha256":"b794a937fea95dcabf8c97eed3b22fdf3342ff5357b6a380ddd4223bec5b19e6","abstract_canon_sha256":"a3d0ee6905db39e2bb473d8ef71ffa741dc446f328f9a03a64bcda581ec269f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:18.727204Z","signature_b64":"P2SHlGEBf7x4Vl4ULtpXBKAM6J6tjtLgLoX3LHODugntltX5XWYKxhN/E/Dnt584w7CDflBM/LUC25Uj6c3wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71ac82d3bd5a7e798e9f361dc096b1e6a8fb4c2ca4f6352e87b9a86d99b4c96c","last_reissued_at":"2026-07-05T10:41:18.726714Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:18.726714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Output-Sensitive Evaluation of Regular Path Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Dan Olteanu, Dan Suciu, Mahmoud Abo Khamis","submitted_at":"2024-12-10T18:26:40Z","abstract_excerpt":"We study the classical evaluation problem for regular path queries: Given an edge-labeled graph and a regular path query, compute the set of pairs of vertices that are connected by paths that match the query.\n  The Product Graph (PG) is the established evaluation approach for regular path queries. PG first constructs the product automaton of the data graph and the query and then uses breadth-first search to find the accepting states reachable from each initial state in the product automaton. Its data complexity is O(|V|.|E|), where V and E are the sets of vertices and respectively edges in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07729","kind":"arxiv","version":2},"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/2412.07729/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":"2412.07729","created_at":"2026-07-05T10:41:18.726777+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07729v2","created_at":"2026-07-05T10:41:18.726777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07729","created_at":"2026-07-05T10:41:18.726777+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGWIFU55LJ7H","created_at":"2026-07-05T10:41:18.726777+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGWIFU55LJ7HTDU7","created_at":"2026-07-05T10:41:18.726777+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGWIFU55","created_at":"2026-07-05T10:41:18.726777+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/OGWIFU55LJ7HTDU7GYO4BFVR42","json":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42.json","graph_json":"https://pith.science/api/pith-number/OGWIFU55LJ7HTDU7GYO4BFVR42/graph.json","events_json":"https://pith.science/api/pith-number/OGWIFU55LJ7HTDU7GYO4BFVR42/events.json","paper":"https://pith.science/paper/OGWIFU55"},"agent_actions":{"view_html":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42","download_json":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42.json","view_paper":"https://pith.science/paper/OGWIFU55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07729&json=true","fetch_graph":"https://pith.science/api/pith-number/OGWIFU55LJ7HTDU7GYO4BFVR42/graph.json","fetch_events":"https://pith.science/api/pith-number/OGWIFU55LJ7HTDU7GYO4BFVR42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42/action/storage_attestation","attest_author":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42/action/author_attestation","sign_citation":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42/action/citation_signature","submit_replication":"https://pith.science/pith/OGWIFU55LJ7HTDU7GYO4BFVR42/action/replication_record"}},"created_at":"2026-07-05T10:41:18.726777+00:00","updated_at":"2026-07-05T10:41:18.726777+00:00"}