{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SP3VQFCFMHNDDZSKOCVELBIQXF","short_pith_number":"pith:SP3VQFCF","schema_version":"1.0","canonical_sha256":"93f758144561da31e64a70aa458510b941c985e069082341b3c103ff3b1998d0","source":{"kind":"arxiv","id":"1603.09281","version":1},"attestation_state":"computed","paper":{"title":"A Tight Bound for Minimal Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jens M. Schmidt","submitted_at":"2016-03-30T17:17:57Z","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 "},"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":"1603.09281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T17:17:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff709b705f194db1f3ac739ce0d739e81588eb68f4722c8f099a48b1fca961d8","abstract_canon_sha256":"fb6886cad374f9907715fd1bce6cbab2666901e1066280c1895fddda571746ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:00.902247Z","signature_b64":"gRq51P3cLia5jmQohPd7BQ2at9oS9I5ZVdkhWvd6yydqULE4U/i9UpFHuGq1MmzKzirGz7RsKuKosv6jyK9hBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f758144561da31e64a70aa458510b941c985e069082341b3c103ff3b1998d0","last_reissued_at":"2026-05-18T01:18:00.901530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:00.901530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Bound for Minimal Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jens M. Schmidt","submitted_at":"2016-03-30T17:17:57Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09281","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.09281","created_at":"2026-05-18T01:18:00.901655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09281v1","created_at":"2026-05-18T01:18:00.901655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09281","created_at":"2026-05-18T01:18:00.901655+00:00"},{"alias_kind":"pith_short_12","alias_value":"SP3VQFCFMHND","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SP3VQFCFMHNDDZSK","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SP3VQFCF","created_at":"2026-05-18T12:30:44.179134+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/SP3VQFCFMHNDDZSKOCVELBIQXF","json":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF.json","graph_json":"https://pith.science/api/pith-number/SP3VQFCFMHNDDZSKOCVELBIQXF/graph.json","events_json":"https://pith.science/api/pith-number/SP3VQFCFMHNDDZSKOCVELBIQXF/events.json","paper":"https://pith.science/paper/SP3VQFCF"},"agent_actions":{"view_html":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF","download_json":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF.json","view_paper":"https://pith.science/paper/SP3VQFCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09281&json=true","fetch_graph":"https://pith.science/api/pith-number/SP3VQFCFMHNDDZSKOCVELBIQXF/graph.json","fetch_events":"https://pith.science/api/pith-number/SP3VQFCFMHNDDZSKOCVELBIQXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/action/storage_attestation","attest_author":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/action/author_attestation","sign_citation":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/action/citation_signature","submit_replication":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/action/replication_record"}},"created_at":"2026-05-18T01:18:00.901655+00:00","updated_at":"2026-05-18T01:18:00.901655+00:00"}