{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EPXSC6CJALYXH46FPB4DKENMYP","short_pith_number":"pith:EPXSC6CJ","schema_version":"1.0","canonical_sha256":"23ef21784902f173f3c578783511acc3e3339d17961a48f1bf82658373d0df18","source":{"kind":"arxiv","id":"1408.0528","version":2},"attestation_state":"computed","paper":{"title":"Answering Regular Path Queries on Workflow Provenance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Susan B. Davidson, Tova Milo, Xiaocheng Huang, Xiaojie Yuan, Zhuowei Bao","submitted_at":"2014-08-03T19:02:51Z","abstract_excerpt":"This paper proposes a novel approach for efficiently evaluating regular path queries over provenance graphs of workflows that may include recursion. The approach assumes that an execution g of a workflow G is labeled with query-agnostic reachability labels using an existing technique. At query time, given g, G and a regular path query R, the approach decomposes R into a set of subqueries R1, ..., Rk that are safe for G. For each safe subquery Ri, G is rewritten so that, using the reachability labels of nodes in g, whether or not there is a path which matches Ri between two nodes can be decided"},"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":"1408.0528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-08-03T19:02:51Z","cross_cats_sorted":[],"title_canon_sha256":"57b0f4736555b741da8a525692dca17a5c8d25255d08bb6038b4df293a922ccb","abstract_canon_sha256":"4a6827b96ab82cfb1d80a6fd17f401accd063cecfaf6f2943f43ad668c80f37c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:50.380293Z","signature_b64":"6mb8EHR6n9A62AboXW6BCfjq89AWsi7QD1TWnsiYJgt+jkMgxS9BV58zDQJx+oITs9FJckOtHKCuDGCJB3zPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23ef21784902f173f3c578783511acc3e3339d17961a48f1bf82658373d0df18","last_reissued_at":"2026-05-18T02:45:50.379885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:50.379885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Answering Regular Path Queries on Workflow Provenance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Susan B. Davidson, Tova Milo, Xiaocheng Huang, Xiaojie Yuan, Zhuowei Bao","submitted_at":"2014-08-03T19:02:51Z","abstract_excerpt":"This paper proposes a novel approach for efficiently evaluating regular path queries over provenance graphs of workflows that may include recursion. The approach assumes that an execution g of a workflow G is labeled with query-agnostic reachability labels using an existing technique. At query time, given g, G and a regular path query R, the approach decomposes R into a set of subqueries R1, ..., Rk that are safe for G. For each safe subquery Ri, G is rewritten so that, using the reachability labels of nodes in g, whether or not there is a path which matches Ri between two nodes can be decided"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0528","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":""},"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":"1408.0528","created_at":"2026-05-18T02:45:50.379941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0528v2","created_at":"2026-05-18T02:45:50.379941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0528","created_at":"2026-05-18T02:45:50.379941+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPXSC6CJALYX","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPXSC6CJALYXH46F","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPXSC6CJ","created_at":"2026-05-18T12:28:28.263976+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/EPXSC6CJALYXH46FPB4DKENMYP","json":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP.json","graph_json":"https://pith.science/api/pith-number/EPXSC6CJALYXH46FPB4DKENMYP/graph.json","events_json":"https://pith.science/api/pith-number/EPXSC6CJALYXH46FPB4DKENMYP/events.json","paper":"https://pith.science/paper/EPXSC6CJ"},"agent_actions":{"view_html":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP","download_json":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP.json","view_paper":"https://pith.science/paper/EPXSC6CJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0528&json=true","fetch_graph":"https://pith.science/api/pith-number/EPXSC6CJALYXH46FPB4DKENMYP/graph.json","fetch_events":"https://pith.science/api/pith-number/EPXSC6CJALYXH46FPB4DKENMYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/action/storage_attestation","attest_author":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/action/author_attestation","sign_citation":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/action/citation_signature","submit_replication":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/action/replication_record"}},"created_at":"2026-05-18T02:45:50.379941+00:00","updated_at":"2026-05-18T02:45:50.379941+00:00"}