{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NQZALTJR764TVXMSPHBQG3ZTVW","short_pith_number":"pith:NQZALTJR","canonical_record":{"source":{"id":"1402.6067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-25T06:54:08Z","cross_cats_sorted":["cs.DB","cs.FL"],"title_canon_sha256":"f1681d27899f0e942b34fb928f90cf1c52f3cf45460c07731b174435a3e62bee","abstract_canon_sha256":"1ad977b3cf5945353c79a0d460c4c4dbca0b66d50d887b006ec18944d6c46492"},"schema_version":"1.0"},"canonical_sha256":"6c3205cd31ffb93add9279c3036f33adb9d7c77dbb69d3882fb1ceb456ba6726","source":{"kind":"arxiv","id":"1402.6067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6067","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6067v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6067","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"NQZALTJR764T","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NQZALTJR764TVXMS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NQZALTJR","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NQZALTJR764TVXMSPHBQG3ZTVW","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-25T06:54:08Z","cross_cats_sorted":["cs.DB","cs.FL"],"title_canon_sha256":"f1681d27899f0e942b34fb928f90cf1c52f3cf45460c07731b174435a3e62bee","abstract_canon_sha256":"1ad977b3cf5945353c79a0d460c4c4dbca0b66d50d887b006ec18944d6c46492"},"schema_version":"1.0"},"canonical_sha256":"6c3205cd31ffb93add9279c3036f33adb9d7c77dbb69d3882fb1ceb456ba6726","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.706099Z","signature_b64":"54BwwHEPcFcQ4KWKCi/EYf0bu/y9Q1CLgudzRGb7nhAYUNeqASZon0uouXsWlwLDXUOd9H1mf0F3ON0PXmxxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c3205cd31ffb93add9279c3036f33adb9d7c77dbb69d3882fb1ceb456ba6726","last_reissued_at":"2026-05-18T02:57:51.705609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.705609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6067","source_version":1,"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mL96SYbLoSwPN9nHtQVsoSjlk4Q1cvJYzHiOmUf2K7bCm4cVW6iav/IoWfOwQTq06DgGJ4KODNLc56C54lyECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:21:03.293872Z"},"content_sha256":"ecc6ff80c6da63f28b91116d091bf7e343a8eafa420f9287db06ee1ef341213a","schema_version":"1.0","event_id":"sha256:ecc6ff80c6da63f28b91116d091bf7e343a8eafa420f9287db06ee1ef341213a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NQZALTJR764TVXMSPHBQG3ZTVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regular path queries on graphs with data: A rigid approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.FL"],"primary_cat":"cs.LO","authors_text":"Zhilin Wu","submitted_at":"2014-02-25T06:54:08Z","abstract_excerpt":"Regular path queries (RPQ) is a classical navigational query formalism for graph databases to specify constraints on labeled paths. Recently, RPQs have been extended by Libkin and Vrgo$\\rm \\check{c}$ to incorporate data value comparisons among different nodes on paths, called regular path queries with data (RDPQ). It has been shown that the evaluation problem of RDPQs is PSPACE-complete and NLOGSPACE-complete in data complexity. On the other hand, the containment problem of RDPQs is in general undecidable. In this paper, we propose a novel approach to extend regular path queries with data valu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6067","kind":"arxiv","version":1},"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tAOou2aN6OjybfRoAfhVsgqTFiV990k39KKtRwxZe5gzJHz44sogOEoiEkQm8xnUSiB/kmd0XBBBNkS6UWrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:21:03.294975Z"},"content_sha256":"5d2b779f082298f3c8d69a916c44c9abc83ed569c9eec22bfa1ecac08068e218","schema_version":"1.0","event_id":"sha256:5d2b779f082298f3c8d69a916c44c9abc83ed569c9eec22bfa1ecac08068e218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQZALTJR764TVXMSPHBQG3ZTVW/bundle.json","state_url":"https://pith.science/pith/NQZALTJR764TVXMSPHBQG3ZTVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQZALTJR764TVXMSPHBQG3ZTVW/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-05-25T19:21:03Z","links":{"resolver":"https://pith.science/pith/NQZALTJR764TVXMSPHBQG3ZTVW","bundle":"https://pith.science/pith/NQZALTJR764TVXMSPHBQG3ZTVW/bundle.json","state":"https://pith.science/pith/NQZALTJR764TVXMSPHBQG3ZTVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQZALTJR764TVXMSPHBQG3ZTVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NQZALTJR764TVXMSPHBQG3ZTVW","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":"1ad977b3cf5945353c79a0d460c4c4dbca0b66d50d887b006ec18944d6c46492","cross_cats_sorted":["cs.DB","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-25T06:54:08Z","title_canon_sha256":"f1681d27899f0e942b34fb928f90cf1c52f3cf45460c07731b174435a3e62bee"},"schema_version":"1.0","source":{"id":"1402.6067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6067","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6067v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6067","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"NQZALTJR764T","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NQZALTJR764TVXMS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NQZALTJR","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:5d2b779f082298f3c8d69a916c44c9abc83ed569c9eec22bfa1ecac08068e218","target":"graph","created_at":"2026-05-18T02:57:51Z","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":"Regular path queries (RPQ) is a classical navigational query formalism for graph databases to specify constraints on labeled paths. Recently, RPQs have been extended by Libkin and Vrgo$\\rm \\check{c}$ to incorporate data value comparisons among different nodes on paths, called regular path queries with data (RDPQ). It has been shown that the evaluation problem of RDPQs is PSPACE-complete and NLOGSPACE-complete in data complexity. On the other hand, the containment problem of RDPQs is in general undecidable. In this paper, we propose a novel approach to extend regular path queries with data valu","authors_text":"Zhilin Wu","cross_cats":["cs.DB","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-25T06:54:08Z","title":"Regular path queries on graphs with data: A rigid approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6067","kind":"arxiv","version":1},"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:ecc6ff80c6da63f28b91116d091bf7e343a8eafa420f9287db06ee1ef341213a","target":"record","created_at":"2026-05-18T02:57:51Z","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":"1ad977b3cf5945353c79a0d460c4c4dbca0b66d50d887b006ec18944d6c46492","cross_cats_sorted":["cs.DB","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-25T06:54:08Z","title_canon_sha256":"f1681d27899f0e942b34fb928f90cf1c52f3cf45460c07731b174435a3e62bee"},"schema_version":"1.0","source":{"id":"1402.6067","kind":"arxiv","version":1}},"canonical_sha256":"6c3205cd31ffb93add9279c3036f33adb9d7c77dbb69d3882fb1ceb456ba6726","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c3205cd31ffb93add9279c3036f33adb9d7c77dbb69d3882fb1ceb456ba6726","first_computed_at":"2026-05-18T02:57:51.705609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:51.705609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54BwwHEPcFcQ4KWKCi/EYf0bu/y9Q1CLgudzRGb7nhAYUNeqASZon0uouXsWlwLDXUOd9H1mf0F3ON0PXmxxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:51.706099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecc6ff80c6da63f28b91116d091bf7e343a8eafa420f9287db06ee1ef341213a","sha256:5d2b779f082298f3c8d69a916c44c9abc83ed569c9eec22bfa1ecac08068e218"],"state_sha256":"793e30b02fcab2e148a2f520371aa274ee1ec276c44bf99a3309dde9fd1a9c6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pge/kR48BnniFgtMcUQQdHCQHV+cp5McNPz8sTSZ/HY44fnGycsraNVrJw+e3xeKAzyFg7JLHw4j6CUkL2cqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:21:03.299360Z","bundle_sha256":"b2f7c268a0ba6a616a6f4e7499c51a23a791aad877cfa1d6f5f25858b9aeda18"}}