{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EIQIYV4LE7KPTTWIRFUTXZF5N5","short_pith_number":"pith:EIQIYV4L","canonical_record":{"source":{"id":"1209.3899","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-18T10:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"de6e911c3818fd8d8f185d5438dd99ed3ea4e072bbe57deff250068b4639fb90","abstract_canon_sha256":"49abd6054b0233f6e798d2f1d80d17477cd88f9cc4551b8848c0c5678e3b5fdc"},"schema_version":"1.0"},"canonical_sha256":"22208c578b27d4f9cec889693be4bd6f5391417c39eda3ea0264013f8b0fa709","source":{"kind":"arxiv","id":"1209.3899","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3899","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3899v4","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3899","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"EIQIYV4LE7KP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EIQIYV4LE7KPTTWI","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EIQIYV4L","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EIQIYV4LE7KPTTWIRFUTXZF5N5","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3899","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-18T10:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"de6e911c3818fd8d8f185d5438dd99ed3ea4e072bbe57deff250068b4639fb90","abstract_canon_sha256":"49abd6054b0233f6e798d2f1d80d17477cd88f9cc4551b8848c0c5678e3b5fdc"},"schema_version":"1.0"},"canonical_sha256":"22208c578b27d4f9cec889693be4bd6f5391417c39eda3ea0264013f8b0fa709","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.799731Z","signature_b64":"2PajGbS5sG/HcpA+n3Hb0j8ZoHXeE53bbKyzs1V5kJZHa3VWZdcVo7O0rxWSy70Rvq+sPTgtQ7xqdDio+FujDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22208c578b27d4f9cec889693be4bd6f5391417c39eda3ea0264013f8b0fa709","last_reissued_at":"2026-05-18T03:37:18.799042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.799042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3899","source_version":4,"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-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMVsf9dS8VdtxwUp/voX7/o3uaE2Od6qLE1Lpq8qBw+fna/AMe/8HMdtcA1+aFEJpcRXLb04558QhK1fbjvnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:02:16.427027Z"},"content_sha256":"dddf88356c15b3d67efd740b003398810ad17ec29342cee98d336c5763fbc337","schema_version":"1.0","event_id":"sha256:dddf88356c15b3d67efd740b003398810ad17ec29342cee98d336c5763fbc337"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EIQIYV4LE7KPTTWIRFUTXZF5N5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two sufficient conditions for the existence of Hamilton cycles in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bing Chen, Bo Ning, Shenggui Zhang","submitted_at":"2012-09-18T10:10:07Z","abstract_excerpt":"Let $G$ be a graph on $n\\geq 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ is called 1-heavy if at least one end vertex of each induced claw of $G$ has degree at least $n/2$, and claw-\\emph{o}-heavy if each induced claw of it has a pair of end vertices with degree sum at least $n$. In this paper we prove two results: (1) Every 2-connected claw-$o$-heavy graph $G$ is Hamiltonian if every pair of vertices $u,v$ in a subgraph $H\\cong Z_1$ contained in an induced subgraph $Z_2$ of $G$ with $d_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3899","kind":"arxiv","version":4},"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-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCgEWVY6q/3Z45GEt5U9ZtCu4E4tF5MFqO/52jUJnA0ISWdA9hfdg32RA79ZX2THNS+g4rMiUU8V+AAMD2egBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:02:16.427679Z"},"content_sha256":"f4cae1c925e40ae32adae253579c02c6b32cdbf191d1f5eb8915aaf328a9a1cc","schema_version":"1.0","event_id":"sha256:f4cae1c925e40ae32adae253579c02c6b32cdbf191d1f5eb8915aaf328a9a1cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIQIYV4LE7KPTTWIRFUTXZF5N5/bundle.json","state_url":"https://pith.science/pith/EIQIYV4LE7KPTTWIRFUTXZF5N5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIQIYV4LE7KPTTWIRFUTXZF5N5/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-04T15:02:16Z","links":{"resolver":"https://pith.science/pith/EIQIYV4LE7KPTTWIRFUTXZF5N5","bundle":"https://pith.science/pith/EIQIYV4LE7KPTTWIRFUTXZF5N5/bundle.json","state":"https://pith.science/pith/EIQIYV4LE7KPTTWIRFUTXZF5N5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIQIYV4LE7KPTTWIRFUTXZF5N5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EIQIYV4LE7KPTTWIRFUTXZF5N5","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":"49abd6054b0233f6e798d2f1d80d17477cd88f9cc4551b8848c0c5678e3b5fdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-18T10:10:07Z","title_canon_sha256":"de6e911c3818fd8d8f185d5438dd99ed3ea4e072bbe57deff250068b4639fb90"},"schema_version":"1.0","source":{"id":"1209.3899","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3899","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3899v4","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3899","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"EIQIYV4LE7KP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EIQIYV4LE7KPTTWI","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EIQIYV4L","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:f4cae1c925e40ae32adae253579c02c6b32cdbf191d1f5eb8915aaf328a9a1cc","target":"graph","created_at":"2026-05-18T03:37:18Z","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 on $n\\geq 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ is called 1-heavy if at least one end vertex of each induced claw of $G$ has degree at least $n/2$, and claw-\\emph{o}-heavy if each induced claw of it has a pair of end vertices with degree sum at least $n$. In this paper we prove two results: (1) Every 2-connected claw-$o$-heavy graph $G$ is Hamiltonian if every pair of vertices $u,v$ in a subgraph $H\\cong Z_1$ contained in an induced subgraph $Z_2$ of $G$ with $d_{","authors_text":"Bing Chen, Bo Ning, Shenggui Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-18T10:10:07Z","title":"Two sufficient conditions for the existence of Hamilton cycles in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3899","kind":"arxiv","version":4},"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:dddf88356c15b3d67efd740b003398810ad17ec29342cee98d336c5763fbc337","target":"record","created_at":"2026-05-18T03:37:18Z","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":"49abd6054b0233f6e798d2f1d80d17477cd88f9cc4551b8848c0c5678e3b5fdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-18T10:10:07Z","title_canon_sha256":"de6e911c3818fd8d8f185d5438dd99ed3ea4e072bbe57deff250068b4639fb90"},"schema_version":"1.0","source":{"id":"1209.3899","kind":"arxiv","version":4}},"canonical_sha256":"22208c578b27d4f9cec889693be4bd6f5391417c39eda3ea0264013f8b0fa709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22208c578b27d4f9cec889693be4bd6f5391417c39eda3ea0264013f8b0fa709","first_computed_at":"2026-05-18T03:37:18.799042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.799042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2PajGbS5sG/HcpA+n3Hb0j8ZoHXeE53bbKyzs1V5kJZHa3VWZdcVo7O0rxWSy70Rvq+sPTgtQ7xqdDio+FujDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.799731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3899","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dddf88356c15b3d67efd740b003398810ad17ec29342cee98d336c5763fbc337","sha256:f4cae1c925e40ae32adae253579c02c6b32cdbf191d1f5eb8915aaf328a9a1cc"],"state_sha256":"4039cd7f16f5953f888b18836e6382fbf45e1cde5e69492badcba4c595656dff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zk4hABRlH5gAu7Mt05ytZUF7GfuHYCQHTFdDzhIeo8YHC5NafZm7oz47QR8sKJ2mc214qFNHRqA4Dr+pRFs5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:02:16.430594Z","bundle_sha256":"1aa38f559d2fe933cc028c16981660c8209ca532269e67cd3244cfe48a6d0442"}}