{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OOWCJ3W7J4MYORT6UKCE6ME76T","short_pith_number":"pith:OOWCJ3W7","schema_version":"1.0","canonical_sha256":"73ac24eedf4f1987467ea2844f309ff4edbe4bd93d517fe659aca23a0c86bdca","source":{"kind":"arxiv","id":"1505.06181","version":2},"attestation_state":"computed","paper":{"title":"Dirac's Condition for Spanning Halin Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Songling Shan","submitted_at":"2015-05-22T19:08:36Z","abstract_excerpt":"Let $G$ be an $n$-vertex graph with $n\\ge 3$. A classic result of Dirac from 1952 asserts that $G$ is hamiltonian if $\\delta(G)\\ge n/2$. Dirac's theorem is one of the most influential results in the study of hamiltonicity and by now there are many related known results\\,(see, e.g., J. A. Bondy, Basic Graph Theory: Paths and Circuits, Chapter 1 in: {\\it Handbook of Combinatorics Vol.1}). A {\\it Halin graph} is a planar graph consisting of two edge-disjoint subgraphs: a spanning tree of at least 4 vertices and with no vertex of degree 2, and a cycle induced on the set of the leaves of the spanni"},"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":"1505.06181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T19:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"735d9a7d947d9801054fb6030ed133ddd5da749585de58b863c38a0a5c1d2a56","abstract_canon_sha256":"1dd3e7c82214e8868b97292dbd2fc4d800bb14adf6194f6aaba450840882bcb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:17.608055Z","signature_b64":"4JFYi/o/R4aftfiTCyfM/OLLazEaAk0nXm+SfHqibEx/K740G4RVkjL6n93t9A9GmselHVq68so7SEH3ImKbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ac24eedf4f1987467ea2844f309ff4edbe4bd93d517fe659aca23a0c86bdca","last_reissued_at":"2026-05-18T00:40:17.607404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:17.607404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dirac's Condition for Spanning Halin Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Songling Shan","submitted_at":"2015-05-22T19:08:36Z","abstract_excerpt":"Let $G$ be an $n$-vertex graph with $n\\ge 3$. A classic result of Dirac from 1952 asserts that $G$ is hamiltonian if $\\delta(G)\\ge n/2$. Dirac's theorem is one of the most influential results in the study of hamiltonicity and by now there are many related known results\\,(see, e.g., J. A. Bondy, Basic Graph Theory: Paths and Circuits, Chapter 1 in: {\\it Handbook of Combinatorics Vol.1}). A {\\it Halin graph} is a planar graph consisting of two edge-disjoint subgraphs: a spanning tree of at least 4 vertices and with no vertex of degree 2, and a cycle induced on the set of the leaves of the spanni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06181","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":"1505.06181","created_at":"2026-05-18T00:40:17.607507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06181v2","created_at":"2026-05-18T00:40:17.607507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06181","created_at":"2026-05-18T00:40:17.607507+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOWCJ3W7J4MY","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOWCJ3W7J4MYORT6","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOWCJ3W7","created_at":"2026-05-18T12:29:34.919912+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/OOWCJ3W7J4MYORT6UKCE6ME76T","json":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T.json","graph_json":"https://pith.science/api/pith-number/OOWCJ3W7J4MYORT6UKCE6ME76T/graph.json","events_json":"https://pith.science/api/pith-number/OOWCJ3W7J4MYORT6UKCE6ME76T/events.json","paper":"https://pith.science/paper/OOWCJ3W7"},"agent_actions":{"view_html":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T","download_json":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T.json","view_paper":"https://pith.science/paper/OOWCJ3W7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06181&json=true","fetch_graph":"https://pith.science/api/pith-number/OOWCJ3W7J4MYORT6UKCE6ME76T/graph.json","fetch_events":"https://pith.science/api/pith-number/OOWCJ3W7J4MYORT6UKCE6ME76T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/action/storage_attestation","attest_author":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/action/author_attestation","sign_citation":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/action/citation_signature","submit_replication":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/action/replication_record"}},"created_at":"2026-05-18T00:40:17.607507+00:00","updated_at":"2026-05-18T00:40:17.607507+00:00"}