{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:35N3ICZI6UPEHQMYCVXTRH2ZZO","short_pith_number":"pith:35N3ICZI","canonical_record":{"source":{"id":"1802.07144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T15:11:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"600b6ffb5ca67465c0b2b50d4c85a95721474de95fd6923606628c9a5495eea5","abstract_canon_sha256":"462aa7d92c5532a2661496468303419605dfc540fea5212d0e2af4eb62590959"},"schema_version":"1.0"},"canonical_sha256":"df5bb40b28f51e43c198156f389f59cbb42f6083930171ac8e5fc7abc6a58253","source":{"kind":"arxiv","id":"1802.07144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07144","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07144v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07144","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"35N3ICZI6UPE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35N3ICZI6UPEHQMY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35N3ICZI","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:35N3ICZI6UPEHQMYCVXTRH2ZZO","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T15:11:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"600b6ffb5ca67465c0b2b50d4c85a95721474de95fd6923606628c9a5495eea5","abstract_canon_sha256":"462aa7d92c5532a2661496468303419605dfc540fea5212d0e2af4eb62590959"},"schema_version":"1.0"},"canonical_sha256":"df5bb40b28f51e43c198156f389f59cbb42f6083930171ac8e5fc7abc6a58253","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.450443Z","signature_b64":"N9NG4JPYcx1BeS5pDxQ4zu8XaVBD8otJMCgooxASvQj84842IYKLyNRw3SoiMNuGaF9Z36G0XPYJxuW/CN1qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5bb40b28f51e43c198156f389f59cbb42f6083930171ac8e5fc7abc6a58253","last_reissued_at":"2026-05-18T00:22:53.450017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.450017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07144","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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcQ6ICH15RJUo6UayKjv16RYyli1ad82l7t79IJGerBnsUSJaYTrDzOamhMmqo5x67p/cdHj8NZAY4CY8DjeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:31:50.506699Z"},"content_sha256":"37b55e9a2915e594f1d57cc1e8153d64ebf877e90da98eb08d9869c5da12d868","schema_version":"1.0","event_id":"sha256:37b55e9a2915e594f1d57cc1e8153d64ebf877e90da98eb08d9869c5da12d868"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:35N3ICZI6UPEHQMYCVXTRH2ZZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ILP-based Local Search for Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander Noe, Alexandra Henzinger, Christian Schulz","submitted_at":"2018-02-20T15:11:23Z","abstract_excerpt":"Computing high-quality graph partitions is a challenging problem with numerous applications. In this paper, we present a novel meta-heuristic for the balanced graph partitioning problem. Our approach is based on integer linear programs that solve the partitioning problem to optimality. However, since those programs typically do not scale to large inputs, we adapt them to heuristically improve a given partition. We do so by defining a much smaller model that allows us to use symmetry breaking and other techniques that make the approach scalable. For example, in Walshaw's well-known benchmark ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07144","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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LZ6vTcGSauyUIv5laBONcZHyFheNMH/dsbagwJyzoQH3T2Eo4kxvzUlUQO+MrTaZuXHSDYISpICi7z5GMFJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:31:50.507336Z"},"content_sha256":"9caa1bcfb316041f7e3b8fdca8c15aaf567de1b169ae4aa08e0d4a9beeb4e771","schema_version":"1.0","event_id":"sha256:9caa1bcfb316041f7e3b8fdca8c15aaf567de1b169ae4aa08e0d4a9beeb4e771"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35N3ICZI6UPEHQMYCVXTRH2ZZO/bundle.json","state_url":"https://pith.science/pith/35N3ICZI6UPEHQMYCVXTRH2ZZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35N3ICZI6UPEHQMYCVXTRH2ZZO/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-31T21:31:50Z","links":{"resolver":"https://pith.science/pith/35N3ICZI6UPEHQMYCVXTRH2ZZO","bundle":"https://pith.science/pith/35N3ICZI6UPEHQMYCVXTRH2ZZO/bundle.json","state":"https://pith.science/pith/35N3ICZI6UPEHQMYCVXTRH2ZZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35N3ICZI6UPEHQMYCVXTRH2ZZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:35N3ICZI6UPEHQMYCVXTRH2ZZO","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":"462aa7d92c5532a2661496468303419605dfc540fea5212d0e2af4eb62590959","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T15:11:23Z","title_canon_sha256":"600b6ffb5ca67465c0b2b50d4c85a95721474de95fd6923606628c9a5495eea5"},"schema_version":"1.0","source":{"id":"1802.07144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07144","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07144v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07144","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"35N3ICZI6UPE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35N3ICZI6UPEHQMY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35N3ICZI","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:9caa1bcfb316041f7e3b8fdca8c15aaf567de1b169ae4aa08e0d4a9beeb4e771","target":"graph","created_at":"2026-05-18T00:22:53Z","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":"Computing high-quality graph partitions is a challenging problem with numerous applications. In this paper, we present a novel meta-heuristic for the balanced graph partitioning problem. Our approach is based on integer linear programs that solve the partitioning problem to optimality. However, since those programs typically do not scale to large inputs, we adapt them to heuristically improve a given partition. We do so by defining a much smaller model that allows us to use symmetry breaking and other techniques that make the approach scalable. For example, in Walshaw's well-known benchmark ta","authors_text":"Alexander Noe, Alexandra Henzinger, Christian Schulz","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T15:11:23Z","title":"ILP-based Local Search for Graph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07144","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:37b55e9a2915e594f1d57cc1e8153d64ebf877e90da98eb08d9869c5da12d868","target":"record","created_at":"2026-05-18T00:22:53Z","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":"462aa7d92c5532a2661496468303419605dfc540fea5212d0e2af4eb62590959","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T15:11:23Z","title_canon_sha256":"600b6ffb5ca67465c0b2b50d4c85a95721474de95fd6923606628c9a5495eea5"},"schema_version":"1.0","source":{"id":"1802.07144","kind":"arxiv","version":1}},"canonical_sha256":"df5bb40b28f51e43c198156f389f59cbb42f6083930171ac8e5fc7abc6a58253","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df5bb40b28f51e43c198156f389f59cbb42f6083930171ac8e5fc7abc6a58253","first_computed_at":"2026-05-18T00:22:53.450017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:53.450017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N9NG4JPYcx1BeS5pDxQ4zu8XaVBD8otJMCgooxASvQj84842IYKLyNRw3SoiMNuGaF9Z36G0XPYJxuW/CN1qCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:53.450443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37b55e9a2915e594f1d57cc1e8153d64ebf877e90da98eb08d9869c5da12d868","sha256:9caa1bcfb316041f7e3b8fdca8c15aaf567de1b169ae4aa08e0d4a9beeb4e771"],"state_sha256":"91ab705f2fb44025041f136d13c2a6c721f0ee14018bd5f5b7fd0aaa66a0372b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbd7avxkjn3g7IHYpuhhC68kaIWn8JdfQAxJn/k0R7mn+71nKhLceurZsc6cQj/Gd00j2rsP3ykfU5WSnFxkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:31:50.509410Z","bundle_sha256":"c0cc2f64b1e6376efd1cc339feaea9c4a54d747cb4bbc8f0a7b29e553d7058db"}}