{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TUONWYIOZZRUDDQUG3BMRTCACF","short_pith_number":"pith:TUONWYIO","schema_version":"1.0","canonical_sha256":"9d1cdb610ece63418e1436c2c8cc4011447a831e5c2820a646163fcc1d2d95cd","source":{"kind":"arxiv","id":"2605.21998","version":1},"attestation_state":"computed","paper":{"title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Dan Li, Huiqiu Lin, Yu Wang","submitted_at":"2026-05-21T04:56:01Z","abstract_excerpt":"For $l > 1$, the $l$-edge-connectivity $\\kappa'_l(G)$ of a connected graph $G$ is defined as the minimum number of edges whose removal leaves a graph with at least $l$ components. A graph is minimally $(k,l)$-edge-connected if $\\kappa'_l(G)\\geq k$ but for any edge $e\\in E(G)$ satisfies that $\\kappa'_l(G-e)< k$. Motivated by two foundational extremal problems: Brualdi and Solheid's problem [SIAM J. Algebra Discrete Methods (1986)] for graphs of fixed order: determine sharp upper bounds for the spectral radius over graph families and characterize extremal graphs; and its fixed size analogue prop"},"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":"2605.21998","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-21T04:56:01Z","cross_cats_sorted":[],"title_canon_sha256":"0f317392c15ab6f4ff6be3c00871023ba1643171e0a9f90b76ef0979c8233080","abstract_canon_sha256":"f7f02d5af4c8bf58121487111b3ef5f63f537f681568c377837f0ab045e17e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:19.752239Z","signature_b64":"ZR3nRdbafpGy+wSfsZuNCsUQFGXKrMEEnwPjcF7qttU+f2vW6SDwzZ1BOb2sS4Gg0cT8D23hEy25OBsMXuSJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d1cdb610ece63418e1436c2c8cc4011447a831e5c2820a646163fcc1d2d95cd","last_reissued_at":"2026-05-22T01:04:19.751509Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:19.751509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Dan Li, Huiqiu Lin, Yu Wang","submitted_at":"2026-05-21T04:56:01Z","abstract_excerpt":"For $l > 1$, the $l$-edge-connectivity $\\kappa'_l(G)$ of a connected graph $G$ is defined as the minimum number of edges whose removal leaves a graph with at least $l$ components. A graph is minimally $(k,l)$-edge-connected if $\\kappa'_l(G)\\geq k$ but for any edge $e\\in E(G)$ satisfies that $\\kappa'_l(G-e)< k$. Motivated by two foundational extremal problems: Brualdi and Solheid's problem [SIAM J. Algebra Discrete Methods (1986)] for graphs of fixed order: determine sharp upper bounds for the spectral radius over graph families and characterize extremal graphs; and its fixed size analogue prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21998","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21998/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.21998","created_at":"2026-05-22T01:04:19.751632+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21998v1","created_at":"2026-05-22T01:04:19.751632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21998","created_at":"2026-05-22T01:04:19.751632+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUONWYIOZZRU","created_at":"2026-05-22T01:04:19.751632+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUONWYIOZZRUDDQU","created_at":"2026-05-22T01:04:19.751632+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUONWYIO","created_at":"2026-05-22T01:04:19.751632+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/TUONWYIOZZRUDDQUG3BMRTCACF","json":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF.json","graph_json":"https://pith.science/api/pith-number/TUONWYIOZZRUDDQUG3BMRTCACF/graph.json","events_json":"https://pith.science/api/pith-number/TUONWYIOZZRUDDQUG3BMRTCACF/events.json","paper":"https://pith.science/paper/TUONWYIO"},"agent_actions":{"view_html":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF","download_json":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF.json","view_paper":"https://pith.science/paper/TUONWYIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21998&json=true","fetch_graph":"https://pith.science/api/pith-number/TUONWYIOZZRUDDQUG3BMRTCACF/graph.json","fetch_events":"https://pith.science/api/pith-number/TUONWYIOZZRUDDQUG3BMRTCACF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF/action/storage_attestation","attest_author":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF/action/author_attestation","sign_citation":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF/action/citation_signature","submit_replication":"https://pith.science/pith/TUONWYIOZZRUDDQUG3BMRTCACF/action/replication_record"}},"created_at":"2026-05-22T01:04:19.751632+00:00","updated_at":"2026-05-22T01:04:19.751632+00:00"}