{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6ACOH3CID6DHB2R3VC3QY2XRTA","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":"f873604070e29bda76bc83640ab34bcece86c3e525be1ab4c1c8e03721d5bb2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:00Z","title_canon_sha256":"b95eead8b63d90a2531bd4d3c3c85e9a03a667fc7d3701ab931db3d5d83d1c45"},"schema_version":"1.0","source":{"id":"1711.03885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03885","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03885v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03885","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"6ACOH3CID6DH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ACOH3CID6DHB2R3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ACOH3CI","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a68faed29d06b0adfe0de10dc05d16ad2a3f14a57821f9438de3846baf95ad62","target":"graph","created_at":"2026-05-18T00:30:51Z","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 study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let $\\mu$ be a function on the subsets of vertices of a graph $G$. In the $(\\mu,p,q)$-PARTITION problem, the task is to find a partition of the vertices into clusters where each cluster $C$ satisfies the requirements that (1) at most $q$ edges leave $C$ and (2) $\\mu(C)\\le p$. Our first result shows that if $\\mu$ is an {\\em arbitrary} polynomial-time computable monotone function, then $(\\mu,p,q)$-PARTITION can be solved in time $n^{O(q)}$, i.e., it is polynomial-time solvable ","authors_text":"Daniel Lokshtanov, D\\'aniel Marx","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:00Z","title":"Clustering with Local Restrictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03885","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:a841cda7eeab2d25fe83ff2dcb23c8710128eee6568710405ab144a88c824a43","target":"record","created_at":"2026-05-18T00:30:51Z","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":"f873604070e29bda76bc83640ab34bcece86c3e525be1ab4c1c8e03721d5bb2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:00Z","title_canon_sha256":"b95eead8b63d90a2531bd4d3c3c85e9a03a667fc7d3701ab931db3d5d83d1c45"},"schema_version":"1.0","source":{"id":"1711.03885","kind":"arxiv","version":1}},"canonical_sha256":"f004e3ec481f8670ea3ba8b70c6af19825268d45681448d98ee3fd810b7749c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f004e3ec481f8670ea3ba8b70c6af19825268d45681448d98ee3fd810b7749c9","first_computed_at":"2026-05-18T00:30:51.191345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:51.191345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U6NZYKUh3hJ7BZLm60ClfUmZFdnwx9wSGKc0dkqk0lJJNUJ+ObzWTdChhaJLoQd3OoWk1jJlrGrYc8U+OQilCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:51.191910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a841cda7eeab2d25fe83ff2dcb23c8710128eee6568710405ab144a88c824a43","sha256:a68faed29d06b0adfe0de10dc05d16ad2a3f14a57821f9438de3846baf95ad62"],"state_sha256":"ef673c227fd3f8c852d2447b4baf41668e55d3a80d199d3bb1fbdfff3ca92baa"}