{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IEZDMREOJBUYXOLHJGNY2NMXFL","short_pith_number":"pith:IEZDMREO","schema_version":"1.0","canonical_sha256":"413236448e48698bb967499b8d35972af5f368fc6bc63dd8f96157393a67c3f5","source":{"kind":"arxiv","id":"1201.0229","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.0229","created_at":"2026-05-18T04:05:25.769879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0229v1","created_at":"2026-05-18T04:05:25.769879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0229","created_at":"2026-05-18T04:05:25.769879+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEZDMREOJBUY","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEZDMREOJBUYXOLH","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEZDMREO","created_at":"2026-05-18T12:26:30.835961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL","json":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL.json","graph_json":"https://pith.science/api/pith-number/IEZDMREOJBUYXOLHJGNY2NMXFL/graph.json","events_json":"https://pith.science/api/pith-number/IEZDMREOJBUYXOLHJGNY2NMXFL/events.json","paper":"https://pith.science/paper/IEZDMREO"},"agent_actions":{"view_html":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL","download_json":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL.json","view_paper":"https://pith.science/paper/IEZDMREO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0229&json=true","fetch_graph":"https://pith.science/api/pith-number/IEZDMREOJBUYXOLHJGNY2NMXFL/graph.json","fetch_events":"https://pith.science/api/pith-number/IEZDMREOJBUYXOLHJGNY2NMXFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/action/storage_attestation","attest_author":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/action/author_attestation","sign_citation":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/action/citation_signature","submit_replication":"https://pith.science/pith/IEZDMREOJBUYXOLHJGNY2NMXFL/action/replication_record"}},"created_at":"2026-05-18T04:05:25.769879+00:00","updated_at":"2026-05-18T04:05:25.769879+00:00"}