{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FSKFG5PZQ2CS6W2CGZLNVVWMRZ","short_pith_number":"pith:FSKFG5PZ","schema_version":"1.0","canonical_sha256":"2c945375f986852f5b423656dad6cc8e4596cf5f24e37ab02676d601b0151827","source":{"kind":"arxiv","id":"1702.01692","version":1},"attestation_state":"computed","paper":{"title":"Distributed Evolutionary k-way Node Separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.NE","authors_text":"Christian Schulz, Darren Strash, Peter Sanders, Robert Williger","submitted_at":"2017-02-06T16:34:27Z","abstract_excerpt":"Computing high quality node separators in large graphs is necessary for a variety of applications, ranging from divide-and-conquer algorithms to VLSI design. In this work, we present a novel distributed evolutionary algorithm tackling the k-way node separator problem. A key component of our contribution includes new k-way local search algorithms based on maximum flows. We combine our local search with a multilevel approach to compute an initial population for our evolutionary algorithm, and further show how to modify the coarsening stage of our multilevel algorithm to create effective combine "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.01692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-06T16:34:27Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"6b36f11308e02be8acc9222c28d93abc885fb43b6076878c645d2539475dfd18","abstract_canon_sha256":"eb702995c8e573eb7301f9c276833d8269c1f93cddc0954d79654113c5648f9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:19.861176Z","signature_b64":"c70gF2FtOtDACpr7cqiUR8w900c+0YnSYhYehbzTxWTwKbhgpgsqGcCeDDaAeCJJ0iwSBJYt1LTI23YezEPgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c945375f986852f5b423656dad6cc8e4596cf5f24e37ab02676d601b0151827","last_reissued_at":"2026-05-18T00:51:19.860361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:19.860361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Evolutionary k-way Node Separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.NE","authors_text":"Christian Schulz, Darren Strash, Peter Sanders, Robert Williger","submitted_at":"2017-02-06T16:34:27Z","abstract_excerpt":"Computing high quality node separators in large graphs is necessary for a variety of applications, ranging from divide-and-conquer algorithms to VLSI design. In this work, we present a novel distributed evolutionary algorithm tackling the k-way node separator problem. A key component of our contribution includes new k-way local search algorithms based on maximum flows. We combine our local search with a multilevel approach to compute an initial population for our evolutionary algorithm, and further show how to modify the coarsening stage of our multilevel algorithm to create effective combine "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01692","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.01692","created_at":"2026-05-18T00:51:19.860510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01692v1","created_at":"2026-05-18T00:51:19.860510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01692","created_at":"2026-05-18T00:51:19.860510+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSKFG5PZQ2CS","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSKFG5PZQ2CS6W2C","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSKFG5PZ","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ","json":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ.json","graph_json":"https://pith.science/api/pith-number/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/graph.json","events_json":"https://pith.science/api/pith-number/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/events.json","paper":"https://pith.science/paper/FSKFG5PZ"},"agent_actions":{"view_html":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ","download_json":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ.json","view_paper":"https://pith.science/paper/FSKFG5PZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01692&json=true","fetch_graph":"https://pith.science/api/pith-number/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/action/storage_attestation","attest_author":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/action/author_attestation","sign_citation":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/action/citation_signature","submit_replication":"https://pith.science/pith/FSKFG5PZQ2CS6W2CGZLNVVWMRZ/action/replication_record"}},"created_at":"2026-05-18T00:51:19.860510+00:00","updated_at":"2026-05-18T00:51:19.860510+00:00"}