{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZIJKD2ZJX6EHU3HJNSGKZ4GVC5","short_pith_number":"pith:ZIJKD2ZJ","canonical_record":{"source":{"id":"2504.19842","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-28T14:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"9c35d783026c26a8a9f1e53f2d03a9b03ae21100667c4e42942388bfdeea2e9b","abstract_canon_sha256":"6de651447d27e2e84784d007699d12edabd1567721560bf7f3c803a8812b10d5"},"schema_version":"1.0"},"canonical_sha256":"ca12a1eb29bf887a6ce96c8cacf0d5174f796f66889f7073ba9136077abdacd6","source":{"kind":"arxiv","id":"2504.19842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.19842","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"2504.19842v2","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19842","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZIJKD2ZJX6EH","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZIJKD2ZJX6EHU3HJ","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZIJKD2ZJ","created_at":"2026-07-05T10:56:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZIJKD2ZJX6EHU3HJNSGKZ4GVC5","target":"record","payload":{"canonical_record":{"source":{"id":"2504.19842","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-28T14:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"9c35d783026c26a8a9f1e53f2d03a9b03ae21100667c4e42942388bfdeea2e9b","abstract_canon_sha256":"6de651447d27e2e84784d007699d12edabd1567721560bf7f3c803a8812b10d5"},"schema_version":"1.0"},"canonical_sha256":"ca12a1eb29bf887a6ce96c8cacf0d5174f796f66889f7073ba9136077abdacd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:18.656726Z","signature_b64":"33ZaagfwVCB1838ha1LoaWbSgbi7bI3HWCtfYvOOvdHI5Mubo7v8F+2ckPZ87KdZLWGHvsDfP9fWxb8URYo2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca12a1eb29bf887a6ce96c8cacf0d5174f796f66889f7073ba9136077abdacd6","last_reissued_at":"2026-07-05T10:56:18.656155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:18.656155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.19842","source_version":2,"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-05T10:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qz2sbNH+ORE+uX3yeeKTEc3bLrXrWITPR7EHcEGigEEMrdqmgEwSfmTsuLYShQrUL2u9o4pz8WnN1A2yr4tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:37:54.741503Z"},"content_sha256":"28cc1e7889e5afc1b8a73a66b8e8d41ef909c6c1d1a5bb70ce6f0766a44d42dc","schema_version":"1.0","event_id":"sha256:28cc1e7889e5afc1b8a73a66b8e8d41ef909c6c1d1a5bb70ce6f0766a44d42dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZIJKD2ZJX6EHU3HJNSGKZ4GVC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adil Chhabra, Bora U\\c{c}ar, Christian Schulz, Loris Wilwert","submitted_at":"2025-04-28T14:41:51Z","abstract_excerpt":"The hypergraph minimum cut problem aims to partition its vertices into two blocks while minimizing the total weight of the cut hyperedges. This fundamental problem arises in network reliability, VLSI design, and community detection. We present HeiCut, a scalable algorithm for computing near-optimal minimum cuts in both unweighted and weighted hypergraphs. HeiCut aggressively reduces the hypergraph size through a sequence of provably exact reductions that preserve the minimum cut, along with an optional heuristic contraction based on label propagation. It then solves a relaxed Binary Integer Li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19842","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.19842/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-05T10:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1VO9IHmX9dcd6wbR3Mtm463VuN9lDCd9NOZcR19Qbla3FUGSUck7z/1KTCghOfx/IsmKL2Q1upr9TYdBrHCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:37:54.742016Z"},"content_sha256":"abd7e0f436da6c5cb1475674c1cdc34004dfdc5ee02eff45c105764688c906cf","schema_version":"1.0","event_id":"sha256:abd7e0f436da6c5cb1475674c1cdc34004dfdc5ee02eff45c105764688c906cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIJKD2ZJX6EHU3HJNSGKZ4GVC5/bundle.json","state_url":"https://pith.science/pith/ZIJKD2ZJX6EHU3HJNSGKZ4GVC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIJKD2ZJX6EHU3HJNSGKZ4GVC5/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-21T09:37:54Z","links":{"resolver":"https://pith.science/pith/ZIJKD2ZJX6EHU3HJNSGKZ4GVC5","bundle":"https://pith.science/pith/ZIJKD2ZJX6EHU3HJNSGKZ4GVC5/bundle.json","state":"https://pith.science/pith/ZIJKD2ZJX6EHU3HJNSGKZ4GVC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIJKD2ZJX6EHU3HJNSGKZ4GVC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZIJKD2ZJX6EHU3HJNSGKZ4GVC5","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":"6de651447d27e2e84784d007699d12edabd1567721560bf7f3c803a8812b10d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-28T14:41:51Z","title_canon_sha256":"9c35d783026c26a8a9f1e53f2d03a9b03ae21100667c4e42942388bfdeea2e9b"},"schema_version":"1.0","source":{"id":"2504.19842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.19842","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"2504.19842v2","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19842","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZIJKD2ZJX6EH","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZIJKD2ZJX6EHU3HJ","created_at":"2026-07-05T10:56:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZIJKD2ZJ","created_at":"2026-07-05T10:56:18Z"}],"graph_snapshots":[{"event_id":"sha256:abd7e0f436da6c5cb1475674c1cdc34004dfdc5ee02eff45c105764688c906cf","target":"graph","created_at":"2026-07-05T10:56:18Z","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/2504.19842/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The hypergraph minimum cut problem aims to partition its vertices into two blocks while minimizing the total weight of the cut hyperedges. This fundamental problem arises in network reliability, VLSI design, and community detection. We present HeiCut, a scalable algorithm for computing near-optimal minimum cuts in both unweighted and weighted hypergraphs. HeiCut aggressively reduces the hypergraph size through a sequence of provably exact reductions that preserve the minimum cut, along with an optional heuristic contraction based on label propagation. It then solves a relaxed Binary Integer Li","authors_text":"Adil Chhabra, Bora U\\c{c}ar, Christian Schulz, Loris Wilwert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19842","kind":"arxiv","version":2},"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:28cc1e7889e5afc1b8a73a66b8e8d41ef909c6c1d1a5bb70ce6f0766a44d42dc","target":"record","created_at":"2026-07-05T10:56:18Z","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":"6de651447d27e2e84784d007699d12edabd1567721560bf7f3c803a8812b10d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-28T14:41:51Z","title_canon_sha256":"9c35d783026c26a8a9f1e53f2d03a9b03ae21100667c4e42942388bfdeea2e9b"},"schema_version":"1.0","source":{"id":"2504.19842","kind":"arxiv","version":2}},"canonical_sha256":"ca12a1eb29bf887a6ce96c8cacf0d5174f796f66889f7073ba9136077abdacd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca12a1eb29bf887a6ce96c8cacf0d5174f796f66889f7073ba9136077abdacd6","first_computed_at":"2026-07-05T10:56:18.656155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:56:18.656155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33ZaagfwVCB1838ha1LoaWbSgbi7bI3HWCtfYvOOvdHI5Mubo7v8F+2ckPZ87KdZLWGHvsDfP9fWxb8URYo2BA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:56:18.656726Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.19842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28cc1e7889e5afc1b8a73a66b8e8d41ef909c6c1d1a5bb70ce6f0766a44d42dc","sha256:abd7e0f436da6c5cb1475674c1cdc34004dfdc5ee02eff45c105764688c906cf"],"state_sha256":"25376be2046443ec279be6b550befd642c18a55d347486efaad3f8daff3d0709"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDU+vF4ajYtZxQfFEBj6/vTHL0SvQmvrtalrjSYqC2gpzYwEvFVoOaUpyD7EfRd4epygRPZVyvPzGkGc0bybDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T09:37:54.747528Z","bundle_sha256":"225bd3c90413974c7cf51cf51a5ab4545dae725592c150698f3aca74d5f9f64a"}}