{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WWSM2NEIRQKS6J4LLHU5C7ZOE7","short_pith_number":"pith:WWSM2NEI","canonical_record":{"source":{"id":"2406.05417","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T09:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"6ce12b6c791844fe8c96f2ad785b836957aab54be389586891ad8b35036bb4e6","abstract_canon_sha256":"6178e9a5f6a2c780ecc4a0dbac22dc1f23860ccee24757be651d0a7d012f486f"},"schema_version":"1.0"},"canonical_sha256":"b5a4cd34888c152f278b59e9d17f2e27d5513f8e0ad5d92e988d959115a7631f","source":{"kind":"arxiv","id":"2406.05417","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05417","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05417v2","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05417","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"WWSM2NEIRQKS","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_16","alias_value":"WWSM2NEIRQKS6J4L","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_8","alias_value":"WWSM2NEI","created_at":"2026-05-21T02:04:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WWSM2NEIRQKS6J4LLHU5C7ZOE7","target":"record","payload":{"canonical_record":{"source":{"id":"2406.05417","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T09:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"6ce12b6c791844fe8c96f2ad785b836957aab54be389586891ad8b35036bb4e6","abstract_canon_sha256":"6178e9a5f6a2c780ecc4a0dbac22dc1f23860ccee24757be651d0a7d012f486f"},"schema_version":"1.0"},"canonical_sha256":"b5a4cd34888c152f278b59e9d17f2e27d5513f8e0ad5d92e988d959115a7631f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:04:45.663213Z","signature_b64":"3wk4yzaHhopcYnzZwbIcYAgcJEThHmJEEDSKEDguwmlxTQJ1fcg1v3GshAZSsv9Do5DqJh59msStG3dw1rlzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a4cd34888c152f278b59e9d17f2e27d5513f8e0ad5d92e988d959115a7631f","last_reissued_at":"2026-05-21T02:04:45.662238Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:04:45.662238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.05417","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-21T02:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JK0XuQmOqTpjNmreyawk12Kzgmymd5ER8ol+dtanCPJhJT4rIEk7Ey6Ph5bajTF2DuF/+jwuaTTTOw+67+mnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:39:55.317402Z"},"content_sha256":"0e876df71bb123d65ef5742d7a4797af815da51596aa70daa158853524a97f5b","schema_version":"1.0","event_id":"sha256:0e876df71bb123d65ef5742d7a4797af815da51596aa70daa158853524a97f5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WWSM2NEIRQKS6J4LLHU5C7ZOE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Navigational Graph Queries","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"George Fletcher, Nikolay Yakovets, Thomas Mulder","submitted_at":"2024-06-08T09:41:08Z","abstract_excerpt":"We study the optimization of navigational graph queries, i.e., queries which combine recursive and pattern-matching fragments. Current approaches to their evaluation are not effective in practice. Towards addressing this, we present a number of novel powerful optimization techniques which aim to constrain the intermediate results during query evaluation. We show how these techniques can be planned effectively and executed efficiently towards the first practical evaluation solution for complex navigational queries on real-world workloads. Indeed, our experimental results show several orders of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05417","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/2406.05417/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"},"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-21T02:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5KZqej943CzAsAVgAiZmwbvuetM3rF9kGYRrm7pX3csmgSNc0hfpfDV0R5PcVDrZNMs6KIrHnTxHOqqBlxUsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:39:55.317890Z"},"content_sha256":"eb8eb399ceeca264f61b099c8f67b19a2269393a236b81c93f4b7c5f4e1767b7","schema_version":"1.0","event_id":"sha256:eb8eb399ceeca264f61b099c8f67b19a2269393a236b81c93f4b7c5f4e1767b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWSM2NEIRQKS6J4LLHU5C7ZOE7/bundle.json","state_url":"https://pith.science/pith/WWSM2NEIRQKS6J4LLHU5C7ZOE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWSM2NEIRQKS6J4LLHU5C7ZOE7/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-26T02:39:55Z","links":{"resolver":"https://pith.science/pith/WWSM2NEIRQKS6J4LLHU5C7ZOE7","bundle":"https://pith.science/pith/WWSM2NEIRQKS6J4LLHU5C7ZOE7/bundle.json","state":"https://pith.science/pith/WWSM2NEIRQKS6J4LLHU5C7ZOE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWSM2NEIRQKS6J4LLHU5C7ZOE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WWSM2NEIRQKS6J4LLHU5C7ZOE7","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":"6178e9a5f6a2c780ecc4a0dbac22dc1f23860ccee24757be651d0a7d012f486f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T09:41:08Z","title_canon_sha256":"6ce12b6c791844fe8c96f2ad785b836957aab54be389586891ad8b35036bb4e6"},"schema_version":"1.0","source":{"id":"2406.05417","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05417","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05417v2","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05417","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"WWSM2NEIRQKS","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_16","alias_value":"WWSM2NEIRQKS6J4L","created_at":"2026-05-21T02:04:45Z"},{"alias_kind":"pith_short_8","alias_value":"WWSM2NEI","created_at":"2026-05-21T02:04:45Z"}],"graph_snapshots":[{"event_id":"sha256:eb8eb399ceeca264f61b099c8f67b19a2269393a236b81c93f4b7c5f4e1767b7","target":"graph","created_at":"2026-05-21T02:04:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.05417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the optimization of navigational graph queries, i.e., queries which combine recursive and pattern-matching fragments. Current approaches to their evaluation are not effective in practice. Towards addressing this, we present a number of novel powerful optimization techniques which aim to constrain the intermediate results during query evaluation. We show how these techniques can be planned effectively and executed efficiently towards the first practical evaluation solution for complex navigational queries on real-world workloads. Indeed, our experimental results show several orders of ","authors_text":"George Fletcher, Nikolay Yakovets, Thomas Mulder","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T09:41:08Z","title":"Optimizing Navigational Graph Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05417","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:0e876df71bb123d65ef5742d7a4797af815da51596aa70daa158853524a97f5b","target":"record","created_at":"2026-05-21T02:04:45Z","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":"6178e9a5f6a2c780ecc4a0dbac22dc1f23860ccee24757be651d0a7d012f486f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T09:41:08Z","title_canon_sha256":"6ce12b6c791844fe8c96f2ad785b836957aab54be389586891ad8b35036bb4e6"},"schema_version":"1.0","source":{"id":"2406.05417","kind":"arxiv","version":2}},"canonical_sha256":"b5a4cd34888c152f278b59e9d17f2e27d5513f8e0ad5d92e988d959115a7631f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5a4cd34888c152f278b59e9d17f2e27d5513f8e0ad5d92e988d959115a7631f","first_computed_at":"2026-05-21T02:04:45.662238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T02:04:45.662238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3wk4yzaHhopcYnzZwbIcYAgcJEThHmJEEDSKEDguwmlxTQJ1fcg1v3GshAZSsv9Do5DqJh59msStG3dw1rlzAg==","signature_status":"signed_v1","signed_at":"2026-05-21T02:04:45.663213Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.05417","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e876df71bb123d65ef5742d7a4797af815da51596aa70daa158853524a97f5b","sha256:eb8eb399ceeca264f61b099c8f67b19a2269393a236b81c93f4b7c5f4e1767b7"],"state_sha256":"0e46bd254cc456f5525120fa6311319d75117e73aecc6ee0aa0ef9e17a74c22f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frGe8bp6E5zBZUY4Lraw29vpMRg7kcLsOqgLrhzu12XIctvAGFFWjrT1FacsbEoAuA66Pd6d57q/r9U1IpnABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:39:55.321527Z","bundle_sha256":"8e4953eb7a9cd7dd0e75fa44ed4bb7e207bfd4086a756ddd63450231637fda3c"}}