{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J57TBK4KCEV23HUTXJ7XRDDB6M","short_pith_number":"pith:J57TBK4K","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"},"canonical_sha256":"4f7f30ab8a112bad9e93ba7f788c61f30d20fcfa14d1a9aec69829bd6fc07e4a","source":{"kind":"arxiv","id":"1110.4319","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4319","created_at":"2026-05-18T04:10:36Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4319v2","created_at":"2026-05-18T04:10:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4319","created_at":"2026-05-18T04:10:36Z"},{"alias_kind":"pith_short_12","alias_value":"J57TBK4KCEV2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J57TBK4KCEV23HUT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J57TBK4K","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J57TBK4KCEV23HUTXJ7XRDDB6M","target":"record","payload":{"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"},"canonical_sha256":"4f7f30ab8a112bad9e93ba7f788c61f30d20fcfa14d1a9aec69829bd6fc07e4a","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"},"source_kind":"arxiv","source_id":"1110.4319","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:10:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqdlwrXMYZmor+oucO5wDlrPwlYFPQtIxY3OkK7NQ0r6L7EdYH2FRMh4y9PsjtVW9gHu78WF0MoRnxzUzrc+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:38:21.133812Z"},"content_sha256":"a5eb924c14ad67d0cc29c9154c83484fa5bb5baa92724621947fe7c5128f6d44","schema_version":"1.0","event_id":"sha256:a5eb924c14ad67d0cc29c9154c83484fa5bb5baa92724621947fe7c5128f6d44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J57TBK4KCEV23HUTXJ7XRDDB6M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:10:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zE7XsJbpWF1nR8HCBAudWD3IKXIB1O51lcyoxr5wVxZNSu2Z9GZJipfRFrxaUyN+yxzlTUpEbPxsci0klwamCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:38:21.134162Z"},"content_sha256":"62ec0f724866960b9cda824aac6000a3ac73757bdf7b58614800fa869f664e29","schema_version":"1.0","event_id":"sha256:62ec0f724866960b9cda824aac6000a3ac73757bdf7b58614800fa869f664e29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/bundle.json","state_url":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T11:38:21Z","links":{"resolver":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M","bundle":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/bundle.json","state":"https://pith.science/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J57TBK4KCEV23HUTXJ7XRDDB6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J57TBK4KCEV23HUTXJ7XRDDB6M","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":"353c7c15b5826c75c15710fd7763407d9d8a0fc4e5cefe76cbc231f473b4d037","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T15:51:38Z","title_canon_sha256":"e2bb47b8912e83dcebb2906323014bf7c905bbad394b85d84333d5e81630373d"},"schema_version":"1.0","source":{"id":"1110.4319","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4319","created_at":"2026-05-18T04:10:36Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4319v2","created_at":"2026-05-18T04:10:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4319","created_at":"2026-05-18T04:10:36Z"},{"alias_kind":"pith_short_12","alias_value":"J57TBK4KCEV2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J57TBK4KCEV23HUT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J57TBK4K","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:62ec0f724866960b9cda824aac6000a3ac73757bdf7b58614800fa869f664e29","target":"graph","created_at":"2026-05-18T04:10:36Z","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 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","authors_text":"Joseph (Seffi) Naor, Konstantin Makarychev, Nikhil Bansal, Robert Krauthgamer, Roy Schwartz, Uriel Feige, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T15:51:38Z","title":"Min-Max Graph Partitioning and Small Set Expansion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4319","kind":"arxiv","version":2},"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:a5eb924c14ad67d0cc29c9154c83484fa5bb5baa92724621947fe7c5128f6d44","target":"record","created_at":"2026-05-18T04:10:36Z","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":"353c7c15b5826c75c15710fd7763407d9d8a0fc4e5cefe76cbc231f473b4d037","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T15:51:38Z","title_canon_sha256":"e2bb47b8912e83dcebb2906323014bf7c905bbad394b85d84333d5e81630373d"},"schema_version":"1.0","source":{"id":"1110.4319","kind":"arxiv","version":2}},"canonical_sha256":"4f7f30ab8a112bad9e93ba7f788c61f30d20fcfa14d1a9aec69829bd6fc07e4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f7f30ab8a112bad9e93ba7f788c61f30d20fcfa14d1a9aec69829bd6fc07e4a","first_computed_at":"2026-05-18T04:10:36.833738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:36.833738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xWz8kHwTRXiTaDpNVXY/109rfE+mTk6poVKGd3Y7gN0Z9BP7rfgx+wvwKKak6290NaWJ05v6Q9jKxjaGFChoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:36.834462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4319","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5eb924c14ad67d0cc29c9154c83484fa5bb5baa92724621947fe7c5128f6d44","sha256:62ec0f724866960b9cda824aac6000a3ac73757bdf7b58614800fa869f664e29"],"state_sha256":"a9d473717eed8932ba7cb3e8bfa008512880d3f401177a34fc78dbba6cdd409a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQ6+cZqOTCX+N0TM80tj5RO3+1waUa44/tacfnm8ea69tzv+vhjWua1SsgRyfup5dSakUlcAskfSat5+Fo3jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:38:21.136068Z","bundle_sha256":"3bb00f88d71941d3fc3e125bb911f7526da2977f837372202b74fbe4444757f5"}}