{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:J545AMYMPBSITVVRXQP53UAZ4K","short_pith_number":"pith:J545AMYM","schema_version":"1.0","canonical_sha256":"4f79d0330c786489d6b1bc1fddd019e2a293ba718e38d33855784e53f3f8f8b8","source":{"kind":"arxiv","id":"2506.02687","version":3},"attestation_state":"computed","paper":{"title":"A Fan-type condition involving bipartite independence number for hamiltonicity in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongxi Liu, Long-tu Yuan, Xiaowen Zhang","submitted_at":"2025-06-03T09:40:28Z","abstract_excerpt":"The bipartite independence number of a graph $G$, denoted by $\\widetilde{\\alpha}(G)$, is defined as the smallest integer $q$ for which there exist positive integers $s$ and $t$ with $s + t = q + 1$, such that for any two disjoint subsets $A, B \\subseteq V(G)$ with $|A| = s$ and $|B| = t$, there exists an edge between $A$ and $B$. In this paper, we prove that for a 2-connected graph $G$ of order at least three, if $\\max\\{d_G(x), d_G(y)\\} \\ge \\widetilde{\\alpha}(G)$ for every pair of nonadjacent vertices $x, y$ at distance two, then $G$ is hamiltonian. Moreover, we prove that if $G$ is 3-connecte"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.02687","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T09:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"4f9d0afec86ddedbe86756cb1e962bb5c9f3106d09250c8d110cb69863337858","abstract_canon_sha256":"d3b2a8bb4d833f4478528961e726a09f7814f4d193678c8ab5084ea03f259e36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:27.961523Z","signature_b64":"PrAR4bsVOiFOcpomyRLoKOq7Iy+CT1PTusbpwKTdS8Fl+CnCqgKfqovOmB3INBCL2gkekrEiTuPGZVUmafkyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f79d0330c786489d6b1bc1fddd019e2a293ba718e38d33855784e53f3f8f8b8","last_reissued_at":"2026-07-05T11:19:27.961040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:27.961040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fan-type condition involving bipartite independence number for hamiltonicity in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongxi Liu, Long-tu Yuan, Xiaowen Zhang","submitted_at":"2025-06-03T09:40:28Z","abstract_excerpt":"The bipartite independence number of a graph $G$, denoted by $\\widetilde{\\alpha}(G)$, is defined as the smallest integer $q$ for which there exist positive integers $s$ and $t$ with $s + t = q + 1$, such that for any two disjoint subsets $A, B \\subseteq V(G)$ with $|A| = s$ and $|B| = t$, there exists an edge between $A$ and $B$. In this paper, we prove that for a 2-connected graph $G$ of order at least three, if $\\max\\{d_G(x), d_G(y)\\} \\ge \\widetilde{\\alpha}(G)$ for every pair of nonadjacent vertices $x, y$ at distance two, then $G$ is hamiltonian. Moreover, we prove that if $G$ is 3-connecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02687","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.02687/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.02687","created_at":"2026-07-05T11:19:27.961095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.02687v3","created_at":"2026-07-05T11:19:27.961095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02687","created_at":"2026-07-05T11:19:27.961095+00:00"},{"alias_kind":"pith_short_12","alias_value":"J545AMYMPBSI","created_at":"2026-07-05T11:19:27.961095+00:00"},{"alias_kind":"pith_short_16","alias_value":"J545AMYMPBSITVVR","created_at":"2026-07-05T11:19:27.961095+00:00"},{"alias_kind":"pith_short_8","alias_value":"J545AMYM","created_at":"2026-07-05T11:19:27.961095+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09750","citing_title":"Cycles and paths through vertices whose degrees are at least the bipartite-hole-number","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K","json":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K.json","graph_json":"https://pith.science/api/pith-number/J545AMYMPBSITVVRXQP53UAZ4K/graph.json","events_json":"https://pith.science/api/pith-number/J545AMYMPBSITVVRXQP53UAZ4K/events.json","paper":"https://pith.science/paper/J545AMYM"},"agent_actions":{"view_html":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K","download_json":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K.json","view_paper":"https://pith.science/paper/J545AMYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.02687&json=true","fetch_graph":"https://pith.science/api/pith-number/J545AMYMPBSITVVRXQP53UAZ4K/graph.json","fetch_events":"https://pith.science/api/pith-number/J545AMYMPBSITVVRXQP53UAZ4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K/action/storage_attestation","attest_author":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K/action/author_attestation","sign_citation":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K/action/citation_signature","submit_replication":"https://pith.science/pith/J545AMYMPBSITVVRXQP53UAZ4K/action/replication_record"}},"created_at":"2026-07-05T11:19:27.961095+00:00","updated_at":"2026-07-05T11:19:27.961095+00:00"}