{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3GJRODEAZBG4CCVB32EAWVFUOG","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":"9bb6ca9ca960639e2e3c42a29b93173ed0c5c6c13917aabbd3c67cc8b53172ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-11T13:54:27Z","title_canon_sha256":"7f475963a96d3f636dccdc8a4b2db038a9eec36415c9341aee23f43c32f0428b"},"schema_version":"1.0","source":{"id":"2506.09750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09750","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09750v1","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09750","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"3GJRODEAZBG4","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_16","alias_value":"3GJRODEAZBG4CCVB","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_8","alias_value":"3GJRODEA","created_at":"2026-07-05T11:19:56Z"}],"graph_snapshots":[{"event_id":"sha256:0dc8cc4755c9c7b79309053069ec7d6a81589a52598d1f71f8de4eef230e6f57","target":"graph","created_at":"2026-07-05T11:19:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.09750/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chengli Li, Feng Liu, Yurui Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-11T13:54:27Z","title":"Cycles and paths through vertices whose degrees are at least the bipartite-hole-number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09750","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:9400dd210c64f8270ee0a19aa8d265e20e47d3ed9c05fe716955bc3219dc5081","target":"record","created_at":"2026-07-05T11:19:56Z","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":"9bb6ca9ca960639e2e3c42a29b93173ed0c5c6c13917aabbd3c67cc8b53172ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-11T13:54:27Z","title_canon_sha256":"7f475963a96d3f636dccdc8a4b2db038a9eec36415c9341aee23f43c32f0428b"},"schema_version":"1.0","source":{"id":"2506.09750","kind":"arxiv","version":1}},"canonical_sha256":"d993170c80c84dc10aa1de880b54b471b8f963f8a8891f97c73cbf66537ab829","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d993170c80c84dc10aa1de880b54b471b8f963f8a8891f97c73cbf66537ab829","first_computed_at":"2026-07-05T11:19:56.338688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:56.338688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ntMlIYHtt6Vqp/kUvxumXnx0xU+ISfEaF4bt4fxo3JjiaIkARWKd4WhktdL0PM6zO9txScPw6RzoNi29qYrRAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:56.339233Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.09750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9400dd210c64f8270ee0a19aa8d265e20e47d3ed9c05fe716955bc3219dc5081","sha256:0dc8cc4755c9c7b79309053069ec7d6a81589a52598d1f71f8de4eef230e6f57"],"state_sha256":"078d373671990dc93f221342c83e345d3f5b3b8f057f414fe0e3b234d66cc6ab"}