{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PAB6L3CZBRUOD42UPWEHQPLGVN","short_pith_number":"pith:PAB6L3CZ","canonical_record":{"source":{"id":"2605.28333","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T11:36:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"590f18bc4a11d389679e15cbd39813e8125874aaf41b8a01bf9e6be66f600973","abstract_canon_sha256":"e0aed3937098fea56ff6411bb05d999ca803eebc072ff680bc36372192694ebf"},"schema_version":"1.0"},"canonical_sha256":"7803e5ec590c68e1f3547d88783d66ab4035afffc54d56ddf0b723886688908c","source":{"kind":"arxiv","id":"2605.28333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28333","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28333v1","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28333","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"PAB6L3CZBRUO","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"pith_short_16","alias_value":"PAB6L3CZBRUOD42U","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"pith_short_8","alias_value":"PAB6L3CZ","created_at":"2026-05-28T01:05:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PAB6L3CZBRUOD42UPWEHQPLGVN","target":"record","payload":{"canonical_record":{"source":{"id":"2605.28333","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T11:36:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"590f18bc4a11d389679e15cbd39813e8125874aaf41b8a01bf9e6be66f600973","abstract_canon_sha256":"e0aed3937098fea56ff6411bb05d999ca803eebc072ff680bc36372192694ebf"},"schema_version":"1.0"},"canonical_sha256":"7803e5ec590c68e1f3547d88783d66ab4035afffc54d56ddf0b723886688908c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:13.242417Z","signature_b64":"LZJEicd02VNByAH/GEoIItuCvoyBkMBoaCRqYB4Tcw94HidIbu4ZlznYIWw9nrflL6gF5UEdeZBhundzzggdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7803e5ec590c68e1f3547d88783d66ab4035afffc54d56ddf0b723886688908c","last_reissued_at":"2026-05-28T01:05:13.241990Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:13.241990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.28333","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-05-28T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFoNuCUyxA5KYRETJyUi8+HFdgoG3sAtdUVTRcgoXC8+ootX5py6XK2B0K5IvGuMdLvXu5MYiPWLEeoGk5aiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:33:34.578924Z"},"content_sha256":"e7ae2b06ba1a47349f1b5fb7cd57eea1a93649760082c8ae48e440674740f2b6","schema_version":"1.0","event_id":"sha256:e7ae2b06ba1a47349f1b5fb7cd57eea1a93649760082c8ae48e440674740f2b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PAB6L3CZBRUOD42UPWEHQPLGVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Nikolai Maas","submitted_at":"2026-05-27T11:36:57Z","abstract_excerpt":"Multi-constraint hypergraph partitioning is a generalization of balanced partitioning, where the vertex set of a hypergraph is partitioned such that the inter-block connectivity of hyperedges is minimized while balancing the vertices with regard to $d$ distinct constraints. A prominent class of applications is data distribution tasks, where this allows to achieve good load balance for $d$ different kinds of resources and simultaneously minimize the communication volume.\n  Although the best approaches for single-constraint partitioning are usually complex (multilevel) algorithms with many compo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28333","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/2605.28333/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-05-28T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwgfaXldt8c/PjjocIFLejdauQXbypKPLYztZhgT3Q9qSgy5Xtjrl0Ly/XeVdyLAYlWm7DQtvNMtiMxOWRdGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:33:34.579288Z"},"content_sha256":"95f8956021aacdbe46612c93ae125b777b8bca8878ebb915102fb7824d75e2af","schema_version":"1.0","event_id":"sha256:95f8956021aacdbe46612c93ae125b777b8bca8878ebb915102fb7824d75e2af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAB6L3CZBRUOD42UPWEHQPLGVN/bundle.json","state_url":"https://pith.science/pith/PAB6L3CZBRUOD42UPWEHQPLGVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAB6L3CZBRUOD42UPWEHQPLGVN/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-06-29T19:33:34Z","links":{"resolver":"https://pith.science/pith/PAB6L3CZBRUOD42UPWEHQPLGVN","bundle":"https://pith.science/pith/PAB6L3CZBRUOD42UPWEHQPLGVN/bundle.json","state":"https://pith.science/pith/PAB6L3CZBRUOD42UPWEHQPLGVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAB6L3CZBRUOD42UPWEHQPLGVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PAB6L3CZBRUOD42UPWEHQPLGVN","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":"e0aed3937098fea56ff6411bb05d999ca803eebc072ff680bc36372192694ebf","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T11:36:57Z","title_canon_sha256":"590f18bc4a11d389679e15cbd39813e8125874aaf41b8a01bf9e6be66f600973"},"schema_version":"1.0","source":{"id":"2605.28333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28333","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28333v1","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28333","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"PAB6L3CZBRUO","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"pith_short_16","alias_value":"PAB6L3CZBRUOD42U","created_at":"2026-05-28T01:05:13Z"},{"alias_kind":"pith_short_8","alias_value":"PAB6L3CZ","created_at":"2026-05-28T01:05:13Z"}],"graph_snapshots":[{"event_id":"sha256:95f8956021aacdbe46612c93ae125b777b8bca8878ebb915102fb7824d75e2af","target":"graph","created_at":"2026-05-28T01:05:13Z","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/2605.28333/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-constraint hypergraph partitioning is a generalization of balanced partitioning, where the vertex set of a hypergraph is partitioned such that the inter-block connectivity of hyperedges is minimized while balancing the vertices with regard to $d$ distinct constraints. A prominent class of applications is data distribution tasks, where this allows to achieve good load balance for $d$ different kinds of resources and simultaneously minimize the communication volume.\n  Although the best approaches for single-constraint partitioning are usually complex (multilevel) algorithms with many compo","authors_text":"Nikolai Maas","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T11:36:57Z","title":"High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28333","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:e7ae2b06ba1a47349f1b5fb7cd57eea1a93649760082c8ae48e440674740f2b6","target":"record","created_at":"2026-05-28T01:05:13Z","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":"e0aed3937098fea56ff6411bb05d999ca803eebc072ff680bc36372192694ebf","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T11:36:57Z","title_canon_sha256":"590f18bc4a11d389679e15cbd39813e8125874aaf41b8a01bf9e6be66f600973"},"schema_version":"1.0","source":{"id":"2605.28333","kind":"arxiv","version":1}},"canonical_sha256":"7803e5ec590c68e1f3547d88783d66ab4035afffc54d56ddf0b723886688908c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7803e5ec590c68e1f3547d88783d66ab4035afffc54d56ddf0b723886688908c","first_computed_at":"2026-05-28T01:05:13.241990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:05:13.241990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZJEicd02VNByAH/GEoIItuCvoyBkMBoaCRqYB4Tcw94HidIbu4ZlznYIWw9nrflL6gF5UEdeZBhundzzggdAg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:05:13.242417Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7ae2b06ba1a47349f1b5fb7cd57eea1a93649760082c8ae48e440674740f2b6","sha256:95f8956021aacdbe46612c93ae125b777b8bca8878ebb915102fb7824d75e2af"],"state_sha256":"2563b1462ddcb6f68b665b25d980ae4a7d694eaaaee138754523d1cc46b5697b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFhYFdPss25bdVfRx1muWw5jbsOgAlCcGX8ALMIs0Qa0yfL/k+HEobb5AYUvU5UlAYUbhwCTSWMnt3f0OZ5mAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:33:34.581158Z","bundle_sha256":"43db67981e22e6503f46be12b81938224173be4478ba1949d452f6b7abb2a511"}}