{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4NJICM4NO6PRT6NJ2N6PSHMOUN","short_pith_number":"pith:4NJICM4N","schema_version":"1.0","canonical_sha256":"e35281338d779f19f9a9d37cf91d8ea3432b22c8140e8c20aeaa0ef8a7884c14","source":{"kind":"arxiv","id":"1701.00546","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.00546","created_at":"2026-05-18T00:16:50.851587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00546v1","created_at":"2026-05-18T00:16:50.851587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00546","created_at":"2026-05-18T00:16:50.851587+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NJICM4NO6PR","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NJICM4NO6PRT6NJ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NJICM4N","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN","json":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN.json","graph_json":"https://pith.science/api/pith-number/4NJICM4NO6PRT6NJ2N6PSHMOUN/graph.json","events_json":"https://pith.science/api/pith-number/4NJICM4NO6PRT6NJ2N6PSHMOUN/events.json","paper":"https://pith.science/paper/4NJICM4N"},"agent_actions":{"view_html":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN","download_json":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN.json","view_paper":"https://pith.science/paper/4NJICM4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00546&json=true","fetch_graph":"https://pith.science/api/pith-number/4NJICM4NO6PRT6NJ2N6PSHMOUN/graph.json","fetch_events":"https://pith.science/api/pith-number/4NJICM4NO6PRT6NJ2N6PSHMOUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/action/storage_attestation","attest_author":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/action/author_attestation","sign_citation":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/action/citation_signature","submit_replication":"https://pith.science/pith/4NJICM4NO6PRT6NJ2N6PSHMOUN/action/replication_record"}},"created_at":"2026-05-18T00:16:50.851587+00:00","updated_at":"2026-05-18T00:16:50.851587+00:00"}