{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2DRSPPCVPVRWUYYO22WE7OJO4L","short_pith_number":"pith:2DRSPPCV","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"},"canonical_sha256":"d0e327bc557d636a630ed6ac4fb92ee2f226d2ddffe325d3862081c764b1d828","source":{"kind":"arxiv","id":"1711.09262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09262","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09262v1","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09262","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"pith_short_12","alias_value":"2DRSPPCVPVRW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2DRSPPCVPVRWUYYO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2DRSPPCV","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2DRSPPCVPVRWUYYO22WE7OJO4L","target":"record","payload":{"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"},"canonical_sha256":"d0e327bc557d636a630ed6ac4fb92ee2f226d2ddffe325d3862081c764b1d828","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"},"source_kind":"arxiv","source_id":"1711.09262","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZtOMvNL0f5sEafyy6hx5+2FwZ1fotwemYHdXslGoiyMqvves57L3tamDu6yHwr+/yrfJzUtv+tdqr7qywJnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:39:12.540614Z"},"content_sha256":"7538a62dfb929928fd6b97f2707da9b3527daee2cc65f9b9a44c6822281c5919","schema_version":"1.0","event_id":"sha256:7538a62dfb929928fd6b97f2707da9b3527daee2cc65f9b9a44c6822281c5919"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2DRSPPCVPVRWUYYO22WE7OJO4L","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hw41myF8N7Wvm+ldNv9rt/wG0JQP0y1l5uYwioYEQKOWtjm42bduyxSIXstYCgTXDNvN+A7r0VUQ7+gMi0Q5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:39:12.541271Z"},"content_sha256":"f6ba92820a72bbda380c9ca5329ce2f9a5a055ad0c5c7f9275f70d8431a07017","schema_version":"1.0","event_id":"sha256:f6ba92820a72bbda380c9ca5329ce2f9a5a055ad0c5c7f9275f70d8431a07017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/bundle.json","state_url":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T08:39:12Z","links":{"resolver":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L","bundle":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/bundle.json","state":"https://pith.science/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DRSPPCVPVRWUYYO22WE7OJO4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2DRSPPCVPVRWUYYO22WE7OJO4L","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":"2f77180977fb6a1da14a63e36295f4751ade36648b8dd67c68bbe8a06b8f3337","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-25T17:27:28Z","title_canon_sha256":"32c083f3e867685998f947552c9bab3a8dc92280093eb9bc43b6e315ea6cb16d"},"schema_version":"1.0","source":{"id":"1711.09262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09262","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09262v1","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09262","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"pith_short_12","alias_value":"2DRSPPCVPVRW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2DRSPPCVPVRWUYYO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2DRSPPCV","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:f6ba92820a72bbda380c9ca5329ce2f9a5a055ad0c5c7f9275f70d8431a07017","target":"graph","created_at":"2026-05-18T00:29:36Z","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":"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","authors_text":"N. Sadagopan, P. Renjith","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-25T17:27:28Z","title":"Hamiltonian Path in Split Graphs- a Dichotomy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09262","kind":"arxiv","version":1},"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:7538a62dfb929928fd6b97f2707da9b3527daee2cc65f9b9a44c6822281c5919","target":"record","created_at":"2026-05-18T00:29:36Z","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":"2f77180977fb6a1da14a63e36295f4751ade36648b8dd67c68bbe8a06b8f3337","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-25T17:27:28Z","title_canon_sha256":"32c083f3e867685998f947552c9bab3a8dc92280093eb9bc43b6e315ea6cb16d"},"schema_version":"1.0","source":{"id":"1711.09262","kind":"arxiv","version":1}},"canonical_sha256":"d0e327bc557d636a630ed6ac4fb92ee2f226d2ddffe325d3862081c764b1d828","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0e327bc557d636a630ed6ac4fb92ee2f226d2ddffe325d3862081c764b1d828","first_computed_at":"2026-05-18T00:29:36.244036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:36.244036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mUuyV5WD+FuoS7wyF38393qr1NFZ3xhqfBhCokumpl7YffCeGiIvxNh7W8BB++RpzDKw8K5yYjpK8Cx55Of0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:36.244786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7538a62dfb929928fd6b97f2707da9b3527daee2cc65f9b9a44c6822281c5919","sha256:f6ba92820a72bbda380c9ca5329ce2f9a5a055ad0c5c7f9275f70d8431a07017"],"state_sha256":"b88f1f87c20ae1e677b0348b7b546910498d9792cb6fe6f49823a3dd5cc725a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccMN9d0n5Dwy6wuKXRRX4CFHolhkV7AvP06hGyYDyUj3U7C/ZhSx76yE+EWJ4Di4cTihEHp5ti6ElQ0q4fAbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:39:12.545055Z","bundle_sha256":"fb46e803ba9e6c98c4b6460d18798c934483424ff77a60ed6e83d86c5d3ac952"}}