{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TUONWYIOZZRUDDQUG3BMRTCACF","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":"f7f02d5af4c8bf58121487111b3ef5f63f537f681568c377837f0ab045e17e7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-21T04:56:01Z","title_canon_sha256":"0f317392c15ab6f4ff6be3c00871023ba1643171e0a9f90b76ef0979c8233080"},"schema_version":"1.0","source":{"id":"2605.21998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21998","created_at":"2026-05-22T01:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21998v1","created_at":"2026-05-22T01:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21998","created_at":"2026-05-22T01:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"TUONWYIOZZRU","created_at":"2026-05-22T01:04:19Z"},{"alias_kind":"pith_short_16","alias_value":"TUONWYIOZZRUDDQU","created_at":"2026-05-22T01:04:19Z"},{"alias_kind":"pith_short_8","alias_value":"TUONWYIO","created_at":"2026-05-22T01:04:19Z"}],"graph_snapshots":[{"event_id":"sha256:9335c1c0e77de8e259440cd06b6489e38f456c0015717b514d22ccc787489e91","target":"graph","created_at":"2026-05-22T01:04:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.21998/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dan Li, Huiqiu Lin, Yu Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21998","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:c07ee48098a9cbf584be759faeb8cbc28a463e8347902529cb4fc888bb8a5da8","target":"record","created_at":"2026-05-22T01:04:19Z","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":"f7f02d5af4c8bf58121487111b3ef5f63f537f681568c377837f0ab045e17e7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-21T04:56:01Z","title_canon_sha256":"0f317392c15ab6f4ff6be3c00871023ba1643171e0a9f90b76ef0979c8233080"},"schema_version":"1.0","source":{"id":"2605.21998","kind":"arxiv","version":1}},"canonical_sha256":"9d1cdb610ece63418e1436c2c8cc4011447a831e5c2820a646163fcc1d2d95cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d1cdb610ece63418e1436c2c8cc4011447a831e5c2820a646163fcc1d2d95cd","first_computed_at":"2026-05-22T01:04:19.751509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:19.751509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZR3nRdbafpGy+wSfsZuNCsUQFGXKrMEEnwPjcF7qttU+f2vW6SDwzZ1BOb2sS4Gg0cT8D23hEy25OBsMXuSJAQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:19.752239Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c07ee48098a9cbf584be759faeb8cbc28a463e8347902529cb4fc888bb8a5da8","sha256:9335c1c0e77de8e259440cd06b6489e38f456c0015717b514d22ccc787489e91"],"state_sha256":"163675523a9fcaa2c659130478902bff5a7671a8be437c113bb29deb3187cf62"}