{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HMMLXUQW3JB2KURNOZMBPHRLCY","short_pith_number":"pith:HMMLXUQW","canonical_record":{"source":{"id":"1309.1049","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-04T14:36:17Z","cross_cats_sorted":[],"title_canon_sha256":"8b384c189154e39996df396f509e90b2a6ae1bd4b51e1605506d07e62914024f","abstract_canon_sha256":"8c5d4df81d5b19e23315e78c62522f4a5bf5bb6fb84d96b194a21c2c20fc2238"},"schema_version":"1.0"},"canonical_sha256":"3b18bbd216da43a5522d7658179e2b160f2caa4ad00698e9ecc3cf0004d2abd1","source":{"kind":"arxiv","id":"1309.1049","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1049","created_at":"2026-05-18T03:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1049v3","created_at":"2026-05-18T03:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1049","created_at":"2026-05-18T03:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"HMMLXUQW3JB2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HMMLXUQW3JB2KURN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HMMLXUQW","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HMMLXUQW3JB2KURNOZMBPHRLCY","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1049","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-04T14:36:17Z","cross_cats_sorted":[],"title_canon_sha256":"8b384c189154e39996df396f509e90b2a6ae1bd4b51e1605506d07e62914024f","abstract_canon_sha256":"8c5d4df81d5b19e23315e78c62522f4a5bf5bb6fb84d96b194a21c2c20fc2238"},"schema_version":"1.0"},"canonical_sha256":"3b18bbd216da43a5522d7658179e2b160f2caa4ad00698e9ecc3cf0004d2abd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:45.268617Z","signature_b64":"yWQA+13VCA8G2REMhDcPyVqzfpMLgwXOooxtI6gvnj6/tECgFBDFjyfvaDAjsLUYpnds335zqdc+hsi35ZP7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b18bbd216da43a5522d7658179e2b160f2caa4ad00698e9ecc3cf0004d2abd1","last_reissued_at":"2026-05-18T03:13:45.268092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:45.268092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1049","source_version":3,"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:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aISe41JFk1s+w25EMUZRB+hszwf0eK7I1I28uqJwPiNFHaBdBOEe3us1blwHHGUZuJQysVFhPYRGgNK1KxS2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:30:23.606406Z"},"content_sha256":"997433ee6764fb31f86eade45c4dbc89e98452611e8d0b8194be6b5357a198ba","schema_version":"1.0","event_id":"sha256:997433ee6764fb31f86eade45c4dbc89e98452611e8d0b8194be6b5357a198ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HMMLXUQW3JB2KURNOZMBPHRLCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"xDGP: A Dynamic Graph Processing System with Adaptive Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Claudio Martella, Dionysios Logothetis, Felix Cuadrado, Luis Vaquero","submitted_at":"2013-09-04T14:36:17Z","abstract_excerpt":"Many real-world systems, such as social networks, rely on mining efficiently large graphs, with hundreds of millions of vertices and edges. This volume of information requires partitioning the graph across multiple nodes in a distributed system. This has a deep effect on performance, as traversing edges cut between partitions incurs a significant performance penalty due to the cost of communication. Thus, several systems in the literature have attempted to improve computational performance by enhancing graph partitioning, but they do not support another characteristic of real-world graphs: gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1049","kind":"arxiv","version":3},"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:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxJcmWGa965IwXhYNHK0IEQN17sqj+iAz23+y+eg6bySpewdXvOUZ5DdxP/J4B2krTacfIpZMjPOFySk9hagBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:30:23.606780Z"},"content_sha256":"2f62303044235b566878d26ae352f19d6dc86ef6269dbf339fc05c1db5d0a5e8","schema_version":"1.0","event_id":"sha256:2f62303044235b566878d26ae352f19d6dc86ef6269dbf339fc05c1db5d0a5e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMMLXUQW3JB2KURNOZMBPHRLCY/bundle.json","state_url":"https://pith.science/pith/HMMLXUQW3JB2KURNOZMBPHRLCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMMLXUQW3JB2KURNOZMBPHRLCY/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-02T17:30:23Z","links":{"resolver":"https://pith.science/pith/HMMLXUQW3JB2KURNOZMBPHRLCY","bundle":"https://pith.science/pith/HMMLXUQW3JB2KURNOZMBPHRLCY/bundle.json","state":"https://pith.science/pith/HMMLXUQW3JB2KURNOZMBPHRLCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMMLXUQW3JB2KURNOZMBPHRLCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HMMLXUQW3JB2KURNOZMBPHRLCY","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":"8c5d4df81d5b19e23315e78c62522f4a5bf5bb6fb84d96b194a21c2c20fc2238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-04T14:36:17Z","title_canon_sha256":"8b384c189154e39996df396f509e90b2a6ae1bd4b51e1605506d07e62914024f"},"schema_version":"1.0","source":{"id":"1309.1049","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1049","created_at":"2026-05-18T03:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1049v3","created_at":"2026-05-18T03:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1049","created_at":"2026-05-18T03:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"HMMLXUQW3JB2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HMMLXUQW3JB2KURN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HMMLXUQW","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:2f62303044235b566878d26ae352f19d6dc86ef6269dbf339fc05c1db5d0a5e8","target":"graph","created_at":"2026-05-18T03:13:45Z","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":"Many real-world systems, such as social networks, rely on mining efficiently large graphs, with hundreds of millions of vertices and edges. This volume of information requires partitioning the graph across multiple nodes in a distributed system. This has a deep effect on performance, as traversing edges cut between partitions incurs a significant performance penalty due to the cost of communication. Thus, several systems in the literature have attempted to improve computational performance by enhancing graph partitioning, but they do not support another characteristic of real-world graphs: gra","authors_text":"Claudio Martella, Dionysios Logothetis, Felix Cuadrado, Luis Vaquero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-04T14:36:17Z","title":"xDGP: A Dynamic Graph Processing System with Adaptive Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1049","kind":"arxiv","version":3},"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:997433ee6764fb31f86eade45c4dbc89e98452611e8d0b8194be6b5357a198ba","target":"record","created_at":"2026-05-18T03:13:45Z","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":"8c5d4df81d5b19e23315e78c62522f4a5bf5bb6fb84d96b194a21c2c20fc2238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-04T14:36:17Z","title_canon_sha256":"8b384c189154e39996df396f509e90b2a6ae1bd4b51e1605506d07e62914024f"},"schema_version":"1.0","source":{"id":"1309.1049","kind":"arxiv","version":3}},"canonical_sha256":"3b18bbd216da43a5522d7658179e2b160f2caa4ad00698e9ecc3cf0004d2abd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b18bbd216da43a5522d7658179e2b160f2caa4ad00698e9ecc3cf0004d2abd1","first_computed_at":"2026-05-18T03:13:45.268092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:45.268092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yWQA+13VCA8G2REMhDcPyVqzfpMLgwXOooxtI6gvnj6/tECgFBDFjyfvaDAjsLUYpnds335zqdc+hsi35ZP7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:45.268617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1049","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:997433ee6764fb31f86eade45c4dbc89e98452611e8d0b8194be6b5357a198ba","sha256:2f62303044235b566878d26ae352f19d6dc86ef6269dbf339fc05c1db5d0a5e8"],"state_sha256":"3846aafb405fc4308e012f6252950cb4f9bfe366900b489806ced65f907a9eb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvvO/2dYaHWldeWcrzlTKDOjYTVkEnBR1xH2MUc3R5yV+FXAyp/uuUbkHRPKPp/x+OFQiYye9J64zr6vWUrxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:30:23.609136Z","bundle_sha256":"3db759853edb93a657e912235dfa877a1c06717c4ca92a80bb92d10efafa9125"}}