{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YELGRLMM34ZEFUVM42BTRALYVD","short_pith_number":"pith:YELGRLMM","canonical_record":{"source":{"id":"1203.3915","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-18T03:50:54Z","cross_cats_sorted":[],"title_canon_sha256":"7edbdb62ab0a3d0855108c8381499f7152b3218f4cf65bd48e5bfc54ba589796","abstract_canon_sha256":"715380b99650942a14d2c159aed2da7ae5f04e03ad980efe6da630dde75ea4d7"},"schema_version":"1.0"},"canonical_sha256":"c11668ad8cdf3242d2ace683388178a8dbcbcbc9aae7cedd7094360b31c41d98","source":{"kind":"arxiv","id":"1203.3915","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3915","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3915v6","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3915","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"YELGRLMM34ZE","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YELGRLMM34ZEFUVM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YELGRLMM","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YELGRLMM34ZEFUVM42BTRALYVD","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3915","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-18T03:50:54Z","cross_cats_sorted":[],"title_canon_sha256":"7edbdb62ab0a3d0855108c8381499f7152b3218f4cf65bd48e5bfc54ba589796","abstract_canon_sha256":"715380b99650942a14d2c159aed2da7ae5f04e03ad980efe6da630dde75ea4d7"},"schema_version":"1.0"},"canonical_sha256":"c11668ad8cdf3242d2ace683388178a8dbcbcbc9aae7cedd7094360b31c41d98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:17.509389Z","signature_b64":"6r95kT9xFikqs+eYehZJi49XctHroAjrLK3L+O0+DqIu/ntc5IhCyG4pNUusk1gOYRaPUtuOlbGQibCaFRMlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c11668ad8cdf3242d2ace683388178a8dbcbcbc9aae7cedd7094360b31c41d98","last_reissued_at":"2026-05-18T03:22:17.508969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:17.508969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3915","source_version":6,"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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfB2M+lknhQ/zywzgZeyn6TAu9uM7Bn1YkXob6CHmQrXjYLfQN/W+MjMwNSolp0NzNyLAzRc1sD8cFFXAgtTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:33:17.379297Z"},"content_sha256":"338459f73f3ac1445a895d824e1a58994a242bfafff09b7310d83fe18929467f","schema_version":"1.0","event_id":"sha256:338459f73f3ac1445a895d824e1a58994a242bfafff09b7310d83fe18929467f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YELGRLMM34ZEFUVM42BTRALYVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Shenggui Zhang","submitted_at":"2012-03-18T03:50:54Z","abstract_excerpt":"Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graphs to be Hamiltonian by restricting Ore- and Fan-type degree conditions on these induced subgraphs. Let $G$ be a graph on $n$ vertices and $H$ be an induced subgraph of $G$. $H$ is called \\emph{o}-heavy if there are two nonadjacent vertices in $H$ with degree sum at least $n$, and is called $f$-heavy if for every two vertices $u,v\\in V(H)$, $d_{H}(u,v)=2$ implies that $\\max\\{d(u),d(v)\\}\\geq n/2$. We say that $G$ is $H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3915","kind":"arxiv","version":6},"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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmmniW6rOXTBgIBnhkAE3TnizzfS6w6jNmsr+mCniZVG8lo0pZgMhmQx5yJCTtA++VD1nJovcDA7+7li/VkyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:33:17.380088Z"},"content_sha256":"babf0dfed52b9366b460b8c5e9a739a21f25d0dc03f32cfcfee85f84ad6efb15","schema_version":"1.0","event_id":"sha256:babf0dfed52b9366b460b8c5e9a739a21f25d0dc03f32cfcfee85f84ad6efb15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YELGRLMM34ZEFUVM42BTRALYVD/bundle.json","state_url":"https://pith.science/pith/YELGRLMM34ZEFUVM42BTRALYVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YELGRLMM34ZEFUVM42BTRALYVD/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-04T20:33:17Z","links":{"resolver":"https://pith.science/pith/YELGRLMM34ZEFUVM42BTRALYVD","bundle":"https://pith.science/pith/YELGRLMM34ZEFUVM42BTRALYVD/bundle.json","state":"https://pith.science/pith/YELGRLMM34ZEFUVM42BTRALYVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YELGRLMM34ZEFUVM42BTRALYVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YELGRLMM34ZEFUVM42BTRALYVD","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":"715380b99650942a14d2c159aed2da7ae5f04e03ad980efe6da630dde75ea4d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-18T03:50:54Z","title_canon_sha256":"7edbdb62ab0a3d0855108c8381499f7152b3218f4cf65bd48e5bfc54ba589796"},"schema_version":"1.0","source":{"id":"1203.3915","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3915","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3915v6","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3915","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"YELGRLMM34ZE","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YELGRLMM34ZEFUVM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YELGRLMM","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:babf0dfed52b9366b460b8c5e9a739a21f25d0dc03f32cfcfee85f84ad6efb15","target":"graph","created_at":"2026-05-18T03:22:17Z","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":"Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graphs to be Hamiltonian by restricting Ore- and Fan-type degree conditions on these induced subgraphs. Let $G$ be a graph on $n$ vertices and $H$ be an induced subgraph of $G$. $H$ is called \\emph{o}-heavy if there are two nonadjacent vertices in $H$ with degree sum at least $n$, and is called $f$-heavy if for every two vertices $u,v\\in V(H)$, $d_{H}(u,v)=2$ implies that $\\max\\{d(u),d(v)\\}\\geq n/2$. We say that $G$ is $H","authors_text":"Bo Ning, Shenggui Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-18T03:50:54Z","title":"Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3915","kind":"arxiv","version":6},"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:338459f73f3ac1445a895d824e1a58994a242bfafff09b7310d83fe18929467f","target":"record","created_at":"2026-05-18T03:22:17Z","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":"715380b99650942a14d2c159aed2da7ae5f04e03ad980efe6da630dde75ea4d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-18T03:50:54Z","title_canon_sha256":"7edbdb62ab0a3d0855108c8381499f7152b3218f4cf65bd48e5bfc54ba589796"},"schema_version":"1.0","source":{"id":"1203.3915","kind":"arxiv","version":6}},"canonical_sha256":"c11668ad8cdf3242d2ace683388178a8dbcbcbc9aae7cedd7094360b31c41d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c11668ad8cdf3242d2ace683388178a8dbcbcbc9aae7cedd7094360b31c41d98","first_computed_at":"2026-05-18T03:22:17.508969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:17.508969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6r95kT9xFikqs+eYehZJi49XctHroAjrLK3L+O0+DqIu/ntc5IhCyG4pNUusk1gOYRaPUtuOlbGQibCaFRMlCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:17.509389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3915","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:338459f73f3ac1445a895d824e1a58994a242bfafff09b7310d83fe18929467f","sha256:babf0dfed52b9366b460b8c5e9a739a21f25d0dc03f32cfcfee85f84ad6efb15"],"state_sha256":"caeb7fb1d279e00799813f7a99fe043a3d2c398db6e0b8cafe9b35c8e092f3eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DS8JxZL3jjW4wZSS8cbQoGrhVTzmcuZwjL7cyQST9iu/X6qdXg0z+eiEbVJVxr4Ydg+Uimb0UaX2Boc8i//fCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:33:17.382998Z","bundle_sha256":"96149a11695f6c5dfb83979881af82d4ad890a67b2e0ec563855d00877423e64"}}