{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CMYAQKGH7GQ5UXFPZYRVMCMYCO","short_pith_number":"pith:CMYAQKGH","canonical_record":{"source":{"id":"1607.08682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-29T03:22:56Z","cross_cats_sorted":[],"title_canon_sha256":"75a1316c43059635b539dcae169b897c3d982a5376ab3ad2b12c312e24e6f92d","abstract_canon_sha256":"4becc9ed72b677bea67364c18e8db28430c179c0cfd3e60ebb72818e0f442c2c"},"schema_version":"1.0"},"canonical_sha256":"13300828c7f9a1da5cafce2356099813b0c293db9740266371c9f074d8ebaf8c","source":{"kind":"arxiv","id":"1607.08682","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08682","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08682v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08682","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"CMYAQKGH7GQ5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CMYAQKGH7GQ5UXFP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CMYAQKGH","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CMYAQKGH7GQ5UXFPZYRVMCMYCO","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-29T03:22:56Z","cross_cats_sorted":[],"title_canon_sha256":"75a1316c43059635b539dcae169b897c3d982a5376ab3ad2b12c312e24e6f92d","abstract_canon_sha256":"4becc9ed72b677bea67364c18e8db28430c179c0cfd3e60ebb72818e0f442c2c"},"schema_version":"1.0"},"canonical_sha256":"13300828c7f9a1da5cafce2356099813b0c293db9740266371c9f074d8ebaf8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.074338Z","signature_b64":"5ks4aKQD6GWBj1idISZEC9VO19r/oVGySLlrqxoQqcyUwtiv2AYss8Xj1NlTg8mx9sSmYcdF0gzeby6EwuLSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13300828c7f9a1da5cafce2356099813b0c293db9740266371c9f074d8ebaf8c","last_reissued_at":"2026-05-18T00:44:37.073878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.073878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08682","source_version":3,"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:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUtOHFMgSInHp505DlZ7QioizpmNW07kAE2PPBFilt8qVx13wIvTRpWD48hFl1vLGNDZHvP6y8BEVsfJsOLBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:19:43.490969Z"},"content_sha256":"f9e23654fbf4eaf40d239ef95aacee8ad5387e728c293bc1e9909f8c21ae4ca3","schema_version":"1.0","event_id":"sha256:f9e23654fbf4eaf40d239ef95aacee8ad5387e728c293bc1e9909f8c21ae4ca3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CMYAQKGH7GQ5UXFPZYRVMCMYCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing minimum cuts in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Chao Xu","submitted_at":"2016-07-29T03:22:56Z","abstract_excerpt":"We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph $H=(V,E)$ with $n = |V|$, $m = |E|$ and $p = \\sum_{e \\in E} |e|$ the best known algorithm to compute a global minimum cut in $H$ runs in time $O(np)$ for the uncapacitated case and in $O(np + n^2 \\log n)$ time for the capacitated case. We show the following new results.\n  1. Given an uncapacitated hypergraph $H$ and an integer $k$ we describe an algorithm that runs in $O(p)$ time to find a subhypergraph $H'$ with sum of degrees $O(kn)$ that preserves all edge-connectivities up to $k$ (a $k$-sparsifie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08682","kind":"arxiv","version":3},"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:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQ+xKRk9OwVmh9NNe5aNTYba3FECnS17emgMCw5XBRphTsigwklWyEb1JhniVPTkTHSeyuTwG6pP+anxJ2fpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:19:43.491328Z"},"content_sha256":"f649c2616271cbdd23edaf3bc0fa2c5079006855c8e2ce889654ee8db8e1e415","schema_version":"1.0","event_id":"sha256:f649c2616271cbdd23edaf3bc0fa2c5079006855c8e2ce889654ee8db8e1e415"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMYAQKGH7GQ5UXFPZYRVMCMYCO/bundle.json","state_url":"https://pith.science/pith/CMYAQKGH7GQ5UXFPZYRVMCMYCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMYAQKGH7GQ5UXFPZYRVMCMYCO/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-04T16:19:43Z","links":{"resolver":"https://pith.science/pith/CMYAQKGH7GQ5UXFPZYRVMCMYCO","bundle":"https://pith.science/pith/CMYAQKGH7GQ5UXFPZYRVMCMYCO/bundle.json","state":"https://pith.science/pith/CMYAQKGH7GQ5UXFPZYRVMCMYCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMYAQKGH7GQ5UXFPZYRVMCMYCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CMYAQKGH7GQ5UXFPZYRVMCMYCO","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":"4becc9ed72b677bea67364c18e8db28430c179c0cfd3e60ebb72818e0f442c2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-29T03:22:56Z","title_canon_sha256":"75a1316c43059635b539dcae169b897c3d982a5376ab3ad2b12c312e24e6f92d"},"schema_version":"1.0","source":{"id":"1607.08682","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08682","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08682v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08682","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"CMYAQKGH7GQ5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CMYAQKGH7GQ5UXFP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CMYAQKGH","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:f649c2616271cbdd23edaf3bc0fa2c5079006855c8e2ce889654ee8db8e1e415","target":"graph","created_at":"2026-05-18T00:44:37Z","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":"We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph $H=(V,E)$ with $n = |V|$, $m = |E|$ and $p = \\sum_{e \\in E} |e|$ the best known algorithm to compute a global minimum cut in $H$ runs in time $O(np)$ for the uncapacitated case and in $O(np + n^2 \\log n)$ time for the capacitated case. We show the following new results.\n  1. Given an uncapacitated hypergraph $H$ and an integer $k$ we describe an algorithm that runs in $O(p)$ time to find a subhypergraph $H'$ with sum of degrees $O(kn)$ that preserves all edge-connectivities up to $k$ (a $k$-sparsifie","authors_text":"Chandra Chekuri, Chao Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-29T03:22:56Z","title":"Computing minimum cuts in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08682","kind":"arxiv","version":3},"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:f9e23654fbf4eaf40d239ef95aacee8ad5387e728c293bc1e9909f8c21ae4ca3","target":"record","created_at":"2026-05-18T00:44:37Z","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":"4becc9ed72b677bea67364c18e8db28430c179c0cfd3e60ebb72818e0f442c2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-29T03:22:56Z","title_canon_sha256":"75a1316c43059635b539dcae169b897c3d982a5376ab3ad2b12c312e24e6f92d"},"schema_version":"1.0","source":{"id":"1607.08682","kind":"arxiv","version":3}},"canonical_sha256":"13300828c7f9a1da5cafce2356099813b0c293db9740266371c9f074d8ebaf8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13300828c7f9a1da5cafce2356099813b0c293db9740266371c9f074d8ebaf8c","first_computed_at":"2026-05-18T00:44:37.073878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:37.073878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ks4aKQD6GWBj1idISZEC9VO19r/oVGySLlrqxoQqcyUwtiv2AYss8Xj1NlTg8mx9sSmYcdF0gzeby6EwuLSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:37.074338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08682","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9e23654fbf4eaf40d239ef95aacee8ad5387e728c293bc1e9909f8c21ae4ca3","sha256:f649c2616271cbdd23edaf3bc0fa2c5079006855c8e2ce889654ee8db8e1e415"],"state_sha256":"f090ed624fd9a0983ea82846bbd030cb8d7861d130a03bfd90b79a11ddbeceed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8kcH2gVdAntnKJGkXL+6JujIqq1rigFIWmKN5J/vNcm3u6gmo6urKfJcGfB9mlEXExWkgee/aRbS+lycrVQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:19:43.493256Z","bundle_sha256":"03feb0b9de2702563536ac6401cc312095d6595c8aca7b97f0523aa338ce4fb1"}}