{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6D7LRREJFKHYXHP3ICNNC26RVH","short_pith_number":"pith:6D7LRREJ","canonical_record":{"source":{"id":"1404.4887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T20:58:21Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"61eaacd04bc6fc563b612c498c2af6ef5dd404a8fbbe1a0927cd4ded345bf8af","abstract_canon_sha256":"622518d2d468d28eb2b7d76ab336046c5f5c8868ac46de66ac17bfafb04032c5"},"schema_version":"1.0"},"canonical_sha256":"f0feb8c4892a8f8b9dfb409ad16bd1a9e311b7a067f2155b76e3abda46132280","source":{"kind":"arxiv","id":"1404.4887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4887","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4887v2","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4887","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"6D7LRREJFKHY","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6D7LRREJFKHYXHP3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6D7LRREJ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6D7LRREJFKHYXHP3ICNNC26RVH","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T20:58:21Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"61eaacd04bc6fc563b612c498c2af6ef5dd404a8fbbe1a0927cd4ded345bf8af","abstract_canon_sha256":"622518d2d468d28eb2b7d76ab336046c5f5c8868ac46de66ac17bfafb04032c5"},"schema_version":"1.0"},"canonical_sha256":"f0feb8c4892a8f8b9dfb409ad16bd1a9e311b7a067f2155b76e3abda46132280","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:07.930802Z","signature_b64":"XJk13UEsCY+jQQjdh1+eU14DrfDxOj9O0+yTHoRaSXBR6/QI0zLA80hWa+dKOU/l45IyD19pqO6ozGZdGVwIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0feb8c4892a8f8b9dfb409ad16bd1a9e311b7a067f2155b76e3abda46132280","last_reissued_at":"2026-05-18T02:42:07.930357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:07.930357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4887","source_version":2,"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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UY7hX985VfTDW19cA/COf5qyCtpLpqfYs+ttvoQplL6zbddHyafl322F/E6D4d7mMUnXZym7PFm0BSsdoleCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:05.673121Z"},"content_sha256":"3bd863116f0cf85b11a72c950a923d17a8654d0de4731bbd2962bb5641514e01","schema_version":"1.0","event_id":"sha256:3bd863116f0cf85b11a72c950a923d17a8654d0de4731bbd2962bb5641514e01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6D7LRREJFKHYXHP3ICNNC26RVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"(Semi-)External Algorithms for Graph Partitioning and Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Peter Sanders, Yaroslav Akhremtsev","submitted_at":"2014-04-18T20:58:21Z","abstract_excerpt":"In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processing and analyzing large complex networks. We address both problems in the (semi-)external model by adapting the size-constrained label propagation technique. Our (semi-)external size-constrained label propagation algorithm can be used to compute graph clusterings and is a prerequisite for the (semi-)external graph partitioning algorithm. The algorithm is then used for both the coarsening and the refinement phase of a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4887","kind":"arxiv","version":2},"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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juC59fOWmDJSW40juYJKH2bRGVSyFQeaWm9G/TerRMfAUnSDmZmXEHK5vyVzWgnCJVZiftC58cxfM7liTXaBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:05.673495Z"},"content_sha256":"2e85f1782a3718329601e0785d52d0c4436f93220afb0788878042e653bf5374","schema_version":"1.0","event_id":"sha256:2e85f1782a3718329601e0785d52d0c4436f93220afb0788878042e653bf5374"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6D7LRREJFKHYXHP3ICNNC26RVH/bundle.json","state_url":"https://pith.science/pith/6D7LRREJFKHYXHP3ICNNC26RVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6D7LRREJFKHYXHP3ICNNC26RVH/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-31T03:19:05Z","links":{"resolver":"https://pith.science/pith/6D7LRREJFKHYXHP3ICNNC26RVH","bundle":"https://pith.science/pith/6D7LRREJFKHYXHP3ICNNC26RVH/bundle.json","state":"https://pith.science/pith/6D7LRREJFKHYXHP3ICNNC26RVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6D7LRREJFKHYXHP3ICNNC26RVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6D7LRREJFKHYXHP3ICNNC26RVH","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":"622518d2d468d28eb2b7d76ab336046c5f5c8868ac46de66ac17bfafb04032c5","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T20:58:21Z","title_canon_sha256":"61eaacd04bc6fc563b612c498c2af6ef5dd404a8fbbe1a0927cd4ded345bf8af"},"schema_version":"1.0","source":{"id":"1404.4887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4887","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4887v2","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4887","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"6D7LRREJFKHY","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6D7LRREJFKHYXHP3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6D7LRREJ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:2e85f1782a3718329601e0785d52d0c4436f93220afb0788878042e653bf5374","target":"graph","created_at":"2026-05-18T02:42:07Z","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":"In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processing and analyzing large complex networks. We address both problems in the (semi-)external model by adapting the size-constrained label propagation technique. Our (semi-)external size-constrained label propagation algorithm can be used to compute graph clusterings and is a prerequisite for the (semi-)external graph partitioning algorithm. The algorithm is then used for both the coarsening and the refinement phase of a m","authors_text":"Christian Schulz, Peter Sanders, Yaroslav Akhremtsev","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T20:58:21Z","title":"(Semi-)External Algorithms for Graph Partitioning and Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4887","kind":"arxiv","version":2},"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:3bd863116f0cf85b11a72c950a923d17a8654d0de4731bbd2962bb5641514e01","target":"record","created_at":"2026-05-18T02:42:07Z","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":"622518d2d468d28eb2b7d76ab336046c5f5c8868ac46de66ac17bfafb04032c5","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-18T20:58:21Z","title_canon_sha256":"61eaacd04bc6fc563b612c498c2af6ef5dd404a8fbbe1a0927cd4ded345bf8af"},"schema_version":"1.0","source":{"id":"1404.4887","kind":"arxiv","version":2}},"canonical_sha256":"f0feb8c4892a8f8b9dfb409ad16bd1a9e311b7a067f2155b76e3abda46132280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0feb8c4892a8f8b9dfb409ad16bd1a9e311b7a067f2155b76e3abda46132280","first_computed_at":"2026-05-18T02:42:07.930357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:07.930357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJk13UEsCY+jQQjdh1+eU14DrfDxOj9O0+yTHoRaSXBR6/QI0zLA80hWa+dKOU/l45IyD19pqO6ozGZdGVwIDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:07.930802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bd863116f0cf85b11a72c950a923d17a8654d0de4731bbd2962bb5641514e01","sha256:2e85f1782a3718329601e0785d52d0c4436f93220afb0788878042e653bf5374"],"state_sha256":"ecd7a3d2a665299cefc548f4e059b55f2f7cd506e466265d57536cf0bd3bd598"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pk9HPppFGf9DD60XknD4uGQI2FLXVXAx3PrDO9e9ZIjEgkDix5O903qpGf2eXcVFnZIYWsKPH5cruKNZmLllBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:19:05.675458Z","bundle_sha256":"804a569c032273c2e940dba9005b67e72c3b4765606ddf1a934fbf686cb20bf2"}}