{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YZXCF2VZ3M26XCYQTGIK2M2UCB","short_pith_number":"pith:YZXCF2VZ","schema_version":"1.0","canonical_sha256":"c66e22eab9db35eb8b109990ad33541041f7b45003612dc4cfdf3384d3255897","source":{"kind":"arxiv","id":"1602.01033","version":3},"attestation_state":"computed","paper":{"title":"Spectral radius and Hamiltonicity of graphs with large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2016-02-02T18:19:21Z","abstract_excerpt":"This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\\lambda\\left( G\\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are:\n  (1) Let $k\\geq1,$ $n\\geq k^{3}/2+k+4,$ and let $G$ be a graph of order $n$, with minimum degree $\\delta\\left( G\\right) \\geq k.$ If \\[ \\lambda\\left( G\\right) \\geq n-k-1, \\] then $G$ has a Hamiltonian cycle, unless $G=K_{1}\\vee(K_{n-k-1}+K_{k})$ or $G=K_{k}\\vee(K_{n-2k}+\\overline{K}_{k})$.\n  (2) Let $k\\geq1,$ $n\\geq k^{3}/2+k^{2}/2+k+5,$ and let $G$ be a graph of order $n$, w"},"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":"1602.01033","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T18:19:21Z","cross_cats_sorted":[],"title_canon_sha256":"f937db36d2adb15b640ee1e5d57306b4c8756f2ce48904c982427a6b298a7101","abstract_canon_sha256":"dd55bf024e9f0bafd44196bacfadeaf35d463786978bceb84c2f4ce5fa742ba6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:09.754009Z","signature_b64":"AoWepQeJdJkvxcbULSzC67F2k3rz/OETr7cAL3nHu6ZeG2A3jiIj8FXrwafuv0hMDr/UswbCGRxtay2DDFKLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c66e22eab9db35eb8b109990ad33541041f7b45003612dc4cfdf3384d3255897","last_reissued_at":"2026-05-18T01:00:09.753441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:09.753441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral radius and Hamiltonicity of graphs with large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2016-02-02T18:19:21Z","abstract_excerpt":"This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\\lambda\\left( G\\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are:\n  (1) Let $k\\geq1,$ $n\\geq k^{3}/2+k+4,$ and let $G$ be a graph of order $n$, with minimum degree $\\delta\\left( G\\right) \\geq k.$ If \\[ \\lambda\\left( G\\right) \\geq n-k-1, \\] then $G$ has a Hamiltonian cycle, unless $G=K_{1}\\vee(K_{n-k-1}+K_{k})$ or $G=K_{k}\\vee(K_{n-2k}+\\overline{K}_{k})$.\n  (2) Let $k\\geq1,$ $n\\geq k^{3}/2+k^{2}/2+k+5,$ and let $G$ be a graph of order $n$, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01033","kind":"arxiv","version":3},"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":"1602.01033","created_at":"2026-05-18T01:00:09.753548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01033v3","created_at":"2026-05-18T01:00:09.753548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01033","created_at":"2026-05-18T01:00:09.753548+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZXCF2VZ3M26","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZXCF2VZ3M26XCYQ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZXCF2VZ","created_at":"2026-05-18T12:30:53.716459+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/YZXCF2VZ3M26XCYQTGIK2M2UCB","json":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB.json","graph_json":"https://pith.science/api/pith-number/YZXCF2VZ3M26XCYQTGIK2M2UCB/graph.json","events_json":"https://pith.science/api/pith-number/YZXCF2VZ3M26XCYQTGIK2M2UCB/events.json","paper":"https://pith.science/paper/YZXCF2VZ"},"agent_actions":{"view_html":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB","download_json":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB.json","view_paper":"https://pith.science/paper/YZXCF2VZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01033&json=true","fetch_graph":"https://pith.science/api/pith-number/YZXCF2VZ3M26XCYQTGIK2M2UCB/graph.json","fetch_events":"https://pith.science/api/pith-number/YZXCF2VZ3M26XCYQTGIK2M2UCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/action/storage_attestation","attest_author":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/action/author_attestation","sign_citation":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/action/citation_signature","submit_replication":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/action/replication_record"}},"created_at":"2026-05-18T01:00:09.753548+00:00","updated_at":"2026-05-18T01:00:09.753548+00:00"}