{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WBHLQTXYXZN5DPL2TPKA2WYGRF","short_pith_number":"pith:WBHLQTXY","schema_version":"1.0","canonical_sha256":"b04eb84ef8be5bd1bd7a9bd40d5b06894016a75a2efc35f9c1693f8d0a2910bc","source":{"kind":"arxiv","id":"2504.12013","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Parallel 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, Robert Krause","submitted_at":"2025-04-16T12:13:21Z","abstract_excerpt":"We present a deterministic parallel multilevel algorithm for balanced hypergraph partitioning that matches the state of the art for non-deterministic algorithms. Deterministic parallel algorithms produce the same result in each invocation, which is crucial for reproducibility. Moreover, determinism is highly desirable in application areas such as VLSI design. While there has been tremendous progress in parallel hypergraph partitioning algorithms recently, deterministic counterparts for high-quality local search techniques are missing. Consequently, solution quality is severely lacking in compa"},"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":"2504.12013","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-04-16T12:13:21Z","cross_cats_sorted":[],"title_canon_sha256":"1e0acd26fb36547a582f46fa7be7f53c4f671cffdda74654865869fc25041af4","abstract_canon_sha256":"803fb63e80076e36fccf6f808c1a2db6b5c4bd669d2444d9ade7d5959aa81378"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:34.994348Z","signature_b64":"7i7/oUUKAaOQ83730Yfl+OxAfNdL2RGUlHQgbvHrrcwEK4yVktKjxUodcl2SvKkHW5AYRfX7tsmtnqdWUlBZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04eb84ef8be5bd1bd7a9bd40d5b06894016a75a2efc35f9c1693f8d0a2910bc","last_reissued_at":"2026-07-05T11:01:34.993875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:34.993875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Parallel 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, Robert Krause","submitted_at":"2025-04-16T12:13:21Z","abstract_excerpt":"We present a deterministic parallel multilevel algorithm for balanced hypergraph partitioning that matches the state of the art for non-deterministic algorithms. Deterministic parallel algorithms produce the same result in each invocation, which is crucial for reproducibility. Moreover, determinism is highly desirable in application areas such as VLSI design. While there has been tremendous progress in parallel hypergraph partitioning algorithms recently, deterministic counterparts for high-quality local search techniques are missing. Consequently, solution quality is severely lacking in compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.12013","kind":"arxiv","version":2},"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/2504.12013/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":"2504.12013","created_at":"2026-07-05T11:01:34.993934+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.12013v2","created_at":"2026-07-05T11:01:34.993934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.12013","created_at":"2026-07-05T11:01:34.993934+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBHLQTXYXZN5","created_at":"2026-07-05T11:01:34.993934+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBHLQTXYXZN5DPL2","created_at":"2026-07-05T11:01:34.993934+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBHLQTXY","created_at":"2026-07-05T11:01:34.993934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.17615","citing_title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF","json":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF.json","graph_json":"https://pith.science/api/pith-number/WBHLQTXYXZN5DPL2TPKA2WYGRF/graph.json","events_json":"https://pith.science/api/pith-number/WBHLQTXYXZN5DPL2TPKA2WYGRF/events.json","paper":"https://pith.science/paper/WBHLQTXY"},"agent_actions":{"view_html":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF","download_json":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF.json","view_paper":"https://pith.science/paper/WBHLQTXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.12013&json=true","fetch_graph":"https://pith.science/api/pith-number/WBHLQTXYXZN5DPL2TPKA2WYGRF/graph.json","fetch_events":"https://pith.science/api/pith-number/WBHLQTXYXZN5DPL2TPKA2WYGRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF/action/storage_attestation","attest_author":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF/action/author_attestation","sign_citation":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF/action/citation_signature","submit_replication":"https://pith.science/pith/WBHLQTXYXZN5DPL2TPKA2WYGRF/action/replication_record"}},"created_at":"2026-07-05T11:01:34.993934+00:00","updated_at":"2026-07-05T11:01:34.993934+00:00"}