{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SP3VQFCFMHNDDZSKOCVELBIQXF","short_pith_number":"pith:SP3VQFCF","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"},"canonical_sha256":"93f758144561da31e64a70aa458510b941c985e069082341b3c103ff3b1998d0","source":{"kind":"arxiv","id":"1603.09281","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SP3VQFCFMHNDDZSKOCVELBIQXF","target":"record","payload":{"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"},"canonical_sha256":"93f758144561da31e64a70aa458510b941c985e069082341b3c103ff3b1998d0","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"},"source_kind":"arxiv","source_id":"1603.09281","source_version":1,"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-18T01:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZ3B2BANx4f8O3ovaPKOmEpYXDM2wRWNIyeESjlZ525eWIfIQWFCy/FW5J5vt4FIDqbO5hgs6HUGW/dJKe2hCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:29:37.395072Z"},"content_sha256":"a128aea23b848ce4fe34b17904ca8e4459b6a8c1836fea54d3dbbe95eb2600bd","schema_version":"1.0","event_id":"sha256:a128aea23b848ce4fe34b17904ca8e4459b6a8c1836fea54d3dbbe95eb2600bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SP3VQFCFMHNDDZSKOCVELBIQXF","target":"graph","payload":{"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"},"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-18T01:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LPHzA+1HoBumxRCTtiXU2IyUsGatGoO1XQfV+76wCS1M++b4Pq/VteSu1B/ZfaMq9QAxl5JARt3iOrZAmGJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:29:37.395444Z"},"content_sha256":"7db15b21d2ceb859f9a672c96ae6a7b66ebb2f990523ef620d744b8d3deac90e","schema_version":"1.0","event_id":"sha256:7db15b21d2ceb859f9a672c96ae6a7b66ebb2f990523ef620d744b8d3deac90e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/bundle.json","state_url":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/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-26T11:29:37Z","links":{"resolver":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF","bundle":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/bundle.json","state":"https://pith.science/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SP3VQFCFMHNDDZSKOCVELBIQXF/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"72IfqVQUWCztkwq2yx86ekvgciKUt0FAI8iLgF2xtN+p2YBcaa1vNlqu9izHxSJrmsFYebR6mLH872R6Tw4QBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:29:37.397481Z","bundle_sha256":"c598376483551b7bd436f28735f462e843ca36845d27b1a3ef934229a8106e02"}}