{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3GJRODEAZBG4CCVB32EAWVFUOG","short_pith_number":"pith:3GJRODEA","schema_version":"1.0","canonical_sha256":"d993170c80c84dc10aa1de880b54b471b8f963f8a8891f97c73cbf66537ab829","source":{"kind":"arxiv","id":"2506.09750","version":1},"attestation_state":"computed","paper":{"title":"Cycles and paths through vertices whose degrees are at least the bipartite-hole-number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Feng Liu, Yurui Tang","submitted_at":"2025-06-11T13:54:27Z","abstract_excerpt":"The bipartite-hole-number of a graph $G$, denoted by $\\widetilde{\\alpha}(G)$, is the minimum integer $k$ such that there exist positive integers $s$ and $t$ with $s + t = k + 1$, satisfying the property that for any two disjoint sets $A, B \\subseteq V(G)$ with $|A| = s$ and $|B| = t$, there is at least one edge between $A$ and $B$. In 1992, Bollob\\'as and Brightwell, and independently Shi, proved that every $2$-connected graph of order $n$ contains a cycle passing through all vertices whose degrees are at least $\\frac{n}{2}$. Motivated by their result, we show that in any $2$-connected graph o"},"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.09750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-11T13:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"7f475963a96d3f636dccdc8a4b2db038a9eec36415c9341aee23f43c32f0428b","abstract_canon_sha256":"9bb6ca9ca960639e2e3c42a29b93173ed0c5c6c13917aabbd3c67cc8b53172ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:56.339233Z","signature_b64":"ntMlIYHtt6Vqp/kUvxumXnx0xU+ISfEaF4bt4fxo3JjiaIkARWKd4WhktdL0PM6zO9txScPw6RzoNi29qYrRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d993170c80c84dc10aa1de880b54b471b8f963f8a8891f97c73cbf66537ab829","last_reissued_at":"2026-07-05T11:19:56.338688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:56.338688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycles and paths through vertices whose degrees are at least the bipartite-hole-number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Feng Liu, Yurui Tang","submitted_at":"2025-06-11T13:54:27Z","abstract_excerpt":"The bipartite-hole-number of a graph $G$, denoted by $\\widetilde{\\alpha}(G)$, is the minimum integer $k$ such that there exist positive integers $s$ and $t$ with $s + t = k + 1$, satisfying the property that for any two disjoint sets $A, B \\subseteq V(G)$ with $|A| = s$ and $|B| = t$, there is at least one edge between $A$ and $B$. In 1992, Bollob\\'as and Brightwell, and independently Shi, proved that every $2$-connected graph of order $n$ contains a cycle passing through all vertices whose degrees are at least $\\frac{n}{2}$. Motivated by their result, we show that in any $2$-connected graph o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09750","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.09750/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.09750","created_at":"2026-07-05T11:19:56.338754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.09750v1","created_at":"2026-07-05T11:19:56.338754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09750","created_at":"2026-07-05T11:19:56.338754+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GJRODEAZBG4","created_at":"2026-07-05T11:19:56.338754+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GJRODEAZBG4CCVB","created_at":"2026-07-05T11:19:56.338754+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GJRODEA","created_at":"2026-07-05T11:19:56.338754+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/3GJRODEAZBG4CCVB32EAWVFUOG","json":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG.json","graph_json":"https://pith.science/api/pith-number/3GJRODEAZBG4CCVB32EAWVFUOG/graph.json","events_json":"https://pith.science/api/pith-number/3GJRODEAZBG4CCVB32EAWVFUOG/events.json","paper":"https://pith.science/paper/3GJRODEA"},"agent_actions":{"view_html":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG","download_json":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG.json","view_paper":"https://pith.science/paper/3GJRODEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.09750&json=true","fetch_graph":"https://pith.science/api/pith-number/3GJRODEAZBG4CCVB32EAWVFUOG/graph.json","fetch_events":"https://pith.science/api/pith-number/3GJRODEAZBG4CCVB32EAWVFUOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG/action/storage_attestation","attest_author":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG/action/author_attestation","sign_citation":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG/action/citation_signature","submit_replication":"https://pith.science/pith/3GJRODEAZBG4CCVB32EAWVFUOG/action/replication_record"}},"created_at":"2026-07-05T11:19:56.338754+00:00","updated_at":"2026-07-05T11:19:56.338754+00:00"}