{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YZXCF2VZ3M26XCYQTGIK2M2UCB","short_pith_number":"pith:YZXCF2VZ","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"},"canonical_sha256":"c66e22eab9db35eb8b109990ad33541041f7b45003612dc4cfdf3384d3255897","source":{"kind":"arxiv","id":"1602.01033","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01033","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01033v3","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01033","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"YZXCF2VZ3M26","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YZXCF2VZ3M26XCYQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YZXCF2VZ","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YZXCF2VZ3M26XCYQTGIK2M2UCB","target":"record","payload":{"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"},"canonical_sha256":"c66e22eab9db35eb8b109990ad33541041f7b45003612dc4cfdf3384d3255897","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"},"source_kind":"arxiv","source_id":"1602.01033","source_version":3,"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-18T01:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAnumOcoMMfM/vpQmuCGzeN2A3C1b2ehBQ4SG9adGlFFZ2YncZnppDnuHJKGfcgpOfH6wC5GigR6Yva4BryYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:49:02.568269Z"},"content_sha256":"beeb8e7b659425574ecaaa8fc7550dd52d6cc64c9b6931804f2995017639dd8f","schema_version":"1.0","event_id":"sha256:beeb8e7b659425574ecaaa8fc7550dd52d6cc64c9b6931804f2995017639dd8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YZXCF2VZ3M26XCYQTGIK2M2UCB","target":"graph","payload":{"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"},"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-18T01:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpDmJbYJq4XH83wcK+MXzyQMMlNHsrKQwbjp7SPOGpShvN0HCPEW7swB8jDkYlEWxf5qeMy9A1M7EMcO/YWwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:49:02.568916Z"},"content_sha256":"d6fc1bb096d42f66c3568ee88cbeedf7052cad4cac8b8658ec6bbd0743d34431","schema_version":"1.0","event_id":"sha256:d6fc1bb096d42f66c3568ee88cbeedf7052cad4cac8b8658ec6bbd0743d34431"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/bundle.json","state_url":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/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-24T14:49:02Z","links":{"resolver":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB","bundle":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/bundle.json","state":"https://pith.science/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZXCF2VZ3M26XCYQTGIK2M2UCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YZXCF2VZ3M26XCYQTGIK2M2UCB","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":"dd55bf024e9f0bafd44196bacfadeaf35d463786978bceb84c2f4ce5fa742ba6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T18:19:21Z","title_canon_sha256":"f937db36d2adb15b640ee1e5d57306b4c8756f2ce48904c982427a6b298a7101"},"schema_version":"1.0","source":{"id":"1602.01033","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01033","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01033v3","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01033","created_at":"2026-05-18T01:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"YZXCF2VZ3M26","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YZXCF2VZ3M26XCYQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YZXCF2VZ","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:d6fc1bb096d42f66c3568ee88cbeedf7052cad4cac8b8658ec6bbd0743d34431","target":"graph","created_at":"2026-05-18T01:00:09Z","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":"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","authors_text":"Vladimir Nikiforov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T18:19:21Z","title":"Spectral radius and Hamiltonicity of graphs with large minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01033","kind":"arxiv","version":3},"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:beeb8e7b659425574ecaaa8fc7550dd52d6cc64c9b6931804f2995017639dd8f","target":"record","created_at":"2026-05-18T01:00:09Z","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":"dd55bf024e9f0bafd44196bacfadeaf35d463786978bceb84c2f4ce5fa742ba6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T18:19:21Z","title_canon_sha256":"f937db36d2adb15b640ee1e5d57306b4c8756f2ce48904c982427a6b298a7101"},"schema_version":"1.0","source":{"id":"1602.01033","kind":"arxiv","version":3}},"canonical_sha256":"c66e22eab9db35eb8b109990ad33541041f7b45003612dc4cfdf3384d3255897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c66e22eab9db35eb8b109990ad33541041f7b45003612dc4cfdf3384d3255897","first_computed_at":"2026-05-18T01:00:09.753441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:09.753441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AoWepQeJdJkvxcbULSzC67F2k3rz/OETr7cAL3nHu6ZeG2A3jiIj8FXrwafuv0hMDr/UswbCGRxtay2DDFKLCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:09.754009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01033","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beeb8e7b659425574ecaaa8fc7550dd52d6cc64c9b6931804f2995017639dd8f","sha256:d6fc1bb096d42f66c3568ee88cbeedf7052cad4cac8b8658ec6bbd0743d34431"],"state_sha256":"89a51deddf8b2318643d8446e5a83d32b536d1f0eb10f58cd789f8191354c849"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Izsrtj2ECRSizdjbTp+t+/Cc7immFkBYUaFywKoHZdOoX05cWFgpMBj2xIJbpaOhvt/c9Ijyjt8T+r92QLEMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:49:02.572093Z","bundle_sha256":"9bd208259670e1a3df8830c6fc83ebb6a1c0c3d446cb70a05732ab50cbce8056"}}