{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NN5AVAP7UZ6MU3X5LERXALEQKY","short_pith_number":"pith:NN5AVAP7","schema_version":"1.0","canonical_sha256":"6b7a0a81ffa67cca6efd5923702c9056085de51271c70c4e4f24a1eda95a60c0","source":{"kind":"arxiv","id":"2605.20497","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cristina Silvano, Marco Ronzani","submitted_at":"2026-05-19T21:04:20Z","abstract_excerpt":"Hypergraph partitioning is a recurring NP-hard problem in engineering; its efficient solution at scale hinges on parallelism. This work proposes a GPU-centric algorithm for multi-level hypergraph partitioning aimed at a specific set of problem constraints: limited size and distinct inbound hyperedges per partition. Manipulating hypergraphs requires deeply nested traversals and concurrent decision-making; our constraints impose further set operations amidst that. In turn, we design algorithms around the GPU's hierarchical parallelism and our problem's specifics. When forming partitions, we mate"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.20497","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-19T21:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"a01436bea1259f4ebe6455c430c4dc4f0a93a7639ffd3655281986bc970d7deb","abstract_canon_sha256":"fc3f2b347408770b5edaa2ee18217d267b9dd013468d6e821d9a9bc83a7ddcdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:39.833870Z","signature_b64":"I9iWgxrMXTqEfxnl+cfjpc+aJYaIkLrOkdQg6jn95kB5y+CrN3SbSmMYPxp3uUtR8heJKFWJWgWcq8pDtvmjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b7a0a81ffa67cca6efd5923702c9056085de51271c70c4e4f24a1eda95a60c0","last_reissued_at":"2026-05-21T01:04:39.833260Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:39.833260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cristina Silvano, Marco Ronzani","submitted_at":"2026-05-19T21:04:20Z","abstract_excerpt":"Hypergraph partitioning is a recurring NP-hard problem in engineering; its efficient solution at scale hinges on parallelism. This work proposes a GPU-centric algorithm for multi-level hypergraph partitioning aimed at a specific set of problem constraints: limited size and distinct inbound hyperedges per partition. Manipulating hypergraphs requires deeply nested traversals and concurrent decision-making; our constraints impose further set operations amidst that. In turn, we design algorithms around the GPU's hierarchical parallelism and our problem's specifics. When forming partitions, we mate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20497","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.20497/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.20497","created_at":"2026-05-21T01:04:39.833358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20497v1","created_at":"2026-05-21T01:04:39.833358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20497","created_at":"2026-05-21T01:04:39.833358+00:00"},{"alias_kind":"pith_short_12","alias_value":"NN5AVAP7UZ6M","created_at":"2026-05-21T01:04:39.833358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NN5AVAP7UZ6MU3X5","created_at":"2026-05-21T01:04:39.833358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NN5AVAP7","created_at":"2026-05-21T01:04:39.833358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY","json":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY.json","graph_json":"https://pith.science/api/pith-number/NN5AVAP7UZ6MU3X5LERXALEQKY/graph.json","events_json":"https://pith.science/api/pith-number/NN5AVAP7UZ6MU3X5LERXALEQKY/events.json","paper":"https://pith.science/paper/NN5AVAP7"},"agent_actions":{"view_html":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY","download_json":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY.json","view_paper":"https://pith.science/paper/NN5AVAP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20497&json=true","fetch_graph":"https://pith.science/api/pith-number/NN5AVAP7UZ6MU3X5LERXALEQKY/graph.json","fetch_events":"https://pith.science/api/pith-number/NN5AVAP7UZ6MU3X5LERXALEQKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY/action/storage_attestation","attest_author":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY/action/author_attestation","sign_citation":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY/action/citation_signature","submit_replication":"https://pith.science/pith/NN5AVAP7UZ6MU3X5LERXALEQKY/action/replication_record"}},"created_at":"2026-05-21T01:04:39.833358+00:00","updated_at":"2026-05-21T01:04:39.833358+00:00"}