{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EBRAEOYDCPECPRIFFJRJSKNGQM","short_pith_number":"pith:EBRAEOYD","canonical_record":{"source":{"id":"1311.1714","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-07T15:38:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac9099ed8b2436253787429b4c775ac0afd57db5fd03696d807e49d4bc4ebbf9","abstract_canon_sha256":"5735d868e8b52bf8a17a37cfa78af07c4ec77a29cccfd4ff4edb7bbad9528730"},"schema_version":"1.0"},"canonical_sha256":"2062023b0313c827c5052a629929a6830888fdba4d226f2c542d3c9aa834884e","source":{"kind":"arxiv","id":"1311.1714","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1714","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1714v9","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1714","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"pith_short_12","alias_value":"EBRAEOYDCPEC","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"pith_short_16","alias_value":"EBRAEOYDCPECPRIF","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"pith_short_8","alias_value":"EBRAEOYD","created_at":"2026-07-05T01:24:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EBRAEOYDCPECPRIFFJRJSKNGQM","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1714","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-07T15:38:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac9099ed8b2436253787429b4c775ac0afd57db5fd03696d807e49d4bc4ebbf9","abstract_canon_sha256":"5735d868e8b52bf8a17a37cfa78af07c4ec77a29cccfd4ff4edb7bbad9528730"},"schema_version":"1.0"},"canonical_sha256":"2062023b0313c827c5052a629929a6830888fdba4d226f2c542d3c9aa834884e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:24:45.268181Z","signature_b64":"ea8Lnj9nUZ1QdML1MZ+zQjHeqIO8GL6AqqRqhSkc8AVFzYKN+M/imPDMWcIUmmfHpOfhSjCJImB2mtnKenKECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2062023b0313c827c5052a629929a6830888fdba4d226f2c542d3c9aa834884e","last_reissued_at":"2026-07-05T01:24:45.267703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:24:45.267703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1714","source_version":9,"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-07-05T01:24:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/KP7e07PNUZ1zel9VS9h2umOvNGc3FTRUSo2TQieul2rrgbYw/eepL26ojJxZ8ppplcPmdSvXAkNprdkOc6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:35:04.089145Z"},"content_sha256":"8c67c7df5b0b57d917adbbce26122a9243c3d1ecae30a1585c798eb629127393","schema_version":"1.0","event_id":"sha256:8c67c7df5b0b57d917adbbce26122a9243c3d1ecae30a1585c798eb629127393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EBRAEOYDCPECPRIFFJRJSKNGQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christian Schulz, Peter Sanders","submitted_at":"2013-11-07T15:38:09Z","abstract_excerpt":"This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions provided within the framework. Since version 3.00 we support multilevel partitioning, memetic algorithms, distributed and shared-memory parallel algorithms, node separator and ordering algorithms, edge partitioning algorithms as well as ILP solvers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1714","kind":"arxiv","version":9},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1311.1714/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:24:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3A/SOmDLlmjHbU5ZQv7ByEKm9R1OsZ+oG2XV3t0N56+fWyrF2aeU0GSDckMQkyihIfJNnYuuFa2V+6ksjWlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:35:04.090055Z"},"content_sha256":"1fbdc4b5f3f300c23c5099d23ab7dca1d22607d908f0aa29df1967e584326bda","schema_version":"1.0","event_id":"sha256:1fbdc4b5f3f300c23c5099d23ab7dca1d22607d908f0aa29df1967e584326bda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBRAEOYDCPECPRIFFJRJSKNGQM/bundle.json","state_url":"https://pith.science/pith/EBRAEOYDCPECPRIFFJRJSKNGQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBRAEOYDCPECPRIFFJRJSKNGQM/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-08-07T05:35:04Z","links":{"resolver":"https://pith.science/pith/EBRAEOYDCPECPRIFFJRJSKNGQM","bundle":"https://pith.science/pith/EBRAEOYDCPECPRIFFJRJSKNGQM/bundle.json","state":"https://pith.science/pith/EBRAEOYDCPECPRIFFJRJSKNGQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBRAEOYDCPECPRIFFJRJSKNGQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EBRAEOYDCPECPRIFFJRJSKNGQM","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":"5735d868e8b52bf8a17a37cfa78af07c4ec77a29cccfd4ff4edb7bbad9528730","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-07T15:38:09Z","title_canon_sha256":"ac9099ed8b2436253787429b4c775ac0afd57db5fd03696d807e49d4bc4ebbf9"},"schema_version":"1.0","source":{"id":"1311.1714","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1714","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1714v9","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1714","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"pith_short_12","alias_value":"EBRAEOYDCPEC","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"pith_short_16","alias_value":"EBRAEOYDCPECPRIF","created_at":"2026-07-05T01:24:45Z"},{"alias_kind":"pith_short_8","alias_value":"EBRAEOYD","created_at":"2026-07-05T01:24:45Z"}],"graph_snapshots":[{"event_id":"sha256:1fbdc4b5f3f300c23c5099d23ab7dca1d22607d908f0aa29df1967e584326bda","target":"graph","created_at":"2026-07-05T01:24:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1311.1714/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions provided within the framework. Since version 3.00 we support multilevel partitioning, memetic algorithms, distributed and shared-memory parallel algorithms, node separator and ordering algorithms, edge partitioning algorithms as well as ILP solvers.","authors_text":"Christian Schulz, Peter Sanders","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-07T15:38:09Z","title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1714","kind":"arxiv","version":9},"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:8c67c7df5b0b57d917adbbce26122a9243c3d1ecae30a1585c798eb629127393","target":"record","created_at":"2026-07-05T01:24:45Z","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":"5735d868e8b52bf8a17a37cfa78af07c4ec77a29cccfd4ff4edb7bbad9528730","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-07T15:38:09Z","title_canon_sha256":"ac9099ed8b2436253787429b4c775ac0afd57db5fd03696d807e49d4bc4ebbf9"},"schema_version":"1.0","source":{"id":"1311.1714","kind":"arxiv","version":9}},"canonical_sha256":"2062023b0313c827c5052a629929a6830888fdba4d226f2c542d3c9aa834884e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2062023b0313c827c5052a629929a6830888fdba4d226f2c542d3c9aa834884e","first_computed_at":"2026-07-05T01:24:45.267703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:24:45.267703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ea8Lnj9nUZ1QdML1MZ+zQjHeqIO8GL6AqqRqhSkc8AVFzYKN+M/imPDMWcIUmmfHpOfhSjCJImB2mtnKenKECA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:24:45.268181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1714","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c67c7df5b0b57d917adbbce26122a9243c3d1ecae30a1585c798eb629127393","sha256:1fbdc4b5f3f300c23c5099d23ab7dca1d22607d908f0aa29df1967e584326bda"],"state_sha256":"72ed5f3848010b07b9b6b3d1bc104602f5aca6c406c190c33bcceb2b0030b9f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pDTJ2QtrcbYcL4YRGf0HAeohXEGkJIvX9noAMw+j8PinE1deVfAk3XRI7IwBn9yB7y/hoo4LofWK1YBfJ7aFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:35:04.096666Z","bundle_sha256":"6798f59583df5a953a6b36e5f4ed3df76407ae5feb261787c07aff7c53e34516"}}