{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EIRGPMAB2YSJS7YMSNNZUQY4ZK","short_pith_number":"pith:EIRGPMAB","canonical_record":{"source":{"id":"1110.0477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-10-03T20:03:46Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9e3b95ff61f51dd8eb1aefbd0004eaa61787121d85287e2cb20ecb3627a5c2c3","abstract_canon_sha256":"14106c92b83581cfcc6d695720045ab100610afa2ad3745f30831788a4c73f46"},"schema_version":"1.0"},"canonical_sha256":"222267b001d624997f0c935b9a431cca9cc41325baf2a750212cd5dcbd6fc817","source":{"kind":"arxiv","id":"1110.0477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0477","created_at":"2026-05-18T04:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0477v1","created_at":"2026-05-18T04:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0477","created_at":"2026-05-18T04:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"EIRGPMAB2YSJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EIRGPMAB2YSJS7YM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EIRGPMAB","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EIRGPMAB2YSJS7YMSNNZUQY4ZK","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-10-03T20:03:46Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9e3b95ff61f51dd8eb1aefbd0004eaa61787121d85287e2cb20ecb3627a5c2c3","abstract_canon_sha256":"14106c92b83581cfcc6d695720045ab100610afa2ad3745f30831788a4c73f46"},"schema_version":"1.0"},"canonical_sha256":"222267b001d624997f0c935b9a431cca9cc41325baf2a750212cd5dcbd6fc817","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:49.608844Z","signature_b64":"Smv+JbLlnqS6rV8/7SJBEH27gGOVqf/2uPF0OslucPKJCXTegI+Z5vRxEYiH0FsOjXauO13prmBHLAkwvVkuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"222267b001d624997f0c935b9a431cca9cc41325baf2a750212cd5dcbd6fc817","last_reissued_at":"2026-05-18T04:11:49.608335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:49.608335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0477","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-18T04:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3AllGCU5RZ28OVDpp0ESFFPWar8dZyRkiPNJ71xZJCvd6CBdVqHJhCRkomy+U88nAO9PatcaHGd8Bocjh4hBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:16:15.958609Z"},"content_sha256":"eddee507b780bd242d91cbc5ba667ba1200216c750f8d95d30592124753f3491","schema_version":"1.0","event_id":"sha256:eddee507b780bd242d91cbc5ba667ba1200216c750f8d95d30592124753f3491"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EIRGPMAB2YSJS7YMSNNZUQY4ZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Evolutionary Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NE","authors_text":"Christian Schulz, Peter Sanders","submitted_at":"2011-10-03T20:03:46Z","abstract_excerpt":"We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw's well known benchmark tables we are able to improve or recompute 76% of entries for the tables with 1%, 3% and 5% im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0477","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-18T04:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5dl9/dGO07tb9ki+WsEcmzB/DAj77QAKGImmfTXDQe2+j7e+FsArdr7brWMUwcSseEi10C5Tlzq3FwsLSpQhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:16:15.958951Z"},"content_sha256":"8a3fd04a7a9d9b27e430fccd3bd0936de537c968ea14e2bfb5466c2e1234b2b7","schema_version":"1.0","event_id":"sha256:8a3fd04a7a9d9b27e430fccd3bd0936de537c968ea14e2bfb5466c2e1234b2b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIRGPMAB2YSJS7YMSNNZUQY4ZK/bundle.json","state_url":"https://pith.science/pith/EIRGPMAB2YSJS7YMSNNZUQY4ZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIRGPMAB2YSJS7YMSNNZUQY4ZK/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-28T08:16:15Z","links":{"resolver":"https://pith.science/pith/EIRGPMAB2YSJS7YMSNNZUQY4ZK","bundle":"https://pith.science/pith/EIRGPMAB2YSJS7YMSNNZUQY4ZK/bundle.json","state":"https://pith.science/pith/EIRGPMAB2YSJS7YMSNNZUQY4ZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIRGPMAB2YSJS7YMSNNZUQY4ZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EIRGPMAB2YSJS7YMSNNZUQY4ZK","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":"14106c92b83581cfcc6d695720045ab100610afa2ad3745f30831788a4c73f46","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-10-03T20:03:46Z","title_canon_sha256":"9e3b95ff61f51dd8eb1aefbd0004eaa61787121d85287e2cb20ecb3627a5c2c3"},"schema_version":"1.0","source":{"id":"1110.0477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0477","created_at":"2026-05-18T04:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0477v1","created_at":"2026-05-18T04:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0477","created_at":"2026-05-18T04:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"EIRGPMAB2YSJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EIRGPMAB2YSJS7YM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EIRGPMAB","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:8a3fd04a7a9d9b27e430fccd3bd0936de537c968ea14e2bfb5466c2e1234b2b7","target":"graph","created_at":"2026-05-18T04:11: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":"We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw's well known benchmark tables we are able to improve or recompute 76% of entries for the tables with 1%, 3% and 5% im","authors_text":"Christian Schulz, Peter Sanders","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-10-03T20:03:46Z","title":"Distributed Evolutionary Graph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0477","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:eddee507b780bd242d91cbc5ba667ba1200216c750f8d95d30592124753f3491","target":"record","created_at":"2026-05-18T04:11: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":"14106c92b83581cfcc6d695720045ab100610afa2ad3745f30831788a4c73f46","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-10-03T20:03:46Z","title_canon_sha256":"9e3b95ff61f51dd8eb1aefbd0004eaa61787121d85287e2cb20ecb3627a5c2c3"},"schema_version":"1.0","source":{"id":"1110.0477","kind":"arxiv","version":1}},"canonical_sha256":"222267b001d624997f0c935b9a431cca9cc41325baf2a750212cd5dcbd6fc817","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"222267b001d624997f0c935b9a431cca9cc41325baf2a750212cd5dcbd6fc817","first_computed_at":"2026-05-18T04:11:49.608335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:49.608335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Smv+JbLlnqS6rV8/7SJBEH27gGOVqf/2uPF0OslucPKJCXTegI+Z5vRxEYiH0FsOjXauO13prmBHLAkwvVkuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:49.608844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eddee507b780bd242d91cbc5ba667ba1200216c750f8d95d30592124753f3491","sha256:8a3fd04a7a9d9b27e430fccd3bd0936de537c968ea14e2bfb5466c2e1234b2b7"],"state_sha256":"5e656e791d4003279df17d30f4382311b8b73e07404a7bb7ed22a84d58329b58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JE96mP286gNJXikeC7JFn7/RWxmpBwFwQAuKl1+6NT1QvzIcy/gl2gNR4AGcBoTo39v38ebtxNBKmUMHa5JiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:16:15.960995Z","bundle_sha256":"1c54088a31c40c7ae361aa9a360606f70c771a8cc7fcfec032d03d062e342ed7"}}