{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IEZDMREOJBUYXOLHJGNY2NMXFL","short_pith_number":"pith:IEZDMREO","canonical_record":{"source":{"id":"1201.0229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"ac75d648b8a584d7112c71f753cd3245bfde2aea3ee802077e53238b14b15868","abstract_canon_sha256":"b740663cc955ff9e955f24053181e30d69765e8e3b3bec226da86d26a2c73a0b"},"schema_version":"1.0"},"canonical_sha256":"413236448e48698bb967499b8d35972af5f368fc6bc63dd8f96157393a67c3f5","source":{"kind":"arxiv","id":"1201.0229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0229","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0229v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0229","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"IEZDMREOJBUY","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IEZDMREOJBUYXOLH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IEZDMREO","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IEZDMREOJBUYXOLHJGNY2NMXFL","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"ac75d648b8a584d7112c71f753cd3245bfde2aea3ee802077e53238b14b15868","abstract_canon_sha256":"b740663cc955ff9e955f24053181e30d69765e8e3b3bec226da86d26a2c73a0b"},"schema_version":"1.0"},"canonical_sha256":"413236448e48698bb967499b8d35972af5f368fc6bc63dd8f96157393a67c3f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:25.770334Z","signature_b64":"apF0XNHIgIr7H2gn5XNxNfbdrHfl8g+M8A88ubOJUYlyGMB052Rdymr6heL9kG4OwrKzYs0iUeArMB22zLQ6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"413236448e48698bb967499b8d35972af5f368fc6bc63dd8f96157393a67c3f5","last_reissued_at":"2026-05-18T04:05:25.769782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:25.769782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0229","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFCQLOSoxtt7QiOu9xDogqDUN0IUKDYuGcvj6FJpjkw0Cw0EFe2iqbm8jkXWyxMCT2bSmuGHKVslmLki6z9sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:05:39.850893Z"},"content_sha256":"6d85a927db1e1cb7953107ef2a97956c7197f2a64e076e2cb7ed8cce6ea29a64","schema_version":"1.0","event_id":"sha256:6d85a927db1e1cb7953107ef2a97956c7197f2a64e076e2cb7ed8cce6ea29a64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IEZDMREOJBUYXOLHJGNY2NMXFL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capturing Topology in Graph Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jinpeng Huai, Shuai Ma, Tianyu Wo, Wenfei Fan, Yang Cao","submitted_at":"2011-12-31T05:34:57Z","abstract_excerpt":"Graph pattern matching is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of data graphs, i.e., graphs may have a structure drastically different from pattern graphs they match, and the matches found are often too large to understand and analyze. To rectify these problems, this paper proposes a notion of strong simulation, a revision of graph simulation, for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0229","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqe4b+YbHaE4ugm6Zz+MtLxuUjNXAPAr0Q9q0bRnrNdZaoIcWekTgj77qwNN0EZyKRA6Jp6hqVkJD/GyKJsaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:05:39.851607Z"},"content_sha256":"a66c799996902e23707657d0f4bcae74882946268955301f1b49dc9bf10fc2ce","schema_version":"1.0","event_id":"sha256:a66c799996902e23707657d0f4bcae74882946268955301f1b49dc9bf10fc2ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/bundle.json","state_url":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/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-06-10T12:05:39Z","links":{"resolver":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL","bundle":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/bundle.json","state":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IEZDMREOJBUYXOLHJGNY2NMXFL","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":"b740663cc955ff9e955f24053181e30d69765e8e3b3bec226da86d26a2c73a0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:57Z","title_canon_sha256":"ac75d648b8a584d7112c71f753cd3245bfde2aea3ee802077e53238b14b15868"},"schema_version":"1.0","source":{"id":"1201.0229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0229","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0229v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0229","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"IEZDMREOJBUY","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IEZDMREOJBUYXOLH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IEZDMREO","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:a66c799996902e23707657d0f4bcae74882946268955301f1b49dc9bf10fc2ce","target":"graph","created_at":"2026-05-18T04:05:25Z","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":"Graph pattern matching is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of data graphs, i.e., graphs may have a structure drastically different from pattern graphs they match, and the matches found are often too large to understand and analyze. To rectify these problems, this paper proposes a notion of strong simulation, a revision of graph simulation, for","authors_text":"Jinpeng Huai, Shuai Ma, Tianyu Wo, Wenfei Fan, Yang Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:57Z","title":"Capturing Topology in Graph Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0229","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:6d85a927db1e1cb7953107ef2a97956c7197f2a64e076e2cb7ed8cce6ea29a64","target":"record","created_at":"2026-05-18T04:05:25Z","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":"b740663cc955ff9e955f24053181e30d69765e8e3b3bec226da86d26a2c73a0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:57Z","title_canon_sha256":"ac75d648b8a584d7112c71f753cd3245bfde2aea3ee802077e53238b14b15868"},"schema_version":"1.0","source":{"id":"1201.0229","kind":"arxiv","version":1}},"canonical_sha256":"413236448e48698bb967499b8d35972af5f368fc6bc63dd8f96157393a67c3f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"413236448e48698bb967499b8d35972af5f368fc6bc63dd8f96157393a67c3f5","first_computed_at":"2026-05-18T04:05:25.769782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:25.769782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"apF0XNHIgIr7H2gn5XNxNfbdrHfl8g+M8A88ubOJUYlyGMB052Rdymr6heL9kG4OwrKzYs0iUeArMB22zLQ6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:25.770334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d85a927db1e1cb7953107ef2a97956c7197f2a64e076e2cb7ed8cce6ea29a64","sha256:a66c799996902e23707657d0f4bcae74882946268955301f1b49dc9bf10fc2ce"],"state_sha256":"71e403a90cb6862b52114171c67bae1a333f83894f9f43a7882a0d48f8a4eb64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIABgl0hlCiurlzR7SzrHCFMeqoWkXwnI0gWaA85wF9sZxUNbCXHBJOK8NZt+M2pSwzW0sQLqo8vIEaBrsyjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:05:39.855627Z","bundle_sha256":"0cd07382eb5931fc538980b6a0f3386c67b859eec14467c98273d16c3fe3db06"}}