{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4NJICM4NO6PRT6NJ2N6PSHMOUN","short_pith_number":"pith:4NJICM4N","canonical_record":{"source":{"id":"1701.00546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-02T22:25:33Z","cross_cats_sorted":[],"title_canon_sha256":"dae9d9204e151c90e725635dbc9b137429b1502751e323263dc80e33f765bf16","abstract_canon_sha256":"54778634c2483918d3e8e84cfa4117b0a41d4ff959641b17de2da636028926be"},"schema_version":"1.0"},"canonical_sha256":"e35281338d779f19f9a9d37cf91d8ea3432b22c8140e8c20aeaa0ef8a7884c14","source":{"kind":"arxiv","id":"1701.00546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00546","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00546v1","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00546","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"4NJICM4NO6PR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NJICM4NO6PRT6NJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NJICM4N","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4NJICM4NO6PRT6NJ2N6PSHMOUN","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-02T22:25:33Z","cross_cats_sorted":[],"title_canon_sha256":"dae9d9204e151c90e725635dbc9b137429b1502751e323263dc80e33f765bf16","abstract_canon_sha256":"54778634c2483918d3e8e84cfa4117b0a41d4ff959641b17de2da636028926be"},"schema_version":"1.0"},"canonical_sha256":"e35281338d779f19f9a9d37cf91d8ea3432b22c8140e8c20aeaa0ef8a7884c14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:50.852346Z","signature_b64":"GrSPJVOIcy8MFjvBdommhbwFAskO27E3oWa6OxL/Qod8snfNkRw89dZCwNAFxt7G4FXnt1SFcIabLW14PrbyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e35281338d779f19f9a9d37cf91d8ea3432b22c8140e8c20aeaa0ef8a7884c14","last_reissued_at":"2026-05-18T00:16:50.851474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:50.851474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00546","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-18T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/YXVg1Ly/nXwHWBhebfSNwE0X9XsmFJmkXVC/4EdNLZxBJLAi+B2zhWg/9ObGZx2UnfmcN8jSeTZr7aoVY1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:04:23.382160Z"},"content_sha256":"acbd4f37c8f15572ea104ce1e6e20b1a755a92720ae4a7fdd5ba9004b2917a78","schema_version":"1.0","event_id":"sha256:acbd4f37c8f15572ea104ce1e6e20b1a755a92720ae4a7fdd5ba9004b2917a78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4NJICM4NO6PRT6NJ2N6PSHMOUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BLADYG: A Graph Processing Framework for Large Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alberto Montresor, Sabeur Aridhi, Yannis Velegrakis","submitted_at":"2017-01-02T22:25:33Z","abstract_excerpt":"Recently, distributed processing of large dynamic graphs has become very popular, especially in certain domains such as social network analysis, Web graph analysis and spatial network analysis. In this context, many distributed/parallel graph processing systems have been proposed, such as Pregel, GraphLab, and Trinity. These systems can be divided into two categories: (1) vertex-centric and (2) block-centric approaches. In vertex-centric approaches, each vertex corresponds to a process, and message are exchanged among vertices. In block-centric approaches, the unit of computation is a block, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00546","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-18T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oQAhOSRevtxLxRSTtAtm/GkJdPjFXWudkoLO30r+kb02qS2SOiYd19Qxro5jT8bxc179lv4CJ9p2zk1M6o8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:04:23.382865Z"},"content_sha256":"7af4875cf0b7767428ead1f31fb29fd111777c12e09930905cdfb5f4f059dddd","schema_version":"1.0","event_id":"sha256:7af4875cf0b7767428ead1f31fb29fd111777c12e09930905cdfb5f4f059dddd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/bundle.json","state_url":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/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-27T13:04:23Z","links":{"resolver":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN","bundle":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/bundle.json","state":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4NJICM4NO6PRT6NJ2N6PSHMOUN","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":"54778634c2483918d3e8e84cfa4117b0a41d4ff959641b17de2da636028926be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-02T22:25:33Z","title_canon_sha256":"dae9d9204e151c90e725635dbc9b137429b1502751e323263dc80e33f765bf16"},"schema_version":"1.0","source":{"id":"1701.00546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00546","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00546v1","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00546","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"4NJICM4NO6PR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NJICM4NO6PRT6NJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NJICM4N","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:7af4875cf0b7767428ead1f31fb29fd111777c12e09930905cdfb5f4f059dddd","target":"graph","created_at":"2026-05-18T00:16:50Z","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":"Recently, distributed processing of large dynamic graphs has become very popular, especially in certain domains such as social network analysis, Web graph analysis and spatial network analysis. In this context, many distributed/parallel graph processing systems have been proposed, such as Pregel, GraphLab, and Trinity. These systems can be divided into two categories: (1) vertex-centric and (2) block-centric approaches. In vertex-centric approaches, each vertex corresponds to a process, and message are exchanged among vertices. In block-centric approaches, the unit of computation is a block, a","authors_text":"Alberto Montresor, Sabeur Aridhi, Yannis Velegrakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-02T22:25:33Z","title":"BLADYG: A Graph Processing Framework for Large Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00546","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:acbd4f37c8f15572ea104ce1e6e20b1a755a92720ae4a7fdd5ba9004b2917a78","target":"record","created_at":"2026-05-18T00:16:50Z","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":"54778634c2483918d3e8e84cfa4117b0a41d4ff959641b17de2da636028926be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-02T22:25:33Z","title_canon_sha256":"dae9d9204e151c90e725635dbc9b137429b1502751e323263dc80e33f765bf16"},"schema_version":"1.0","source":{"id":"1701.00546","kind":"arxiv","version":1}},"canonical_sha256":"e35281338d779f19f9a9d37cf91d8ea3432b22c8140e8c20aeaa0ef8a7884c14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e35281338d779f19f9a9d37cf91d8ea3432b22c8140e8c20aeaa0ef8a7884c14","first_computed_at":"2026-05-18T00:16:50.851474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:50.851474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GrSPJVOIcy8MFjvBdommhbwFAskO27E3oWa6OxL/Qod8snfNkRw89dZCwNAFxt7G4FXnt1SFcIabLW14PrbyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:50.852346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acbd4f37c8f15572ea104ce1e6e20b1a755a92720ae4a7fdd5ba9004b2917a78","sha256:7af4875cf0b7767428ead1f31fb29fd111777c12e09930905cdfb5f4f059dddd"],"state_sha256":"336ed42a8d7d14269b24dffca8f203611aed9ca8a4ea94cf4c46d9e464b908db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/tPmkYm0xQYU2tmN2a3XPZZuKeF0BIAlIzK5QIOsSRCJ/E0oeFfHvlErACNf89mLmFJiIIrn+NTmA4y9vW8GCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:04:23.386582Z","bundle_sha256":"f6878d8ac348414d6bc12fc55a2f48838dc4dd559b509e2afbdbcad04cb46280"}}