{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GSGYFSL3LD6V2W756OU6ITBG32","short_pith_number":"pith:GSGYFSL3","canonical_record":{"source":{"id":"1310.4802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-10-16T15:04:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2b79ec50e6cbfead5287f85544aed3fd61e1cfaeb28294f85b1880fbfd898775","abstract_canon_sha256":"87bfc62c209f1ecadca5ef65016f2ea57e4243e8b42c96143627cd0a879502c2"},"schema_version":"1.0"},"canonical_sha256":"348d82c97b58fd5d5bfdf3a9e44c26de9afb0e99b40c113c81e0ceea9e6813a9","source":{"kind":"arxiv","id":"1310.4802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4802","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4802v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4802","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"GSGYFSL3LD6V","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GSGYFSL3LD6V2W75","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GSGYFSL3","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GSGYFSL3LD6V2W756OU6ITBG32","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-10-16T15:04:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2b79ec50e6cbfead5287f85544aed3fd61e1cfaeb28294f85b1880fbfd898775","abstract_canon_sha256":"87bfc62c209f1ecadca5ef65016f2ea57e4243e8b42c96143627cd0a879502c2"},"schema_version":"1.0"},"canonical_sha256":"348d82c97b58fd5d5bfdf3a9e44c26de9afb0e99b40c113c81e0ceea9e6813a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.681781Z","signature_b64":"Y0x/sWWS/maB5Ah9Gu7YSGC1JpJYNVbGNUymxL3aeNeK88zp++de3+2tO/LdwUAIyLf/70a8V+yAC6AW/ia0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"348d82c97b58fd5d5bfdf3a9e44c26de9afb0e99b40c113c81e0ceea9e6813a9","last_reissued_at":"2026-05-18T03:10:12.680943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.680943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4802","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-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"muO7tja1RYKeqjGwa6dXByKayjNBjZfZUjdOD0HO1i5ns5iijB3UpTk2ngC9dvnc+KoScCTLZluC/xHv5BzFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:02:46.393719Z"},"content_sha256":"73e50605bfb9eacc95bf5fc557fe519c1319626dc689219e162a1880cb06dd53","schema_version":"1.0","event_id":"sha256:73e50605bfb9eacc95bf5fc557fe519c1319626dc689219e162a1880cb06dd53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GSGYFSL3LD6V2W756OU6ITBG32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Demand Memory Specialization for Distributed Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"David Dominguez-Sal, Josep Llu\\'is Larriba-Pey, Patrick Valduriez, Reza Akbarinia, Xavier Martinez-Palau","submitted_at":"2013-10-16T15:04:06Z","abstract_excerpt":"In this paper, we propose the DN-tree that is a data structure to build lossy summaries of the frequent data access patterns of the queries in a distributed graph data management system. These compact representations allow us an efficient communication of the data structure in distributed systems. We exploit this data structure with a new \\textit{Dynamic Data Partitioning} strategy (DYDAP) that assigns the portions of the graph according to historical data access patterns, and guarantees a small network communication and a computational load balance in distributed graph queries. This method is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4802","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-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bW/78ysgcbKRhPVRAnGdTMfqqDadzVKhvJi5OipDhsmzZ0Dyod6cmMtat+kd5arFughRI96kN3pNvuj0d6EqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:02:46.394065Z"},"content_sha256":"83b95ed2c5501ef3c29f30133520dca26552742f634f238823da507c45d0ffc7","schema_version":"1.0","event_id":"sha256:83b95ed2c5501ef3c29f30133520dca26552742f634f238823da507c45d0ffc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/bundle.json","state_url":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSGYFSL3LD6V2W756OU6ITBG32/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-06-25T05:02:46Z","links":{"resolver":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32","bundle":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/bundle.json","state":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSGYFSL3LD6V2W756OU6ITBG32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GSGYFSL3LD6V2W756OU6ITBG32","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":"87bfc62c209f1ecadca5ef65016f2ea57e4243e8b42c96143627cd0a879502c2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-10-16T15:04:06Z","title_canon_sha256":"2b79ec50e6cbfead5287f85544aed3fd61e1cfaeb28294f85b1880fbfd898775"},"schema_version":"1.0","source":{"id":"1310.4802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4802","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4802v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4802","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"GSGYFSL3LD6V","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GSGYFSL3LD6V2W75","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GSGYFSL3","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:83b95ed2c5501ef3c29f30133520dca26552742f634f238823da507c45d0ffc7","target":"graph","created_at":"2026-05-18T03:10: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":"In this paper, we propose the DN-tree that is a data structure to build lossy summaries of the frequent data access patterns of the queries in a distributed graph data management system. These compact representations allow us an efficient communication of the data structure in distributed systems. We exploit this data structure with a new \\textit{Dynamic Data Partitioning} strategy (DYDAP) that assigns the portions of the graph according to historical data access patterns, and guarantees a small network communication and a computational load balance in distributed graph queries. This method is","authors_text":"David Dominguez-Sal, Josep Llu\\'is Larriba-Pey, Patrick Valduriez, Reza Akbarinia, Xavier Martinez-Palau","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-10-16T15:04:06Z","title":"On Demand Memory Specialization for Distributed Graph Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4802","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:73e50605bfb9eacc95bf5fc557fe519c1319626dc689219e162a1880cb06dd53","target":"record","created_at":"2026-05-18T03:10: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":"87bfc62c209f1ecadca5ef65016f2ea57e4243e8b42c96143627cd0a879502c2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-10-16T15:04:06Z","title_canon_sha256":"2b79ec50e6cbfead5287f85544aed3fd61e1cfaeb28294f85b1880fbfd898775"},"schema_version":"1.0","source":{"id":"1310.4802","kind":"arxiv","version":1}},"canonical_sha256":"348d82c97b58fd5d5bfdf3a9e44c26de9afb0e99b40c113c81e0ceea9e6813a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"348d82c97b58fd5d5bfdf3a9e44c26de9afb0e99b40c113c81e0ceea9e6813a9","first_computed_at":"2026-05-18T03:10:12.680943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.680943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0x/sWWS/maB5Ah9Gu7YSGC1JpJYNVbGNUymxL3aeNeK88zp++de3+2tO/LdwUAIyLf/70a8V+yAC6AW/ia0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.681781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73e50605bfb9eacc95bf5fc557fe519c1319626dc689219e162a1880cb06dd53","sha256:83b95ed2c5501ef3c29f30133520dca26552742f634f238823da507c45d0ffc7"],"state_sha256":"ca0a5f275bed5e65471dfea2db6ba0118c2751d9b1fa7d64e251e9ad834e69d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dh4on5lu4Ik5xKVgV5iJHrQkqb6//k+eGgaKTSP+3xn6cjabyO/zZ2enYXh+YIVXakpMOkpJoxCn5u+vWo6SBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:02:46.395994Z","bundle_sha256":"0baf03089c2e0b0f5452dd0a71e256c1e517412f69b4c283f7e254131c60e391"}}