{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X6HOR63A3I5YVWKNLRZ5IBTMIC","short_pith_number":"pith:X6HOR63A","schema_version":"1.0","canonical_sha256":"bf8ee8fb60da3b8ad94d5c73d4066c4084be09afb278302a59854b3d5153f152","source":{"kind":"arxiv","id":"1708.05396","version":1},"attestation_state":"computed","paper":{"title":"Sufficient conditions for graphs to be $k$-connected, maximally connected and super-connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuyuan Chen, Lutz Volkmann, Zheng-Jiang Xia, Zhen-Mu Hong","submitted_at":"2017-08-17T18:07:49Z","abstract_excerpt":"Let $G$ be a connected graph with minimum degree $\\delta(G)$ and vertex-connectivity $\\kappa(G)$. The graph $G$ is $k$-connected if $\\kappa(G)\\geq k$, maximally connected if $\\kappa(G) = \\delta(G)$, and super-connected (or super-$\\kappa$) if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is $k$-connected, maximally connected or super-connected if the number of edges or the spectral radius is large enough."},"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":"1708.05396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-17T18:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"2685b904e61d2ab18b9cad21b5c82d1300d646ad06a700de3ec71419b1df3b1f","abstract_canon_sha256":"c5f45640a4d860824ed9c816bd2a495610cf3818be8bae5bc3bd286d8ac746cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:50.194329Z","signature_b64":"+nVUqMfZS/t68//rJOBndc873JXSNYyby8Ztd/NM4KkHrYYkdsriO9DqQYP9R3MvOdYIQbrIjIJp70NGWphcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf8ee8fb60da3b8ad94d5c73d4066c4084be09afb278302a59854b3d5153f152","last_reissued_at":"2026-05-18T00:37:50.193654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:50.193654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sufficient conditions for graphs to be $k$-connected, maximally connected and super-connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuyuan Chen, Lutz Volkmann, Zheng-Jiang Xia, Zhen-Mu Hong","submitted_at":"2017-08-17T18:07:49Z","abstract_excerpt":"Let $G$ be a connected graph with minimum degree $\\delta(G)$ and vertex-connectivity $\\kappa(G)$. The graph $G$ is $k$-connected if $\\kappa(G)\\geq k$, maximally connected if $\\kappa(G) = \\delta(G)$, and super-connected (or super-$\\kappa$) if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is $k$-connected, maximally connected or super-connected if the number of edges or the spectral radius is large enough."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05396","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":"1708.05396","created_at":"2026-05-18T00:37:50.193749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05396v1","created_at":"2026-05-18T00:37:50.193749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05396","created_at":"2026-05-18T00:37:50.193749+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6HOR63A3I5Y","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6HOR63A3I5YVWKN","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6HOR63A","created_at":"2026-05-18T12:31:53.515858+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/X6HOR63A3I5YVWKNLRZ5IBTMIC","json":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC.json","graph_json":"https://pith.science/api/pith-number/X6HOR63A3I5YVWKNLRZ5IBTMIC/graph.json","events_json":"https://pith.science/api/pith-number/X6HOR63A3I5YVWKNLRZ5IBTMIC/events.json","paper":"https://pith.science/paper/X6HOR63A"},"agent_actions":{"view_html":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC","download_json":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC.json","view_paper":"https://pith.science/paper/X6HOR63A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05396&json=true","fetch_graph":"https://pith.science/api/pith-number/X6HOR63A3I5YVWKNLRZ5IBTMIC/graph.json","fetch_events":"https://pith.science/api/pith-number/X6HOR63A3I5YVWKNLRZ5IBTMIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC/action/storage_attestation","attest_author":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC/action/author_attestation","sign_citation":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC/action/citation_signature","submit_replication":"https://pith.science/pith/X6HOR63A3I5YVWKNLRZ5IBTMIC/action/replication_record"}},"created_at":"2026-05-18T00:37:50.193749+00:00","updated_at":"2026-05-18T00:37:50.193749+00:00"}