{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7SC3576R2MUOZGDOIR3LMSRMFA","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":"3bda4101320feec3e6983f197402e325d5124c6d90eae86af363519689818183","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T18:54:19Z","title_canon_sha256":"dc93f203fa1a9939fea183e44d0980d3fd01918ade25cf865af1a9394fcd4ea7"},"schema_version":"1.0","source":{"id":"1109.4122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4122","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4122v1","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4122","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"7SC3576R2MUO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7SC3576R2MUOZGDO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7SC3576R","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:e8bf1abfbf8e6f608b1824399a18ac33a94c0859d0ddee12c68058cf7cfd8d07","target":"graph","created_at":"2026-05-18T04:12:45Z","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$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic to $H$ is heavy. For a family $\\mathcal{H}$ of graphs, $G$ is called $\\mathcal{H}$-heavy if $G$ is $H$-heavy for every $H\\in\\mathcal{H}$. In this paper we characterize all connected graphs $R$ and $S$ other than $P_3$ (the path on three vertices) such that every 2-connected $\\{R,S\\}$-heavy graph is Hamiltonian. This extends several previous results on forbid","authors_text":"Binlong Li, Shenggui Zhang, Ying Wang, Zden\\v{e}k Ryj\\'a\\v{c}ek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T18:54:19Z","title":"Pairs of heavy subgraphs for Hamiltonicity of 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4122","kind":"arxiv","version":1},"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:c861e7cf971af98453c3c9bd1586492d673da9bed47c4279bbe84737304031e4","target":"record","created_at":"2026-05-18T04:12:45Z","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":"3bda4101320feec3e6983f197402e325d5124c6d90eae86af363519689818183","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T18:54:19Z","title_canon_sha256":"dc93f203fa1a9939fea183e44d0980d3fd01918ade25cf865af1a9394fcd4ea7"},"schema_version":"1.0","source":{"id":"1109.4122","kind":"arxiv","version":1}},"canonical_sha256":"fc85beffd1d328ec986e4476b64a2c283ca6443db0739ae2cbc4adfb07480734","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc85beffd1d328ec986e4476b64a2c283ca6443db0739ae2cbc4adfb07480734","first_computed_at":"2026-05-18T04:12:45.174639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:45.174639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OgOHijYaGrxIFcjuXc8I7xYIDwADagLZeFDCRYS8b0Upg7fVe6+ufUWczlJwnUUGbadHO6O9UG1kRu/lZLwpDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:45.175341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c861e7cf971af98453c3c9bd1586492d673da9bed47c4279bbe84737304031e4","sha256:e8bf1abfbf8e6f608b1824399a18ac33a94c0859d0ddee12c68058cf7cfd8d07"],"state_sha256":"a15005e59b8ddacbe5874ce266346eea7e79af7168c41a883908badb40c8916a"}