{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DCA7N7EPLPESEBAWPEUCD5Z3VI","short_pith_number":"pith:DCA7N7EP","canonical_record":{"source":{"id":"2504.15742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-22T09:45:37Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"fc6b262b241aa6f03341f0fa1d5eefd1eeee3d4951ea420fb284fcaabbeba278","abstract_canon_sha256":"7015c350ca2a8e0126920deafaaeaa67cf12da2355697e2aae77442eb78b7ac3"},"schema_version":"1.0"},"canonical_sha256":"1881f6fc8f5bc9220416792821f73baa30e41559749b9c0a2522afbc008e11b1","source":{"kind":"arxiv","id":"2504.15742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15742","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15742v1","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15742","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"DCA7N7EPLPES","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"pith_short_16","alias_value":"DCA7N7EPLPESEBAW","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"pith_short_8","alias_value":"DCA7N7EP","created_at":"2026-07-05T10:52:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DCA7N7EPLPESEBAWPEUCD5Z3VI","target":"record","payload":{"canonical_record":{"source":{"id":"2504.15742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-22T09:45:37Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"fc6b262b241aa6f03341f0fa1d5eefd1eeee3d4951ea420fb284fcaabbeba278","abstract_canon_sha256":"7015c350ca2a8e0126920deafaaeaa67cf12da2355697e2aae77442eb78b7ac3"},"schema_version":"1.0"},"canonical_sha256":"1881f6fc8f5bc9220416792821f73baa30e41559749b9c0a2522afbc008e11b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:29.389158Z","signature_b64":"LsLHJcYrZdq3GQj/3hUNNAXluj6WasGe642I5kIs6XN+ROcRvv4N3/rapb0S4R/vCYBi36dfls4PmNCuR6eNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1881f6fc8f5bc9220416792821f73baa30e41559749b9c0a2522afbc008e11b1","last_reissued_at":"2026-07-05T10:52:29.388688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:29.388688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.15742","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-07-05T10:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jvufBZcTG21Q7/9wID0CYkVJImi+uBwVExD8BrChI2MdpYfuptp+lV45zPuhGaULoMCaEo56fbodOj1XPbfQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T13:03:30.614891Z"},"content_sha256":"d28009f5da731893e8549e066ca258c90e44b7de4c22af536765e831bf8fa5ab","schema_version":"1.0","event_id":"sha256:d28009f5da731893e8549e066ca258c90e44b7de4c22af536765e831bf8fa5ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DCA7N7EPLPESEBAWPEUCD5Z3VI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proving Cypher Query Equivalence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.DB","authors_text":"Jun Wei, Lei Tang, Lijie Xu, Tao Huang, Wei Wang, Wensheng Dou, Yingying Zheng","submitted_at":"2025-04-22T09:45:37Z","abstract_excerpt":"Graph database systems store graph data as nodes and relationships, and utilize graph query languages (e.g., Cypher) for efficiently querying graph data. Proving the equivalence of graph queries is an important foundation for optimizing graph query performance, ensuring graph query reliability, etc. Although researchers have proposed many SQL query equivalence provers for relational database systems, these provers cannot be directly applied to prove the equivalence of graph queries. The difficulty lies in the fact that graph query languages (e.g., Cypher) adopt significantly different data mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15742","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.15742/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-07-05T10:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0HjS8mM+vR6P4wLUXUspavu+mVlcyOKkhEdbJUte2wk10kaaj9OzWRTC9gSp0h7XAoh3riBQaH24xv91UiDaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T13:03:30.615271Z"},"content_sha256":"1b3b709e5fb50221bce3fe04c8c65dae2e5668c6e9825e48660238cb6bd71b93","schema_version":"1.0","event_id":"sha256:1b3b709e5fb50221bce3fe04c8c65dae2e5668c6e9825e48660238cb6bd71b93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCA7N7EPLPESEBAWPEUCD5Z3VI/bundle.json","state_url":"https://pith.science/pith/DCA7N7EPLPESEBAWPEUCD5Z3VI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCA7N7EPLPESEBAWPEUCD5Z3VI/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-07-27T13:03:30Z","links":{"resolver":"https://pith.science/pith/DCA7N7EPLPESEBAWPEUCD5Z3VI","bundle":"https://pith.science/pith/DCA7N7EPLPESEBAWPEUCD5Z3VI/bundle.json","state":"https://pith.science/pith/DCA7N7EPLPESEBAWPEUCD5Z3VI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCA7N7EPLPESEBAWPEUCD5Z3VI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DCA7N7EPLPESEBAWPEUCD5Z3VI","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":"7015c350ca2a8e0126920deafaaeaa67cf12da2355697e2aae77442eb78b7ac3","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-22T09:45:37Z","title_canon_sha256":"fc6b262b241aa6f03341f0fa1d5eefd1eeee3d4951ea420fb284fcaabbeba278"},"schema_version":"1.0","source":{"id":"2504.15742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15742","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15742v1","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15742","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"DCA7N7EPLPES","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"pith_short_16","alias_value":"DCA7N7EPLPESEBAW","created_at":"2026-07-05T10:52:29Z"},{"alias_kind":"pith_short_8","alias_value":"DCA7N7EP","created_at":"2026-07-05T10:52:29Z"}],"graph_snapshots":[{"event_id":"sha256:1b3b709e5fb50221bce3fe04c8c65dae2e5668c6e9825e48660238cb6bd71b93","target":"graph","created_at":"2026-07-05T10:52:29Z","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/2504.15742/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph database systems store graph data as nodes and relationships, and utilize graph query languages (e.g., Cypher) for efficiently querying graph data. Proving the equivalence of graph queries is an important foundation for optimizing graph query performance, ensuring graph query reliability, etc. Although researchers have proposed many SQL query equivalence provers for relational database systems, these provers cannot be directly applied to prove the equivalence of graph queries. The difficulty lies in the fact that graph query languages (e.g., Cypher) adopt significantly different data mod","authors_text":"Jun Wei, Lei Tang, Lijie Xu, Tao Huang, Wei Wang, Wensheng Dou, Yingying Zheng","cross_cats":["cs.SE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-22T09:45:37Z","title":"Proving Cypher Query Equivalence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15742","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:d28009f5da731893e8549e066ca258c90e44b7de4c22af536765e831bf8fa5ab","target":"record","created_at":"2026-07-05T10:52:29Z","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":"7015c350ca2a8e0126920deafaaeaa67cf12da2355697e2aae77442eb78b7ac3","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-22T09:45:37Z","title_canon_sha256":"fc6b262b241aa6f03341f0fa1d5eefd1eeee3d4951ea420fb284fcaabbeba278"},"schema_version":"1.0","source":{"id":"2504.15742","kind":"arxiv","version":1}},"canonical_sha256":"1881f6fc8f5bc9220416792821f73baa30e41559749b9c0a2522afbc008e11b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1881f6fc8f5bc9220416792821f73baa30e41559749b9c0a2522afbc008e11b1","first_computed_at":"2026-07-05T10:52:29.388688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:29.388688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LsLHJcYrZdq3GQj/3hUNNAXluj6WasGe642I5kIs6XN+ROcRvv4N3/rapb0S4R/vCYBi36dfls4PmNCuR6eNDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:29.389158Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d28009f5da731893e8549e066ca258c90e44b7de4c22af536765e831bf8fa5ab","sha256:1b3b709e5fb50221bce3fe04c8c65dae2e5668c6e9825e48660238cb6bd71b93"],"state_sha256":"db0b7cf3e7ff19f6331f25fe02f9d264ce295584096bfec932f731ea9b63e63d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"739X6J+aPaD5SHVYfwHCACkdzglUYVM9TmQNhqJqqkh1jDIpxVgf7h8fgYJbIS5wa2/gMMToOUfkupf/IuUNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-27T13:03:30.617864Z","bundle_sha256":"5c7172b1957c85e91940ad8e77fdb58d6e03bb3b93eb7a698280865acf59117d"}}