{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KH4DCGENK4FUL7Y3QEY4IDA2AK","short_pith_number":"pith:KH4DCGEN","canonical_record":{"source":{"id":"1703.10268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T23:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"3b58f55e19449852d21566962c71dc24408f0f5635565d363acd74eadb3ca11d","abstract_canon_sha256":"c0420c42c5467f533e0eac77d69eea1ff631943f445bf64fb46089c4488c1f92"},"schema_version":"1.0"},"canonical_sha256":"51f831188d570b45ff1b8131c40c1a028b4d11849d2316bce0aea71901a58842","source":{"kind":"arxiv","id":"1703.10268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10268","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10268v2","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10268","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"pith_short_12","alias_value":"KH4DCGENK4FU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KH4DCGENK4FUL7Y3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KH4DCGEN","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KH4DCGENK4FUL7Y3QEY4IDA2AK","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T23:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"3b58f55e19449852d21566962c71dc24408f0f5635565d363acd74eadb3ca11d","abstract_canon_sha256":"c0420c42c5467f533e0eac77d69eea1ff631943f445bf64fb46089c4488c1f92"},"schema_version":"1.0"},"canonical_sha256":"51f831188d570b45ff1b8131c40c1a028b4d11849d2316bce0aea71901a58842","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:54.950784Z","signature_b64":"cAOYIQfUePKlXeNWLka5h5Q66iFgYc8Bf0t0a3l9ZapmO5me+9Gy3V7O6X9CwsZJ3taN5qzfblONSCSDPeJxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f831188d570b45ff1b8131c40c1a028b4d11849d2316bce0aea71901a58842","last_reissued_at":"2026-05-18T00:46:54.950154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:54.950154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10268","source_version":2,"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:46:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIed3kHbiEbMmPBOZfi7luxE0KaKIvsmwJoYBoD/cojtxRNRwBNiACUB/HA8pxBr4yNTDBP+xWsDkCKqs3JxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:16:39.877254Z"},"content_sha256":"58f2bf4d47054206f0ea6e70a98e96ec481710bcb8f131b3ce98e38af2ab27b7","schema_version":"1.0","event_id":"sha256:58f2bf4d47054206f0ea6e70a98e96ec481710bcb8f131b3ce98e38af2ab27b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KH4DCGENK4FUL7Y3QEY4IDA2AK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extensions of a theorem of Erd\\H{o}s on nonhamiltonian graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Ruth Luo, Zolt\\'an F\\\"uredi","submitted_at":"2017-03-29T23:28:47Z","abstract_excerpt":"Let $n, d$ be integers with $1 \\leq d \\leq \\left \\lfloor \\frac{n-1}{2} \\right \\rfloor$, and set $h(n,d):={n-d \\choose 2} + d^2$. Erd\\H{o}s proved that when $n \\geq 6d$, each nonhamiltonian graph $G$ on $n$ vertices with minimum degree $\\delta(G) \\geq d$ has at most $h(n,d)$ edges. He also provides a sharpness example $H_{n,d}$ for all such pairs $n,d$. Previously, we showed a stability version of this result: for $n$ large enough, every nonhamiltonian graph $G$ on $n$ vertices with $\\delta(G) \\geq d$ and more than $h(n,d+1)$ edges is a subgraph of $H_{n,d}$.\n  In this paper, we show that not o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10268","kind":"arxiv","version":2},"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:46:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZ/cKR4H+A0xBMwtxfuxurdD1+byxd4oyHG5CvZAQrgsQF1Y3T6Qcu17pFyyqclfPSOi0ZQ2MsVOkM23icfxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:16:39.877605Z"},"content_sha256":"29ec67fa386931cdc746128777f5128de130457437ae8a6659f794a746307820","schema_version":"1.0","event_id":"sha256:29ec67fa386931cdc746128777f5128de130457437ae8a6659f794a746307820"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KH4DCGENK4FUL7Y3QEY4IDA2AK/bundle.json","state_url":"https://pith.science/pith/KH4DCGENK4FUL7Y3QEY4IDA2AK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KH4DCGENK4FUL7Y3QEY4IDA2AK/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-03T19:16:39Z","links":{"resolver":"https://pith.science/pith/KH4DCGENK4FUL7Y3QEY4IDA2AK","bundle":"https://pith.science/pith/KH4DCGENK4FUL7Y3QEY4IDA2AK/bundle.json","state":"https://pith.science/pith/KH4DCGENK4FUL7Y3QEY4IDA2AK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KH4DCGENK4FUL7Y3QEY4IDA2AK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KH4DCGENK4FUL7Y3QEY4IDA2AK","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":"c0420c42c5467f533e0eac77d69eea1ff631943f445bf64fb46089c4488c1f92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T23:28:47Z","title_canon_sha256":"3b58f55e19449852d21566962c71dc24408f0f5635565d363acd74eadb3ca11d"},"schema_version":"1.0","source":{"id":"1703.10268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10268","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10268v2","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10268","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"pith_short_12","alias_value":"KH4DCGENK4FU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KH4DCGENK4FUL7Y3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KH4DCGEN","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:29ec67fa386931cdc746128777f5128de130457437ae8a6659f794a746307820","target":"graph","created_at":"2026-05-18T00:46:54Z","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 $n, d$ be integers with $1 \\leq d \\leq \\left \\lfloor \\frac{n-1}{2} \\right \\rfloor$, and set $h(n,d):={n-d \\choose 2} + d^2$. Erd\\H{o}s proved that when $n \\geq 6d$, each nonhamiltonian graph $G$ on $n$ vertices with minimum degree $\\delta(G) \\geq d$ has at most $h(n,d)$ edges. He also provides a sharpness example $H_{n,d}$ for all such pairs $n,d$. Previously, we showed a stability version of this result: for $n$ large enough, every nonhamiltonian graph $G$ on $n$ vertices with $\\delta(G) \\geq d$ and more than $h(n,d+1)$ edges is a subgraph of $H_{n,d}$.\n  In this paper, we show that not o","authors_text":"Alexandr Kostochka, Ruth Luo, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T23:28:47Z","title":"Extensions of a theorem of Erd\\H{o}s on nonhamiltonian graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10268","kind":"arxiv","version":2},"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:58f2bf4d47054206f0ea6e70a98e96ec481710bcb8f131b3ce98e38af2ab27b7","target":"record","created_at":"2026-05-18T00:46:54Z","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":"c0420c42c5467f533e0eac77d69eea1ff631943f445bf64fb46089c4488c1f92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T23:28:47Z","title_canon_sha256":"3b58f55e19449852d21566962c71dc24408f0f5635565d363acd74eadb3ca11d"},"schema_version":"1.0","source":{"id":"1703.10268","kind":"arxiv","version":2}},"canonical_sha256":"51f831188d570b45ff1b8131c40c1a028b4d11849d2316bce0aea71901a58842","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51f831188d570b45ff1b8131c40c1a028b4d11849d2316bce0aea71901a58842","first_computed_at":"2026-05-18T00:46:54.950154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:54.950154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAOYIQfUePKlXeNWLka5h5Q66iFgYc8Bf0t0a3l9ZapmO5me+9Gy3V7O6X9CwsZJ3taN5qzfblONSCSDPeJxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:54.950784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58f2bf4d47054206f0ea6e70a98e96ec481710bcb8f131b3ce98e38af2ab27b7","sha256:29ec67fa386931cdc746128777f5128de130457437ae8a6659f794a746307820"],"state_sha256":"8ecec85fe4ff7efcda1543cc6a4c2eca18c156f837d233dc228bc24f318267ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/ps0UkdrWpCcq+FfbUtw+Sq4XjL0WPbMB69FMZyIjL0MTTI2GV5I8zXNPndtokaxPjWWmTueJlmrAqAI1COAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:16:39.879541Z","bundle_sha256":"b7508dae06d62cf495962eedc8e27f405c8e47208eb7a3960b39d4532fcd05ef"}}