{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PV2GZGNU6IMFRGUEREHWUDA3DA","short_pith_number":"pith:PV2GZGNU","schema_version":"1.0","canonical_sha256":"7d746c99b4f218589a84890f6a0c1b1800d4c26bc8d64d56fbfb22497e1490b8","source":{"kind":"arxiv","id":"1803.09483","version":2},"attestation_state":"computed","paper":{"title":"Clustering to Given Connectivities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Petr A. Golovach","submitted_at":"2018-03-26T09:38:02Z","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$"},"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":"1803.09483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-26T09:38:02Z","cross_cats_sorted":[],"title_canon_sha256":"db0348bdf4faac6e87ef05b60ae3009691c84cf04b590609c130876ec4528207","abstract_canon_sha256":"595dd18e634542de2ebffec8c96bfaece3393819067520ead6caca4ed6d33034"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:59.459669Z","signature_b64":"9Q7BnEmVbNPQZpNjCM1Mg5IkCXsWxnEQbEWTVNjMMOwUGitC07v6APxQMDhlCBrR6M28p7F1XMZqXmzrCDL0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d746c99b4f218589a84890f6a0c1b1800d4c26bc8d64d56fbfb22497e1490b8","last_reissued_at":"2026-05-18T00:17:59.459153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:59.459153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering to Given Connectivities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Petr A. Golovach","submitted_at":"2018-03-26T09:38:02Z","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$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09483","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1803.09483","created_at":"2026-05-18T00:17:59.459236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09483v2","created_at":"2026-05-18T00:17:59.459236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09483","created_at":"2026-05-18T00:17:59.459236+00:00"},{"alias_kind":"pith_short_12","alias_value":"PV2GZGNU6IMF","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PV2GZGNU6IMFRGUE","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PV2GZGNU","created_at":"2026-05-18T12:32:46.962924+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/PV2GZGNU6IMFRGUEREHWUDA3DA","json":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA.json","graph_json":"https://pith.science/api/pith-number/PV2GZGNU6IMFRGUEREHWUDA3DA/graph.json","events_json":"https://pith.science/api/pith-number/PV2GZGNU6IMFRGUEREHWUDA3DA/events.json","paper":"https://pith.science/paper/PV2GZGNU"},"agent_actions":{"view_html":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA","download_json":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA.json","view_paper":"https://pith.science/paper/PV2GZGNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09483&json=true","fetch_graph":"https://pith.science/api/pith-number/PV2GZGNU6IMFRGUEREHWUDA3DA/graph.json","fetch_events":"https://pith.science/api/pith-number/PV2GZGNU6IMFRGUEREHWUDA3DA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA/action/storage_attestation","attest_author":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA/action/author_attestation","sign_citation":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA/action/citation_signature","submit_replication":"https://pith.science/pith/PV2GZGNU6IMFRGUEREHWUDA3DA/action/replication_record"}},"created_at":"2026-05-18T00:17:59.459236+00:00","updated_at":"2026-05-18T00:17:59.459236+00:00"}