{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CCS7QBUERTCCNXFEVIAKBWPNAI","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":"979080c0d9c197b4465f61c886805c523a2665635899f01ac8b58f42746a8df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T06:56:05Z","title_canon_sha256":"04decf95b7f5be375a7af961f87e86d08f24a5f9e3b55a8cdcc41e92d73d5e30"},"schema_version":"1.0","source":{"id":"1804.01258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01258","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01258v1","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01258","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"CCS7QBUERTCC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CCS7QBUERTCCNXFE","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CCS7QBUE","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:5891c66406117ecf9694a06690a6308facee255b24ce0fb7a60bf41d073771b8","target":"graph","created_at":"2026-05-18T00:19:15Z","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 [Graphs Combin.~24 (2008) 469--483.], the third author and the fifth author conjectured that if $G$ is a $k$-connected graph such that $\\sigma_{k+1}(G) \\ge |V(G)|+\\kappa(G)+(k-2)(\\alpha(G)-1)$, then $G$ contains a Hamiltonian cycle, where $\\sigma_{k+1}(G)$, $\\kappa(G)$ and $\\alpha(G)$ are the minimum degree sum of $k+1$ independent vertices, the connectivity and the independence number of $G$, respectively. In this paper, we settle this conjecture. This is an improvement of the result obtained by Li: If $G$ is a $k$-connected graph such that $\\sigma_{k+1}(G) \\ge |V(G)|+(k-1)(\\alpha(G)-1)$, ","authors_text":"K. Ozeki, M. Furuya, M. Tsugaki, S. Chiba, T. Yamashita","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T06:56:05Z","title":"A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01258","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:b457d5d371f4f28f1230cf9f30b8de93960b0c842e24ca9a3739a157d9e27b24","target":"record","created_at":"2026-05-18T00:19:15Z","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":"979080c0d9c197b4465f61c886805c523a2665635899f01ac8b58f42746a8df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T06:56:05Z","title_canon_sha256":"04decf95b7f5be375a7af961f87e86d08f24a5f9e3b55a8cdcc41e92d73d5e30"},"schema_version":"1.0","source":{"id":"1804.01258","kind":"arxiv","version":1}},"canonical_sha256":"10a5f806848cc426dca4aa00a0d9ed020031599fab9f3ae96284ddb15ffd21b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10a5f806848cc426dca4aa00a0d9ed020031599fab9f3ae96284ddb15ffd21b3","first_computed_at":"2026-05-18T00:19:15.588364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:15.588364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W4yN+cQrX1UzO980ErH9YHWNj5rzzKDH0iGMNTprdIimayEmKvd7ZebRNqH/Dsy1/OW4o9dH7POzs93OIceXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:15.588917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b457d5d371f4f28f1230cf9f30b8de93960b0c842e24ca9a3739a157d9e27b24","sha256:5891c66406117ecf9694a06690a6308facee255b24ce0fb7a60bf41d073771b8"],"state_sha256":"34c45ed291844aa3db6a40021a072105d819de91043b62ea4eaa98c5ab3b5ced"}