{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DIDEILBYILI6BRC7ZX2HNGFI6N","short_pith_number":"pith:DIDEILBY","schema_version":"1.0","canonical_sha256":"1a06442c3842d1e0c45fcdf47698a8f36e53e7fb7a8c4580e67482394b5d3d0c","source":{"kind":"arxiv","id":"1611.07087","version":3},"attestation_state":"computed","paper":{"title":"Connectivity in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Pike, John Proos, Megan Dewar","submitted_at":"2016-11-21T22:45:46Z","abstract_excerpt":"In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from graphs to hypergraphs. We find that while determining a minimum weak vertex cut can be done in polynomial time and is equivalent to finding a minimum vertex cut in the 2-section of the hypergraph in question, determining a minimum strong vertex cut is NP-hard for general hypergraphs. Moreover, the problem of finding minimum strong vertex cuts re"},"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":"1611.07087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T22:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"110901e83188dd80b10ac4a75451f480045e24a027c95dad4ffdc55653b2fd74","abstract_canon_sha256":"4cb51398e4761aa724ac089a18b37794d256da7996e961f75372b280993b5483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:32.303652Z","signature_b64":"9C6awueg1dAI3IzQ/is5uQ6CsfqsMnO2q5A15SVeEIChTseiEYfSSxqoL9m9Ji56j2R4+3GO1Ftqk4toGvYMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a06442c3842d1e0c45fcdf47698a8f36e53e7fb7a8c4580e67482394b5d3d0c","last_reissued_at":"2026-07-04T23:56:32.303200Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:32.303200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Pike, John Proos, Megan Dewar","submitted_at":"2016-11-21T22:45:46Z","abstract_excerpt":"In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from graphs to hypergraphs. We find that while determining a minimum weak vertex cut can be done in polynomial time and is equivalent to finding a minimum vertex cut in the 2-section of the hypergraph in question, determining a minimum strong vertex cut is NP-hard for general hypergraphs. Moreover, the problem of finding minimum strong vertex cuts re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07087","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1611.07087/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":"1611.07087","created_at":"2026-07-04T23:56:32.303256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07087v3","created_at":"2026-07-04T23:56:32.303256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07087","created_at":"2026-07-04T23:56:32.303256+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIDEILBYILI6","created_at":"2026-07-04T23:56:32.303256+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIDEILBYILI6BRC7","created_at":"2026-07-04T23:56:32.303256+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIDEILBY","created_at":"2026-07-04T23:56:32.303256+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/DIDEILBYILI6BRC7ZX2HNGFI6N","json":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N.json","graph_json":"https://pith.science/api/pith-number/DIDEILBYILI6BRC7ZX2HNGFI6N/graph.json","events_json":"https://pith.science/api/pith-number/DIDEILBYILI6BRC7ZX2HNGFI6N/events.json","paper":"https://pith.science/paper/DIDEILBY"},"agent_actions":{"view_html":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N","download_json":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N.json","view_paper":"https://pith.science/paper/DIDEILBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07087&json=true","fetch_graph":"https://pith.science/api/pith-number/DIDEILBYILI6BRC7ZX2HNGFI6N/graph.json","fetch_events":"https://pith.science/api/pith-number/DIDEILBYILI6BRC7ZX2HNGFI6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/action/storage_attestation","attest_author":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/action/author_attestation","sign_citation":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/action/citation_signature","submit_replication":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/action/replication_record"}},"created_at":"2026-07-04T23:56:32.303256+00:00","updated_at":"2026-07-04T23:56:32.303256+00:00"}