{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CWWNZUDOKBKMA6XHGLABHVT7NZ","short_pith_number":"pith:CWWNZUDO","canonical_record":{"source":{"id":"1810.11319","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-26T13:35:55Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"8778f37f12c1d570cdea181d54caf29368170103a43fa255a55395f08ff50fd5","abstract_canon_sha256":"7f6e1d62c23ed0124808cf43b88dcd3acd4c1be993939d196d7890bd2107c7c3"},"schema_version":"1.0"},"canonical_sha256":"15acdcd06e5054c07ae732c013d67f6e71d9c31ef31fdec704a9e185f2377b80","source":{"kind":"arxiv","id":"1810.11319","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11319","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11319v4","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11319","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"CWWNZUDOKBKM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CWWNZUDOKBKMA6XH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CWWNZUDO","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CWWNZUDOKBKMA6XHGLABHVT7NZ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11319","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-26T13:35:55Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"8778f37f12c1d570cdea181d54caf29368170103a43fa255a55395f08ff50fd5","abstract_canon_sha256":"7f6e1d62c23ed0124808cf43b88dcd3acd4c1be993939d196d7890bd2107c7c3"},"schema_version":"1.0"},"canonical_sha256":"15acdcd06e5054c07ae732c013d67f6e71d9c31ef31fdec704a9e185f2377b80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.922062Z","signature_b64":"NE6i3SIJYXvueUBNqtZ8b7BBCid29MZMXBRW+4HQPiPKLVqfq2Ohh7Hs37SqUr2Zw45IaEtd/Opz4YHAn19HCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15acdcd06e5054c07ae732c013d67f6e71d9c31ef31fdec704a9e185f2377b80","last_reissued_at":"2026-05-18T00:00:42.921680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.921680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11319","source_version":4,"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-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8Xm24VTtq4ZByfMbQolNk1MtLK/0TezhQ6wHwjijrvTkxHlVvUnldBbz+IzEVOj1aUE+Ywpt3xyfSo/+/v8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:11:41.341944Z"},"content_sha256":"ce14aabe878a73f79fa5a6c4a2d34acd072db86f1b52b7e3fc7e44c769d06380","schema_version":"1.0","event_id":"sha256:ce14aabe878a73f79fa5a6c4a2d34acd072db86f1b52b7e3fc7e44c769d06380"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CWWNZUDOKBKMA6XHGLABHVT7NZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"cs.DC","authors_text":"Christian Mayer, Kurt Rothermel, Lukas Epple, Ruben Mayer, Sukanya Bhowmik","submitted_at":"2018-10-26T13:35:55Z","abstract_excerpt":"Many important real-world applications-such as social networks or distributed data bases-can be modeled as hypergraphs. In such a model, vertices represent entities-such as users or data records-whereas hyperedges model a group membership of the vertices-such as the authorship in a specific topic or the membership of a data record in a specific replicated shard. To optimize such applications, we need an efficient and effective solution to the NP-hard balanced k-way hypergraph partitioning problem. However, existing hypergraph partitioners that scale to very large graphs do not effectively expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11319","kind":"arxiv","version":4},"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-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbqsnMd7CKtw/KPRUpJVsmNbt8sbxxsmb8D165mZrwoQ5A/C3kI3AkTHHlz8z9Udup0WMQZEintq4fLa9JrWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:11:41.342281Z"},"content_sha256":"4af38a507ba5d38d92e45e3d752d8f9f9865af8e17f30064dff77202de44aed2","schema_version":"1.0","event_id":"sha256:4af38a507ba5d38d92e45e3d752d8f9f9865af8e17f30064dff77202de44aed2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWWNZUDOKBKMA6XHGLABHVT7NZ/bundle.json","state_url":"https://pith.science/pith/CWWNZUDOKBKMA6XHGLABHVT7NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWWNZUDOKBKMA6XHGLABHVT7NZ/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-23T15:11:41Z","links":{"resolver":"https://pith.science/pith/CWWNZUDOKBKMA6XHGLABHVT7NZ","bundle":"https://pith.science/pith/CWWNZUDOKBKMA6XHGLABHVT7NZ/bundle.json","state":"https://pith.science/pith/CWWNZUDOKBKMA6XHGLABHVT7NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWWNZUDOKBKMA6XHGLABHVT7NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CWWNZUDOKBKMA6XHGLABHVT7NZ","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":"7f6e1d62c23ed0124808cf43b88dcd3acd4c1be993939d196d7890bd2107c7c3","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-26T13:35:55Z","title_canon_sha256":"8778f37f12c1d570cdea181d54caf29368170103a43fa255a55395f08ff50fd5"},"schema_version":"1.0","source":{"id":"1810.11319","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11319","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11319v4","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11319","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"CWWNZUDOKBKM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CWWNZUDOKBKMA6XH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CWWNZUDO","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:4af38a507ba5d38d92e45e3d752d8f9f9865af8e17f30064dff77202de44aed2","target":"graph","created_at":"2026-05-18T00:00:42Z","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":"Many important real-world applications-such as social networks or distributed data bases-can be modeled as hypergraphs. In such a model, vertices represent entities-such as users or data records-whereas hyperedges model a group membership of the vertices-such as the authorship in a specific topic or the membership of a data record in a specific replicated shard. To optimize such applications, we need an efficient and effective solution to the NP-hard balanced k-way hypergraph partitioning problem. However, existing hypergraph partitioners that scale to very large graphs do not effectively expl","authors_text":"Christian Mayer, Kurt Rothermel, Lukas Epple, Ruben Mayer, Sukanya Bhowmik","cross_cats":["cs.DS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-26T13:35:55Z","title":"HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11319","kind":"arxiv","version":4},"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:ce14aabe878a73f79fa5a6c4a2d34acd072db86f1b52b7e3fc7e44c769d06380","target":"record","created_at":"2026-05-18T00:00:42Z","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":"7f6e1d62c23ed0124808cf43b88dcd3acd4c1be993939d196d7890bd2107c7c3","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-26T13:35:55Z","title_canon_sha256":"8778f37f12c1d570cdea181d54caf29368170103a43fa255a55395f08ff50fd5"},"schema_version":"1.0","source":{"id":"1810.11319","kind":"arxiv","version":4}},"canonical_sha256":"15acdcd06e5054c07ae732c013d67f6e71d9c31ef31fdec704a9e185f2377b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15acdcd06e5054c07ae732c013d67f6e71d9c31ef31fdec704a9e185f2377b80","first_computed_at":"2026-05-18T00:00:42.921680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:42.921680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NE6i3SIJYXvueUBNqtZ8b7BBCid29MZMXBRW+4HQPiPKLVqfq2Ohh7Hs37SqUr2Zw45IaEtd/Opz4YHAn19HCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:42.922062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11319","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce14aabe878a73f79fa5a6c4a2d34acd072db86f1b52b7e3fc7e44c769d06380","sha256:4af38a507ba5d38d92e45e3d752d8f9f9865af8e17f30064dff77202de44aed2"],"state_sha256":"bb9b00730ab93cc667bf03a57ce7d17e567518d1f96b03f758ce0ff4e72e581e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyzQIzRXK8Ky1Tz4KVHiu3MpWRdIwWMKE1B+rNtxM0S/tkz73wLAT14aNrYU3jc/qCj8TDkrVz/KiRoPJs/GDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:11:41.344161Z","bundle_sha256":"f1360f7b175ed528f1c1a832d29ec97f99355b5e2a00c33b9473e25622565a1f"}}