{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MFJIZUCCEIX3IHVVFEUX3Q4JYA","short_pith_number":"pith:MFJIZUCC","canonical_record":{"source":{"id":"1212.6466","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-28T05:55:57Z","cross_cats_sorted":[],"title_canon_sha256":"de144856a288555e315c0e995c837fde9fc1f194e417444e95c38808da68cd35","abstract_canon_sha256":"7f171b2dedda6a74467f63b64a74382cfa3568c77c633e231e5e03c00dd78f12"},"schema_version":"1.0"},"canonical_sha256":"61528cd042222fb41eb529297dc389c0307947cb884a78150c3680ab3a82756b","source":{"kind":"arxiv","id":"1212.6466","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6466","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6466v4","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6466","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"MFJIZUCCEIX3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MFJIZUCCEIX3IHVV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MFJIZUCC","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MFJIZUCCEIX3IHVVFEUX3Q4JYA","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6466","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-28T05:55:57Z","cross_cats_sorted":[],"title_canon_sha256":"de144856a288555e315c0e995c837fde9fc1f194e417444e95c38808da68cd35","abstract_canon_sha256":"7f171b2dedda6a74467f63b64a74382cfa3568c77c633e231e5e03c00dd78f12"},"schema_version":"1.0"},"canonical_sha256":"61528cd042222fb41eb529297dc389c0307947cb884a78150c3680ab3a82756b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:20.499290Z","signature_b64":"RhNJl/4KUI5B/JZcV4rokI5DOEbylto1TxL3WIMfL97vUkusfwHnQrGveG8uwd0SmReGlh475sPlF9nwmwv4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61528cd042222fb41eb529297dc389c0307947cb884a78150c3680ab3a82756b","last_reissued_at":"2026-05-18T02:49:20.498780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:20.498780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6466","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-18T02:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrAUgSfBDWm1T73o56Rhj7I0enmvWqARLYeLczBkAthMmK9T9ekbYA2OxofEcxhfv2hvVpkNLK9gDKBfiGvyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:39:14.768785Z"},"content_sha256":"3d08fef78a06683028353be21081b5bfe091faab671d3b6a78530f7ab0d0ea87","schema_version":"1.0","event_id":"sha256:3d08fef78a06683028353be21081b5bfe091faab671d3b6a78530f7ab0d0ea87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MFJIZUCCEIX3IHVVFEUX3Q4JYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of 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-12-28T05:55:57Z","abstract_excerpt":"Let claw be the graph $K_{1,3}$. A graph $G$ on $n\\geq 3$ vertices is called \\emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and 1-heavy if at least one end-vertex of each induced claw of $G$ has degree at least $n/2$. In this note, we show that every 2-connected $o$-heavy or 3-connected 1-heavy graph is Hamiltonian if we restrict Fan-type degree condition or neighborhood intersection condition to certain pairs of vertices in some small induced subgraphs of the graph. Our results improve or extend previous results of Broersma et al., Chen et "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6466","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-18T02:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSr8RSVbqfVgGg+uPz3OHjQWZRDCysr47m9bWTW0chwRJKYgP+EIZLTVdgXsdb3OrQr6hk+ZZughPg1ZbNafBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:39:14.769125Z"},"content_sha256":"9160484ccc08c5186b73098f2a4bd76b7f5d79ba58eb659d7f4e41ede03ab4f9","schema_version":"1.0","event_id":"sha256:9160484ccc08c5186b73098f2a4bd76b7f5d79ba58eb659d7f4e41ede03ab4f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFJIZUCCEIX3IHVVFEUX3Q4JYA/bundle.json","state_url":"https://pith.science/pith/MFJIZUCCEIX3IHVVFEUX3Q4JYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFJIZUCCEIX3IHVVFEUX3Q4JYA/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-04T21:39:14Z","links":{"resolver":"https://pith.science/pith/MFJIZUCCEIX3IHVVFEUX3Q4JYA","bundle":"https://pith.science/pith/MFJIZUCCEIX3IHVVFEUX3Q4JYA/bundle.json","state":"https://pith.science/pith/MFJIZUCCEIX3IHVVFEUX3Q4JYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFJIZUCCEIX3IHVVFEUX3Q4JYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MFJIZUCCEIX3IHVVFEUX3Q4JYA","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":"7f171b2dedda6a74467f63b64a74382cfa3568c77c633e231e5e03c00dd78f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-28T05:55:57Z","title_canon_sha256":"de144856a288555e315c0e995c837fde9fc1f194e417444e95c38808da68cd35"},"schema_version":"1.0","source":{"id":"1212.6466","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6466","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6466v4","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6466","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"MFJIZUCCEIX3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MFJIZUCCEIX3IHVV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MFJIZUCC","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:9160484ccc08c5186b73098f2a4bd76b7f5d79ba58eb659d7f4e41ede03ab4f9","target":"graph","created_at":"2026-05-18T02:49:20Z","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 claw be the graph $K_{1,3}$. A graph $G$ on $n\\geq 3$ vertices is called \\emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and 1-heavy if at least one end-vertex of each induced claw of $G$ has degree at least $n/2$. In this note, we show that every 2-connected $o$-heavy or 3-connected 1-heavy graph is Hamiltonian if we restrict Fan-type degree condition or neighborhood intersection condition to certain pairs of vertices in some small induced subgraphs of the graph. Our results improve or extend previous results of Broersma et al., Chen et ","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-12-28T05:55:57Z","title":"Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6466","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:3d08fef78a06683028353be21081b5bfe091faab671d3b6a78530f7ab0d0ea87","target":"record","created_at":"2026-05-18T02:49:20Z","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":"7f171b2dedda6a74467f63b64a74382cfa3568c77c633e231e5e03c00dd78f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-28T05:55:57Z","title_canon_sha256":"de144856a288555e315c0e995c837fde9fc1f194e417444e95c38808da68cd35"},"schema_version":"1.0","source":{"id":"1212.6466","kind":"arxiv","version":4}},"canonical_sha256":"61528cd042222fb41eb529297dc389c0307947cb884a78150c3680ab3a82756b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61528cd042222fb41eb529297dc389c0307947cb884a78150c3680ab3a82756b","first_computed_at":"2026-05-18T02:49:20.498780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:20.498780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RhNJl/4KUI5B/JZcV4rokI5DOEbylto1TxL3WIMfL97vUkusfwHnQrGveG8uwd0SmReGlh475sPlF9nwmwv4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:20.499290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6466","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d08fef78a06683028353be21081b5bfe091faab671d3b6a78530f7ab0d0ea87","sha256:9160484ccc08c5186b73098f2a4bd76b7f5d79ba58eb659d7f4e41ede03ab4f9"],"state_sha256":"243947678de90cda0ed7a33db10c9fbfffff4ee0a71a15946ebe55d161a8c5e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VxZEYYHnQvqdqrzjVZ1TZyTiomhbuCMbLfcr4yRLJ7KiY8DKBZn+SeK/Dn2dkRS8x8Duksb62BqBhVXh7HGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:39:14.771105Z","bundle_sha256":"2ae974ef3884fbdc7ada65837b36829b633dba47c9c3652667ff798035987514"}}