{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PV2GZGNU6IMFRGUEREHWUDA3DA","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":"595dd18e634542de2ebffec8c96bfaece3393819067520ead6caca4ed6d33034","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-26T09:38:02Z","title_canon_sha256":"db0348bdf4faac6e87ef05b60ae3009691c84cf04b590609c130876ec4528207"},"schema_version":"1.0","source":{"id":"1803.09483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09483","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09483v2","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09483","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"PV2GZGNU6IMF","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PV2GZGNU6IMFRGUE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PV2GZGNU","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:4bac58e242995fed2a46019fbc3f4563571bf1384d93e6080bd52dfcb9b9d500","target":"graph","created_at":"2026-05-18T00:17:59Z","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"},"paper":{"abstract_excerpt":"We define a general variant of the graph clustering problem where the criterion of density for the clusters is (high) connectivity. In {\\sc Clustering to Given Connectivities}, we are given an $n$-vertex graph $G$, an integer $k$, and a sequence $\\Lambda=\\langle \\lambda_{1},\\ldots,\\lambda_{t}\\rangle$ of positive integers and we ask whether it is possible to remove at most $k$ edges from $G$ such that the resulting connected components are {\\sl exactly} $t$ and their corresponding edge connectivities are lower-bounded by the numbers in $\\Lambda$. We prove that this problem, parameterized by $k$","authors_text":"Dimitrios M. Thilikos, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-26T09:38:02Z","title":"Clustering to Given Connectivities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09483","kind":"arxiv","version":2},"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:883a07c3d74132bb049f96fd67d385383be148011e21cb252bd7df2d64ca80e8","target":"record","created_at":"2026-05-18T00:17:59Z","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":"595dd18e634542de2ebffec8c96bfaece3393819067520ead6caca4ed6d33034","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-26T09:38:02Z","title_canon_sha256":"db0348bdf4faac6e87ef05b60ae3009691c84cf04b590609c130876ec4528207"},"schema_version":"1.0","source":{"id":"1803.09483","kind":"arxiv","version":2}},"canonical_sha256":"7d746c99b4f218589a84890f6a0c1b1800d4c26bc8d64d56fbfb22497e1490b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d746c99b4f218589a84890f6a0c1b1800d4c26bc8d64d56fbfb22497e1490b8","first_computed_at":"2026-05-18T00:17:59.459153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:59.459153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Q7BnEmVbNPQZpNjCM1Mg5IkCXsWxnEQbEWTVNjMMOwUGitC07v6APxQMDhlCBrR6M28p7F1XMZqXmzrCDL0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:59.459669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:883a07c3d74132bb049f96fd67d385383be148011e21cb252bd7df2d64ca80e8","sha256:4bac58e242995fed2a46019fbc3f4563571bf1384d93e6080bd52dfcb9b9d500"],"state_sha256":"6c4730f0bd80bd77705b6aa3b054b3a4efee0f8dd2584fe3fa86a078f3c89d26"}