{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5XIY26II7TY7DCBLKC3KBRHLPS","short_pith_number":"pith:5XIY26II","canonical_record":{"source":{"id":"2012.06802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-12-12T12:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"8769481747c89edb664878f78174f2b7b739549b252c6721d785acee92647143","abstract_canon_sha256":"53688c81e902a636cb9c0ee7c3bee82bb6bcc8c749689c7746db3ebd607344c1"},"schema_version":"1.0"},"canonical_sha256":"edd18d7908fcf1f1882b50b6a0c4eb7c832e1dff605e715b358576c379ee9dbc","source":{"kind":"arxiv","id":"2012.06802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06802","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06802v2","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06802","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"5XIY26II7TY7","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"5XIY26II7TY7DCBL","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"5XIY26II","created_at":"2026-07-05T02:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5XIY26II7TY7DCBLKC3KBRHLPS","target":"record","payload":{"canonical_record":{"source":{"id":"2012.06802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-12-12T12:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"8769481747c89edb664878f78174f2b7b739549b252c6721d785acee92647143","abstract_canon_sha256":"53688c81e902a636cb9c0ee7c3bee82bb6bcc8c749689c7746db3ebd607344c1"},"schema_version":"1.0"},"canonical_sha256":"edd18d7908fcf1f1882b50b6a0c4eb7c832e1dff605e715b358576c379ee9dbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:24.556874Z","signature_b64":"jpaoHNtWklBA3s6hjWOzio31aR9oA9HMTmMd0EUKmCCV4FkXr7Xr0ex9hIqQhaf/KlPSE/9MJZ/GO5NrmDggBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edd18d7908fcf1f1882b50b6a0c4eb7c832e1dff605e715b358576c379ee9dbc","last_reissued_at":"2026-07-05T02:33:24.556480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:24.556480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.06802","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-07-05T02:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jdaw21PVPpxHIzlvqAbAB4oXfRvvQBiLDvjWpL6NQfaFcfZ0K01S+xQ5KNr/zqIpATFqK4ukwqNjY7r1JvmAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T09:22:06.973814Z"},"content_sha256":"093b125ebe0b84b7a4d3bba5041c37e9397c0ddc01ee2891c4b83533372561fd","schema_version":"1.0","event_id":"sha256:093b125ebe0b84b7a4d3bba5041c37e9397c0ddc01ee2891c4b83533372561fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5XIY26II7TY7DCBLKC3KBRHLPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Analysis on Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lei Zou, Li Zeng, Weixin Lu, Yan Jiang","submitted_at":"2020-12-12T12:29:38Z","abstract_excerpt":"Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works have been done since 2012, mainly optimizing pruning rules and matching orders to accelerate enumerating all isomorphic subgraphs. Nevertheless, their correctness and performance are not well studied. First, different languages are used in implementation with different compilation flags. Second, experiments are not done on the same platform and the same datas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06802","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/2012.06802/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-05T02:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUM7S+C4VBL38f2fjqcUlfaUQVDj/oF8pUd7qpP+jmHXJlVgnm81waIk9KZ0luzLZ1wE6v8m40pylyYTqtnMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T09:22:06.974471Z"},"content_sha256":"4a03595fce77a6297c5beeeeb98395d404bf2a7f12cd840c73862df5688da38d","schema_version":"1.0","event_id":"sha256:4a03595fce77a6297c5beeeeb98395d404bf2a7f12cd840c73862df5688da38d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XIY26II7TY7DCBLKC3KBRHLPS/bundle.json","state_url":"https://pith.science/pith/5XIY26II7TY7DCBLKC3KBRHLPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XIY26II7TY7DCBLKC3KBRHLPS/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-09T09:22:06Z","links":{"resolver":"https://pith.science/pith/5XIY26II7TY7DCBLKC3KBRHLPS","bundle":"https://pith.science/pith/5XIY26II7TY7DCBLKC3KBRHLPS/bundle.json","state":"https://pith.science/pith/5XIY26II7TY7DCBLKC3KBRHLPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XIY26II7TY7DCBLKC3KBRHLPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5XIY26II7TY7DCBLKC3KBRHLPS","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":"53688c81e902a636cb9c0ee7c3bee82bb6bcc8c749689c7746db3ebd607344c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-12-12T12:29:38Z","title_canon_sha256":"8769481747c89edb664878f78174f2b7b739549b252c6721d785acee92647143"},"schema_version":"1.0","source":{"id":"2012.06802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06802","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06802v2","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06802","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"5XIY26II7TY7","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"5XIY26II7TY7DCBL","created_at":"2026-07-05T02:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"5XIY26II","created_at":"2026-07-05T02:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:4a03595fce77a6297c5beeeeb98395d404bf2a7f12cd840c73862df5688da38d","target":"graph","created_at":"2026-07-05T02:33:24Z","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/2012.06802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works have been done since 2012, mainly optimizing pruning rules and matching orders to accelerate enumerating all isomorphic subgraphs. Nevertheless, their correctness and performance are not well studied. First, different languages are used in implementation with different compilation flags. Second, experiments are not done on the same platform and the same datas","authors_text":"Lei Zou, Li Zeng, Weixin Lu, Yan Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-12-12T12:29:38Z","title":"Deep Analysis on Subgraph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06802","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:093b125ebe0b84b7a4d3bba5041c37e9397c0ddc01ee2891c4b83533372561fd","target":"record","created_at":"2026-07-05T02:33:24Z","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":"53688c81e902a636cb9c0ee7c3bee82bb6bcc8c749689c7746db3ebd607344c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-12-12T12:29:38Z","title_canon_sha256":"8769481747c89edb664878f78174f2b7b739549b252c6721d785acee92647143"},"schema_version":"1.0","source":{"id":"2012.06802","kind":"arxiv","version":2}},"canonical_sha256":"edd18d7908fcf1f1882b50b6a0c4eb7c832e1dff605e715b358576c379ee9dbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edd18d7908fcf1f1882b50b6a0c4eb7c832e1dff605e715b358576c379ee9dbc","first_computed_at":"2026-07-05T02:33:24.556480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:33:24.556480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jpaoHNtWklBA3s6hjWOzio31aR9oA9HMTmMd0EUKmCCV4FkXr7Xr0ex9hIqQhaf/KlPSE/9MJZ/GO5NrmDggBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:33:24.556874Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.06802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:093b125ebe0b84b7a4d3bba5041c37e9397c0ddc01ee2891c4b83533372561fd","sha256:4a03595fce77a6297c5beeeeb98395d404bf2a7f12cd840c73862df5688da38d"],"state_sha256":"85dd970e6e614550efedea7c5240c6d7f10ce16890c368a77481210e0897d3e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZJwCtjWb7bRH/dBAyFk5VNfDSxrs/Uvyb8w2EV6hRGg5ciWG4QQjPNrS4OcZ0Esal6+Q5nGxjUsfYj4kmprAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T09:22:06.978112Z","bundle_sha256":"bfa730195923022f98b35d1f07fbb09f61427838445f01bfe9b83235e6b648f3"}}