{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EPXSC6CJALYXH46FPB4DKENMYP","short_pith_number":"pith:EPXSC6CJ","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"},"canonical_sha256":"23ef21784902f173f3c578783511acc3e3339d17961a48f1bf82658373d0df18","source":{"kind":"arxiv","id":"1408.0528","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0528","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0528v2","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0528","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"EPXSC6CJALYX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EPXSC6CJALYXH46F","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EPXSC6CJ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EPXSC6CJALYXH46FPB4DKENMYP","target":"record","payload":{"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"},"canonical_sha256":"23ef21784902f173f3c578783511acc3e3339d17961a48f1bf82658373d0df18","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"},"source_kind":"arxiv","source_id":"1408.0528","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vre3rlxQfnCeLrs3Q0VTvJb4MbU6OqoXoySFRXuosHgaspvN+Br64WuLxXFHT+IyOSINBBcn9gaaYDNXFa/CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:08.123523Z"},"content_sha256":"ed5fe47fbeaf03fac8fa64a594e1fd4f967ad49e47012a711c2cac042456b040","schema_version":"1.0","event_id":"sha256:ed5fe47fbeaf03fac8fa64a594e1fd4f967ad49e47012a711c2cac042456b040"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EPXSC6CJALYXH46FPB4DKENMYP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcisg5M78VuaZ/zcfGGhE4NfuPYxS/eZMe3zUSmk+Lh3poK8vLIZhRuAYSojJODH2FPaYCvYmqvXYZmHgHRQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:08.124154Z"},"content_sha256":"c32cd014c998ec8d0b909f6301071abff613e0e1aa15ebce858d26233e0b70ae","schema_version":"1.0","event_id":"sha256:c32cd014c998ec8d0b909f6301071abff613e0e1aa15ebce858d26233e0b70ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/bundle.json","state_url":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPXSC6CJALYXH46FPB4DKENMYP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T22:06:08Z","links":{"resolver":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP","bundle":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/bundle.json","state":"https://pith.science/pith/EPXSC6CJALYXH46FPB4DKENMYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPXSC6CJALYXH46FPB4DKENMYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EPXSC6CJALYXH46FPB4DKENMYP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a6827b96ab82cfb1d80a6fd17f401accd063cecfaf6f2943f43ad668c80f37c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-08-03T19:02:51Z","title_canon_sha256":"57b0f4736555b741da8a525692dca17a5c8d25255d08bb6038b4df293a922ccb"},"schema_version":"1.0","source":{"id":"1408.0528","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0528","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0528v2","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0528","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"EPXSC6CJALYX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EPXSC6CJALYXH46F","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EPXSC6CJ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:c32cd014c998ec8d0b909f6301071abff613e0e1aa15ebce858d26233e0b70ae","target":"graph","created_at":"2026-05-18T02:45:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Susan B. Davidson, Tova Milo, Xiaocheng Huang, Xiaojie Yuan, Zhuowei Bao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-08-03T19:02:51Z","title":"Answering Regular Path Queries on Workflow Provenance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0528","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ed5fe47fbeaf03fac8fa64a594e1fd4f967ad49e47012a711c2cac042456b040","target":"record","created_at":"2026-05-18T02:45:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4a6827b96ab82cfb1d80a6fd17f401accd063cecfaf6f2943f43ad668c80f37c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-08-03T19:02:51Z","title_canon_sha256":"57b0f4736555b741da8a525692dca17a5c8d25255d08bb6038b4df293a922ccb"},"schema_version":"1.0","source":{"id":"1408.0528","kind":"arxiv","version":2}},"canonical_sha256":"23ef21784902f173f3c578783511acc3e3339d17961a48f1bf82658373d0df18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23ef21784902f173f3c578783511acc3e3339d17961a48f1bf82658373d0df18","first_computed_at":"2026-05-18T02:45:50.379885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:50.379885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6mb8EHR6n9A62AboXW6BCfjq89AWsi7QD1TWnsiYJgt+jkMgxS9BV58zDQJx+oITs9FJckOtHKCuDGCJB3zPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:50.380293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0528","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed5fe47fbeaf03fac8fa64a594e1fd4f967ad49e47012a711c2cac042456b040","sha256:c32cd014c998ec8d0b909f6301071abff613e0e1aa15ebce858d26233e0b70ae"],"state_sha256":"2dcc614b35e17a001f31bf8647b689cbb6062c4d5d36bd57a0da463ceddb7ce4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtscakN3hk3h9GhxasTiFNlhl52HnEahhy6hwcdc/jW13RKhWUnorgHaRb5qIxcbQxVij5SZMIeVyLCKRIESCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:06:08.127185Z","bundle_sha256":"2c6e064eca072eb13239b5b0fd2b28417e307b1c7b13a9b700803cbe76b82214"}}