{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N4WZLTEPQR3KKDVDXVS35WB24T","short_pith_number":"pith:N4WZLTEP","schema_version":"1.0","canonical_sha256":"6f2d95cc8f8476a50ea3bd65bed83ae4dee8e39a41d8072c344a4e642eea618d","source":{"kind":"arxiv","id":"1710.01883","version":2},"attestation_state":"computed","paper":{"title":"Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Jixiang Meng, Liqiong Xu, Yingzhi Tian","submitted_at":"2017-10-05T04:47:44Z","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"},"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":"1710.01883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T04:47:44Z","cross_cats_sorted":[],"title_canon_sha256":"9812f548dd0da1b47faf634703c7f127237bf1bed4ef6014098e195156fc5296","abstract_canon_sha256":"5c06d51553ca5db735e2b7e78a5433acf0b1cf927a236a7c5a1d6a427eb99650"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:29.581929Z","signature_b64":"jrQiarSfEHAReNRbaD39HT/wCKERCxCxXWJ5NWO2OJYKfzqLKDDi6dY+Sv+rSfeWic3/4hRYM8YbFBrzlxZ1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f2d95cc8f8476a50ea3bd65bed83ae4dee8e39a41d8072c344a4e642eea618d","last_reissued_at":"2026-05-18T00:33:29.581255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:29.581255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Jixiang Meng, Liqiong Xu, Yingzhi Tian","submitted_at":"2017-10-05T04:47:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01883","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":"1710.01883","created_at":"2026-05-18T00:33:29.581383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01883v2","created_at":"2026-05-18T00:33:29.581383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01883","created_at":"2026-05-18T00:33:29.581383+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4WZLTEPQR3K","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4WZLTEPQR3KKDVD","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4WZLTEP","created_at":"2026-05-18T12:31:31.346846+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/N4WZLTEPQR3KKDVDXVS35WB24T","json":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T.json","graph_json":"https://pith.science/api/pith-number/N4WZLTEPQR3KKDVDXVS35WB24T/graph.json","events_json":"https://pith.science/api/pith-number/N4WZLTEPQR3KKDVDXVS35WB24T/events.json","paper":"https://pith.science/paper/N4WZLTEP"},"agent_actions":{"view_html":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T","download_json":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T.json","view_paper":"https://pith.science/paper/N4WZLTEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01883&json=true","fetch_graph":"https://pith.science/api/pith-number/N4WZLTEPQR3KKDVDXVS35WB24T/graph.json","fetch_events":"https://pith.science/api/pith-number/N4WZLTEPQR3KKDVDXVS35WB24T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T/action/storage_attestation","attest_author":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T/action/author_attestation","sign_citation":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T/action/citation_signature","submit_replication":"https://pith.science/pith/N4WZLTEPQR3KKDVDXVS35WB24T/action/replication_record"}},"created_at":"2026-05-18T00:33:29.581383+00:00","updated_at":"2026-05-18T00:33:29.581383+00:00"}