{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7RNUULHTM67OFIG5T7PORIECPY","short_pith_number":"pith:7RNUULHT","canonical_record":{"source":{"id":"1710.08231","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T12:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"86a1506dd44c0e4bee676e316c8fb19f97a0ab549db6d6852e3df63f705fe1d2","abstract_canon_sha256":"fbdac76a5fd4cfe74bfd5cff233a95453c8140eaf3903936b361a2df24b89eff"},"schema_version":"1.0"},"canonical_sha256":"fc5b4a2cf367bee2a0dd9fdee8a0827e37cd0eb7e8383baffdb2540e1349b13e","source":{"kind":"arxiv","id":"1710.08231","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08231","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08231v4","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08231","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"7RNUULHTM67O","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7RNUULHTM67OFIG5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7RNUULHT","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7RNUULHTM67OFIG5T7PORIECPY","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08231","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T12:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"86a1506dd44c0e4bee676e316c8fb19f97a0ab549db6d6852e3df63f705fe1d2","abstract_canon_sha256":"fbdac76a5fd4cfe74bfd5cff233a95453c8140eaf3903936b361a2df24b89eff"},"schema_version":"1.0"},"canonical_sha256":"fc5b4a2cf367bee2a0dd9fdee8a0827e37cd0eb7e8383baffdb2540e1349b13e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:24.898307Z","signature_b64":"FiB/LKuxBisIKlAG4mOtKD/0nND16d0lcdOq+EJsim61m9qUoSvTsWKTiECBrqoSEGn7ep2F5mLOk9PDue6nBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5b4a2cf367bee2a0dd9fdee8a0827e37cd0eb7e8383baffdb2540e1349b13e","last_reissued_at":"2026-05-18T00:03:24.897788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:24.897788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08231","source_version":4,"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:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvAWxXl+y9ieg7LO2T3iREBc2Ry5TWYuDamv8zJtL6KiyOp4T0xw+TdOldc/x7xGMgerM5GXwszdjm3eDaLtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:04.400688Z"},"content_sha256":"26d517d43355d275bef79257724995c1f7083d5bec2ff7328fd6fdd880984739","schema_version":"1.0","event_id":"sha256:26d517d43355d275bef79257724995c1f7083d5bec2ff7328fd6fdd880984739"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7RNUULHTM67OFIG5T7PORIECPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Quality Shared-Memory Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Peter Sanders, Yaroslav Akhremtsev","submitted_at":"2017-10-23T12:20:18Z","abstract_excerpt":"Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partitioning have problems in this context since they often show a negative trade-off between speed and quality. We present an approach to multi-level shared-memory parallel graph partitioning that guarantees balanced solutions, shows high speed-ups for a variety of large graphs and yields very good quali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08231","kind":"arxiv","version":4},"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:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wM84lJR1cOVlFXOk3gs5NKroM8/AHol45lWFuDR2PihwONo0H+Ut8NYUX+/qUa73fMC6J5TNMdtfSYvfJdEVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:04.401061Z"},"content_sha256":"3d2d0967fe2762ff7786c951b816f9412986a3ff4788c4d16e284c292ae6812d","schema_version":"1.0","event_id":"sha256:3d2d0967fe2762ff7786c951b816f9412986a3ff4788c4d16e284c292ae6812d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RNUULHTM67OFIG5T7PORIECPY/bundle.json","state_url":"https://pith.science/pith/7RNUULHTM67OFIG5T7PORIECPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RNUULHTM67OFIG5T7PORIECPY/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-31T09:58:04Z","links":{"resolver":"https://pith.science/pith/7RNUULHTM67OFIG5T7PORIECPY","bundle":"https://pith.science/pith/7RNUULHTM67OFIG5T7PORIECPY/bundle.json","state":"https://pith.science/pith/7RNUULHTM67OFIG5T7PORIECPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RNUULHTM67OFIG5T7PORIECPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7RNUULHTM67OFIG5T7PORIECPY","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":"fbdac76a5fd4cfe74bfd5cff233a95453c8140eaf3903936b361a2df24b89eff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T12:20:18Z","title_canon_sha256":"86a1506dd44c0e4bee676e316c8fb19f97a0ab549db6d6852e3df63f705fe1d2"},"schema_version":"1.0","source":{"id":"1710.08231","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08231","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08231v4","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08231","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"7RNUULHTM67O","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7RNUULHTM67OFIG5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7RNUULHT","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:3d2d0967fe2762ff7786c951b816f9412986a3ff4788c4d16e284c292ae6812d","target":"graph","created_at":"2026-05-18T00:03:24Z","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":"Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partitioning have problems in this context since they often show a negative trade-off between speed and quality. We present an approach to multi-level shared-memory parallel graph partitioning that guarantees balanced solutions, shows high speed-ups for a variety of large graphs and yields very good quali","authors_text":"Christian Schulz, Peter Sanders, Yaroslav Akhremtsev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T12:20:18Z","title":"High-Quality Shared-Memory Graph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08231","kind":"arxiv","version":4},"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:26d517d43355d275bef79257724995c1f7083d5bec2ff7328fd6fdd880984739","target":"record","created_at":"2026-05-18T00:03:24Z","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":"fbdac76a5fd4cfe74bfd5cff233a95453c8140eaf3903936b361a2df24b89eff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T12:20:18Z","title_canon_sha256":"86a1506dd44c0e4bee676e316c8fb19f97a0ab549db6d6852e3df63f705fe1d2"},"schema_version":"1.0","source":{"id":"1710.08231","kind":"arxiv","version":4}},"canonical_sha256":"fc5b4a2cf367bee2a0dd9fdee8a0827e37cd0eb7e8383baffdb2540e1349b13e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc5b4a2cf367bee2a0dd9fdee8a0827e37cd0eb7e8383baffdb2540e1349b13e","first_computed_at":"2026-05-18T00:03:24.897788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:24.897788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FiB/LKuxBisIKlAG4mOtKD/0nND16d0lcdOq+EJsim61m9qUoSvTsWKTiECBrqoSEGn7ep2F5mLOk9PDue6nBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:24.898307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08231","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26d517d43355d275bef79257724995c1f7083d5bec2ff7328fd6fdd880984739","sha256:3d2d0967fe2762ff7786c951b816f9412986a3ff4788c4d16e284c292ae6812d"],"state_sha256":"55bd42c5c9924c1abe1bc46829c437c6f80319dc8d4db1a2b57abe3600ec4ba0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzNQN+o7h21xTzUcvPKJ+H3GghQIdsncAHYFGxp+repboy7EiVQ5z3QuwS6WgI/D4t0i+0SC07nkvTAAWITwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:58:04.402905Z","bundle_sha256":"3ac08b63757d42d760c561d6393e003c9379fb0d5b63d75237e46c34b8e82086"}}