{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FLBHSAET7HDTF3JDC5KYZVB5BF","short_pith_number":"pith:FLBHSAET","schema_version":"1.0","canonical_sha256":"2ac2790093f9c732ed2317558cd43d094b77cf54589093b40ff580c6d4a222c3","source":{"kind":"arxiv","id":"1401.0699","version":3},"attestation_state":"computed","paper":{"title":"Nonuniform Graph Partitioning with Unrelated Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Yury Makarychev","submitted_at":"2014-01-03T19:10:51Z","abstract_excerpt":"We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014). In this problem, we are given a graph $G=(V,E)$ on $n$ vertices and $k$ numbers $\\rho_1,\\dots, \\rho_k$. The goal is to partition the graph into $k$ disjoint sets $P_1,\\dots, P_k$ satisfying $|P_i|\\leq \\rho_i n$ so as to minimize the number of edges cut by the partition. Our algorithm has an approximation ratio of $O(\\sqrt{\\log n \\log k})$ for general graphs, and an $O(1)$ approximation for graphs with excluded minors. This is an im"},"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":"1401.0699","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T19:10:51Z","cross_cats_sorted":[],"title_canon_sha256":"abb064237cec48af3b1355c1d253fcf6ee0a43171d90e39c7bf2eb8ca83d9d69","abstract_canon_sha256":"9e121d8532c968b481fb88399eb9120445ef49befe1e935ddd9f1696b2e42fc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.522870Z","signature_b64":"CiuR1B9EYylpRfY9lEc+IM46p1TPJIqGGOiVLFyXsAoSPsHzipGMn9j9EqvZjFsJO8spoLH63tdLGxQzJKn0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ac2790093f9c732ed2317558cd43d094b77cf54589093b40ff580c6d4a222c3","last_reissued_at":"2026-05-18T02:53:07.522200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.522200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonuniform Graph Partitioning with Unrelated Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Yury Makarychev","submitted_at":"2014-01-03T19:10:51Z","abstract_excerpt":"We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014). In this problem, we are given a graph $G=(V,E)$ on $n$ vertices and $k$ numbers $\\rho_1,\\dots, \\rho_k$. The goal is to partition the graph into $k$ disjoint sets $P_1,\\dots, P_k$ satisfying $|P_i|\\leq \\rho_i n$ so as to minimize the number of edges cut by the partition. Our algorithm has an approximation ratio of $O(\\sqrt{\\log n \\log k})$ for general graphs, and an $O(1)$ approximation for graphs with excluded minors. This is an im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0699","kind":"arxiv","version":3},"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":"1401.0699","created_at":"2026-05-18T02:53:07.522308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0699v3","created_at":"2026-05-18T02:53:07.522308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0699","created_at":"2026-05-18T02:53:07.522308+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLBHSAET7HDT","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLBHSAET7HDTF3JD","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLBHSAET","created_at":"2026-05-18T12:28:28.263976+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/FLBHSAET7HDTF3JDC5KYZVB5BF","json":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF.json","graph_json":"https://pith.science/api/pith-number/FLBHSAET7HDTF3JDC5KYZVB5BF/graph.json","events_json":"https://pith.science/api/pith-number/FLBHSAET7HDTF3JDC5KYZVB5BF/events.json","paper":"https://pith.science/paper/FLBHSAET"},"agent_actions":{"view_html":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF","download_json":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF.json","view_paper":"https://pith.science/paper/FLBHSAET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0699&json=true","fetch_graph":"https://pith.science/api/pith-number/FLBHSAET7HDTF3JDC5KYZVB5BF/graph.json","fetch_events":"https://pith.science/api/pith-number/FLBHSAET7HDTF3JDC5KYZVB5BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/action/storage_attestation","attest_author":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/action/author_attestation","sign_citation":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/action/citation_signature","submit_replication":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/action/replication_record"}},"created_at":"2026-05-18T02:53:07.522308+00:00","updated_at":"2026-05-18T02:53:07.522308+00:00"}