{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OP27VPYWGYOFYGLFWSRCXQQSM2","short_pith_number":"pith:OP27VPYW","schema_version":"1.0","canonical_sha256":"73f5fabf16361c5c1965b4a22bc21266884e5939f5b598d8791f20de97e0e76b","source":{"kind":"arxiv","id":"1906.03420","version":4},"attestation_state":"computed","paper":{"title":"GSI: GPU-friendly Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Fan Zhang, Lei Zou, Lin Hu, Li Zeng, M. Tamer \\\"Ozsu","submitted_at":"2019-06-08T08:47:08Z","abstract_excerpt":"Subgraph isomorphism is a well-known NP-hard problem that is widely used in many applications, such as social network analysis and query over the knowledge graph. Due to the inherent hardness, its performance is often a bottleneck in various real-world applications. Therefore, we address this by designing an efficient subgraph isomorphism algorithm leveraging features of GPU architecture, such as massive parallelism and memory hierarchy. Existing GPU-based solutions adopt a two-step output scheme, performing the same join process twice in order to write intermediate results concurrently. They "},"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":"1906.03420","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-08T08:47:08Z","cross_cats_sorted":[],"title_canon_sha256":"315eae48008bedd258ed2889b7838cd1f6e7ad3fdd87241918a3e8f0ae6a9898","abstract_canon_sha256":"bbde35f40d644014f9c4053962196b29b274b3bc689b3ee2dcea76cb3dfbd725"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:15.116149Z","signature_b64":"koNANKw3AKeoMzPm92VG7FjJSFRojO6o37vu2ass+/gR8/6i2lIM4o3Mvd1JhbkZERwXhqVIaWnqQMfL1MpKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73f5fabf16361c5c1965b4a22bc21266884e5939f5b598d8791f20de97e0e76b","last_reissued_at":"2026-07-05T02:33:15.115673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:15.115673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GSI: GPU-friendly Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Fan Zhang, Lei Zou, Lin Hu, Li Zeng, M. Tamer \\\"Ozsu","submitted_at":"2019-06-08T08:47:08Z","abstract_excerpt":"Subgraph isomorphism is a well-known NP-hard problem that is widely used in many applications, such as social network analysis and query over the knowledge graph. Due to the inherent hardness, its performance is often a bottleneck in various real-world applications. Therefore, we address this by designing an efficient subgraph isomorphism algorithm leveraging features of GPU architecture, such as massive parallelism and memory hierarchy. Existing GPU-based solutions adopt a two-step output scheme, performing the same join process twice in order to write intermediate results concurrently. They "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03420","kind":"arxiv","version":4},"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/1906.03420/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.03420","created_at":"2026-07-05T02:33:15.115750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03420v4","created_at":"2026-07-05T02:33:15.115750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03420","created_at":"2026-07-05T02:33:15.115750+00:00"},{"alias_kind":"pith_short_12","alias_value":"OP27VPYWGYOF","created_at":"2026-07-05T02:33:15.115750+00:00"},{"alias_kind":"pith_short_16","alias_value":"OP27VPYWGYOFYGLF","created_at":"2026-07-05T02:33:15.115750+00:00"},{"alias_kind":"pith_short_8","alias_value":"OP27VPYW","created_at":"2026-07-05T02:33:15.115750+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/OP27VPYWGYOFYGLFWSRCXQQSM2","json":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2.json","graph_json":"https://pith.science/api/pith-number/OP27VPYWGYOFYGLFWSRCXQQSM2/graph.json","events_json":"https://pith.science/api/pith-number/OP27VPYWGYOFYGLFWSRCXQQSM2/events.json","paper":"https://pith.science/paper/OP27VPYW"},"agent_actions":{"view_html":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2","download_json":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2.json","view_paper":"https://pith.science/paper/OP27VPYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03420&json=true","fetch_graph":"https://pith.science/api/pith-number/OP27VPYWGYOFYGLFWSRCXQQSM2/graph.json","fetch_events":"https://pith.science/api/pith-number/OP27VPYWGYOFYGLFWSRCXQQSM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/action/storage_attestation","attest_author":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/action/author_attestation","sign_citation":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/action/citation_signature","submit_replication":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/action/replication_record"}},"created_at":"2026-07-05T02:33:15.115750+00:00","updated_at":"2026-07-05T02:33:15.115750+00:00"}