{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6ACOH3CID6DHB2R3VC3QY2XRTA","short_pith_number":"pith:6ACOH3CI","schema_version":"1.0","canonical_sha256":"f004e3ec481f8670ea3ba8b70c6af19825268d45681448d98ee3fd810b7749c9","source":{"kind":"arxiv","id":"1711.03885","version":1},"attestation_state":"computed","paper":{"title":"Clustering with Local Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, D\\'aniel Marx","submitted_at":"2017-11-10T15:41:00Z","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 "},"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":"1711.03885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"b95eead8b63d90a2531bd4d3c3c85e9a03a667fc7d3701ab931db3d5d83d1c45","abstract_canon_sha256":"f873604070e29bda76bc83640ab34bcece86c3e525be1ab4c1c8e03721d5bb2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:51.191910Z","signature_b64":"U6NZYKUh3hJ7BZLm60ClfUmZFdnwx9wSGKc0dkqk0lJJNUJ+ObzWTdChhaJLoQd3OoWk1jJlrGrYc8U+OQilCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f004e3ec481f8670ea3ba8b70c6af19825268d45681448d98ee3fd810b7749c9","last_reissued_at":"2026-05-18T00:30:51.191345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:51.191345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering with Local Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, D\\'aniel Marx","submitted_at":"2017-11-10T15:41:00Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03885","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":""},"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":"1711.03885","created_at":"2026-05-18T00:30:51.191427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03885v1","created_at":"2026-05-18T00:30:51.191427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03885","created_at":"2026-05-18T00:30:51.191427+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ACOH3CID6DH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ACOH3CID6DHB2R3","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ACOH3CI","created_at":"2026-05-18T12:31:03.183658+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/6ACOH3CID6DHB2R3VC3QY2XRTA","json":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA.json","graph_json":"https://pith.science/api/pith-number/6ACOH3CID6DHB2R3VC3QY2XRTA/graph.json","events_json":"https://pith.science/api/pith-number/6ACOH3CID6DHB2R3VC3QY2XRTA/events.json","paper":"https://pith.science/paper/6ACOH3CI"},"agent_actions":{"view_html":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA","download_json":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA.json","view_paper":"https://pith.science/paper/6ACOH3CI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03885&json=true","fetch_graph":"https://pith.science/api/pith-number/6ACOH3CID6DHB2R3VC3QY2XRTA/graph.json","fetch_events":"https://pith.science/api/pith-number/6ACOH3CID6DHB2R3VC3QY2XRTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA/action/storage_attestation","attest_author":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA/action/author_attestation","sign_citation":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA/action/citation_signature","submit_replication":"https://pith.science/pith/6ACOH3CID6DHB2R3VC3QY2XRTA/action/replication_record"}},"created_at":"2026-05-18T00:30:51.191427+00:00","updated_at":"2026-05-18T00:30:51.191427+00:00"}