{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4TLWWQY3EO5VDWYCGZZMBXVWYZ","short_pith_number":"pith:4TLWWQY3","canonical_record":{"source":{"id":"1510.07749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-27T02:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"4014b00bbb4a8cc23c12528eb62206892da9def981d733a9ed0a454bb6ddf2c4","abstract_canon_sha256":"b6dcdbec240225878dbd22d373cb082cf5f3ea19fb6cd190739e5e15d50c3f1e"},"schema_version":"1.0"},"canonical_sha256":"e4d76b431b23bb51db023672c0deb6c66255c3d830db0a95c894664ef393741a","source":{"kind":"arxiv","id":"1510.07749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07749","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07749v1","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07749","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"4TLWWQY3EO5V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TLWWQY3EO5VDWYC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TLWWQY3","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4TLWWQY3EO5VDWYCGZZMBXVWYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-27T02:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"4014b00bbb4a8cc23c12528eb62206892da9def981d733a9ed0a454bb6ddf2c4","abstract_canon_sha256":"b6dcdbec240225878dbd22d373cb082cf5f3ea19fb6cd190739e5e15d50c3f1e"},"schema_version":"1.0"},"canonical_sha256":"e4d76b431b23bb51db023672c0deb6c66255c3d830db0a95c894664ef393741a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:12.728154Z","signature_b64":"P6IbQ5iDSukPDEjs7p01CKyMHLALl8O1JVFBeRLRGB7jN7S5VDrnB0+cF8NmsZ7mYtszUTkFJnQMJGPHWt/BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d76b431b23bb51db023672c0deb6c66255c3d830db0a95c894664ef393741a","last_reissued_at":"2026-05-18T01:29:12.727578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:12.727578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07749","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-18T01:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fENHjeWjSNKDrgrjkRbC4gJ7Ujjzalq2pZSkQj5ixpnTgko0f0yymguVR+SLTRTvVwyLpkgtuhYJyyDTjYDxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:21:15.946644Z"},"content_sha256":"105c983b0fd1c1c1224a7207ee661fe74566d01ad7796bb87cee624a0253acff","schema_version":"1.0","event_id":"sha256:105c983b0fd1c1c1224a7207ee661fe74566d01ad7796bb87cee624a0253acff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4TLWWQY3EO5VDWYCGZZMBXVWYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A partition-based Summary-Graph-Driven Method for Efficient RDF Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lei Gai, Tengjiao Wang, Wei Chen","submitted_at":"2015-10-27T02:01:53Z","abstract_excerpt":"RDF query optimization is a challenging problem. Although considerable factors and their impacts on query efficiency have been investigated, this problem still needs further investigation. We identify that decomposing query into a series of light-weight operations is also effective in boosting query processing. Considering the linked nature of RDF data, the correlations among operations should be carefully handled. In this paper, we present SGDQ, a novel framework that features a partition-based Summary Graph Driven Query for efficient query processing. Basically, SGDQ partitions data and mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07749","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-18T01:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTyc39L0p//cCYhwiDJSkEZ0jwTnrpQFbu/7Qc6XCtt3VWUDqFE09rKhlojOA8YPu74rQJKnpKkpnLxk2X0eDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:21:15.947344Z"},"content_sha256":"c6e2aa79c0bcf6a571d7ea3294e4e68c4e66b660e2cdc684b2f53a6ff2b06e75","schema_version":"1.0","event_id":"sha256:c6e2aa79c0bcf6a571d7ea3294e4e68c4e66b660e2cdc684b2f53a6ff2b06e75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/bundle.json","state_url":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/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-31T17:21:15Z","links":{"resolver":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ","bundle":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/bundle.json","state":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4TLWWQY3EO5VDWYCGZZMBXVWYZ","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":"b6dcdbec240225878dbd22d373cb082cf5f3ea19fb6cd190739e5e15d50c3f1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-27T02:01:53Z","title_canon_sha256":"4014b00bbb4a8cc23c12528eb62206892da9def981d733a9ed0a454bb6ddf2c4"},"schema_version":"1.0","source":{"id":"1510.07749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07749","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07749v1","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07749","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"4TLWWQY3EO5V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TLWWQY3EO5VDWYC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TLWWQY3","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:c6e2aa79c0bcf6a571d7ea3294e4e68c4e66b660e2cdc684b2f53a6ff2b06e75","target":"graph","created_at":"2026-05-18T01:29:12Z","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":"RDF query optimization is a challenging problem. Although considerable factors and their impacts on query efficiency have been investigated, this problem still needs further investigation. We identify that decomposing query into a series of light-weight operations is also effective in boosting query processing. Considering the linked nature of RDF data, the correlations among operations should be carefully handled. In this paper, we present SGDQ, a novel framework that features a partition-based Summary Graph Driven Query for efficient query processing. Basically, SGDQ partitions data and mode","authors_text":"Lei Gai, Tengjiao Wang, Wei Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-27T02:01:53Z","title":"A partition-based Summary-Graph-Driven Method for Efficient RDF Query Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07749","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:105c983b0fd1c1c1224a7207ee661fe74566d01ad7796bb87cee624a0253acff","target":"record","created_at":"2026-05-18T01:29:12Z","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":"b6dcdbec240225878dbd22d373cb082cf5f3ea19fb6cd190739e5e15d50c3f1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-27T02:01:53Z","title_canon_sha256":"4014b00bbb4a8cc23c12528eb62206892da9def981d733a9ed0a454bb6ddf2c4"},"schema_version":"1.0","source":{"id":"1510.07749","kind":"arxiv","version":1}},"canonical_sha256":"e4d76b431b23bb51db023672c0deb6c66255c3d830db0a95c894664ef393741a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4d76b431b23bb51db023672c0deb6c66255c3d830db0a95c894664ef393741a","first_computed_at":"2026-05-18T01:29:12.727578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:12.727578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P6IbQ5iDSukPDEjs7p01CKyMHLALl8O1JVFBeRLRGB7jN7S5VDrnB0+cF8NmsZ7mYtszUTkFJnQMJGPHWt/BDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:12.728154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:105c983b0fd1c1c1224a7207ee661fe74566d01ad7796bb87cee624a0253acff","sha256:c6e2aa79c0bcf6a571d7ea3294e4e68c4e66b660e2cdc684b2f53a6ff2b06e75"],"state_sha256":"9fd309656c0332ac67730234dfcbc45ee0e0429d8ddcacf4cb4af788e33c1de0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wcgmmd4HfRaCwfUrkeOCIZdToZ+9zKqG5gYK+gbWwlysAN7Lgm3wTSmc+wZ9fIx3N+bJEhM0Jzy60oHEhF34Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:21:15.951133Z","bundle_sha256":"4e1fb59976ac6ea111577b7ec0d94c79d5ec61a1d73a043be4d1a94918d7d8ad"}}