{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BOO4WCWSXL3IFCVWJQ2IEZ2GOR","short_pith_number":"pith:BOO4WCWS","schema_version":"1.0","canonical_sha256":"0b9dcb0ad2baf6828ab64c348267467455ef74a715bc9ad26fd081de14c255ab","source":{"kind":"arxiv","id":"1809.05265","version":1},"attestation_state":"computed","paper":{"title":"The degrees, number of edges, spectral radius and weakly Hamilton-connectedness of bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Wei, Zhifu You","submitted_at":"2018-09-14T06:02:54Z","abstract_excerpt":"A path of a graph $G$ is called a Hamilton path if it passes through all the vertices of $G$. A graph is Hamilton-connected if any two vertices are connected by a Hamilton path. Note that any bipartite graph is not Hamilton-connected. We consider the weak version of Hamilton-connected property among bipartite graphs. A weakly Hamilton-connected graph is a balanced bipartite graph $G=(X,Y,E)$ that there is a Hamilton path between any vertex $x\\in X$ and $y\\in Y$. In this paper, we present some degrees, number of edges, and spectral radius conditions for a simple balanced bipartite graph to be w"},"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":"1809.05265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T06:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"adf420a79f77a27a407f9d4e6d7e01f7148ed421fbc0a5a4ebc49de2e2d2cdc9","abstract_canon_sha256":"da2cb4506fafae01bd50757850a48aa5a79e36eafe9b9c978231a2a8b2cd6623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:44.199533Z","signature_b64":"S2a8wO+1UKN5XWfh75yII3yCOBwcFN6tvDNKnv5xUZvblPz0qeAZrn7624y+Ib2JA4LoAI9mbFshFd7XFr/pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b9dcb0ad2baf6828ab64c348267467455ef74a715bc9ad26fd081de14c255ab","last_reissued_at":"2026-05-18T00:05:44.198769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:44.198769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The degrees, number of edges, spectral radius and weakly Hamilton-connectedness of bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Wei, Zhifu You","submitted_at":"2018-09-14T06:02:54Z","abstract_excerpt":"A path of a graph $G$ is called a Hamilton path if it passes through all the vertices of $G$. A graph is Hamilton-connected if any two vertices are connected by a Hamilton path. Note that any bipartite graph is not Hamilton-connected. We consider the weak version of Hamilton-connected property among bipartite graphs. A weakly Hamilton-connected graph is a balanced bipartite graph $G=(X,Y,E)$ that there is a Hamilton path between any vertex $x\\in X$ and $y\\in Y$. In this paper, we present some degrees, number of edges, and spectral radius conditions for a simple balanced bipartite graph to be w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05265","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.05265","created_at":"2026-05-18T00:05:44.198891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05265v1","created_at":"2026-05-18T00:05:44.198891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05265","created_at":"2026-05-18T00:05:44.198891+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOO4WCWSXL3I","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOO4WCWSXL3IFCVW","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOO4WCWS","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR","json":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR.json","graph_json":"https://pith.science/api/pith-number/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/graph.json","events_json":"https://pith.science/api/pith-number/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/events.json","paper":"https://pith.science/paper/BOO4WCWS"},"agent_actions":{"view_html":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR","download_json":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR.json","view_paper":"https://pith.science/paper/BOO4WCWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05265&json=true","fetch_graph":"https://pith.science/api/pith-number/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/graph.json","fetch_events":"https://pith.science/api/pith-number/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/action/storage_attestation","attest_author":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/action/author_attestation","sign_citation":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/action/citation_signature","submit_replication":"https://pith.science/pith/BOO4WCWSXL3IFCVWJQ2IEZ2GOR/action/replication_record"}},"created_at":"2026-05-18T00:05:44.198891+00:00","updated_at":"2026-05-18T00:05:44.198891+00:00"}