{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EZWKOKT6QNWSQRYPN4CG2IGREK","short_pith_number":"pith:EZWKOKT6","canonical_record":{"source":{"id":"2201.01556","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-05T11:57:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e2e8fd562a09dbd1c39276c36e0081c22f0b5250fc62f66ea492448a1ef5779f","abstract_canon_sha256":"d7caeb3e2dd5154400987d75f4a0a96efb34fdf56856dc45019283554c88e2dc"},"schema_version":"1.0"},"canonical_sha256":"266ca72a7e836d28470f6f046d20d122b4cc6050f4c6cbd42783c685dece3f25","source":{"kind":"arxiv","id":"2201.01556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.01556","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"2201.01556v1","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.01556","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"EZWKOKT6QNWS","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZWKOKT6QNWSQRYP","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZWKOKT6","created_at":"2026-07-05T03:46:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EZWKOKT6QNWSQRYPN4CG2IGREK","target":"record","payload":{"canonical_record":{"source":{"id":"2201.01556","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-05T11:57:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e2e8fd562a09dbd1c39276c36e0081c22f0b5250fc62f66ea492448a1ef5779f","abstract_canon_sha256":"d7caeb3e2dd5154400987d75f4a0a96efb34fdf56856dc45019283554c88e2dc"},"schema_version":"1.0"},"canonical_sha256":"266ca72a7e836d28470f6f046d20d122b4cc6050f4c6cbd42783c685dece3f25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:06.750203Z","signature_b64":"s2XWHY8+AzEiPAXxFhFmFP+0jd0X+FJbJ11t/JuamAocXCDAfPrmeTin0yTKyY7xJEQkqUo4iwh5ACEZL34ZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"266ca72a7e836d28470f6f046d20d122b4cc6050f4c6cbd42783c685dece3f25","last_reissued_at":"2026-07-05T03:46:06.749701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:06.749701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.01556","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-07-05T03:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxKYt5Hd0ZDgoenfrjI4I8v0tQdJAJhjPmz3xh5N/b8peiAUppWtGqWMkfN3X8hlflmN963hcCNH4S142ZJXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:33:46.017726Z"},"content_sha256":"908e497daaa840c2d7c3a59d43da8986dc62bffddbfeb418c85b541cac08620a","schema_version":"1.0","event_id":"sha256:908e497daaa840c2d7c3a59d43da8986dc62bffddbfeb418c85b541cac08620a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EZWKOKT6QNWSQRYPN4CG2IGREK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Flow-Based Hypergraph Partitioning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Lars Gottesb\\\"uren, Peter Sanders, Tobias Heuer","submitted_at":"2022-01-05T11:57:16Z","abstract_excerpt":"We present a shared-memory parallelization of flow-based refinement, which is considered the most powerful iterative improvement technique for hypergraph partitioning at the moment. Flow-based refinement works on bipartitions, so current sequential partitioners schedule it on different block pairs to improve $k$-way partitions. We investigate two different sources of parallelism: a parallel scheduling scheme and a parallel maximum flow algorithm based on the well-known push-relabel algorithm. In addition to thoroughly engineered implementations, we propose several optimizations that substantia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.01556","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.01556/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-05T03:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cebq+HDJGBJKi5Kq2812/gGtywUTM6XMSSa54RvV3HrOSFTrzM/nOVKTzBsvq6NrNrkpMHMzuo6mi/ZssrmsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:33:46.018103Z"},"content_sha256":"e63a29f635c3034308aa5be84d7ea3f0f9128f523c8a499aaf79c56c58fa84e7","schema_version":"1.0","event_id":"sha256:e63a29f635c3034308aa5be84d7ea3f0f9128f523c8a499aaf79c56c58fa84e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZWKOKT6QNWSQRYPN4CG2IGREK/bundle.json","state_url":"https://pith.science/pith/EZWKOKT6QNWSQRYPN4CG2IGREK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZWKOKT6QNWSQRYPN4CG2IGREK/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-07-05T08:33:46Z","links":{"resolver":"https://pith.science/pith/EZWKOKT6QNWSQRYPN4CG2IGREK","bundle":"https://pith.science/pith/EZWKOKT6QNWSQRYPN4CG2IGREK/bundle.json","state":"https://pith.science/pith/EZWKOKT6QNWSQRYPN4CG2IGREK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZWKOKT6QNWSQRYPN4CG2IGREK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EZWKOKT6QNWSQRYPN4CG2IGREK","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":"d7caeb3e2dd5154400987d75f4a0a96efb34fdf56856dc45019283554c88e2dc","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-05T11:57:16Z","title_canon_sha256":"e2e8fd562a09dbd1c39276c36e0081c22f0b5250fc62f66ea492448a1ef5779f"},"schema_version":"1.0","source":{"id":"2201.01556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.01556","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"2201.01556v1","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.01556","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"EZWKOKT6QNWS","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZWKOKT6QNWSQRYP","created_at":"2026-07-05T03:46:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZWKOKT6","created_at":"2026-07-05T03:46:06Z"}],"graph_snapshots":[{"event_id":"sha256:e63a29f635c3034308aa5be84d7ea3f0f9128f523c8a499aaf79c56c58fa84e7","target":"graph","created_at":"2026-07-05T03:46:06Z","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/2201.01556/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a shared-memory parallelization of flow-based refinement, which is considered the most powerful iterative improvement technique for hypergraph partitioning at the moment. Flow-based refinement works on bipartitions, so current sequential partitioners schedule it on different block pairs to improve $k$-way partitions. We investigate two different sources of parallelism: a parallel scheduling scheme and a parallel maximum flow algorithm based on the well-known push-relabel algorithm. In addition to thoroughly engineered implementations, we propose several optimizations that substantia","authors_text":"Lars Gottesb\\\"uren, Peter Sanders, Tobias Heuer","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-05T11:57:16Z","title":"Parallel Flow-Based Hypergraph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.01556","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:908e497daaa840c2d7c3a59d43da8986dc62bffddbfeb418c85b541cac08620a","target":"record","created_at":"2026-07-05T03:46:06Z","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":"d7caeb3e2dd5154400987d75f4a0a96efb34fdf56856dc45019283554c88e2dc","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-05T11:57:16Z","title_canon_sha256":"e2e8fd562a09dbd1c39276c36e0081c22f0b5250fc62f66ea492448a1ef5779f"},"schema_version":"1.0","source":{"id":"2201.01556","kind":"arxiv","version":1}},"canonical_sha256":"266ca72a7e836d28470f6f046d20d122b4cc6050f4c6cbd42783c685dece3f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"266ca72a7e836d28470f6f046d20d122b4cc6050f4c6cbd42783c685dece3f25","first_computed_at":"2026-07-05T03:46:06.749701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:46:06.749701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s2XWHY8+AzEiPAXxFhFmFP+0jd0X+FJbJ11t/JuamAocXCDAfPrmeTin0yTKyY7xJEQkqUo4iwh5ACEZL34ZBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:46:06.750203Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.01556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:908e497daaa840c2d7c3a59d43da8986dc62bffddbfeb418c85b541cac08620a","sha256:e63a29f635c3034308aa5be84d7ea3f0f9128f523c8a499aaf79c56c58fa84e7"],"state_sha256":"17d6156e40753943b07240d88d8a55f20ebac5bef74002950b61495928436913"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnKcHdV7mYQ1DJK7P3sfGzAR5UERcXhMu/8tqRR4bORQC0U3hERADx+T/Iew1aAUcFYFSdpd3T+wn7SkawjCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:33:46.020240Z","bundle_sha256":"fd10a39a5ad44cd34dfbb2c7c239cfe62971094dcb4ac292e173bd0409b24215"}}