{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OP27VPYWGYOFYGLFWSRCXQQSM2","short_pith_number":"pith:OP27VPYW","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"},"canonical_sha256":"73f5fabf16361c5c1965b4a22bc21266884e5939f5b598d8791f20de97e0e76b","source":{"kind":"arxiv","id":"1906.03420","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03420","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03420v4","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03420","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"pith_short_12","alias_value":"OP27VPYWGYOF","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"OP27VPYWGYOFYGLF","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"OP27VPYW","created_at":"2026-07-05T02:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OP27VPYWGYOFYGLFWSRCXQQSM2","target":"record","payload":{"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"},"canonical_sha256":"73f5fabf16361c5c1965b4a22bc21266884e5939f5b598d8791f20de97e0e76b","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"},"source_kind":"arxiv","source_id":"1906.03420","source_version":4,"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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6sWIN3i6fW3fbMKjgqIocneuUDquNNriszdbQbVwFBtzrYvyzGJq7XtI9C8cTez2FZ4qtt/u6/2lo8b+i4gAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:48:50.518126Z"},"content_sha256":"cef6eac63f7ba200794ebd3085627a7cd715168be4effae752a2be9f5515b8c6","schema_version":"1.0","event_id":"sha256:cef6eac63f7ba200794ebd3085627a7cd715168be4effae752a2be9f5515b8c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OP27VPYWGYOFYGLFWSRCXQQSM2","target":"graph","payload":{"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"},"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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcpiIo/BzoFiTd3fpYNrJSxiCAtxF9wdX7SbROa2/5Ju8RTlFnkaQltR0RgQR2yAh/GwPmWUYwK0JDdeEs8cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:48:50.518517Z"},"content_sha256":"68956a25b1c8ba44f4f84ece6d427603cc79be19f17ac7820e4278fab454cb42","schema_version":"1.0","event_id":"sha256:68956a25b1c8ba44f4f84ece6d427603cc79be19f17ac7820e4278fab454cb42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/bundle.json","state_url":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/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-09T01:48:50Z","links":{"resolver":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2","bundle":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/bundle.json","state":"https://pith.science/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OP27VPYWGYOFYGLFWSRCXQQSM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OP27VPYWGYOFYGLFWSRCXQQSM2","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":"bbde35f40d644014f9c4053962196b29b274b3bc689b3ee2dcea76cb3dfbd725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-08T08:47:08Z","title_canon_sha256":"315eae48008bedd258ed2889b7838cd1f6e7ad3fdd87241918a3e8f0ae6a9898"},"schema_version":"1.0","source":{"id":"1906.03420","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03420","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03420v4","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03420","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"pith_short_12","alias_value":"OP27VPYWGYOF","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"OP27VPYWGYOFYGLF","created_at":"2026-07-05T02:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"OP27VPYW","created_at":"2026-07-05T02:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:68956a25b1c8ba44f4f84ece6d427603cc79be19f17ac7820e4278fab454cb42","target":"graph","created_at":"2026-07-05T02:33:15Z","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/1906.03420/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 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 ","authors_text":"Fan Zhang, Lei Zou, Lin Hu, Li Zeng, M. Tamer \\\"Ozsu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-08T08:47:08Z","title":"GSI: GPU-friendly Subgraph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03420","kind":"arxiv","version":4},"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:cef6eac63f7ba200794ebd3085627a7cd715168be4effae752a2be9f5515b8c6","target":"record","created_at":"2026-07-05T02:33:15Z","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":"bbde35f40d644014f9c4053962196b29b274b3bc689b3ee2dcea76cb3dfbd725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-08T08:47:08Z","title_canon_sha256":"315eae48008bedd258ed2889b7838cd1f6e7ad3fdd87241918a3e8f0ae6a9898"},"schema_version":"1.0","source":{"id":"1906.03420","kind":"arxiv","version":4}},"canonical_sha256":"73f5fabf16361c5c1965b4a22bc21266884e5939f5b598d8791f20de97e0e76b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73f5fabf16361c5c1965b4a22bc21266884e5939f5b598d8791f20de97e0e76b","first_computed_at":"2026-07-05T02:33:15.115673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:33:15.115673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"koNANKw3AKeoMzPm92VG7FjJSFRojO6o37vu2ass+/gR8/6i2lIM4o3Mvd1JhbkZERwXhqVIaWnqQMfL1MpKDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:33:15.116149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03420","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cef6eac63f7ba200794ebd3085627a7cd715168be4effae752a2be9f5515b8c6","sha256:68956a25b1c8ba44f4f84ece6d427603cc79be19f17ac7820e4278fab454cb42"],"state_sha256":"98e1a5da63b013408802ac92fefe70b184e1ebb9a973c20e0244f0360a04f0dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cib5JGsEpFfrdGbp7b78xLpZRXr7dv2IkJ3+oa6kAI3tLBiN+1M1EvynCVnh2bYAd5ATogCXxSAqqktM/y9xDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T01:48:50.520621Z","bundle_sha256":"fdef451dd410f267ced768b2bd014bba4ff28648334d15203ab720e34d272fc8"}}