{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QBRHBV7RHAF4IFCW6V7RBT6LWK","short_pith_number":"pith:QBRHBV7R","schema_version":"1.0","canonical_sha256":"806270d7f1380bc41456f57f10cfcbb2948af6ec6192c31b03e32f0370a247c4","source":{"kind":"arxiv","id":"1412.2374","version":1},"attestation_state":"computed","paper":{"title":"Minimum degree condition for spanning generalized Halin graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Ping Yang, Songling Shan","submitted_at":"2014-12-07T17:30:37Z","abstract_excerpt":"A spanning tree with no vertices of degree 2 is called a Homeomorphically irreducible spanning tree\\,(HIST). Based on a HIST embedded in the plane, a Halin graph is formed by connecting the leaves of the tree into a cycle following the cyclic order determined by the embedding. Both of the determination problems of whether a graph contains a HIST or whether a graph contains a spanning Halin graph are shown to be NP-complete. It was conjectured by Albertson, Berman, Hutchinson, and Thomassen in 1990 that a {\\it every surface triangulation of at least four vertices contains a HIST}\\,(confirmed). "},"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":"1412.2374","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2014-12-07T17:30:37Z","cross_cats_sorted":[],"title_canon_sha256":"e990dab5350f349a53aef81a1a8a492bc2b10e2dee6154ed8c5276cdfa9222d8","abstract_canon_sha256":"93e79b48544ca6a9e4b5b184e096fd1286f150d5975c85c6526978d4791566a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:58.127978Z","signature_b64":"REBf0w80tcivbEqgGbAGXYZsUPNUJxU6AByzBA5aALCvaARDnTB0N+Gu3gj1SPFNKrvm44s6WB1Vvlv5T4WUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"806270d7f1380bc41456f57f10cfcbb2948af6ec6192c31b03e32f0370a247c4","last_reissued_at":"2026-05-18T02:31:58.127381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:58.127381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree condition for spanning generalized Halin graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Ping Yang, Songling Shan","submitted_at":"2014-12-07T17:30:37Z","abstract_excerpt":"A spanning tree with no vertices of degree 2 is called a Homeomorphically irreducible spanning tree\\,(HIST). Based on a HIST embedded in the plane, a Halin graph is formed by connecting the leaves of the tree into a cycle following the cyclic order determined by the embedding. Both of the determination problems of whether a graph contains a HIST or whether a graph contains a spanning Halin graph are shown to be NP-complete. It was conjectured by Albertson, Berman, Hutchinson, and Thomassen in 1990 that a {\\it every surface triangulation of at least four vertices contains a HIST}\\,(confirmed). "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2374","kind":"arxiv","version":1},"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":"1412.2374","created_at":"2026-05-18T02:31:58.127478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2374v1","created_at":"2026-05-18T02:31:58.127478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2374","created_at":"2026-05-18T02:31:58.127478+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBRHBV7RHAF4","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBRHBV7RHAF4IFCW","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBRHBV7R","created_at":"2026-05-18T12:28:43.426989+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/QBRHBV7RHAF4IFCW6V7RBT6LWK","json":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK.json","graph_json":"https://pith.science/api/pith-number/QBRHBV7RHAF4IFCW6V7RBT6LWK/graph.json","events_json":"https://pith.science/api/pith-number/QBRHBV7RHAF4IFCW6V7RBT6LWK/events.json","paper":"https://pith.science/paper/QBRHBV7R"},"agent_actions":{"view_html":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK","download_json":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK.json","view_paper":"https://pith.science/paper/QBRHBV7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2374&json=true","fetch_graph":"https://pith.science/api/pith-number/QBRHBV7RHAF4IFCW6V7RBT6LWK/graph.json","fetch_events":"https://pith.science/api/pith-number/QBRHBV7RHAF4IFCW6V7RBT6LWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK/action/storage_attestation","attest_author":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK/action/author_attestation","sign_citation":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK/action/citation_signature","submit_replication":"https://pith.science/pith/QBRHBV7RHAF4IFCW6V7RBT6LWK/action/replication_record"}},"created_at":"2026-05-18T02:31:58.127478+00:00","updated_at":"2026-05-18T02:31:58.127478+00:00"}