{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KUOBAQG34IDXTK6JMWKDNQ7LT7","short_pith_number":"pith:KUOBAQG3","schema_version":"1.0","canonical_sha256":"551c1040dbe20779abc9659436c3eb9feb2a48898db6f7ab03045b6d09e875fa","source":{"kind":"arxiv","id":"2210.15151","version":1},"attestation_state":"computed","paper":{"title":"Graphs with many independent vertex cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leilei Zhang, Xingzhi Zhan, Yanan Hu","submitted_at":"2022-10-27T03:32:07Z","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."},"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":"2210.15151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-27T03:32:07Z","cross_cats_sorted":[],"title_canon_sha256":"fea1a826bfe6163e5394ede198fa183690019258c00cb4c469772f09525e3503","abstract_canon_sha256":"f6c87200e0ed0dba4d40f00ccd7db5e06e6e58e5f99b0093ac6a53f45879cbae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:02.719292Z","signature_b64":"CWwXFNpmIuG37zdhu5bj/3Cu2VifsPYMVGY13/MUt69RuMWUy69l4eLIgUAr8DPu3pmHdJHLTgM6y6nuhklOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"551c1040dbe20779abc9659436c3eb9feb2a48898db6f7ab03045b6d09e875fa","last_reissued_at":"2026-07-05T05:11:02.718888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:02.718888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with many independent vertex cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leilei Zhang, Xingzhi Zhan, Yanan Hu","submitted_at":"2022-10-27T03:32:07Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.15151","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/2210.15151/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":"2210.15151","created_at":"2026-07-05T05:11:02.718944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.15151v1","created_at":"2026-07-05T05:11:02.718944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.15151","created_at":"2026-07-05T05:11:02.718944+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUOBAQG34IDX","created_at":"2026-07-05T05:11:02.718944+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUOBAQG34IDXTK6J","created_at":"2026-07-05T05:11:02.718944+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUOBAQG3","created_at":"2026-07-05T05:11:02.718944+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/KUOBAQG34IDXTK6JMWKDNQ7LT7","json":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7.json","graph_json":"https://pith.science/api/pith-number/KUOBAQG34IDXTK6JMWKDNQ7LT7/graph.json","events_json":"https://pith.science/api/pith-number/KUOBAQG34IDXTK6JMWKDNQ7LT7/events.json","paper":"https://pith.science/paper/KUOBAQG3"},"agent_actions":{"view_html":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7","download_json":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7.json","view_paper":"https://pith.science/paper/KUOBAQG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.15151&json=true","fetch_graph":"https://pith.science/api/pith-number/KUOBAQG34IDXTK6JMWKDNQ7LT7/graph.json","fetch_events":"https://pith.science/api/pith-number/KUOBAQG34IDXTK6JMWKDNQ7LT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7/action/storage_attestation","attest_author":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7/action/author_attestation","sign_citation":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7/action/citation_signature","submit_replication":"https://pith.science/pith/KUOBAQG34IDXTK6JMWKDNQ7LT7/action/replication_record"}},"created_at":"2026-07-05T05:11:02.718944+00:00","updated_at":"2026-07-05T05:11:02.718944+00:00"}