{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NYP6UXRTMGMMLZ67M2MKT5D2JL","short_pith_number":"pith:NYP6UXRT","canonical_record":{"source":{"id":"1808.06411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-20T12:09:31Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"268f092b8fcf2e9218f3e214424f3e75ca95b76a727814f2748b60416f81e550","abstract_canon_sha256":"f4fde4b9618e770b81710af635478fc533f605541f9e3a7cf60569a1f14981b3"},"schema_version":"1.0"},"canonical_sha256":"6e1fea5e336198c5e7df6698a9f47a4acf5c6a8ce4a2a3b1de0844cc1364c791","source":{"kind":"arxiv","id":"1808.06411","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06411","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06411v2","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06411","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"NYP6UXRTMGMM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NYP6UXRTMGMMLZ67","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NYP6UXRT","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NYP6UXRTMGMMLZ67M2MKT5D2JL","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-20T12:09:31Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"268f092b8fcf2e9218f3e214424f3e75ca95b76a727814f2748b60416f81e550","abstract_canon_sha256":"f4fde4b9618e770b81710af635478fc533f605541f9e3a7cf60569a1f14981b3"},"schema_version":"1.0"},"canonical_sha256":"6e1fea5e336198c5e7df6698a9f47a4acf5c6a8ce4a2a3b1de0844cc1364c791","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:36.578295Z","signature_b64":"vrnYc7V3fJqXXhc0tyQkkm71yxojoaHMxtQs3UFSEwBJbGSrNVCb4pFqHEbqgGk9Sr7myD894/KF2N83f+TBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e1fea5e336198c5e7df6698a9f47a4acf5c6a8ce4a2a3b1de0844cc1364c791","last_reissued_at":"2026-05-18T00:03:36.577503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:36.577503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06411","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:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxlrk3sDGCnETiEYm+vjEZJOqA6CpBY8q2/QDX44I8O7jHWPZAg/pE2UbvMSoMpl0zYFpAHF70n5iXkuG8W5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:31:15.704212Z"},"content_sha256":"c7a17637b7cb0a3731fc84d8a08d7c18274eacc6a8b9185f9e94fff8d7ebff15","schema_version":"1.0","event_id":"sha256:c7a17637b7cb0a3731fc84d8a08d7c18274eacc6a8b9185f9e94fff8d7ebff15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NYP6UXRTMGMMLZ67M2MKT5D2JL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Edge Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Daniel Seemaier, Darren Strash, Sebastian Schlag","submitted_at":"2018-08-20T12:09:31Z","abstract_excerpt":"Edge-centric distributed computations have appeared as a recent technique to improve the shortcomings of think-like-a-vertex algorithms on large scale-free networks. In order to increase parallelism on this model, edge partitioning - partitioning edges into roughly equally sized blocks - has emerged as an alternative to traditional (node-based) graph partitioning. In this work, we give a distributed memory parallel algorithm to compute high-quality edge partitions in a scalable way. Our algorithm scales to networks with billions of edges, and runs efficiently on thousands of PEs. Our technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06411","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:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFA9kLL0dZ63tRx1fjCokPNP10/+ULhCQ7+ToF8FfsxA542ekYt7hlB+dslm5LM11Y0VD2Xax32IGyRdz46zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:31:15.704836Z"},"content_sha256":"76406bc304ac737e49b2f5c400bd34842d502207dffe72d7071d4bdc7521179b","schema_version":"1.0","event_id":"sha256:76406bc304ac737e49b2f5c400bd34842d502207dffe72d7071d4bdc7521179b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYP6UXRTMGMMLZ67M2MKT5D2JL/bundle.json","state_url":"https://pith.science/pith/NYP6UXRTMGMMLZ67M2MKT5D2JL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYP6UXRTMGMMLZ67M2MKT5D2JL/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:31:15Z","links":{"resolver":"https://pith.science/pith/NYP6UXRTMGMMLZ67M2MKT5D2JL","bundle":"https://pith.science/pith/NYP6UXRTMGMMLZ67M2MKT5D2JL/bundle.json","state":"https://pith.science/pith/NYP6UXRTMGMMLZ67M2MKT5D2JL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYP6UXRTMGMMLZ67M2MKT5D2JL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NYP6UXRTMGMMLZ67M2MKT5D2JL","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":"f4fde4b9618e770b81710af635478fc533f605541f9e3a7cf60569a1f14981b3","cross_cats_sorted":["cs.DC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-20T12:09:31Z","title_canon_sha256":"268f092b8fcf2e9218f3e214424f3e75ca95b76a727814f2748b60416f81e550"},"schema_version":"1.0","source":{"id":"1808.06411","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06411","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06411v2","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06411","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"NYP6UXRTMGMM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NYP6UXRTMGMMLZ67","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NYP6UXRT","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:76406bc304ac737e49b2f5c400bd34842d502207dffe72d7071d4bdc7521179b","target":"graph","created_at":"2026-05-18T00:03:36Z","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":"Edge-centric distributed computations have appeared as a recent technique to improve the shortcomings of think-like-a-vertex algorithms on large scale-free networks. In order to increase parallelism on this model, edge partitioning - partitioning edges into roughly equally sized blocks - has emerged as an alternative to traditional (node-based) graph partitioning. In this work, we give a distributed memory parallel algorithm to compute high-quality edge partitions in a scalable way. Our algorithm scales to networks with billions of edges, and runs efficiently on thousands of PEs. Our technique","authors_text":"Christian Schulz, Daniel Seemaier, Darren Strash, Sebastian Schlag","cross_cats":["cs.DC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-20T12:09:31Z","title":"Scalable Edge Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06411","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:c7a17637b7cb0a3731fc84d8a08d7c18274eacc6a8b9185f9e94fff8d7ebff15","target":"record","created_at":"2026-05-18T00:03:36Z","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":"f4fde4b9618e770b81710af635478fc533f605541f9e3a7cf60569a1f14981b3","cross_cats_sorted":["cs.DC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-20T12:09:31Z","title_canon_sha256":"268f092b8fcf2e9218f3e214424f3e75ca95b76a727814f2748b60416f81e550"},"schema_version":"1.0","source":{"id":"1808.06411","kind":"arxiv","version":2}},"canonical_sha256":"6e1fea5e336198c5e7df6698a9f47a4acf5c6a8ce4a2a3b1de0844cc1364c791","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e1fea5e336198c5e7df6698a9f47a4acf5c6a8ce4a2a3b1de0844cc1364c791","first_computed_at":"2026-05-18T00:03:36.577503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:36.577503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vrnYc7V3fJqXXhc0tyQkkm71yxojoaHMxtQs3UFSEwBJbGSrNVCb4pFqHEbqgGk9Sr7myD894/KF2N83f+TBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:36.578295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06411","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7a17637b7cb0a3731fc84d8a08d7c18274eacc6a8b9185f9e94fff8d7ebff15","sha256:76406bc304ac737e49b2f5c400bd34842d502207dffe72d7071d4bdc7521179b"],"state_sha256":"03117a1807e2b7253345f8ed479457e41d17f132c93e01ef88adc2647dd9ae63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxr1weQYdJAmAUChCsrdEMz4Rg5qDWDlnl8x9Y+38kFuhOeS+cS3iTBAfbAIpnPNOmy4fwqJhRBUpfmzbl94Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:31:15.707980Z","bundle_sha256":"dfda829c7795edbaf256205a2589b5de628d840fed7edba2a15f16aa57cb97f4"}}