{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FLBHSAET7HDTF3JDC5KYZVB5BF","short_pith_number":"pith:FLBHSAET","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"},"canonical_sha256":"2ac2790093f9c732ed2317558cd43d094b77cf54589093b40ff580c6d4a222c3","source":{"kind":"arxiv","id":"1401.0699","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0699","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0699v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0699","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"FLBHSAET7HDT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FLBHSAET7HDTF3JD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FLBHSAET","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FLBHSAET7HDTF3JDC5KYZVB5BF","target":"record","payload":{"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"},"canonical_sha256":"2ac2790093f9c732ed2317558cd43d094b77cf54589093b40ff580c6d4a222c3","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"},"source_kind":"arxiv","source_id":"1401.0699","source_version":3,"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3TFX/3noGhffc4cCS7o2eQLBwo88vaUYZbK4RrMvCtjlzmq83NhN5mQPOk0FQ458r3Ch3eSfxJtewe9Qss7AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:14.267284Z"},"content_sha256":"4e9ed4d9c2a756dc846ccb02481caf7cc222403aca0a15ba6cab8422ec7b790c","schema_version":"1.0","event_id":"sha256:4e9ed4d9c2a756dc846ccb02481caf7cc222403aca0a15ba6cab8422ec7b790c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FLBHSAET7HDTF3JDC5KYZVB5BF","target":"graph","payload":{"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"},"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7iIkAbh5Dpa/xtiRnLxMQ/4NgOqYvoo8raFw7oka2URNvsKZlwlVATB5xNUzkoM0IecbAKIhJU30Vk8kEHfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:14.267643Z"},"content_sha256":"872ccd8a820daeb1454ac31f1969dc82b136bd1891d92589a20aee2b541dbc1e","schema_version":"1.0","event_id":"sha256:872ccd8a820daeb1454ac31f1969dc82b136bd1891d92589a20aee2b541dbc1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/bundle.json","state_url":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/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-06-02T17:34:14Z","links":{"resolver":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF","bundle":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/bundle.json","state":"https://pith.science/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLBHSAET7HDTF3JDC5KYZVB5BF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FLBHSAET7HDTF3JDC5KYZVB5BF","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":"9e121d8532c968b481fb88399eb9120445ef49befe1e935ddd9f1696b2e42fc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T19:10:51Z","title_canon_sha256":"abb064237cec48af3b1355c1d253fcf6ee0a43171d90e39c7bf2eb8ca83d9d69"},"schema_version":"1.0","source":{"id":"1401.0699","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0699","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0699v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0699","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"FLBHSAET7HDT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FLBHSAET7HDTF3JD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FLBHSAET","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:872ccd8a820daeb1454ac31f1969dc82b136bd1891d92589a20aee2b541dbc1e","target":"graph","created_at":"2026-05-18T02:53:07Z","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 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","authors_text":"Konstantin Makarychev, Yury Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T19:10:51Z","title":"Nonuniform Graph Partitioning with Unrelated Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0699","kind":"arxiv","version":3},"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:4e9ed4d9c2a756dc846ccb02481caf7cc222403aca0a15ba6cab8422ec7b790c","target":"record","created_at":"2026-05-18T02:53:07Z","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":"9e121d8532c968b481fb88399eb9120445ef49befe1e935ddd9f1696b2e42fc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T19:10:51Z","title_canon_sha256":"abb064237cec48af3b1355c1d253fcf6ee0a43171d90e39c7bf2eb8ca83d9d69"},"schema_version":"1.0","source":{"id":"1401.0699","kind":"arxiv","version":3}},"canonical_sha256":"2ac2790093f9c732ed2317558cd43d094b77cf54589093b40ff580c6d4a222c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ac2790093f9c732ed2317558cd43d094b77cf54589093b40ff580c6d4a222c3","first_computed_at":"2026-05-18T02:53:07.522200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:07.522200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CiuR1B9EYylpRfY9lEc+IM46p1TPJIqGGOiVLFyXsAoSPsHzipGMn9j9EqvZjFsJO8spoLH63tdLGxQzJKn0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:07.522870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0699","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e9ed4d9c2a756dc846ccb02481caf7cc222403aca0a15ba6cab8422ec7b790c","sha256:872ccd8a820daeb1454ac31f1969dc82b136bd1891d92589a20aee2b541dbc1e"],"state_sha256":"3af0ca48ac312b442cd869b6ce331c63dae539b8d2109b5b16ece5baebe0c212"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZARca/q0BS3y4vOlHJ0dpqKgWez3XA2DIdTMCR7yTjEYTWCzJJcXUww+r/wO3ObzS2h770BNPOzOOgcL9Jw6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:34:14.269643Z","bundle_sha256":"7abc4af32bb15878e36452a01833fb27bb1c7a8abce593d9bff9d9042317d459"}}