{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U5AORQMDVX5E3GEDZGZYMAQQ3Z","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":"467ed3bbc48fb762343a031bb1c5d6e4085aaa6c0fb2719d9d74d97c5e1bfe85","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-05T15:39:59Z","title_canon_sha256":"fd9b51a787a7cea1d0c3c69b1bb265128cc6d3e2f5153de96bbdf26e3a4db1fa"},"schema_version":"1.0","source":{"id":"1801.01795","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01795","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01795v2","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01795","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"U5AORQMDVX5E","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U5AORQMDVX5E3GED","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U5AORQMD","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:a3a056d52042c416a053e019f5bc7e916cdf8e08e0273f907c112724a2597b24","target":"graph","created_at":"2026-05-17T23:49:44Z","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":"Mader proved that every strongly $k$-connected $n$-vertex digraph contains a strongly $k$-connected spanning subgraph with at most $2kn - 2k^2$ edges, where the equality holds for the complete bipartite digraph ${DK}_{k,n-k}$. For dense strongly $k$-connected digraphs, this upper bound can be significantly improved. More precisely, we prove that every strongly $k$-connected $n$-vertex digraph $D$ contains a strongly $k$-connected spanning subgraph with at most $kn + 800k(k+\\overline{\\Delta}(D))$ edges, where $\\overline{\\Delta}(D)$ denotes the maximum degree of the complement of the underlying ","authors_text":"Dong Yeap Kang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-05T15:39:59Z","title":"Sparse highly connected spanning subgraphs in dense directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01795","kind":"arxiv","version":2},"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:a9a6f0ca45c9d85c4928ece9cc96d2b42acd271d456f3a78d51c5238f5a14af1","target":"record","created_at":"2026-05-17T23:49:44Z","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":"467ed3bbc48fb762343a031bb1c5d6e4085aaa6c0fb2719d9d74d97c5e1bfe85","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-05T15:39:59Z","title_canon_sha256":"fd9b51a787a7cea1d0c3c69b1bb265128cc6d3e2f5153de96bbdf26e3a4db1fa"},"schema_version":"1.0","source":{"id":"1801.01795","kind":"arxiv","version":2}},"canonical_sha256":"a740e8c183adfa4d9883c9b3860210de74aff1e95184b45e1c45a79a56a848b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a740e8c183adfa4d9883c9b3860210de74aff1e95184b45e1c45a79a56a848b9","first_computed_at":"2026-05-17T23:49:44.158146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:44.158146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nWsrCl0bEyfP7O+dpNWD0f9QIxUypLemn8hXhV2/irc4qpQQ1r+IjVrh5jh/uMc3yOKQK8inTCQgi+lONmVECQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:44.158662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01795","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9a6f0ca45c9d85c4928ece9cc96d2b42acd271d456f3a78d51c5238f5a14af1","sha256:a3a056d52042c416a053e019f5bc7e916cdf8e08e0273f907c112724a2597b24"],"state_sha256":"bf1bdc6ae34206904982552fdcd9f01a5fdbef698a8fa86da853719654f647ca"}