{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MBE2APQS2XB6L3M6EKBK5LS4GP","short_pith_number":"pith:MBE2APQS","canonical_record":{"source":{"id":"1309.0217","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T13:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"313385c72b3417ac22d77637638b7efe21f7962afda4060dc31ad85cbb7ead62","abstract_canon_sha256":"57b3cb2efef01d7adfb01864d1c7df27e672479e14ee77d566bc2afbdf5b8ded"},"schema_version":"1.0"},"canonical_sha256":"6049a03e12d5c3e5ed9e2282aeae5c33e3dedd2f4ef641a936059c948aa7914d","source":{"kind":"arxiv","id":"1309.0217","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0217","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0217v6","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0217","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"MBE2APQS2XB6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MBE2APQS2XB6L3M6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MBE2APQS","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MBE2APQS2XB6L3M6EKBK5LS4GP","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0217","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T13:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"313385c72b3417ac22d77637638b7efe21f7962afda4060dc31ad85cbb7ead62","abstract_canon_sha256":"57b3cb2efef01d7adfb01864d1c7df27e672479e14ee77d566bc2afbdf5b8ded"},"schema_version":"1.0"},"canonical_sha256":"6049a03e12d5c3e5ed9e2282aeae5c33e3dedd2f4ef641a936059c948aa7914d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:29.547037Z","signature_b64":"j8B7r8JNWHLABbjuhVd/TCnJU5JPqxCBXN97Sa1s78RqZeea6qM9xDxlWuCH3XO0ZvoIgaHpGXpN7RRDW804Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6049a03e12d5c3e5ed9e2282aeae5c33e3dedd2f4ef641a936059c948aa7914d","last_reissued_at":"2026-05-18T02:27:29.546264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:29.546264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0217","source_version":6,"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-18T02:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RE8HZDfkUTOgaHTrAD+60xAen5pLXQIgtH2xCZG3yEdqa3MW+ObgzBLaIos/wK5NBX6EfAiq5D6elDr4o3ImDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:54:13.981914Z"},"content_sha256":"bc60125b309fa8c4e6064f789ec0c43742577053bcca6d35ab8cf174aa339a2f","schema_version":"1.0","event_id":"sha256:bc60125b309fa8c4e6064f789ec0c43742577053bcca6d35ab8cf174aa339a2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MBE2APQS2XB6L3M6EKBK5LS4GP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral radius and Hamiltonian properties of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Jun Ge","submitted_at":"2013-09-01T13:06:31Z","abstract_excerpt":"Let $G$ be a graph with minimum degree $\\delta$. The spectral radius of $G$, denoted by $\\rho(G)$, is the largest eigenvalue of the adjacency matrix of $G$. In this note we mainly prove the following two results. (1) Let $G$ be a graph on $n\\geq 4$ vertices with $\\delta\\geq 1$. If $\\rho(G)> n-3$, then $G$ contains a Hamilton path unless $G\\in\\{K_1\\vee (K_{n-3}+2K_1),K_2\\vee 4K_1,K_1\\vee (K_{1,3}+K_1)\\}$. (2) Let $G$ be a graph on $n\\geq 14$ vertices with $\\delta \\geq 2$. If $\\rho(G)\\geq \\rho(K_2\\vee (K_{n-4}+2K_1))$, then $G$ contains a Hamilton cycle unless $G= K_2\\vee (K_{n-4}+2K_1)$. As cor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0217","kind":"arxiv","version":6},"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-18T02:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVtqcMHX3BfPYqwiKhnI7rfUhET87zEHnnkfAWt2zB2rfZAHUcQG9FSRte5NyiuGW9WjAp+hV9/pGsbaUpGtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:54:13.982254Z"},"content_sha256":"76034129cacc9dd4340d8ca4b46c70a2b543faa470e690bf75e1f27aa8435932","schema_version":"1.0","event_id":"sha256:76034129cacc9dd4340d8ca4b46c70a2b543faa470e690bf75e1f27aa8435932"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBE2APQS2XB6L3M6EKBK5LS4GP/bundle.json","state_url":"https://pith.science/pith/MBE2APQS2XB6L3M6EKBK5LS4GP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBE2APQS2XB6L3M6EKBK5LS4GP/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-06-04T19:54:13Z","links":{"resolver":"https://pith.science/pith/MBE2APQS2XB6L3M6EKBK5LS4GP","bundle":"https://pith.science/pith/MBE2APQS2XB6L3M6EKBK5LS4GP/bundle.json","state":"https://pith.science/pith/MBE2APQS2XB6L3M6EKBK5LS4GP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBE2APQS2XB6L3M6EKBK5LS4GP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MBE2APQS2XB6L3M6EKBK5LS4GP","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":"57b3cb2efef01d7adfb01864d1c7df27e672479e14ee77d566bc2afbdf5b8ded","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T13:06:31Z","title_canon_sha256":"313385c72b3417ac22d77637638b7efe21f7962afda4060dc31ad85cbb7ead62"},"schema_version":"1.0","source":{"id":"1309.0217","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0217","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0217v6","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0217","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"MBE2APQS2XB6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MBE2APQS2XB6L3M6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MBE2APQS","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:76034129cacc9dd4340d8ca4b46c70a2b543faa470e690bf75e1f27aa8435932","target":"graph","created_at":"2026-05-18T02:27:29Z","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":"Let $G$ be a graph with minimum degree $\\delta$. The spectral radius of $G$, denoted by $\\rho(G)$, is the largest eigenvalue of the adjacency matrix of $G$. In this note we mainly prove the following two results. (1) Let $G$ be a graph on $n\\geq 4$ vertices with $\\delta\\geq 1$. If $\\rho(G)> n-3$, then $G$ contains a Hamilton path unless $G\\in\\{K_1\\vee (K_{n-3}+2K_1),K_2\\vee 4K_1,K_1\\vee (K_{1,3}+K_1)\\}$. (2) Let $G$ be a graph on $n\\geq 14$ vertices with $\\delta \\geq 2$. If $\\rho(G)\\geq \\rho(K_2\\vee (K_{n-4}+2K_1))$, then $G$ contains a Hamilton cycle unless $G= K_2\\vee (K_{n-4}+2K_1)$. As cor","authors_text":"Bo Ning, Jun Ge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T13:06:31Z","title":"Spectral radius and Hamiltonian properties of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0217","kind":"arxiv","version":6},"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:bc60125b309fa8c4e6064f789ec0c43742577053bcca6d35ab8cf174aa339a2f","target":"record","created_at":"2026-05-18T02:27:29Z","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":"57b3cb2efef01d7adfb01864d1c7df27e672479e14ee77d566bc2afbdf5b8ded","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T13:06:31Z","title_canon_sha256":"313385c72b3417ac22d77637638b7efe21f7962afda4060dc31ad85cbb7ead62"},"schema_version":"1.0","source":{"id":"1309.0217","kind":"arxiv","version":6}},"canonical_sha256":"6049a03e12d5c3e5ed9e2282aeae5c33e3dedd2f4ef641a936059c948aa7914d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6049a03e12d5c3e5ed9e2282aeae5c33e3dedd2f4ef641a936059c948aa7914d","first_computed_at":"2026-05-18T02:27:29.546264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:29.546264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j8B7r8JNWHLABbjuhVd/TCnJU5JPqxCBXN97Sa1s78RqZeea6qM9xDxlWuCH3XO0ZvoIgaHpGXpN7RRDW804Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:29.547037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0217","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc60125b309fa8c4e6064f789ec0c43742577053bcca6d35ab8cf174aa339a2f","sha256:76034129cacc9dd4340d8ca4b46c70a2b543faa470e690bf75e1f27aa8435932"],"state_sha256":"8862f0b9b5acc3df58a503e8283a03f3d6ec993a316fa586d56a56c422a7e040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5ahmxqbxcOzpPTjkG9yHQv3sw8ifBzW3NhFuOcM81ptw/10UDvqGndefzJTmGZ8VhiekdHpNweStdnnn6eDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:54:13.984690Z","bundle_sha256":"5da646bcb600c3eac80d106ea030af7bdab70658e92a65db3ba4c1ec2900ddf9"}}