{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IWTIB23KXEXCCTV3FHGSIEM7IC","short_pith_number":"pith:IWTIB23K","canonical_record":{"source":{"id":"1807.07691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-20T01:52:45Z","cross_cats_sorted":[],"title_canon_sha256":"68d32ebffe16415fe23b16f597b404698b140a69c64db2318e439db05e7d17ab","abstract_canon_sha256":"e9f21c51dc0bbc60a1166c32a067641c10ebff429fc3111f894e0b7d0a309540"},"schema_version":"1.0"},"canonical_sha256":"45a680eb6ab92e214ebb29cd24119f40b5b27daac889b5a3a185d44ba905177f","source":{"kind":"arxiv","id":"1807.07691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07691","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07691v1","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07691","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"IWTIB23KXEXC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IWTIB23KXEXCCTV3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IWTIB23K","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IWTIB23KXEXCCTV3FHGSIEM7IC","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-20T01:52:45Z","cross_cats_sorted":[],"title_canon_sha256":"68d32ebffe16415fe23b16f597b404698b140a69c64db2318e439db05e7d17ab","abstract_canon_sha256":"e9f21c51dc0bbc60a1166c32a067641c10ebff429fc3111f894e0b7d0a309540"},"schema_version":"1.0"},"canonical_sha256":"45a680eb6ab92e214ebb29cd24119f40b5b27daac889b5a3a185d44ba905177f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:15.879522Z","signature_b64":"YI5Odt12VVfcTtYQMr8SaM1Qsbr+DHEmztPzMr+H1gCVTBc6EXv5Ftjem5m1FbutrftIX/CfBdjuJl4NhPPJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a680eb6ab92e214ebb29cd24119f40b5b27daac889b5a3a185d44ba905177f","last_reissued_at":"2026-05-18T00:10:15.878856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:15.878856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07691","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-18T00:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BErgr1TbXgfH3SZehjLXHSQCbQ9ed1oDLpLJBGvW6V8AtIsFNgSFbUR79k+WlCDFP2lR/3a5qwi05AgGOnEeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:29:51.097024Z"},"content_sha256":"fb552c90eccb2d25b6237fe90f431cf24e5d77f0f13a85ab7ef9d950d83bbb0a","schema_version":"1.0","event_id":"sha256:fb552c90eccb2d25b6237fe90f431cf24e5d77f0f13a85ab7ef9d950d83bbb0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IWTIB23KXEXCCTV3FHGSIEM7IC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"gSMat: A Scalable Sparse Matrix-based Join for SPARQL Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jiaming Song, Lei Zou, Mingyue Zhang, Peng Peng, Xiaowang Zhang, Zhiyong Feng","submitted_at":"2018-07-20T01:52:45Z","abstract_excerpt":"Resource Description Framework (RDF) has been widely used to represent information on the web, while SPARQL is a standard query language to manipulate RDF data. Given a SPARQL query, there often exist many joins which are the bottlenecks of efficiency of query processing. Besides, the real RDF datasets often reveal strong data sparsity, which indicates that a resource often only relates to a few resources even the number of total resources is large. In this paper, we propose a sparse matrix-based (SM-based) SPARQL query processing approach over RDF datasets which con- siders both join optimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07691","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-18T00:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0oiwviyUZMXoHtDURh8jwjWXL4qBSWRks2lY5PmzHqDcPNvibVKuf+1oBpBorGhxdBjWMVM+y4KlhQb3PSFTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:29:51.097660Z"},"content_sha256":"4852bf063b915ecb7b23df72400880a32ef87dd5eb8475dd214789825a955229","schema_version":"1.0","event_id":"sha256:4852bf063b915ecb7b23df72400880a32ef87dd5eb8475dd214789825a955229"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/bundle.json","state_url":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/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-05-26T05:29:51Z","links":{"resolver":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC","bundle":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/bundle.json","state":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IWTIB23KXEXCCTV3FHGSIEM7IC","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":"e9f21c51dc0bbc60a1166c32a067641c10ebff429fc3111f894e0b7d0a309540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-20T01:52:45Z","title_canon_sha256":"68d32ebffe16415fe23b16f597b404698b140a69c64db2318e439db05e7d17ab"},"schema_version":"1.0","source":{"id":"1807.07691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07691","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07691v1","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07691","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"IWTIB23KXEXC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IWTIB23KXEXCCTV3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IWTIB23K","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:4852bf063b915ecb7b23df72400880a32ef87dd5eb8475dd214789825a955229","target":"graph","created_at":"2026-05-18T00:10: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"},"paper":{"abstract_excerpt":"Resource Description Framework (RDF) has been widely used to represent information on the web, while SPARQL is a standard query language to manipulate RDF data. Given a SPARQL query, there often exist many joins which are the bottlenecks of efficiency of query processing. Besides, the real RDF datasets often reveal strong data sparsity, which indicates that a resource often only relates to a few resources even the number of total resources is large. In this paper, we propose a sparse matrix-based (SM-based) SPARQL query processing approach over RDF datasets which con- siders both join optimiza","authors_text":"Jiaming Song, Lei Zou, Mingyue Zhang, Peng Peng, Xiaowang Zhang, Zhiyong Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-20T01:52:45Z","title":"gSMat: A Scalable Sparse Matrix-based Join for SPARQL Query Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07691","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:fb552c90eccb2d25b6237fe90f431cf24e5d77f0f13a85ab7ef9d950d83bbb0a","target":"record","created_at":"2026-05-18T00:10: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":"e9f21c51dc0bbc60a1166c32a067641c10ebff429fc3111f894e0b7d0a309540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-20T01:52:45Z","title_canon_sha256":"68d32ebffe16415fe23b16f597b404698b140a69c64db2318e439db05e7d17ab"},"schema_version":"1.0","source":{"id":"1807.07691","kind":"arxiv","version":1}},"canonical_sha256":"45a680eb6ab92e214ebb29cd24119f40b5b27daac889b5a3a185d44ba905177f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45a680eb6ab92e214ebb29cd24119f40b5b27daac889b5a3a185d44ba905177f","first_computed_at":"2026-05-18T00:10:15.878856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:15.878856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YI5Odt12VVfcTtYQMr8SaM1Qsbr+DHEmztPzMr+H1gCVTBc6EXv5Ftjem5m1FbutrftIX/CfBdjuJl4NhPPJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:15.879522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb552c90eccb2d25b6237fe90f431cf24e5d77f0f13a85ab7ef9d950d83bbb0a","sha256:4852bf063b915ecb7b23df72400880a32ef87dd5eb8475dd214789825a955229"],"state_sha256":"b0257b1bc5fce7136523b42b36873e7fc3ef30d548e2cf313f089b87cf840539"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/6tKFM+gUCLU55Imv40rs8xgO/A3nKnNtPTkVeoYdMZVImeYXopGgZlotNCjwo4ZoNpVW6Cq5M6sboJHP17Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:29:51.101041Z","bundle_sha256":"cbcf1088a65a28f0ad1d7e0a1cfe68ee76e07f383870e6da82af43daa19d8819"}}