{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:L3UIPQ6QUOJSOP2CP5MZBW5RS7","short_pith_number":"pith:L3UIPQ6Q","canonical_record":{"source":{"id":"1012.0006","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-30T21:01:48Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"327ef497ee2b9c6182e5c7c275195caa078b8afcafad0c05825079a6e5423512","abstract_canon_sha256":"cc5dea1663952a54ab9c860e313624bdaa0195c892a2cd0a443df429dbe28001"},"schema_version":"1.0"},"canonical_sha256":"5ee887c3d0a393273f427f5990dbb197e5f8d10de681cb91e3621b5018514f87","source":{"kind":"arxiv","id":"1012.0006","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0006","created_at":"2026-05-18T04:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0006v3","created_at":"2026-05-18T04:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0006","created_at":"2026-05-18T04:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"L3UIPQ6QUOJS","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"L3UIPQ6QUOJSOP2C","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"L3UIPQ6Q","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:L3UIPQ6QUOJSOP2CP5MZBW5RS7","target":"record","payload":{"canonical_record":{"source":{"id":"1012.0006","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-30T21:01:48Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"327ef497ee2b9c6182e5c7c275195caa078b8afcafad0c05825079a6e5423512","abstract_canon_sha256":"cc5dea1663952a54ab9c860e313624bdaa0195c892a2cd0a443df429dbe28001"},"schema_version":"1.0"},"canonical_sha256":"5ee887c3d0a393273f427f5990dbb197e5f8d10de681cb91e3621b5018514f87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:11.030850Z","signature_b64":"yHmX3nXaDi9ey8qE+HRxaVFC5pd+FcVv9VSwN0vXovVWtIUPOVJF7wJHRRMLAyd7vREwouexwWRoC2DtdwthBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ee887c3d0a393273f427f5990dbb197e5f8d10de681cb91e3621b5018514f87","last_reissued_at":"2026-05-18T04:25:11.030306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:11.030306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.0006","source_version":3,"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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8BeO7NTCqjywDNCIX9E8AEdsRFCVIc5wzSR4D7LjYGY6ZCV7pCC+1Ovbc19FqO870aHykaiJtZAax53XG8UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:42.888124Z"},"content_sha256":"500021892f10151088ee0ef2b99172748c2d6e93071448752fe639c6f9cafe6b","schema_version":"1.0","event_id":"sha256:500021892f10151088ee0ef2b99172748c2d6e93071448752fe639c6f9cafe6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:L3UIPQ6QUOJSOP2CP5MZBW5RS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Engineering Multilevel Graph Partitioning Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Peter Sanders","submitted_at":"2010-11-30T21:01:48Z","abstract_excerpt":"We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from the multi-grid community. Local improvement algorithms are based max-flow min-cut computations and more localized FM searches. By combining these techniques, we obtain an algorithm that is fast on the one hand and on the other hand is able to improve the best known partitioning results for many inputs. For example, in Walshaw's well known benchmark tables we achieve 317 improvements for the tables 1%, 3% and 5% imbalance. Moreover, in 118 additional cases"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0006","kind":"arxiv","version":3},"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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0R2dmysCBgIglpVR5mrqfRS5HNFH6Uh03VY7dGHTUU1m4qnRpVyj4vlfEAXlOtY4JgGLgnquQ9dX0B1YSkYwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:42.888528Z"},"content_sha256":"66ed284c47f87864aedef8851418628df2b39abdaf9fa1bd3b40a200afad187b","schema_version":"1.0","event_id":"sha256:66ed284c47f87864aedef8851418628df2b39abdaf9fa1bd3b40a200afad187b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3UIPQ6QUOJSOP2CP5MZBW5RS7/bundle.json","state_url":"https://pith.science/pith/L3UIPQ6QUOJSOP2CP5MZBW5RS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3UIPQ6QUOJSOP2CP5MZBW5RS7/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-31T01:17:42Z","links":{"resolver":"https://pith.science/pith/L3UIPQ6QUOJSOP2CP5MZBW5RS7","bundle":"https://pith.science/pith/L3UIPQ6QUOJSOP2CP5MZBW5RS7/bundle.json","state":"https://pith.science/pith/L3UIPQ6QUOJSOP2CP5MZBW5RS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3UIPQ6QUOJSOP2CP5MZBW5RS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:L3UIPQ6QUOJSOP2CP5MZBW5RS7","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":"cc5dea1663952a54ab9c860e313624bdaa0195c892a2cd0a443df429dbe28001","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-30T21:01:48Z","title_canon_sha256":"327ef497ee2b9c6182e5c7c275195caa078b8afcafad0c05825079a6e5423512"},"schema_version":"1.0","source":{"id":"1012.0006","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0006","created_at":"2026-05-18T04:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0006v3","created_at":"2026-05-18T04:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0006","created_at":"2026-05-18T04:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"L3UIPQ6QUOJS","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"L3UIPQ6QUOJSOP2C","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"L3UIPQ6Q","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:66ed284c47f87864aedef8851418628df2b39abdaf9fa1bd3b40a200afad187b","target":"graph","created_at":"2026-05-18T04:25:11Z","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 multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from the multi-grid community. Local improvement algorithms are based max-flow min-cut computations and more localized FM searches. By combining these techniques, we obtain an algorithm that is fast on the one hand and on the other hand is able to improve the best known partitioning results for many inputs. For example, in Walshaw's well known benchmark tables we achieve 317 improvements for the tables 1%, 3% and 5% imbalance. Moreover, in 118 additional cases","authors_text":"Christian Schulz, Peter Sanders","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-30T21:01:48Z","title":"Engineering Multilevel Graph Partitioning Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0006","kind":"arxiv","version":3},"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:500021892f10151088ee0ef2b99172748c2d6e93071448752fe639c6f9cafe6b","target":"record","created_at":"2026-05-18T04:25:11Z","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":"cc5dea1663952a54ab9c860e313624bdaa0195c892a2cd0a443df429dbe28001","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-30T21:01:48Z","title_canon_sha256":"327ef497ee2b9c6182e5c7c275195caa078b8afcafad0c05825079a6e5423512"},"schema_version":"1.0","source":{"id":"1012.0006","kind":"arxiv","version":3}},"canonical_sha256":"5ee887c3d0a393273f427f5990dbb197e5f8d10de681cb91e3621b5018514f87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ee887c3d0a393273f427f5990dbb197e5f8d10de681cb91e3621b5018514f87","first_computed_at":"2026-05-18T04:25:11.030306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:11.030306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHmX3nXaDi9ey8qE+HRxaVFC5pd+FcVv9VSwN0vXovVWtIUPOVJF7wJHRRMLAyd7vREwouexwWRoC2DtdwthBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:11.030850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0006","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:500021892f10151088ee0ef2b99172748c2d6e93071448752fe639c6f9cafe6b","sha256:66ed284c47f87864aedef8851418628df2b39abdaf9fa1bd3b40a200afad187b"],"state_sha256":"2a4814d5d2dd75edc3b3c75f5e2b33061044247d2c7d6c6da00d075c0671a3d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONcIwHGkr7PFA/uYFKXk69X4jsVdTUng14g/W+kh5qdgHE0u7pegvO5WaNoiNWyh2B3ynvsE3QH4Evb1HTpZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:17:42.890726Z","bundle_sha256":"6e0e12d21a769a61ffd0d676a575f951999f0c41a8f117816d03d0b523190b77"}}