{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2DRSPPCVPVRWUYYO22WE7OJO4L","short_pith_number":"pith:2DRSPPCV","schema_version":"1.0","canonical_sha256":"d0e327bc557d636a630ed6ac4fb92ee2f226d2ddffe325d3862081c764b1d828","source":{"kind":"arxiv","id":"1711.09262","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonian Path in Split Graphs- a Dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"N. Sadagopan, P. Renjith","submitted_at":"2017-11-25T17:27:28Z","abstract_excerpt":"In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the Hamiltonian path problem in $K_{1,4}$-free split graphs. We close this paper with the hardness result: we show that, unless P=NP, Hamiltonian path problem is NP-complete in $K_{1,5}$-free split graphs by reducing from Hamiltonian cycle problem in $K"},"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":"1711.09262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-25T17:27:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"32c083f3e867685998f947552c9bab3a8dc92280093eb9bc43b6e315ea6cb16d","abstract_canon_sha256":"2f77180977fb6a1da14a63e36295f4751ade36648b8dd67c68bbe8a06b8f3337"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:36.244786Z","signature_b64":"mUuyV5WD+FuoS7wyF38393qr1NFZ3xhqfBhCokumpl7YffCeGiIvxNh7W8BB++RpzDKw8K5yYjpK8Cx55Of0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0e327bc557d636a630ed6ac4fb92ee2f226d2ddffe325d3862081c764b1d828","last_reissued_at":"2026-05-18T00:29:36.244036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:36.244036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian Path in Split Graphs- a Dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"N. Sadagopan, P. Renjith","submitted_at":"2017-11-25T17:27:28Z","abstract_excerpt":"In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the Hamiltonian path problem in $K_{1,4}$-free split graphs. We close this paper with the hardness result: we show that, unless P=NP, Hamiltonian path problem is NP-complete in $K_{1,5}$-free split graphs by reducing from Hamiltonian cycle problem in $K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09262","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":"1711.09262","created_at":"2026-05-18T00:29:36.244159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09262v1","created_at":"2026-05-18T00:29:36.244159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09262","created_at":"2026-05-18T00:29:36.244159+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DRSPPCVPVRW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DRSPPCVPVRWUYYO","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DRSPPCV","created_at":"2026-05-18T12:30:55.937587+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/2DRSPPCVPVRWUYYO22WE7OJO4L","json":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L.json","graph_json":"https://pith.science/api/pith-number/2DRSPPCVPVRWUYYO22WE7OJO4L/graph.json","events_json":"https://pith.science/api/pith-number/2DRSPPCVPVRWUYYO22WE7OJO4L/events.json","paper":"https://pith.science/paper/2DRSPPCV"},"agent_actions":{"view_html":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L","download_json":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L.json","view_paper":"https://pith.science/paper/2DRSPPCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09262&json=true","fetch_graph":"https://pith.science/api/pith-number/2DRSPPCVPVRWUYYO22WE7OJO4L/graph.json","fetch_events":"https://pith.science/api/pith-number/2DRSPPCVPVRWUYYO22WE7OJO4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/action/storage_attestation","attest_author":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/action/author_attestation","sign_citation":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/action/citation_signature","submit_replication":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/action/replication_record"}},"created_at":"2026-05-18T00:29:36.244159+00:00","updated_at":"2026-05-18T00:29:36.244159+00:00"}