{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2KK4HXMSV3A7LYYGVBZ7JRJ2WD","short_pith_number":"pith:2KK4HXMS","canonical_record":{"source":{"id":"1704.02003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T19:48:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"efa61dc37029896c0cb3c756fcf2358fc74948c7bb9478e230e50edda9115fd9","abstract_canon_sha256":"e4009c6fa1d002f4369a96bc18a5f3bcef153b48af7e12235a42b9dabdf208f9"},"schema_version":"1.0"},"canonical_sha256":"d295c3dd92aec1f5e306a873f4c53ab0cd01c1b8a4d297bd4921218de4501318","source":{"kind":"arxiv","id":"1704.02003","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02003","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02003v2","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02003","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"2KK4HXMSV3A7","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KK4HXMSV3A7LYYG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KK4HXMS","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2KK4HXMSV3A7LYYGVBZ7JRJ2WD","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T19:48:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"efa61dc37029896c0cb3c756fcf2358fc74948c7bb9478e230e50edda9115fd9","abstract_canon_sha256":"e4009c6fa1d002f4369a96bc18a5f3bcef153b48af7e12235a42b9dabdf208f9"},"schema_version":"1.0"},"canonical_sha256":"d295c3dd92aec1f5e306a873f4c53ab0cd01c1b8a4d297bd4921218de4501318","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.611857Z","signature_b64":"1m3wxwLBhQd+zBkm1oJ8rvnI9pXYO9sXBfBFMOjJr0cVoDZlIVb/a5ijyCmKz00BcjfLOFdAuPSJp3XprDhICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d295c3dd92aec1f5e306a873f4c53ab0cd01c1b8a4d297bd4921218de4501318","last_reissued_at":"2026-05-18T00:44:19.611442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.611442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02003","source_version":2,"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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6UihLkgfOeUaEIIZ3wJKdIMs3cVjkku2tlU2Yo/woTiRdUOsxrEN+sQjRVZwjxNK8it3+dWPempkPKAi0FyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:13:20.630752Z"},"content_sha256":"0744bc43793a7ce4dbf8fd05c23b681efee8140c23915cd36b7a14220f0905c3","schema_version":"1.0","event_id":"sha256:0744bc43793a7ce4dbf8fd05c23b681efee8140c23915cd36b7a14220f0905c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2KK4HXMSV3A7LYYGVBZ7JRJ2WD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comparison of Parallel Graph Processing Implementations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Boyana Norris, Samuel Pollard","submitted_at":"2017-04-06T19:48:37Z","abstract_excerpt":"The rapidly growing number of large network analysis problems has led to the emergence of many parallel and distributed graph processing systems---one survey in 2014 identified over 80. Since then, the landscape has evolved; some packages have become inactive while more are being developed. Determining the best approach for a given problem is infeasible for most developers. To enable easy, rigorous, and repeatable comparison of the capabilities of such systems, we present an approach and associated software for analyzing the performance and scalability of parallel, open-source graph libraries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02003","kind":"arxiv","version":2},"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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmWIlsaCyW+BuTtDCGMJ+aA615Flye8S7jYWdkxyxZD+xzgpnuc+4QwvdD1JlqfkOmxJFKad8LUMhfClboZ1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:13:20.631089Z"},"content_sha256":"9d4b97397052279321b24b26e436f23164f474b3365e1f4be2743a78645219a9","schema_version":"1.0","event_id":"sha256:9d4b97397052279321b24b26e436f23164f474b3365e1f4be2743a78645219a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KK4HXMSV3A7LYYGVBZ7JRJ2WD/bundle.json","state_url":"https://pith.science/pith/2KK4HXMSV3A7LYYGVBZ7JRJ2WD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KK4HXMSV3A7LYYGVBZ7JRJ2WD/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-27T18:13:20Z","links":{"resolver":"https://pith.science/pith/2KK4HXMSV3A7LYYGVBZ7JRJ2WD","bundle":"https://pith.science/pith/2KK4HXMSV3A7LYYGVBZ7JRJ2WD/bundle.json","state":"https://pith.science/pith/2KK4HXMSV3A7LYYGVBZ7JRJ2WD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KK4HXMSV3A7LYYGVBZ7JRJ2WD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2KK4HXMSV3A7LYYGVBZ7JRJ2WD","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":"e4009c6fa1d002f4369a96bc18a5f3bcef153b48af7e12235a42b9dabdf208f9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T19:48:37Z","title_canon_sha256":"efa61dc37029896c0cb3c756fcf2358fc74948c7bb9478e230e50edda9115fd9"},"schema_version":"1.0","source":{"id":"1704.02003","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02003","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02003v2","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02003","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"2KK4HXMSV3A7","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KK4HXMSV3A7LYYG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KK4HXMS","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:9d4b97397052279321b24b26e436f23164f474b3365e1f4be2743a78645219a9","target":"graph","created_at":"2026-05-18T00:44:19Z","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":"The rapidly growing number of large network analysis problems has led to the emergence of many parallel and distributed graph processing systems---one survey in 2014 identified over 80. Since then, the landscape has evolved; some packages have become inactive while more are being developed. Determining the best approach for a given problem is infeasible for most developers. To enable easy, rigorous, and repeatable comparison of the capabilities of such systems, we present an approach and associated software for analyzing the performance and scalability of parallel, open-source graph libraries.","authors_text":"Boyana Norris, Samuel Pollard","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T19:48:37Z","title":"A Comparison of Parallel Graph Processing Implementations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02003","kind":"arxiv","version":2},"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:0744bc43793a7ce4dbf8fd05c23b681efee8140c23915cd36b7a14220f0905c3","target":"record","created_at":"2026-05-18T00:44:19Z","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":"e4009c6fa1d002f4369a96bc18a5f3bcef153b48af7e12235a42b9dabdf208f9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T19:48:37Z","title_canon_sha256":"efa61dc37029896c0cb3c756fcf2358fc74948c7bb9478e230e50edda9115fd9"},"schema_version":"1.0","source":{"id":"1704.02003","kind":"arxiv","version":2}},"canonical_sha256":"d295c3dd92aec1f5e306a873f4c53ab0cd01c1b8a4d297bd4921218de4501318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d295c3dd92aec1f5e306a873f4c53ab0cd01c1b8a4d297bd4921218de4501318","first_computed_at":"2026-05-18T00:44:19.611442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:19.611442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1m3wxwLBhQd+zBkm1oJ8rvnI9pXYO9sXBfBFMOjJr0cVoDZlIVb/a5ijyCmKz00BcjfLOFdAuPSJp3XprDhICg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:19.611857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02003","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0744bc43793a7ce4dbf8fd05c23b681efee8140c23915cd36b7a14220f0905c3","sha256:9d4b97397052279321b24b26e436f23164f474b3365e1f4be2743a78645219a9"],"state_sha256":"d29a5bb3f60311a9bb8e6e05b96b5ffb6e93cacc1576f3048595f3be7e1e0181"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tvbq2pKYqoaNEh+OKXlI/9UDm0LydZBzl17uzRWsvguufb8mnp7m4aG3XYH27FXvn6gk/ER+7N6P+mYkL5nmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:13:20.633163Z","bundle_sha256":"68341c9016a891452863e5bce86f968b00d06c37d0d874c0064c379562750047"}}