{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KUOBAQG34IDXTK6JMWKDNQ7LT7","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":"f6c87200e0ed0dba4d40f00ccd7db5e06e6e58e5f99b0093ac6a53f45879cbae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-27T03:32:07Z","title_canon_sha256":"fea1a826bfe6163e5394ede198fa183690019258c00cb4c469772f09525e3503"},"schema_version":"1.0","source":{"id":"2210.15151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.15151","created_at":"2026-07-05T05:11:02Z"},{"alias_kind":"arxiv_version","alias_value":"2210.15151v1","created_at":"2026-07-05T05:11:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.15151","created_at":"2026-07-05T05:11:02Z"},{"alias_kind":"pith_short_12","alias_value":"KUOBAQG34IDX","created_at":"2026-07-05T05:11:02Z"},{"alias_kind":"pith_short_16","alias_value":"KUOBAQG34IDXTK6J","created_at":"2026-07-05T05:11:02Z"},{"alias_kind":"pith_short_8","alias_value":"KUOBAQG3","created_at":"2026-07-05T05:11:02Z"}],"graph_snapshots":[{"event_id":"sha256:243e4dfd5149f388fa9b7291b0dab9b8528d3f1c250f035d28c22bc789f3da9c","target":"graph","created_at":"2026-07-05T05:11:02Z","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/2210.15151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\\ge 3$ there exists a unique graph $G$ satisfying the following conditions: (1) $G$ is $k$-connected; (2) the independence number of $G$ is greater than $k;$ (3) any independent set of cardinality $k$ is a vertex cut of $G.$ The edge version of this result does not hold. We also consider the problem when replacing independent sets by the periphery.","authors_text":"Leilei Zhang, Xingzhi Zhan, Yanan Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-27T03:32:07Z","title":"Graphs with many independent vertex cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.15151","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:0df99b69034d79d84dff3ff270b857b6104e9e0c4b82b6411c16063376e85a15","target":"record","created_at":"2026-07-05T05:11:02Z","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":"f6c87200e0ed0dba4d40f00ccd7db5e06e6e58e5f99b0093ac6a53f45879cbae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-27T03:32:07Z","title_canon_sha256":"fea1a826bfe6163e5394ede198fa183690019258c00cb4c469772f09525e3503"},"schema_version":"1.0","source":{"id":"2210.15151","kind":"arxiv","version":1}},"canonical_sha256":"551c1040dbe20779abc9659436c3eb9feb2a48898db6f7ab03045b6d09e875fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"551c1040dbe20779abc9659436c3eb9feb2a48898db6f7ab03045b6d09e875fa","first_computed_at":"2026-07-05T05:11:02.718888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:11:02.718888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CWwXFNpmIuG37zdhu5bj/3Cu2VifsPYMVGY13/MUt69RuMWUy69l4eLIgUAr8DPu3pmHdJHLTgM6y6nuhklOCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:11:02.719292Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.15151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0df99b69034d79d84dff3ff270b857b6104e9e0c4b82b6411c16063376e85a15","sha256:243e4dfd5149f388fa9b7291b0dab9b8528d3f1c250f035d28c22bc789f3da9c"],"state_sha256":"40a7cddbf33bfaacf1148f51682fa37fc261ed1e445641cd3fcdb5daffd19e0c"}