{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4D3PBZ3KZMHZJRQQHRUWM3FWKZ","short_pith_number":"pith:4D3PBZ3K","canonical_record":{"source":{"id":"1608.05741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T21:30:30Z","cross_cats_sorted":[],"title_canon_sha256":"ea893125ab44bb7dc7bc9801967aafeda84c6ac59bc478b5443345224e5177f2","abstract_canon_sha256":"ae76a967b7181bac847fedd3775aefddfd74d6285450469660dab12742054312"},"schema_version":"1.0"},"canonical_sha256":"e0f6f0e76acb0f94c6103c69666cb656500574c2434d1cc73a4cf52018c1385a","source":{"kind":"arxiv","id":"1608.05741","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05741","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05741v2","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05741","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"4D3PBZ3KZMHZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4D3PBZ3KZMHZJRQQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4D3PBZ3K","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4D3PBZ3KZMHZJRQQHRUWM3FWKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T21:30:30Z","cross_cats_sorted":[],"title_canon_sha256":"ea893125ab44bb7dc7bc9801967aafeda84c6ac59bc478b5443345224e5177f2","abstract_canon_sha256":"ae76a967b7181bac847fedd3775aefddfd74d6285450469660dab12742054312"},"schema_version":"1.0"},"canonical_sha256":"e0f6f0e76acb0f94c6103c69666cb656500574c2434d1cc73a4cf52018c1385a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:55.606395Z","signature_b64":"FxsKVPvrWTsFFezh7NhijeAjCR/FGelRREc3cFNJcPHxs4B23DcJN8DkfMGgxlkkGnZqPm4f4IAVMswO5XX0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0f6f0e76acb0f94c6103c69666cb656500574c2434d1cc73a4cf52018c1385a","last_reissued_at":"2026-05-18T00:46:55.605819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:55.605819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05741","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:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AsOh0uWc7GpNcwNSN5DYDsP/QxHdVarCY5p/Lj5yIgYuOX+zNtLS497P+j4ZV3uaP0G2i9XA0Oq4XaHE1FvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:25:17.808822Z"},"content_sha256":"41db09927a0bd3fc7da74a9b46021aee799b670f719111fc3cd97f7165122ec7","schema_version":"1.0","event_id":"sha256:41db09927a0bd3fc7da74a9b46021aee799b670f719111fc3cd97f7165122ec7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4D3PBZ3KZMHZJRQQHRUWM3FWKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A stability version for 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":"2016-08-19T21:30:30Z","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$ and $e(n,d):= \\max\\{h(n,d),h(n, \\left \\lfloor \\frac{n-1}{2} \\right \\rfloor)\\}$. Because $h(n,d)$ is quadratic in $d$, there exists a $d_0(n)=(n/6)+O(1)$ such that $e(n,1)> e(n, 2)> \\dots >e(n,d_0)=e(n, d_0+1)=\\dots = e(n,\\left \\lfloor \\frac{n-1}{2} \\right \\rfloor)$. A theorem by Erd\\H{o}s states that for $d\\leq \\left \\lfloor \\frac{n-1}{2} \\right \\rfloor$, any $n$-vertex nonhamiltonian graph $G$ with minimum degree $\\delta(G) \\geq d$ has at most $e(n,d)$ edges, and for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05741","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:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7bKAzRlnq87IqEzGmeTb67MXb9miRsK5khzHQEkxCN8qTNTP8XGwN8q+jKVOixoxF7FUpkFleH+4vvhJ3WABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:25:17.809227Z"},"content_sha256":"5fc53478a3a4e4b8085fc0698fe829f9d7257a26bbd6feb178f38a88ea1e2617","schema_version":"1.0","event_id":"sha256:5fc53478a3a4e4b8085fc0698fe829f9d7257a26bbd6feb178f38a88ea1e2617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4D3PBZ3KZMHZJRQQHRUWM3FWKZ/bundle.json","state_url":"https://pith.science/pith/4D3PBZ3KZMHZJRQQHRUWM3FWKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4D3PBZ3KZMHZJRQQHRUWM3FWKZ/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-26T07:25:17Z","links":{"resolver":"https://pith.science/pith/4D3PBZ3KZMHZJRQQHRUWM3FWKZ","bundle":"https://pith.science/pith/4D3PBZ3KZMHZJRQQHRUWM3FWKZ/bundle.json","state":"https://pith.science/pith/4D3PBZ3KZMHZJRQQHRUWM3FWKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4D3PBZ3KZMHZJRQQHRUWM3FWKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4D3PBZ3KZMHZJRQQHRUWM3FWKZ","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":"ae76a967b7181bac847fedd3775aefddfd74d6285450469660dab12742054312","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T21:30:30Z","title_canon_sha256":"ea893125ab44bb7dc7bc9801967aafeda84c6ac59bc478b5443345224e5177f2"},"schema_version":"1.0","source":{"id":"1608.05741","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05741","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05741v2","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05741","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"4D3PBZ3KZMHZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4D3PBZ3KZMHZJRQQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4D3PBZ3K","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:5fc53478a3a4e4b8085fc0698fe829f9d7257a26bbd6feb178f38a88ea1e2617","target":"graph","created_at":"2026-05-18T00:46:55Z","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$ and $e(n,d):= \\max\\{h(n,d),h(n, \\left \\lfloor \\frac{n-1}{2} \\right \\rfloor)\\}$. Because $h(n,d)$ is quadratic in $d$, there exists a $d_0(n)=(n/6)+O(1)$ such that $e(n,1)> e(n, 2)> \\dots >e(n,d_0)=e(n, d_0+1)=\\dots = e(n,\\left \\lfloor \\frac{n-1}{2} \\right \\rfloor)$. A theorem by Erd\\H{o}s states that for $d\\leq \\left \\lfloor \\frac{n-1}{2} \\right \\rfloor$, any $n$-vertex nonhamiltonian graph $G$ with minimum degree $\\delta(G) \\geq d$ has at most $e(n,d)$ edges, and for","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":"2016-08-19T21:30:30Z","title":"A stability version for 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":"1608.05741","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:41db09927a0bd3fc7da74a9b46021aee799b670f719111fc3cd97f7165122ec7","target":"record","created_at":"2026-05-18T00:46:55Z","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":"ae76a967b7181bac847fedd3775aefddfd74d6285450469660dab12742054312","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T21:30:30Z","title_canon_sha256":"ea893125ab44bb7dc7bc9801967aafeda84c6ac59bc478b5443345224e5177f2"},"schema_version":"1.0","source":{"id":"1608.05741","kind":"arxiv","version":2}},"canonical_sha256":"e0f6f0e76acb0f94c6103c69666cb656500574c2434d1cc73a4cf52018c1385a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0f6f0e76acb0f94c6103c69666cb656500574c2434d1cc73a4cf52018c1385a","first_computed_at":"2026-05-18T00:46:55.605819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:55.605819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FxsKVPvrWTsFFezh7NhijeAjCR/FGelRREc3cFNJcPHxs4B23DcJN8DkfMGgxlkkGnZqPm4f4IAVMswO5XX0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:55.606395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05741","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41db09927a0bd3fc7da74a9b46021aee799b670f719111fc3cd97f7165122ec7","sha256:5fc53478a3a4e4b8085fc0698fe829f9d7257a26bbd6feb178f38a88ea1e2617"],"state_sha256":"9d47a5c621e90b004ee8754dbb47b8fd4357aebdefe35e8dc9effedfcb3f135d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbx8ISBUjhaw7IfRA5URXzd4TJtowdZed4UGbBE95q5uKWTzKm//XsJn1hZqCOy/WLMyiEKPT/tYdHcC/WR5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:25:17.812633Z","bundle_sha256":"3bc02b01fc0e94c8925ce9b6a44b3e07646aa6d9d17afc548eec2a307ac3c763"}}