{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4XOBLSF4RMXRHVM7H4Z3O6GEMJ","short_pith_number":"pith:4XOBLSF4","canonical_record":{"source":{"id":"2303.17679","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-03-30T19:42:23Z","cross_cats_sorted":[],"title_canon_sha256":"ce6eab289ab213826975de531c2bde4b0d8a4f3a2a578d9996f42cdead215373","abstract_canon_sha256":"9ebbc9af1295978fe4fcffa069c0a981caa98c8833830e8f22136ac6d441e697"},"schema_version":"1.0"},"canonical_sha256":"e5dc15c8bc8b2f13d59f3f33b778c46259961dbb661160a3e8b1bacaf85a7c7e","source":{"kind":"arxiv","id":"2303.17679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17679","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17679v1","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17679","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"4XOBLSF4RMXR","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"pith_short_16","alias_value":"4XOBLSF4RMXRHVM7","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"pith_short_8","alias_value":"4XOBLSF4","created_at":"2026-07-05T05:56:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4XOBLSF4RMXRHVM7H4Z3O6GEMJ","target":"record","payload":{"canonical_record":{"source":{"id":"2303.17679","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-03-30T19:42:23Z","cross_cats_sorted":[],"title_canon_sha256":"ce6eab289ab213826975de531c2bde4b0d8a4f3a2a578d9996f42cdead215373","abstract_canon_sha256":"9ebbc9af1295978fe4fcffa069c0a981caa98c8833830e8f22136ac6d441e697"},"schema_version":"1.0"},"canonical_sha256":"e5dc15c8bc8b2f13d59f3f33b778c46259961dbb661160a3e8b1bacaf85a7c7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:43.908346Z","signature_b64":"48hRzVacNFnNng8mbIjI9Iu4q86kXaODgpLxl8R+M7JQPi2e3UlH7GUw6lyPslJTIj7445eg6W7AU0P3sBckCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5dc15c8bc8b2f13d59f3f33b778c46259961dbb661160a3e8b1bacaf85a7c7e","last_reissued_at":"2026-07-05T05:56:43.907844Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:43.907844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.17679","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-05T05:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFoOMGfnpppyXytNnWob8MumV8AsE87CC5S+Re5Orb7a4WEso9DxEMAFuqJWNDv8D/4ESsRIPFt2+faHpSzQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:59:26.236302Z"},"content_sha256":"f022bda7e4a5d5594343f58ece453b8e7372f7d30f35fd15f8fe4221b6543123","schema_version":"1.0","event_id":"sha256:f022bda7e4a5d5594343f58ece453b8e7372f7d30f35fd15f8fe4221b6543123"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4XOBLSF4RMXRHVM7H4Z3O6GEMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable High-Quality Hypergraph Partitioning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lars Gottesb\\\"uren, Nikolai Maas, Peter Sanders, Sebastian Schlag, Tobias Heuer","submitted_at":"2023-03-30T19:42:23Z","abstract_excerpt":"Balanced hypergraph partitioning is an NP-hard problem with many applications, e.g., optimizing communication in distributed data placement problems. The goal is to place all nodes across $k$ different blocks of bounded size, such that hyperedges span as few parts as possible. This problem is well-studied in sequential and distributed settings, but not in shared-memory. We close this gap by devising efficient and scalable shared-memory algorithms for all components employed in the best sequential solvers without compromises with regards to solution quality.\n  This work presents the scalable an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17679","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/2303.17679/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-05T05:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLTChcNQuzOgdRm3+0bKIThocLlfG6PA/SPQMmDaDXiORJXvX1kNXz98pQYlLQSZc2mDwsj9XuP9e6mxHkXFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:59:26.237027Z"},"content_sha256":"d22cf5676ba21f193ee1bca341f08d44856602447f92650647176cf582a617dd","schema_version":"1.0","event_id":"sha256:d22cf5676ba21f193ee1bca341f08d44856602447f92650647176cf582a617dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XOBLSF4RMXRHVM7H4Z3O6GEMJ/bundle.json","state_url":"https://pith.science/pith/4XOBLSF4RMXRHVM7H4Z3O6GEMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XOBLSF4RMXRHVM7H4Z3O6GEMJ/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-05T15:59:26Z","links":{"resolver":"https://pith.science/pith/4XOBLSF4RMXRHVM7H4Z3O6GEMJ","bundle":"https://pith.science/pith/4XOBLSF4RMXRHVM7H4Z3O6GEMJ/bundle.json","state":"https://pith.science/pith/4XOBLSF4RMXRHVM7H4Z3O6GEMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XOBLSF4RMXRHVM7H4Z3O6GEMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4XOBLSF4RMXRHVM7H4Z3O6GEMJ","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":"9ebbc9af1295978fe4fcffa069c0a981caa98c8833830e8f22136ac6d441e697","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-03-30T19:42:23Z","title_canon_sha256":"ce6eab289ab213826975de531c2bde4b0d8a4f3a2a578d9996f42cdead215373"},"schema_version":"1.0","source":{"id":"2303.17679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17679","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17679v1","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17679","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"4XOBLSF4RMXR","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"pith_short_16","alias_value":"4XOBLSF4RMXRHVM7","created_at":"2026-07-05T05:56:43Z"},{"alias_kind":"pith_short_8","alias_value":"4XOBLSF4","created_at":"2026-07-05T05:56:43Z"}],"graph_snapshots":[{"event_id":"sha256:d22cf5676ba21f193ee1bca341f08d44856602447f92650647176cf582a617dd","target":"graph","created_at":"2026-07-05T05:56:43Z","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/2303.17679/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Balanced hypergraph partitioning is an NP-hard problem with many applications, e.g., optimizing communication in distributed data placement problems. The goal is to place all nodes across $k$ different blocks of bounded size, such that hyperedges span as few parts as possible. This problem is well-studied in sequential and distributed settings, but not in shared-memory. We close this gap by devising efficient and scalable shared-memory algorithms for all components employed in the best sequential solvers without compromises with regards to solution quality.\n  This work presents the scalable an","authors_text":"Lars Gottesb\\\"uren, Nikolai Maas, Peter Sanders, Sebastian Schlag, Tobias Heuer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-03-30T19:42:23Z","title":"Scalable High-Quality Hypergraph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17679","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:f022bda7e4a5d5594343f58ece453b8e7372f7d30f35fd15f8fe4221b6543123","target":"record","created_at":"2026-07-05T05:56:43Z","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":"9ebbc9af1295978fe4fcffa069c0a981caa98c8833830e8f22136ac6d441e697","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-03-30T19:42:23Z","title_canon_sha256":"ce6eab289ab213826975de531c2bde4b0d8a4f3a2a578d9996f42cdead215373"},"schema_version":"1.0","source":{"id":"2303.17679","kind":"arxiv","version":1}},"canonical_sha256":"e5dc15c8bc8b2f13d59f3f33b778c46259961dbb661160a3e8b1bacaf85a7c7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5dc15c8bc8b2f13d59f3f33b778c46259961dbb661160a3e8b1bacaf85a7c7e","first_computed_at":"2026-07-05T05:56:43.907844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:56:43.907844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"48hRzVacNFnNng8mbIjI9Iu4q86kXaODgpLxl8R+M7JQPi2e3UlH7GUw6lyPslJTIj7445eg6W7AU0P3sBckCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:56:43.908346Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.17679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f022bda7e4a5d5594343f58ece453b8e7372f7d30f35fd15f8fe4221b6543123","sha256:d22cf5676ba21f193ee1bca341f08d44856602447f92650647176cf582a617dd"],"state_sha256":"ac1487074569810256a0135c1c9f78700d42d589b8eb456d529ae383fec66afc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22lrfERiwtaROGrpTjsfeKIzomxNVO8qcYO9j3MTEGarriX13HYlSnHyhkjaM2Haz0tpmrXONXuGpzIyp5NODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T15:59:26.241609Z","bundle_sha256":"993006a684523acd1ceee5799fe121e40f13d2201a4343e370a280e0109e94f1"}}