{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EKATJOEX5YNDFJRXS6VB6CIRK5","short_pith_number":"pith:EKATJOEX","canonical_record":{"source":{"id":"1508.07845","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-31T14:23:38Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"edf3be81b581576792810fb53c9194f84ab567b039e356771c3b40523eb08844","abstract_canon_sha256":"ca30c013f6c3e23f3b7b79bfd9d9f6f47970023787dc964339730907cb58ffb8"},"schema_version":"1.0"},"canonical_sha256":"228134b897ee1a32a63797aa1f0911576d52dc5a9cd6e08b6a732e2a570b7401","source":{"kind":"arxiv","id":"1508.07845","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07845","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07845v4","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07845","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"EKATJOEX5YND","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKATJOEX5YNDFJRX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKATJOEX","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EKATJOEX5YNDFJRXS6VB6CIRK5","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07845","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-31T14:23:38Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"edf3be81b581576792810fb53c9194f84ab567b039e356771c3b40523eb08844","abstract_canon_sha256":"ca30c013f6c3e23f3b7b79bfd9d9f6f47970023787dc964339730907cb58ffb8"},"schema_version":"1.0"},"canonical_sha256":"228134b897ee1a32a63797aa1f0911576d52dc5a9cd6e08b6a732e2a570b7401","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:16.878520Z","signature_b64":"QZnNvIomCOD+Np02jCUN6+qNBcmsU0c66RhXiQA3QmeOtLQUucacHw/pDAiyzL59yO2WdBwM3ofe6O83fQ0yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"228134b897ee1a32a63797aa1f0911576d52dc5a9cd6e08b6a732e2a570b7401","last_reissued_at":"2026-05-18T01:20:16.877902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:16.877902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07845","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-05-18T01:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNON9asO1I6Vait1XXharshLMRTUpPDqkzlkvV0Du8KdGOU7gHYuaLzh47Fj/WaWQ05FSCIxRjh8e+cagOyZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:27:11.827430Z"},"content_sha256":"67e386ad44bf0aafaf2ffc14e072dd045d768f0b1aa49949cc64d208ba635a9a","schema_version":"1.0","event_id":"sha256:67e386ad44bf0aafaf2ffc14e072dd045d768f0b1aa49949cc64d208ba635a9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EKATJOEX5YNDFJRXS6VB6CIRK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query Workload-based RDF Graph Fragmentation and Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Dongyan Zhao, Lei Chen, Lei Zou, Peng Peng","submitted_at":"2015-08-31T14:23:38Z","abstract_excerpt":"As the volume of the RDF data becomes increasingly large, it is essential for us to design a distributed database system to manage it. For distributed RDF data design, it is quite common to partition the RDF data into some parts, called fragments, which are then distributed. Thus, the distribution design consists of two steps: fragmentation and allocation. In this paper, we propose a method to explore the intrinsic similarities among the structures of queries in a workload for fragmentation and allocation, which aims to reduce the number of crossing matches and the communication cost during SP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07845","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":""},"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:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bs5llqLBf4FL/qbJZDosDFYoN+JHD5ZWYvv65UIHh3RYoTtbjl5VwMPlJ3u4csonEpmDciMggHPww8TcExlmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:27:11.827813Z"},"content_sha256":"725bad58a2ed4082ec9c0b922ff6669ba5c9407ee72f382396fdee51eb597094","schema_version":"1.0","event_id":"sha256:725bad58a2ed4082ec9c0b922ff6669ba5c9407ee72f382396fdee51eb597094"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKATJOEX5YNDFJRXS6VB6CIRK5/bundle.json","state_url":"https://pith.science/pith/EKATJOEX5YNDFJRXS6VB6CIRK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKATJOEX5YNDFJRXS6VB6CIRK5/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-02T19:27:11Z","links":{"resolver":"https://pith.science/pith/EKATJOEX5YNDFJRXS6VB6CIRK5","bundle":"https://pith.science/pith/EKATJOEX5YNDFJRXS6VB6CIRK5/bundle.json","state":"https://pith.science/pith/EKATJOEX5YNDFJRXS6VB6CIRK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKATJOEX5YNDFJRXS6VB6CIRK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EKATJOEX5YNDFJRXS6VB6CIRK5","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":"ca30c013f6c3e23f3b7b79bfd9d9f6f47970023787dc964339730907cb58ffb8","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-31T14:23:38Z","title_canon_sha256":"edf3be81b581576792810fb53c9194f84ab567b039e356771c3b40523eb08844"},"schema_version":"1.0","source":{"id":"1508.07845","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07845","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07845v4","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07845","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"EKATJOEX5YND","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKATJOEX5YNDFJRX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKATJOEX","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:725bad58a2ed4082ec9c0b922ff6669ba5c9407ee72f382396fdee51eb597094","target":"graph","created_at":"2026-05-18T01:20:16Z","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":"As the volume of the RDF data becomes increasingly large, it is essential for us to design a distributed database system to manage it. For distributed RDF data design, it is quite common to partition the RDF data into some parts, called fragments, which are then distributed. Thus, the distribution design consists of two steps: fragmentation and allocation. In this paper, we propose a method to explore the intrinsic similarities among the structures of queries in a workload for fragmentation and allocation, which aims to reduce the number of crossing matches and the communication cost during SP","authors_text":"Dongyan Zhao, Lei Chen, Lei Zou, Peng Peng","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-31T14:23:38Z","title":"Query Workload-based RDF Graph Fragmentation and Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07845","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:67e386ad44bf0aafaf2ffc14e072dd045d768f0b1aa49949cc64d208ba635a9a","target":"record","created_at":"2026-05-18T01:20:16Z","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":"ca30c013f6c3e23f3b7b79bfd9d9f6f47970023787dc964339730907cb58ffb8","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-31T14:23:38Z","title_canon_sha256":"edf3be81b581576792810fb53c9194f84ab567b039e356771c3b40523eb08844"},"schema_version":"1.0","source":{"id":"1508.07845","kind":"arxiv","version":4}},"canonical_sha256":"228134b897ee1a32a63797aa1f0911576d52dc5a9cd6e08b6a732e2a570b7401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"228134b897ee1a32a63797aa1f0911576d52dc5a9cd6e08b6a732e2a570b7401","first_computed_at":"2026-05-18T01:20:16.877902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:16.877902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QZnNvIomCOD+Np02jCUN6+qNBcmsU0c66RhXiQA3QmeOtLQUucacHw/pDAiyzL59yO2WdBwM3ofe6O83fQ0yDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:16.878520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07845","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67e386ad44bf0aafaf2ffc14e072dd045d768f0b1aa49949cc64d208ba635a9a","sha256:725bad58a2ed4082ec9c0b922ff6669ba5c9407ee72f382396fdee51eb597094"],"state_sha256":"ebab7ad17e518c4e8d43224d28e0486229cba76493f90de660858d2ae5919e72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XCfaxMFhXGdXIPK7t8gbLo/LyjLhpGDwYss2oZtBm5mFvckwJcnewhKzr8qNUNpv/nu2YO7nVfY4leG8YSKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T19:27:11.829751Z","bundle_sha256":"2f273ed3c5c5090cc48975c1d8d1c76b20e9aefca1ff946b04a96f4afb7e9445"}}