{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7D54O2UM5VZBV2ERVWNN5OPHUK","short_pith_number":"pith:7D54O2UM","schema_version":"1.0","canonical_sha256":"f8fbc76a8ced721ae891ad9adeb9e7a292752d5757d4289984120b31bd388baa","source":{"kind":"arxiv","id":"1603.02474","version":2},"attestation_state":"computed","paper":{"title":"Sparse spanning $k$-connected subgraphs in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Geewon Suh, Jaehoon Kim, Younjin Kim","submitted_at":"2016-03-08T10:54:27Z","abstract_excerpt":"In 2009, Bang-Jensen asked whether there exists a function $g(k)$ such that every strongly $k$-connected $n$-vertex tournament contains a strongly $k$-connected spanning subgraph with at most $kn + g(k)$ arcs. In this paper, we answer the question by showing that every strongly $k$-connected $n$-vertex tournament contains a strongly $k$-connected spanning subgraph with at most $kn + 750k^2\\log(k+1)$ arcs."},"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":"1603.02474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-08T10:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"4685a99a617594bcaec4526774a65a2a7bb9d75e101d552c8d31f4a395f22644","abstract_canon_sha256":"58feeb141713192d23322fe9f2fd9bb8757f86ab7369f504be7b4f6626dc9754"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:21.493032Z","signature_b64":"0F7+bLOuM2pvSES8YF3U3m1k9iZ2yIVOzAU7wMw22+bYHutF0cfu0N2fDSnraqWwCJr1zjGEG3h4WGFCGOgtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8fbc76a8ced721ae891ad9adeb9e7a292752d5757d4289984120b31bd388baa","last_reissued_at":"2026-05-18T00:25:21.492402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:21.492402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse spanning $k$-connected subgraphs in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Geewon Suh, Jaehoon Kim, Younjin Kim","submitted_at":"2016-03-08T10:54:27Z","abstract_excerpt":"In 2009, Bang-Jensen asked whether there exists a function $g(k)$ such that every strongly $k$-connected $n$-vertex tournament contains a strongly $k$-connected spanning subgraph with at most $kn + g(k)$ arcs. In this paper, we answer the question by showing that every strongly $k$-connected $n$-vertex tournament contains a strongly $k$-connected spanning subgraph with at most $kn + 750k^2\\log(k+1)$ arcs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02474","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":"1603.02474","created_at":"2026-05-18T00:25:21.492507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02474v2","created_at":"2026-05-18T00:25:21.492507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02474","created_at":"2026-05-18T00:25:21.492507+00:00"},{"alias_kind":"pith_short_12","alias_value":"7D54O2UM5VZB","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7D54O2UM5VZBV2ER","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7D54O2UM","created_at":"2026-05-18T12:30:04.600751+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/7D54O2UM5VZBV2ERVWNN5OPHUK","json":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK.json","graph_json":"https://pith.science/api/pith-number/7D54O2UM5VZBV2ERVWNN5OPHUK/graph.json","events_json":"https://pith.science/api/pith-number/7D54O2UM5VZBV2ERVWNN5OPHUK/events.json","paper":"https://pith.science/paper/7D54O2UM"},"agent_actions":{"view_html":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK","download_json":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK.json","view_paper":"https://pith.science/paper/7D54O2UM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02474&json=true","fetch_graph":"https://pith.science/api/pith-number/7D54O2UM5VZBV2ERVWNN5OPHUK/graph.json","fetch_events":"https://pith.science/api/pith-number/7D54O2UM5VZBV2ERVWNN5OPHUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK/action/storage_attestation","attest_author":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK/action/author_attestation","sign_citation":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK/action/citation_signature","submit_replication":"https://pith.science/pith/7D54O2UM5VZBV2ERVWNN5OPHUK/action/replication_record"}},"created_at":"2026-05-18T00:25:21.492507+00:00","updated_at":"2026-05-18T00:25:21.492507+00:00"}