{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KW5G27FW2TDMDNDZN6772DKO7O","short_pith_number":"pith:KW5G27FW","schema_version":"1.0","canonical_sha256":"55ba6d7cb6d4c6c1b4796fbffd0d4efbb3fa3a62e0ba9a73240be46055408537","source":{"kind":"arxiv","id":"1210.0477","version":1},"attestation_state":"computed","paper":{"title":"Think Locally, Act Globally: Perfectly Balanced Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NE"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Peter Sanders","submitted_at":"2012-10-01T17:30:47Z","abstract_excerpt":"We present a novel local improvement scheme for the perfectly balanced graph partitioning problem. This scheme encodes local searches that are not restricted to a balance constraint into a model allowing us to find combinations of these searches maintaining balance by applying a negative cycle detection algorithm. We combine this technique with an algorithm to balance unbalanced solutions and integrate it into a parallel multi-level evolutionary algorithm, KaFFPaE, to tackle the problem. Overall, we obtain a system that is fast on the one hand and on the other hand is able to improve or reprod"},"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":"1210.0477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-01T17:30:47Z","cross_cats_sorted":["cs.DC","cs.NE"],"title_canon_sha256":"e93ae77d84991e057b18e05290d044a60bc5251d5e74519f8f0f7b43587193ea","abstract_canon_sha256":"0126f19f1c3fea9e8ee1109af3ff3fcb8e52170b13dadfbf3d7d1857d3df6705"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:22.363070Z","signature_b64":"S2Wl1FPCeSHSAPqU4NlGYPb/PLfHIOL2fMINojiM1ln/FUVtFRBJtqUa3O/JNbacWjb8MMlAUJH8pLnQS9hkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55ba6d7cb6d4c6c1b4796fbffd0d4efbb3fa3a62e0ba9a73240be46055408537","last_reissued_at":"2026-05-18T03:44:22.362280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:22.362280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Think Locally, Act Globally: Perfectly Balanced Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NE"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Peter Sanders","submitted_at":"2012-10-01T17:30:47Z","abstract_excerpt":"We present a novel local improvement scheme for the perfectly balanced graph partitioning problem. This scheme encodes local searches that are not restricted to a balance constraint into a model allowing us to find combinations of these searches maintaining balance by applying a negative cycle detection algorithm. We combine this technique with an algorithm to balance unbalanced solutions and integrate it into a parallel multi-level evolutionary algorithm, KaFFPaE, to tackle the problem. Overall, we obtain a system that is fast on the one hand and on the other hand is able to improve or reprod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.0477","created_at":"2026-05-18T03:44:22.362419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0477v1","created_at":"2026-05-18T03:44:22.362419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0477","created_at":"2026-05-18T03:44:22.362419+00:00"},{"alias_kind":"pith_short_12","alias_value":"KW5G27FW2TDM","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KW5G27FW2TDMDNDZ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KW5G27FW","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10602","citing_title":"Pyramid: A General Framework for Distributed Similarity Search","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O","json":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O.json","graph_json":"https://pith.science/api/pith-number/KW5G27FW2TDMDNDZN6772DKO7O/graph.json","events_json":"https://pith.science/api/pith-number/KW5G27FW2TDMDNDZN6772DKO7O/events.json","paper":"https://pith.science/paper/KW5G27FW"},"agent_actions":{"view_html":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O","download_json":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O.json","view_paper":"https://pith.science/paper/KW5G27FW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0477&json=true","fetch_graph":"https://pith.science/api/pith-number/KW5G27FW2TDMDNDZN6772DKO7O/graph.json","fetch_events":"https://pith.science/api/pith-number/KW5G27FW2TDMDNDZN6772DKO7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O/action/storage_attestation","attest_author":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O/action/author_attestation","sign_citation":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O/action/citation_signature","submit_replication":"https://pith.science/pith/KW5G27FW2TDMDNDZN6772DKO7O/action/replication_record"}},"created_at":"2026-05-18T03:44:22.362419+00:00","updated_at":"2026-05-18T03:44:22.362419+00:00"}