{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N4WZLTEPQR3KKDVDXVS35WB24T","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":"5c06d51553ca5db735e2b7e78a5433acf0b1cf927a236a7c5a1d6a427eb99650","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T04:47:44Z","title_canon_sha256":"9812f548dd0da1b47faf634703c7f127237bf1bed4ef6014098e195156fc5296"},"schema_version":"1.0","source":{"id":"1710.01883","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01883","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01883v2","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01883","created_at":"2026-05-18T00:33:29Z"},{"alias_kind":"pith_short_12","alias_value":"N4WZLTEPQR3K","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N4WZLTEPQR3KKDVD","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N4WZLTEP","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:f2c69e946c41dbd2ea3739ba3cab44fb2564fe21af355d0286fff8a35eca6eb5","target":"graph","created_at":"2026-05-18T00:33:29Z","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 [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with $\\delta(G)\\geq \\lfloor\\frac{3}{2}k\\rfloor+m-1$ contains a subtree $T'$ isomorphic to $T$ such that $G-V(T')$ is $k$-connected. The conjecture has been verified for paths, trees when $k=1$, and stars or double-stars when $k=2$. In this paper we verify the conjecture for two classes of trees when $k=2$.\n  For digraphs, Mader [J. Graph Theory 69 (2012) 324-329] conjectured that every $k$-connected digraph $D$ with minimum semi","authors_text":"Hong-Jian Lai, Jixiang Meng, Liqiong Xu, Yingzhi Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T04:47:44Z","title":"Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01883","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:c78e9e8f182154ca2d20e75825acf2ebe898360beb6d1876e88aad325b5cb50b","target":"record","created_at":"2026-05-18T00:33:29Z","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":"5c06d51553ca5db735e2b7e78a5433acf0b1cf927a236a7c5a1d6a427eb99650","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T04:47:44Z","title_canon_sha256":"9812f548dd0da1b47faf634703c7f127237bf1bed4ef6014098e195156fc5296"},"schema_version":"1.0","source":{"id":"1710.01883","kind":"arxiv","version":2}},"canonical_sha256":"6f2d95cc8f8476a50ea3bd65bed83ae4dee8e39a41d8072c344a4e642eea618d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f2d95cc8f8476a50ea3bd65bed83ae4dee8e39a41d8072c344a4e642eea618d","first_computed_at":"2026-05-18T00:33:29.581255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:29.581255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jrQiarSfEHAReNRbaD39HT/wCKERCxCxXWJ5NWO2OJYKfzqLKDDi6dY+Sv+rSfeWic3/4hRYM8YbFBrzlxZ1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:29.581929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01883","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c78e9e8f182154ca2d20e75825acf2ebe898360beb6d1876e88aad325b5cb50b","sha256:f2c69e946c41dbd2ea3739ba3cab44fb2564fe21af355d0286fff8a35eca6eb5"],"state_sha256":"9be188c3c8025c67da0c6ff707ed6db754dd1474d5dcc8e3c3ddc238ef307bf2"}