{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LLPGLKFD6OR7HHI7XWRYTTT3TE","short_pith_number":"pith:LLPGLKFD","schema_version":"1.0","canonical_sha256":"5ade65a8a3f3a3f39d1fbda389ce7b9921089f1b725ce2410f21b739a71ab409","source":{"kind":"arxiv","id":"1403.0099","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Algorithms for Graph Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hadas Shachnai, Meirav Zehavi","submitted_at":"2014-03-01T15:45:12Z","abstract_excerpt":"We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\\subseteq V$ of size $k$, such that $\\alpha_1m_1 + \\alpha_2m_2$ is at most (or at least) $p$, where $\\alpha_1,\\alpha_2\\in\\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $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":"1403.0099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-01T15:45:12Z","cross_cats_sorted":[],"title_canon_sha256":"a6c5ccddfd579bedc12894ff8099370190d276d22795f41b6190a6ec01cd5df2","abstract_canon_sha256":"da5bc5bb6b464d4d068d447c825012b917dd93d1cb58a995cc437ab1955a5f82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:25.766942Z","signature_b64":"ERjtMfCpgf/FJHdwfrGN7SjwqmRXxLlzPs9oJ6KEzvNyTd0xe4w1y80QQshQFLCTJgtc7KP1c46q8w1o7IvqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ade65a8a3f3a3f39d1fbda389ce7b9921089f1b725ce2410f21b739a71ab409","last_reissued_at":"2026-05-18T02:57:25.766369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:25.766369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Graph Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hadas Shachnai, Meirav Zehavi","submitted_at":"2014-03-01T15:45:12Z","abstract_excerpt":"We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\\subseteq V$ of size $k$, such that $\\alpha_1m_1 + \\alpha_2m_2$ is at most (or at least) $p$, where $\\alpha_1,\\alpha_2\\in\\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $k$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0099","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":"1403.0099","created_at":"2026-05-18T02:57:25.766465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0099v1","created_at":"2026-05-18T02:57:25.766465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0099","created_at":"2026-05-18T02:57:25.766465+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLPGLKFD6OR7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLPGLKFD6OR7HHI7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLPGLKFD","created_at":"2026-05-18T12:28:38.356838+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/LLPGLKFD6OR7HHI7XWRYTTT3TE","json":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE.json","graph_json":"https://pith.science/api/pith-number/LLPGLKFD6OR7HHI7XWRYTTT3TE/graph.json","events_json":"https://pith.science/api/pith-number/LLPGLKFD6OR7HHI7XWRYTTT3TE/events.json","paper":"https://pith.science/paper/LLPGLKFD"},"agent_actions":{"view_html":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE","download_json":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE.json","view_paper":"https://pith.science/paper/LLPGLKFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0099&json=true","fetch_graph":"https://pith.science/api/pith-number/LLPGLKFD6OR7HHI7XWRYTTT3TE/graph.json","fetch_events":"https://pith.science/api/pith-number/LLPGLKFD6OR7HHI7XWRYTTT3TE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/action/storage_attestation","attest_author":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/action/author_attestation","sign_citation":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/action/citation_signature","submit_replication":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/action/replication_record"}},"created_at":"2026-05-18T02:57:25.766465+00:00","updated_at":"2026-05-18T02:57:25.766465+00:00"}