{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J57TBK4KCEV23HUTXJ7XRDDB6M","short_pith_number":"pith:J57TBK4K","schema_version":"1.0","canonical_sha256":"4f7f30ab8a112bad9e93ba7f788c61f30d20fcfa14d1a9aec69829bd6fc07e4a","source":{"kind":"arxiv","id":"1110.4319","version":2},"attestation_state":"computed","paper":{"title":"Min-Max Graph Partitioning and Small Set Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joseph (Seffi) Naor, Konstantin Makarychev, Nikhil Bansal, Robert Krauthgamer, Roy Schwartz, Uriel Feige, Viswanath Nagarajan","submitted_at":"2011-10-19T15:51:38Z","abstract_excerpt":"We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are where the k parts need to be of equal-size, and where they must separate a set of k given terminals. We consider a common generalization of these two problems, and design for it an $O(\\sqrt{\\log n\\log k})$-approximation algorithm. This improves over an $O(\\log^2 n)$ approximation for the second version, and roughly $O(k\\log n)$ approxima"},"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":"1110.4319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T15:51:38Z","cross_cats_sorted":[],"title_canon_sha256":"e2bb47b8912e83dcebb2906323014bf7c905bbad394b85d84333d5e81630373d","abstract_canon_sha256":"353c7c15b5826c75c15710fd7763407d9d8a0fc4e5cefe76cbc231f473b4d037"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:36.834462Z","signature_b64":"xWz8kHwTRXiTaDpNVXY/109rfE+mTk6poVKGd3Y7gN0Z9BP7rfgx+wvwKKak6290NaWJ05v6Q9jKxjaGFChoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f7f30ab8a112bad9e93ba7f788c61f30d20fcfa14d1a9aec69829bd6fc07e4a","last_reissued_at":"2026-05-18T04:10:36.833738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:36.833738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Min-Max Graph Partitioning and Small Set Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joseph (Seffi) Naor, Konstantin Makarychev, Nikhil Bansal, Robert Krauthgamer, Roy Schwartz, Uriel Feige, Viswanath Nagarajan","submitted_at":"2011-10-19T15:51:38Z","abstract_excerpt":"We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are where the k parts need to be of equal-size, and where they must separate a set of k given terminals. We consider a common generalization of these two problems, and design for it an $O(\\sqrt{\\log n\\log k})$-approximation algorithm. This improves over an $O(\\log^2 n)$ approximation for the second version, and roughly $O(k\\log n)$ approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4319","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":"1110.4319","created_at":"2026-05-18T04:10:36.833848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4319v2","created_at":"2026-05-18T04:10:36.833848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4319","created_at":"2026-05-18T04:10:36.833848+00:00"},{"alias_kind":"pith_short_12","alias_value":"J57TBK4KCEV2","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J57TBK4KCEV23HUT","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J57TBK4K","created_at":"2026-05-18T12:26:32.869790+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/J57TBK4KCEV23HUTXJ7XRDDB6M","json":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M.json","graph_json":"https://pith.science/api/pith-number/J57TBK4KCEV23HUTXJ7XRDDB6M/graph.json","events_json":"https://pith.science/api/pith-number/J57TBK4KCEV23HUTXJ7XRDDB6M/events.json","paper":"https://pith.science/paper/J57TBK4K"},"agent_actions":{"view_html":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M","download_json":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M.json","view_paper":"https://pith.science/paper/J57TBK4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4319&json=true","fetch_graph":"https://pith.science/api/pith-number/J57TBK4KCEV23HUTXJ7XRDDB6M/graph.json","fetch_events":"https://pith.science/api/pith-number/J57TBK4KCEV23HUTXJ7XRDDB6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/action/storage_attestation","attest_author":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/action/author_attestation","sign_citation":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/action/citation_signature","submit_replication":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/action/replication_record"}},"created_at":"2026-05-18T04:10:36.833848+00:00","updated_at":"2026-05-18T04:10:36.833848+00:00"}