{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SP3VQFCFMHNDDZSKOCVELBIQXF","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":"fb6886cad374f9907715fd1bce6cbab2666901e1066280c1895fddda571746ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T17:17:57Z","title_canon_sha256":"ff709b705f194db1f3ac739ce0d739e81588eb68f4722c8f099a48b1fca961d8"},"schema_version":"1.0","source":{"id":"1603.09281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09281","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09281v1","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09281","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"SP3VQFCFMHND","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SP3VQFCFMHNDDZSK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SP3VQFCF","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:7db15b21d2ceb859f9a672c96ae6a7b66ebb2f990523ef620d744b8d3deac90e","target":"graph","created_at":"2026-05-18T01:18:00Z","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":"For minimally $k$-connected graphs on $n$ vertices, Mader proved a tight lower bound for the number $|V_k|$ of vertices of degree $k$ in dependence on $n$ and $k$. Oxley observed 1981 that in many cases a considerably better bound can be given if $m := |E|$ is used as additional parameter, i.e. in dependence on $m$, $n$ and $k$. It was left open to determine whether Oxley's bound is best possible.\n  We show that this is not the case, but propose a closely related bound that deviates from Oxley's long-standing one only for small values of $m$. We prove that this new bound is best possible. The ","authors_text":"Jens M. Schmidt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T17:17:57Z","title":"A Tight Bound for Minimal Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09281","kind":"arxiv","version":1},"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:a128aea23b848ce4fe34b17904ca8e4459b6a8c1836fea54d3dbbe95eb2600bd","target":"record","created_at":"2026-05-18T01:18:00Z","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":"fb6886cad374f9907715fd1bce6cbab2666901e1066280c1895fddda571746ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T17:17:57Z","title_canon_sha256":"ff709b705f194db1f3ac739ce0d739e81588eb68f4722c8f099a48b1fca961d8"},"schema_version":"1.0","source":{"id":"1603.09281","kind":"arxiv","version":1}},"canonical_sha256":"93f758144561da31e64a70aa458510b941c985e069082341b3c103ff3b1998d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93f758144561da31e64a70aa458510b941c985e069082341b3c103ff3b1998d0","first_computed_at":"2026-05-18T01:18:00.901530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:00.901530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gRq51P3cLia5jmQohPd7BQ2at9oS9I5ZVdkhWvd6yydqULE4U/i9UpFHuGq1MmzKzirGz7RsKuKosv6jyK9hBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:00.902247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a128aea23b848ce4fe34b17904ca8e4459b6a8c1836fea54d3dbbe95eb2600bd","sha256:7db15b21d2ceb859f9a672c96ae6a7b66ebb2f990523ef620d744b8d3deac90e"],"state_sha256":"0628838bc873d133c3b3908754dd13802e34d4d5d527179c6b0ff2d4c5376fc7"}