{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KF4TG7TJQFUVATJEW7TVXOF763","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":"b9095f4f168a9cbc80d68a13c0270dc6092dbea8e3809e5ae1b051347679c0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T05:02:22Z","title_canon_sha256":"3277b0a25153d172d2e5aa3e04c01691172528e663e56e9c961f622f3461f0c6"},"schema_version":"1.0","source":{"id":"1409.3325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3325","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3325v2","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3325","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"KF4TG7TJQFUV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KF4TG7TJQFUVATJE","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KF4TG7TJ","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:85685ed792d115bfccf891811ce477b1fcbe72043644686398d68631d350a81f","target":"graph","created_at":"2026-05-18T01:11:57Z","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":"A graph $G$ is called \\emph{claw-o-heavy} if every induced claw ($K_{1,3}$) of $G$ has two end-vertices with degree sum at least $|V(G)|$ in $G$. For a given graph $R$, $G$ is called \\emph{$R$-f-heavy} if for every induced subgraph $H$ of $G$ isomorphic to $R$ and every pair of vertices $u,v\\in V(H)$ with $d_H(u,v)=2$, there holds $\\max\\{d(u),d(v)\\}\\geq |V(G)|/2$. In this paper, we prove that every 2-connected claw-\\emph{o}-heavy and $Z_3$-\\emph{f}-heavy graph is hamiltonian (with two exceptional graphs), where $Z_3$ is the graph obtained from identifying one end-vertex of $P_4$ (a path with 4","authors_text":"Binlong Li, Bo Ning, Shenggui Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T05:02:22Z","title":"Solution to a problem on hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3325","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:d352a65d01c0448b345c758f1d861ff1dace9fafa260240f5dc714b168273182","target":"record","created_at":"2026-05-18T01:11:57Z","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":"b9095f4f168a9cbc80d68a13c0270dc6092dbea8e3809e5ae1b051347679c0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T05:02:22Z","title_canon_sha256":"3277b0a25153d172d2e5aa3e04c01691172528e663e56e9c961f622f3461f0c6"},"schema_version":"1.0","source":{"id":"1409.3325","kind":"arxiv","version":2}},"canonical_sha256":"5179337e698169504d24b7e75bb8bff6d3c3b8c4ee71cdeb71bee23dfd6e1ddd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5179337e698169504d24b7e75bb8bff6d3c3b8c4ee71cdeb71bee23dfd6e1ddd","first_computed_at":"2026-05-18T01:11:57.936882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:57.936882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8CGq9+rGgz1F/dBvVDBhne9t+/ghPD91KG2ltzpgYaPjzQWn40BhKbhvzsiqvC2YP3qADX9TQSutr/h1X+qNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:57.937236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d352a65d01c0448b345c758f1d861ff1dace9fafa260240f5dc714b168273182","sha256:85685ed792d115bfccf891811ce477b1fcbe72043644686398d68631d350a81f"],"state_sha256":"7188dffaf0c7726fd56d93d08bf1d7d9992aba4de38c8aff8c96df56c4283919"}