{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DIDEILBYILI6BRC7ZX2HNGFI6N","short_pith_number":"pith:DIDEILBY","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"},"canonical_sha256":"1a06442c3842d1e0c45fcdf47698a8f36e53e7fb7a8c4580e67482394b5d3d0c","source":{"kind":"arxiv","id":"1611.07087","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07087","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07087v3","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07087","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"DIDEILBYILI6","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"DIDEILBYILI6BRC7","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"DIDEILBY","created_at":"2026-07-04T23:56:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DIDEILBYILI6BRC7ZX2HNGFI6N","target":"record","payload":{"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"},"canonical_sha256":"1a06442c3842d1e0c45fcdf47698a8f36e53e7fb7a8c4580e67482394b5d3d0c","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"},"source_kind":"arxiv","source_id":"1611.07087","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-07-04T23:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"midye45QUMTGKoHwvdlzJW6qOhrUX/2uagJXlaocTLfVgDenZXoC/yoNWkx3FRX6mgUJvQiqje7jYGTXz50YDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:31:30.024578Z"},"content_sha256":"b9dbae46f86ea9625744ac9ded183f291f27f660fd7157e981acd61273b0a3d2","schema_version":"1.0","event_id":"sha256:b9dbae46f86ea9625744ac9ded183f291f27f660fd7157e981acd61273b0a3d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DIDEILBYILI6BRC7ZX2HNGFI6N","target":"graph","payload":{"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"},"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-04T23:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yg7Wi2QzwoCx2RB67vtrlDGwcgddYVYmJUhD4NYq+MPGDtW0+vFnkGIuqq4ROWfzA5TplfQsTyZjEDwXFwbYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:31:30.025477Z"},"content_sha256":"d3d2d9e68b2f8cd70795f50fcd29f620d1dbb374738b2eb7a6660735a935a259","schema_version":"1.0","event_id":"sha256:d3d2d9e68b2f8cd70795f50fcd29f620d1dbb374738b2eb7a6660735a935a259"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/bundle.json","state_url":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/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-06T21:31:30Z","links":{"resolver":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N","bundle":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/bundle.json","state":"https://pith.science/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIDEILBYILI6BRC7ZX2HNGFI6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DIDEILBYILI6BRC7ZX2HNGFI6N","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":"4cb51398e4761aa724ac089a18b37794d256da7996e961f75372b280993b5483","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T22:45:46Z","title_canon_sha256":"110901e83188dd80b10ac4a75451f480045e24a027c95dad4ffdc55653b2fd74"},"schema_version":"1.0","source":{"id":"1611.07087","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07087","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07087v3","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07087","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"DIDEILBYILI6","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"DIDEILBYILI6BRC7","created_at":"2026-07-04T23:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"DIDEILBY","created_at":"2026-07-04T23:56:32Z"}],"graph_snapshots":[{"event_id":"sha256:d3d2d9e68b2f8cd70795f50fcd29f620d1dbb374738b2eb7a6660735a935a259","target":"graph","created_at":"2026-07-04T23:56:32Z","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/1611.07087/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"David Pike, John Proos, Megan Dewar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T22:45:46Z","title":"Connectivity in Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07087","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:b9dbae46f86ea9625744ac9ded183f291f27f660fd7157e981acd61273b0a3d2","target":"record","created_at":"2026-07-04T23:56:32Z","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":"4cb51398e4761aa724ac089a18b37794d256da7996e961f75372b280993b5483","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T22:45:46Z","title_canon_sha256":"110901e83188dd80b10ac4a75451f480045e24a027c95dad4ffdc55653b2fd74"},"schema_version":"1.0","source":{"id":"1611.07087","kind":"arxiv","version":3}},"canonical_sha256":"1a06442c3842d1e0c45fcdf47698a8f36e53e7fb7a8c4580e67482394b5d3d0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a06442c3842d1e0c45fcdf47698a8f36e53e7fb7a8c4580e67482394b5d3d0c","first_computed_at":"2026-07-04T23:56:32.303200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:56:32.303200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9C6awueg1dAI3IzQ/is5uQ6CsfqsMnO2q5A15SVeEIChTseiEYfSSxqoL9m9Ji56j2R4+3GO1Ftqk4toGvYMCA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:56:32.303652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07087","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9dbae46f86ea9625744ac9ded183f291f27f660fd7157e981acd61273b0a3d2","sha256:d3d2d9e68b2f8cd70795f50fcd29f620d1dbb374738b2eb7a6660735a935a259"],"state_sha256":"6c8da8d07e0ec6dd053a0c79f57a6260ec4c2f3b6aa45e441ea4b5ca39b4f3e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6n2RQ7Dekar/L3PE+DWlNfdzlgWPR4E681MBHBaThnB7KmyvknJ21cJBKdN7nWmG+7oLeDmZ/G+0GpOj8rpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:31:30.030803Z","bundle_sha256":"e566c8675dc69dd37403408a8d55a6e909d2d65a5aada65bad9e38340faa1142"}}