{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U5AORQMDVX5E3GEDZGZYMAQQ3Z","short_pith_number":"pith:U5AORQMD","schema_version":"1.0","canonical_sha256":"a740e8c183adfa4d9883c9b3860210de74aff1e95184b45e1c45a79a56a848b9","source":{"kind":"arxiv","id":"1801.01795","version":2},"attestation_state":"computed","paper":{"title":"Sparse highly connected spanning subgraphs in dense directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang","submitted_at":"2018-01-05T15:39:59Z","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 "},"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":"1801.01795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-05T15:39:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fd9b51a787a7cea1d0c3c69b1bb265128cc6d3e2f5153de96bbdf26e3a4db1fa","abstract_canon_sha256":"467ed3bbc48fb762343a031bb1c5d6e4085aaa6c0fb2719d9d74d97c5e1bfe85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:44.158662Z","signature_b64":"nWsrCl0bEyfP7O+dpNWD0f9QIxUypLemn8hXhV2/irc4qpQQ1r+IjVrh5jh/uMc3yOKQK8inTCQgi+lONmVECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a740e8c183adfa4d9883c9b3860210de74aff1e95184b45e1c45a79a56a848b9","last_reissued_at":"2026-05-17T23:49:44.158146Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:44.158146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse highly connected spanning subgraphs in dense directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang","submitted_at":"2018-01-05T15:39:59Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01795","kind":"arxiv","version":2},"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":"1801.01795","created_at":"2026-05-17T23:49:44.158239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01795v2","created_at":"2026-05-17T23:49:44.158239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01795","created_at":"2026-05-17T23:49:44.158239+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5AORQMDVX5E","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5AORQMDVX5E3GED","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5AORQMD","created_at":"2026-05-18T12:32:56.356000+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/U5AORQMDVX5E3GEDZGZYMAQQ3Z","json":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z.json","graph_json":"https://pith.science/api/pith-number/U5AORQMDVX5E3GEDZGZYMAQQ3Z/graph.json","events_json":"https://pith.science/api/pith-number/U5AORQMDVX5E3GEDZGZYMAQQ3Z/events.json","paper":"https://pith.science/paper/U5AORQMD"},"agent_actions":{"view_html":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z","download_json":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z.json","view_paper":"https://pith.science/paper/U5AORQMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01795&json=true","fetch_graph":"https://pith.science/api/pith-number/U5AORQMDVX5E3GEDZGZYMAQQ3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/U5AORQMDVX5E3GEDZGZYMAQQ3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z/action/storage_attestation","attest_author":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z/action/author_attestation","sign_citation":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z/action/citation_signature","submit_replication":"https://pith.science/pith/U5AORQMDVX5E3GEDZGZYMAQQ3Z/action/replication_record"}},"created_at":"2026-05-17T23:49:44.158239+00:00","updated_at":"2026-05-17T23:49:44.158239+00:00"}