{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S2UGTCRG7YUAQILF7VUIMSE44R","short_pith_number":"pith:S2UGTCRG","canonical_record":{"source":{"id":"1301.5121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-22T09:48:34Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1d52a168f87ca60e92d9d046dbce9d08fc0db71c2d89777b69c8db9177fe7b6e","abstract_canon_sha256":"d87e23dd34c95cb2078f9f2f2ffc0a21c326eedeed360d65e7f1fa7ef36ce6f0"},"schema_version":"1.0"},"canonical_sha256":"96a8698a26fe28082165fd6886489ce442e06a949675a213fdf6f9ec7a64c74e","source":{"kind":"arxiv","id":"1301.5121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5121","created_at":"2026-05-18T03:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5121v1","created_at":"2026-05-18T03:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5121","created_at":"2026-05-18T03:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"S2UGTCRG7YUA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S2UGTCRG7YUAQILF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S2UGTCRG","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S2UGTCRG7YUAQILF7VUIMSE44R","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-22T09:48:34Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1d52a168f87ca60e92d9d046dbce9d08fc0db71c2d89777b69c8db9177fe7b6e","abstract_canon_sha256":"d87e23dd34c95cb2078f9f2f2ffc0a21c326eedeed360d65e7f1fa7ef36ce6f0"},"schema_version":"1.0"},"canonical_sha256":"96a8698a26fe28082165fd6886489ce442e06a949675a213fdf6f9ec7a64c74e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:52.952423Z","signature_b64":"PywKPBIvNjuE3S4tQ65qnputhL78Hdyv4xUhCIv6n5z1TiPtheuugxsAyTxcOabDUH359u6r9k2AR7lrDDbYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96a8698a26fe28082165fd6886489ce442e06a949675a213fdf6f9ec7a64c74e","last_reissued_at":"2026-05-18T03:35:52.951684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:52.951684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5121","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:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WepSJNcyJWAgEnHlIMNN55EoC8dS+XASYP0CQ4r3V40zN8LQR6e90N3p7dTYQ1S3yUsjKc/yHgg7oGX5RL8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:05:10.355028Z"},"content_sha256":"2d4e5f31d0645680639eaf3c039cf3bd54e8ba9212f386ce6279357d61942110","schema_version":"1.0","event_id":"sha256:2d4e5f31d0645680639eaf3c039cf3bd54e8ba9212f386ce6279357d61942110"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S2UGTCRG7YUAQILF7VUIMSE44R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning Graph Databases - A Quantitative Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Alex Averbuch, Martin Neumann","submitted_at":"2013-01-22T09:48:34Z","abstract_excerpt":"Electronic data is growing at increasing rates, in both size and connectivity: the increasing presence of, and interest in, relationships between data. An example is the Twitter social network graph. Due to this growth demand is increasing for technologies that can process such data. Currently relational databases are the predominant technology, but they are poorly suited to processing connected data as they are optimized for index-intensive operations. Conversely, graph databases are optimized for graph computation. They link records by direct references, avoiding index lookups, and enabling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5121","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:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DA2EeVaeSRCH2Lv76crkpveOPynFJaDLO6jye+dT/nTgV7PSjrxV3gzSXDWoeu7m9c39LFoSdZu2/NdjPnVwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:05:10.355499Z"},"content_sha256":"0ab6ce1c7e56ebc19150b397f67df1ca24410a5447721db76ea602a7d6acec40","schema_version":"1.0","event_id":"sha256:0ab6ce1c7e56ebc19150b397f67df1ca24410a5447721db76ea602a7d6acec40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2UGTCRG7YUAQILF7VUIMSE44R/bundle.json","state_url":"https://pith.science/pith/S2UGTCRG7YUAQILF7VUIMSE44R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2UGTCRG7YUAQILF7VUIMSE44R/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-27T15:05:10Z","links":{"resolver":"https://pith.science/pith/S2UGTCRG7YUAQILF7VUIMSE44R","bundle":"https://pith.science/pith/S2UGTCRG7YUAQILF7VUIMSE44R/bundle.json","state":"https://pith.science/pith/S2UGTCRG7YUAQILF7VUIMSE44R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2UGTCRG7YUAQILF7VUIMSE44R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S2UGTCRG7YUAQILF7VUIMSE44R","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":"d87e23dd34c95cb2078f9f2f2ffc0a21c326eedeed360d65e7f1fa7ef36ce6f0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-22T09:48:34Z","title_canon_sha256":"1d52a168f87ca60e92d9d046dbce9d08fc0db71c2d89777b69c8db9177fe7b6e"},"schema_version":"1.0","source":{"id":"1301.5121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5121","created_at":"2026-05-18T03:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5121v1","created_at":"2026-05-18T03:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5121","created_at":"2026-05-18T03:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"S2UGTCRG7YUA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S2UGTCRG7YUAQILF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S2UGTCRG","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:0ab6ce1c7e56ebc19150b397f67df1ca24410a5447721db76ea602a7d6acec40","target":"graph","created_at":"2026-05-18T03:35:52Z","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":"Electronic data is growing at increasing rates, in both size and connectivity: the increasing presence of, and interest in, relationships between data. An example is the Twitter social network graph. Due to this growth demand is increasing for technologies that can process such data. Currently relational databases are the predominant technology, but they are poorly suited to processing connected data as they are optimized for index-intensive operations. Conversely, graph databases are optimized for graph computation. They link records by direct references, avoiding index lookups, and enabling ","authors_text":"Alex Averbuch, Martin Neumann","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-22T09:48:34Z","title":"Partitioning Graph Databases - A Quantitative Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5121","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:2d4e5f31d0645680639eaf3c039cf3bd54e8ba9212f386ce6279357d61942110","target":"record","created_at":"2026-05-18T03:35:52Z","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":"d87e23dd34c95cb2078f9f2f2ffc0a21c326eedeed360d65e7f1fa7ef36ce6f0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-22T09:48:34Z","title_canon_sha256":"1d52a168f87ca60e92d9d046dbce9d08fc0db71c2d89777b69c8db9177fe7b6e"},"schema_version":"1.0","source":{"id":"1301.5121","kind":"arxiv","version":1}},"canonical_sha256":"96a8698a26fe28082165fd6886489ce442e06a949675a213fdf6f9ec7a64c74e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96a8698a26fe28082165fd6886489ce442e06a949675a213fdf6f9ec7a64c74e","first_computed_at":"2026-05-18T03:35:52.951684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:52.951684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PywKPBIvNjuE3S4tQ65qnputhL78Hdyv4xUhCIv6n5z1TiPtheuugxsAyTxcOabDUH359u6r9k2AR7lrDDbYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:52.952423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d4e5f31d0645680639eaf3c039cf3bd54e8ba9212f386ce6279357d61942110","sha256:0ab6ce1c7e56ebc19150b397f67df1ca24410a5447721db76ea602a7d6acec40"],"state_sha256":"ba3aec15368964363e1750615279073cd3c80bc09041a48b725b77dddca8ac35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJ9h//bAx1ISy7swkymk97bZutzAy0LRUk2vLlRync82m5Xa2GGQMtqCqtj3wSHM/1DrgAkZbHBLGhvDT+0ACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:05:10.358133Z","bundle_sha256":"278efd2a949c3fd03fe4616cde0ca9b0d571d2927af33fcd259b4fdedbab361c"}}