{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OTF2DVXJPYJ7RBVOVZFCG2D5DF","short_pith_number":"pith:OTF2DVXJ","canonical_record":{"source":{"id":"1703.10628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-30T18:26:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"97c946efbefb01f4581d4264da4b42b65dcabad2ab79986a74c4ed29138601aa","abstract_canon_sha256":"8bcb5a6ce27f71a34aade6d60759aa7d0a758851157ada34fd8c45eaeccb17db"},"schema_version":"1.0"},"canonical_sha256":"74cba1d6e97e13f886aeae4a23687d196ad56336318b02892942ca11868c9dfe","source":{"kind":"arxiv","id":"1703.10628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10628","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10628v1","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10628","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"pith_short_12","alias_value":"OTF2DVXJPYJ7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OTF2DVXJPYJ7RBVO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OTF2DVXJ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OTF2DVXJPYJ7RBVOVZFCG2D5DF","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-30T18:26:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"97c946efbefb01f4581d4264da4b42b65dcabad2ab79986a74c4ed29138601aa","abstract_canon_sha256":"8bcb5a6ce27f71a34aade6d60759aa7d0a758851157ada34fd8c45eaeccb17db"},"schema_version":"1.0"},"canonical_sha256":"74cba1d6e97e13f886aeae4a23687d196ad56336318b02892942ca11868c9dfe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:33.133251Z","signature_b64":"h/uTOBEZmHBnA34JLRY1DlhkT3XmwDQcvkRP/HNzoyaVN55PENu0l3J7b0ATrxlC9Bo+8LQEL1TaeCXwFjqWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74cba1d6e97e13f886aeae4a23687d196ad56336318b02892942ca11868c9dfe","last_reissued_at":"2026-05-18T00:47:33.132547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:33.132547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10628","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:47:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JNlXq51bq4/pti9WqKEynypLXSH8mffOvvJ3RXFExhK8yXma9XHYjNKaZAAkm7L5FB6/hI4fHw3U59QX5pwdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:39.539600Z"},"content_sha256":"3b02cb45753e0f9a41ff971eb1c6e2efd5cdc04c9a1a71f402b85dcb5ebaf64f","schema_version":"1.0","event_id":"sha256:3b02cb45753e0f9a41ff971eb1c6e2efd5cdc04c9a1a71f402b85dcb5ebaf64f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OTF2DVXJPYJ7RBVOVZFCG2D5DF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study on Resource Efficiency of Distributed Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexandre P. Francisco, Luis Veiga, Miguel E. Coimbra","submitted_at":"2017-03-30T18:26:53Z","abstract_excerpt":"Graphs may be used to represent many different problem domains -- a concrete example is that of detecting communities in social networks, which are represented as graphs. With big data and more sophisticated applications becoming widespread in recent years, graph processing has seen an emergence of requirements pertaining data volume and volatility. This multidisciplinary study presents a review of relevant distributed graph processing systems. Herein they are presented in groups defined by common traits (distributed processing paradigm, type of graph operations, among others), with an overvie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10628","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:47:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9r8A8qhgMreU3FbsUBqnZ/HwWzl/O0TyMstzFhSSgE+Obd9uKHc3JRLMkQLOI1nDYNNlGNVhIInZesncsZHrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:39.540066Z"},"content_sha256":"d0874f5ccaf5ba0b68d6abe5c4b2a147295aa558f8689575656c17f2cb0ca645","schema_version":"1.0","event_id":"sha256:d0874f5ccaf5ba0b68d6abe5c4b2a147295aa558f8689575656c17f2cb0ca645"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTF2DVXJPYJ7RBVOVZFCG2D5DF/bundle.json","state_url":"https://pith.science/pith/OTF2DVXJPYJ7RBVOVZFCG2D5DF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTF2DVXJPYJ7RBVOVZFCG2D5DF/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-30T22:44:39Z","links":{"resolver":"https://pith.science/pith/OTF2DVXJPYJ7RBVOVZFCG2D5DF","bundle":"https://pith.science/pith/OTF2DVXJPYJ7RBVOVZFCG2D5DF/bundle.json","state":"https://pith.science/pith/OTF2DVXJPYJ7RBVOVZFCG2D5DF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTF2DVXJPYJ7RBVOVZFCG2D5DF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OTF2DVXJPYJ7RBVOVZFCG2D5DF","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":"8bcb5a6ce27f71a34aade6d60759aa7d0a758851157ada34fd8c45eaeccb17db","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-30T18:26:53Z","title_canon_sha256":"97c946efbefb01f4581d4264da4b42b65dcabad2ab79986a74c4ed29138601aa"},"schema_version":"1.0","source":{"id":"1703.10628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10628","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10628v1","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10628","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"pith_short_12","alias_value":"OTF2DVXJPYJ7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OTF2DVXJPYJ7RBVO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OTF2DVXJ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:d0874f5ccaf5ba0b68d6abe5c4b2a147295aa558f8689575656c17f2cb0ca645","target":"graph","created_at":"2026-05-18T00:47:33Z","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":"Graphs may be used to represent many different problem domains -- a concrete example is that of detecting communities in social networks, which are represented as graphs. With big data and more sophisticated applications becoming widespread in recent years, graph processing has seen an emergence of requirements pertaining data volume and volatility. This multidisciplinary study presents a review of relevant distributed graph processing systems. Herein they are presented in groups defined by common traits (distributed processing paradigm, type of graph operations, among others), with an overvie","authors_text":"Alexandre P. Francisco, Luis Veiga, Miguel E. Coimbra","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-30T18:26:53Z","title":"Study on Resource Efficiency of Distributed Graph Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10628","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:3b02cb45753e0f9a41ff971eb1c6e2efd5cdc04c9a1a71f402b85dcb5ebaf64f","target":"record","created_at":"2026-05-18T00:47:33Z","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":"8bcb5a6ce27f71a34aade6d60759aa7d0a758851157ada34fd8c45eaeccb17db","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-30T18:26:53Z","title_canon_sha256":"97c946efbefb01f4581d4264da4b42b65dcabad2ab79986a74c4ed29138601aa"},"schema_version":"1.0","source":{"id":"1703.10628","kind":"arxiv","version":1}},"canonical_sha256":"74cba1d6e97e13f886aeae4a23687d196ad56336318b02892942ca11868c9dfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74cba1d6e97e13f886aeae4a23687d196ad56336318b02892942ca11868c9dfe","first_computed_at":"2026-05-18T00:47:33.132547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:33.132547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h/uTOBEZmHBnA34JLRY1DlhkT3XmwDQcvkRP/HNzoyaVN55PENu0l3J7b0ATrxlC9Bo+8LQEL1TaeCXwFjqWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:33.133251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b02cb45753e0f9a41ff971eb1c6e2efd5cdc04c9a1a71f402b85dcb5ebaf64f","sha256:d0874f5ccaf5ba0b68d6abe5c4b2a147295aa558f8689575656c17f2cb0ca645"],"state_sha256":"ed16079c65bf522d5f004ef5c684361b7169e02ac6c72fa47312b3c1757018fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OifPHDTeXE7y9YXI0pSIy8BcFVuRNYtuswbWmMWA0Trqlx1LsDYgk704Gl33nw21ee4OmjiBganjdiR92BRcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:44:39.543185Z","bundle_sha256":"8a845e434c932f6722587df4348b83e87a06ffe169a4b6f8277e0ff98a02d458"}}