{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3ZO3Y5KQYFCI2WWRFXRV337JFZ","short_pith_number":"pith:3ZO3Y5KQ","canonical_record":{"source":{"id":"1708.00196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-01T07:54:09Z","cross_cats_sorted":[],"title_canon_sha256":"5458fe8907fe2f159f190c872524fbc3f77fa1052f77e1edb02622e7f362ab60","abstract_canon_sha256":"f01422126c59a721b0cd495cc883f8ce777ae5b8bb7d17a610cbc0649b9b1183"},"schema_version":"1.0"},"canonical_sha256":"de5dbc7550c1448d5ad12de35defe92e78b531e38b492536b10ebb7f65ac7467","source":{"kind":"arxiv","id":"1708.00196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00196","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00196v1","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00196","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"3ZO3Y5KQYFCI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZO3Y5KQYFCI2WWR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZO3Y5KQ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3ZO3Y5KQYFCI2WWRFXRV337JFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-01T07:54:09Z","cross_cats_sorted":[],"title_canon_sha256":"5458fe8907fe2f159f190c872524fbc3f77fa1052f77e1edb02622e7f362ab60","abstract_canon_sha256":"f01422126c59a721b0cd495cc883f8ce777ae5b8bb7d17a610cbc0649b9b1183"},"schema_version":"1.0"},"canonical_sha256":"de5dbc7550c1448d5ad12de35defe92e78b531e38b492536b10ebb7f65ac7467","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:05.835361Z","signature_b64":"bZQiCPQry88ssVNtDpM6n7/WExrBFzsa0BLBSLoi9HEjGJtNCPZjg+xeGZhaN3Okwklblib1qhKfNNIn3YZwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de5dbc7550c1448d5ad12de35defe92e78b531e38b492536b10ebb7f65ac7467","last_reissued_at":"2026-05-18T00:39:05.834688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:05.834688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00196","source_version":1,"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-18T00:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98ki+oqN/6lRmufnJHZyfbMwKpjKZ4HfcNVNoKvVUJZWoutA8dfZfsUO0gTX4NhRQbP80nH3HmrU57JvipmxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:38:01.762060Z"},"content_sha256":"2852057bfcfaf66a03e6272607a685e3007727f247fd1a3ae2e9c307362872cd","schema_version":"1.0","event_id":"sha256:2852057bfcfaf66a03e6272607a685e3007727f247fd1a3ae2e9c307362872cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3ZO3Y5KQYFCI2WWRFXRV337JFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some new sufficient conditions for $2p$-Hamilton-biconnectedness of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ming-Zhu Chen, Xiao-Dong Zhang","submitted_at":"2017-08-01T07:54:09Z","abstract_excerpt":"A balanced bipartite graph $G$ is said to be $2p$-Hamilton-biconnected if for any balanced subset $W$ of size $2p$ of $V(G)$, the subgraph induced by $V(G)\\backslash W$ is Hamilton-biconnected. In this paper, we prove that \"Let $p\\geq0$ and $G$ be a balanced bipartite graph of order $2n$ with minimum degree $\\delta(G)\\geq k$, where $n\\geq 2k-p+2$ and $k\\geq p$. If the number of edges $ e(G)>n(n-k+p-1)+(k+2)(k-p+1), $ then $G$ is $2p$-Hamilton-biconnected except some exceptions.\" Furthermore, this result is used to present two new spectral conditions for a graph to $2p$-Hamilton-biconnected. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00196","kind":"arxiv","version":1},"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-18T00:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ed19ma+QYvPWG60U7QWZX3sVKOgLJLlUFnqJ4Mu3bheRrc4vUP66yPZOnTEmNDl4LVsuvPb/Rha48aXx/F9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:38:01.762797Z"},"content_sha256":"38013f28a5afbf4f2616b0ea6400702c3f30131e0797725ab2e68e348882a5d6","schema_version":"1.0","event_id":"sha256:38013f28a5afbf4f2616b0ea6400702c3f30131e0797725ab2e68e348882a5d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZO3Y5KQYFCI2WWRFXRV337JFZ/bundle.json","state_url":"https://pith.science/pith/3ZO3Y5KQYFCI2WWRFXRV337JFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZO3Y5KQYFCI2WWRFXRV337JFZ/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-09T07:38:01Z","links":{"resolver":"https://pith.science/pith/3ZO3Y5KQYFCI2WWRFXRV337JFZ","bundle":"https://pith.science/pith/3ZO3Y5KQYFCI2WWRFXRV337JFZ/bundle.json","state":"https://pith.science/pith/3ZO3Y5KQYFCI2WWRFXRV337JFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZO3Y5KQYFCI2WWRFXRV337JFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3ZO3Y5KQYFCI2WWRFXRV337JFZ","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":"f01422126c59a721b0cd495cc883f8ce777ae5b8bb7d17a610cbc0649b9b1183","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-01T07:54:09Z","title_canon_sha256":"5458fe8907fe2f159f190c872524fbc3f77fa1052f77e1edb02622e7f362ab60"},"schema_version":"1.0","source":{"id":"1708.00196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00196","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00196v1","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00196","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"3ZO3Y5KQYFCI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZO3Y5KQYFCI2WWR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZO3Y5KQ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:38013f28a5afbf4f2616b0ea6400702c3f30131e0797725ab2e68e348882a5d6","target":"graph","created_at":"2026-05-18T00:39:05Z","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 balanced bipartite graph $G$ is said to be $2p$-Hamilton-biconnected if for any balanced subset $W$ of size $2p$ of $V(G)$, the subgraph induced by $V(G)\\backslash W$ is Hamilton-biconnected. In this paper, we prove that \"Let $p\\geq0$ and $G$ be a balanced bipartite graph of order $2n$ with minimum degree $\\delta(G)\\geq k$, where $n\\geq 2k-p+2$ and $k\\geq p$. If the number of edges $ e(G)>n(n-k+p-1)+(k+2)(k-p+1), $ then $G$ is $2p$-Hamilton-biconnected except some exceptions.\" Furthermore, this result is used to present two new spectral conditions for a graph to $2p$-Hamilton-biconnected. Mo","authors_text":"Ming-Zhu Chen, Xiao-Dong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-01T07:54:09Z","title":"Some new sufficient conditions for $2p$-Hamilton-biconnectedness of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00196","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:2852057bfcfaf66a03e6272607a685e3007727f247fd1a3ae2e9c307362872cd","target":"record","created_at":"2026-05-18T00:39:05Z","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":"f01422126c59a721b0cd495cc883f8ce777ae5b8bb7d17a610cbc0649b9b1183","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-01T07:54:09Z","title_canon_sha256":"5458fe8907fe2f159f190c872524fbc3f77fa1052f77e1edb02622e7f362ab60"},"schema_version":"1.0","source":{"id":"1708.00196","kind":"arxiv","version":1}},"canonical_sha256":"de5dbc7550c1448d5ad12de35defe92e78b531e38b492536b10ebb7f65ac7467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de5dbc7550c1448d5ad12de35defe92e78b531e38b492536b10ebb7f65ac7467","first_computed_at":"2026-05-18T00:39:05.834688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:05.834688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bZQiCPQry88ssVNtDpM6n7/WExrBFzsa0BLBSLoi9HEjGJtNCPZjg+xeGZhaN3Okwklblib1qhKfNNIn3YZwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:05.835361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2852057bfcfaf66a03e6272607a685e3007727f247fd1a3ae2e9c307362872cd","sha256:38013f28a5afbf4f2616b0ea6400702c3f30131e0797725ab2e68e348882a5d6"],"state_sha256":"e8ecf713a4c9f4c1ad0026d7a59c824ca080de401358eb6867b4a5ea2f5305a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V98C3wvwhjofMmZBY+DWYqm7rtmyEm453zQksZedRiMeuUPI9NxnEtTGhoQ39uHmfqqrFc46ffWoO0Vy27gDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:38:01.766664Z","bundle_sha256":"3dad3c608750ae92c723563afd719ac2e34b0ec278851dfaf42d6c6d9a05e503"}}