{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LTNVJFUYBMQOJUIK2QIXHAKMPW","short_pith_number":"pith:LTNVJFUY","canonical_record":{"source":{"id":"1503.00626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-02T17:25:57Z","cross_cats_sorted":[],"title_canon_sha256":"55a3eda5b151d8ebfe96ad5af35d97322a611768a5c1f1b3858525c2748ad300","abstract_canon_sha256":"9302129b8c0864552d894fee6e2b129e80cb0f935248861399822f117903a37d"},"schema_version":"1.0"},"canonical_sha256":"5cdb5496980b20e4d10ad41173814c7d98e9623e43af641f91b1c47184f4b924","source":{"kind":"arxiv","id":"1503.00626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00626","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00626v1","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00626","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"LTNVJFUYBMQO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTNVJFUYBMQOJUIK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTNVJFUY","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LTNVJFUYBMQOJUIK2QIXHAKMPW","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-02T17:25:57Z","cross_cats_sorted":[],"title_canon_sha256":"55a3eda5b151d8ebfe96ad5af35d97322a611768a5c1f1b3858525c2748ad300","abstract_canon_sha256":"9302129b8c0864552d894fee6e2b129e80cb0f935248861399822f117903a37d"},"schema_version":"1.0"},"canonical_sha256":"5cdb5496980b20e4d10ad41173814c7d98e9623e43af641f91b1c47184f4b924","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:49.637386Z","signature_b64":"a8vlRMiohE7IqlS7UUHhulIgOE/TSIb5vijDqylRwZ5QKUY04VaKSYp8lWPcFbLaMNc0GYicMQQ5XHT+RTGIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cdb5496980b20e4d10ad41173814c7d98e9623e43af641f91b1c47184f4b924","last_reissued_at":"2026-05-18T02:25:49.636807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:49.636807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00626","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-18T02:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73xVOU2csKKHInpAkunENkwuL6Rw1Vvu9QiBQjMaAQGgfXI1jTlvnV+xiG2G/bNU4/xYbgwlw4IzynwlTOWODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:18:35.856076Z"},"content_sha256":"ae9f2fec680c8f879b82fcc0d72dad9913c4b867a017953d536067b3511997d9","schema_version":"1.0","event_id":"sha256:ae9f2fec680c8f879b82fcc0d72dad9913c4b867a017953d536067b3511997d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LTNVJFUYBMQOJUIK2QIXHAKMPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Da Yan, James Cheng, Wilfred Ng, Yi Lu","submitted_at":"2015-03-02T17:25:57Z","abstract_excerpt":"Massive graphs, such as online social networks and communication networks, have become common today. To efficiently analyze such large graphs, many distributed graph computing systems have been developed. These systems employ the \"think like a vertex\" programming paradigm, where a program proceeds in iterations and at each iteration, vertices exchange messages with each other. However, using Pregel's simple message passing mechanism, some vertices may send/receive significantly more messages than others due to either the high degree of these vertices or the logic of the algorithm used. This fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00626","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-18T02:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QrLtCtmF4/Lgho/U6N3W3LO5CV7RmxTulOGh5WDS0y8Lr5dK5sUJ8qo76rOdqP/6PrShninjZN4oDPVln7hHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:18:35.856437Z"},"content_sha256":"4cd7e13f390f01ad147899138b6e38ffd4958b5efb4b5f2e5c4386fa10930e04","schema_version":"1.0","event_id":"sha256:4cd7e13f390f01ad147899138b6e38ffd4958b5efb4b5f2e5c4386fa10930e04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTNVJFUYBMQOJUIK2QIXHAKMPW/bundle.json","state_url":"https://pith.science/pith/LTNVJFUYBMQOJUIK2QIXHAKMPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTNVJFUYBMQOJUIK2QIXHAKMPW/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-06T15:18:35Z","links":{"resolver":"https://pith.science/pith/LTNVJFUYBMQOJUIK2QIXHAKMPW","bundle":"https://pith.science/pith/LTNVJFUYBMQOJUIK2QIXHAKMPW/bundle.json","state":"https://pith.science/pith/LTNVJFUYBMQOJUIK2QIXHAKMPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTNVJFUYBMQOJUIK2QIXHAKMPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LTNVJFUYBMQOJUIK2QIXHAKMPW","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":"9302129b8c0864552d894fee6e2b129e80cb0f935248861399822f117903a37d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-02T17:25:57Z","title_canon_sha256":"55a3eda5b151d8ebfe96ad5af35d97322a611768a5c1f1b3858525c2748ad300"},"schema_version":"1.0","source":{"id":"1503.00626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00626","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00626v1","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00626","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"LTNVJFUYBMQO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTNVJFUYBMQOJUIK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTNVJFUY","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:4cd7e13f390f01ad147899138b6e38ffd4958b5efb4b5f2e5c4386fa10930e04","target":"graph","created_at":"2026-05-18T02:25:49Z","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":"Massive graphs, such as online social networks and communication networks, have become common today. To efficiently analyze such large graphs, many distributed graph computing systems have been developed. These systems employ the \"think like a vertex\" programming paradigm, where a program proceeds in iterations and at each iteration, vertices exchange messages with each other. However, using Pregel's simple message passing mechanism, some vertices may send/receive significantly more messages than others due to either the high degree of these vertices or the logic of the algorithm used. This fo","authors_text":"Da Yan, James Cheng, Wilfred Ng, Yi Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-02T17:25:57Z","title":"Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00626","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:ae9f2fec680c8f879b82fcc0d72dad9913c4b867a017953d536067b3511997d9","target":"record","created_at":"2026-05-18T02:25:49Z","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":"9302129b8c0864552d894fee6e2b129e80cb0f935248861399822f117903a37d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-02T17:25:57Z","title_canon_sha256":"55a3eda5b151d8ebfe96ad5af35d97322a611768a5c1f1b3858525c2748ad300"},"schema_version":"1.0","source":{"id":"1503.00626","kind":"arxiv","version":1}},"canonical_sha256":"5cdb5496980b20e4d10ad41173814c7d98e9623e43af641f91b1c47184f4b924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cdb5496980b20e4d10ad41173814c7d98e9623e43af641f91b1c47184f4b924","first_computed_at":"2026-05-18T02:25:49.636807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:49.636807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a8vlRMiohE7IqlS7UUHhulIgOE/TSIb5vijDqylRwZ5QKUY04VaKSYp8lWPcFbLaMNc0GYicMQQ5XHT+RTGIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:49.637386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae9f2fec680c8f879b82fcc0d72dad9913c4b867a017953d536067b3511997d9","sha256:4cd7e13f390f01ad147899138b6e38ffd4958b5efb4b5f2e5c4386fa10930e04"],"state_sha256":"af7a00b6b10fb24c9a83e01fac861814b8e0a3a150c0774893a5512ffc1fe79e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAPM41+IqyCZeiEQdaQPj3mzJAJBmcxPu52wYSbXGYjdf8rkQxiQgT9TS8HzCLa5ipjVejp/8GhA6FBO6BdfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:18:35.858900Z","bundle_sha256":"0ad297fb23a8b1754a4b74cd4f1264d06d50335263fa6355c7126927219f35f9"}}