{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VGIJXSJV46AUQX3MEDUZXM7OI7","short_pith_number":"pith:VGIJXSJV","canonical_record":{"source":{"id":"2404.11105","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-17T06:42:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"958366a5adcfcd2b2b1d9aa048af313fba7f80b6d491a74b22e83e5098866f52","abstract_canon_sha256":"205c5d29e09af7847102e3fb5ef92f35140e1f55097dfdd49ad67b8c8cb65b18"},"schema_version":"1.0"},"canonical_sha256":"a9909bc935e781485f6c20e99bb3ee47c6536bf9efa0f1c46c170f4b69f6ceb2","source":{"kind":"arxiv","id":"2404.11105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.11105","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2404.11105v1","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.11105","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"VGIJXSJV46AU","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"VGIJXSJV46AUQX3M","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"VGIJXSJV","created_at":"2026-07-05T08:09:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VGIJXSJV46AUQX3MEDUZXM7OI7","target":"record","payload":{"canonical_record":{"source":{"id":"2404.11105","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-17T06:42:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"958366a5adcfcd2b2b1d9aa048af313fba7f80b6d491a74b22e83e5098866f52","abstract_canon_sha256":"205c5d29e09af7847102e3fb5ef92f35140e1f55097dfdd49ad67b8c8cb65b18"},"schema_version":"1.0"},"canonical_sha256":"a9909bc935e781485f6c20e99bb3ee47c6536bf9efa0f1c46c170f4b69f6ceb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:03.995715Z","signature_b64":"9fkMf17T7wxPPThFoIRfFNYgZUTJNSFcg9RQCJYD1FzC4vfBh5GaJKQSaZtB++ODaFbrWEbk5a4Xr0wPIxcDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9909bc935e781485f6c20e99bb3ee47c6536bf9efa0f1c46c170f4b69f6ceb2","last_reissued_at":"2026-07-05T08:09:03.995256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:03.995256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.11105","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-05T08:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwwmdF75v7CMum8spOT2Riw6nGmPFa+Do8CafjFDw7YTkkeK3znMBlDlUv6wAOXiYHG0X5vHTsnYM6CFyfyMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:59:49.240765Z"},"content_sha256":"04d595251fedd73e610c5f04182ca8f7ae67f963524f761259d3da72e8eac683","schema_version":"1.0","event_id":"sha256:04d595251fedd73e610c5f04182ca8f7ae67f963524f761259d3da72e8eac683"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VGIJXSJV46AUQX3MEDUZXM7OI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"XMiner: Efficient Directed Subgraph Matching with Pattern Reduction","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Ling Liu, Pingpeng Yuan, Siyuan He, Tianyu Ma, Yujiang Wang","submitted_at":"2024-04-17T06:42:26Z","abstract_excerpt":"Graph pattern matching, one of the fundamental graph mining problems, aims to extract structural patterns of interest from an input graph. The state-of-the-art graph matching algorithms and systems are mainly designed for undirected graphs. Directed graph matching is more complex than undirected graph matching because the edge direction must be taken into account before the exploration of each directed edge. Thus, the technologies (e.g. storage, exploiting symmetry for graph matching) for undirected graph matching may not be fully applicable to directed graphs. For example, the redundancy impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.11105","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/2404.11105/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-05T08:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CLmgo7miVKTPnv7LX6CNaAxB6ZoDKI3siZI+vojP+13nLlWeNcpk3lZkC3eZ4i6OmOZN3RInCpNZZY+GHWrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:59:49.241289Z"},"content_sha256":"20f01545f66a61b9d8bdc543e4d11f8bb5b1916882bb6d18001237ff66e9e013","schema_version":"1.0","event_id":"sha256:20f01545f66a61b9d8bdc543e4d11f8bb5b1916882bb6d18001237ff66e9e013"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGIJXSJV46AUQX3MEDUZXM7OI7/bundle.json","state_url":"https://pith.science/pith/VGIJXSJV46AUQX3MEDUZXM7OI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGIJXSJV46AUQX3MEDUZXM7OI7/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-08-16T18:59:49Z","links":{"resolver":"https://pith.science/pith/VGIJXSJV46AUQX3MEDUZXM7OI7","bundle":"https://pith.science/pith/VGIJXSJV46AUQX3MEDUZXM7OI7/bundle.json","state":"https://pith.science/pith/VGIJXSJV46AUQX3MEDUZXM7OI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGIJXSJV46AUQX3MEDUZXM7OI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VGIJXSJV46AUQX3MEDUZXM7OI7","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":"205c5d29e09af7847102e3fb5ef92f35140e1f55097dfdd49ad67b8c8cb65b18","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-17T06:42:26Z","title_canon_sha256":"958366a5adcfcd2b2b1d9aa048af313fba7f80b6d491a74b22e83e5098866f52"},"schema_version":"1.0","source":{"id":"2404.11105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.11105","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2404.11105v1","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.11105","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"VGIJXSJV46AU","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"VGIJXSJV46AUQX3M","created_at":"2026-07-05T08:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"VGIJXSJV","created_at":"2026-07-05T08:09:03Z"}],"graph_snapshots":[{"event_id":"sha256:20f01545f66a61b9d8bdc543e4d11f8bb5b1916882bb6d18001237ff66e9e013","target":"graph","created_at":"2026-07-05T08:09:03Z","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/2404.11105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph pattern matching, one of the fundamental graph mining problems, aims to extract structural patterns of interest from an input graph. The state-of-the-art graph matching algorithms and systems are mainly designed for undirected graphs. Directed graph matching is more complex than undirected graph matching because the edge direction must be taken into account before the exploration of each directed edge. Thus, the technologies (e.g. storage, exploiting symmetry for graph matching) for undirected graph matching may not be fully applicable to directed graphs. For example, the redundancy impl","authors_text":"Ling Liu, Pingpeng Yuan, Siyuan He, Tianyu Ma, Yujiang Wang","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-17T06:42:26Z","title":"XMiner: Efficient Directed Subgraph Matching with Pattern Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.11105","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:04d595251fedd73e610c5f04182ca8f7ae67f963524f761259d3da72e8eac683","target":"record","created_at":"2026-07-05T08:09:03Z","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":"205c5d29e09af7847102e3fb5ef92f35140e1f55097dfdd49ad67b8c8cb65b18","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-17T06:42:26Z","title_canon_sha256":"958366a5adcfcd2b2b1d9aa048af313fba7f80b6d491a74b22e83e5098866f52"},"schema_version":"1.0","source":{"id":"2404.11105","kind":"arxiv","version":1}},"canonical_sha256":"a9909bc935e781485f6c20e99bb3ee47c6536bf9efa0f1c46c170f4b69f6ceb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9909bc935e781485f6c20e99bb3ee47c6536bf9efa0f1c46c170f4b69f6ceb2","first_computed_at":"2026-07-05T08:09:03.995256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:09:03.995256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9fkMf17T7wxPPThFoIRfFNYgZUTJNSFcg9RQCJYD1FzC4vfBh5GaJKQSaZtB++ODaFbrWEbk5a4Xr0wPIxcDCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:09:03.995715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.11105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04d595251fedd73e610c5f04182ca8f7ae67f963524f761259d3da72e8eac683","sha256:20f01545f66a61b9d8bdc543e4d11f8bb5b1916882bb6d18001237ff66e9e013"],"state_sha256":"2234ebf238f5d6cf50a90b3cee3be6c2a93f68bde54e0c4a82abb560432f4538"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+IqyV7KGkefZBw6IBE9WuIn1tTMY5kHMUFF1yVniGiivlrSbZYVnRy3DF49w0yo62jfznXlCcqo6NvntRgnDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:59:49.246427Z","bundle_sha256":"a570624d2e9ad46c15ffb2e90ccc02a9efc30404efc54c50e11dd982a1c3b4e4"}}