{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XIIYB7YV73ZB7CWLDSHBEHKEZW","short_pith_number":"pith:XIIYB7YV","canonical_record":{"source":{"id":"1306.4384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T23:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"40c137e0f96f4031aeae00c41ec7570c4cd8e58f4b01662d80755fa110476783","abstract_canon_sha256":"874f199c3875a9014188c881c22e4e3266f129ed788cc886f46a79db6df21f65"},"schema_version":"1.0"},"canonical_sha256":"ba1180ff15fef21f8acb1c8e121d44cda1ef407b112ad2420abe4e2998c307d9","source":{"kind":"arxiv","id":"1306.4384","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4384","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4384v2","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4384","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"XIIYB7YV73ZB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XIIYB7YV73ZB7CWL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XIIYB7YV","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XIIYB7YV73ZB7CWLDSHBEHKEZW","target":"record","payload":{"canonical_record":{"source":{"id":"1306.4384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T23:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"40c137e0f96f4031aeae00c41ec7570c4cd8e58f4b01662d80755fa110476783","abstract_canon_sha256":"874f199c3875a9014188c881c22e4e3266f129ed788cc886f46a79db6df21f65"},"schema_version":"1.0"},"canonical_sha256":"ba1180ff15fef21f8acb1c8e121d44cda1ef407b112ad2420abe4e2998c307d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:09.107303Z","signature_b64":"92/3MUW+6YmlMBr49c58PhuosIKetbyQAOozPJ9kal3M0Xm4oz+nkAlogvZr8zDzHGN6RICX0TrCL4AzPjXNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba1180ff15fef21f8acb1c8e121d44cda1ef407b112ad2420abe4e2998c307d9","last_reissued_at":"2026-05-18T03:11:09.106514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:09.106514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.4384","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-18T03:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q0Xpg8QXBJOdJJ1Kuxa1qgX1mYjFhsQKiqPypbyfxMeHxC0uWOE+ELNkmOtn8SfDN+QXK7Bny2Qfntjtwuh7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:11:42.599656Z"},"content_sha256":"cb29036b182d6c660a3a03a4b8ab45f1f27942256b72ab026c06a3a9011b6778","schema_version":"1.0","event_id":"sha256:cb29036b182d6c660a3a03a4b8ab45f1f27942256b72ab026c06a3a9011b6778"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XIIYB7YV73ZB7CWLDSHBEHKEZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithm for Sparsest k-Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Louis, Konstantin Makarychev","submitted_at":"2013-06-18T23:00:35Z","abstract_excerpt":"Given a graph $G$, the sparsest-cut problem asks to find the set of vertices $S$ which has the least expansion defined as $$\\phi_G(S) := \\frac{w(E(S,\\bar{S}))}{\\min \\set{w(S), w(\\bar{S})}}, $$ where $w$ is the total edge weight of a subset. Here we study the natural generalization of this problem: given an integer $k$, compute a $k$-partition $\\set{P_1, \\ldots, P_k}$ of the vertex set so as to minimize $$ \\phi_k(\\set{P_1, \\ldots, P_k}) := \\max_i \\phi_G(P_i). $$ Our main result is a polynomial time bi-criteria approximation algorithm which outputs a $(1 - \\e)k$-partition of the vertex set such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4384","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-18T03:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVV9oeJaYe0BRjh3i3R/lZfi9WMM90ehE+yHzKmT2sKKBldb26hSkLRs6Ezl3lrkc77g6ejE3RmfT0kkJ2kqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:11:42.600208Z"},"content_sha256":"c81d62a7a282fdb2fbd0f30be5b2342b05ad36da22d4c2e0653f7a55db5ff46e","schema_version":"1.0","event_id":"sha256:c81d62a7a282fdb2fbd0f30be5b2342b05ad36da22d4c2e0653f7a55db5ff46e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIIYB7YV73ZB7CWLDSHBEHKEZW/bundle.json","state_url":"https://pith.science/pith/XIIYB7YV73ZB7CWLDSHBEHKEZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIIYB7YV73ZB7CWLDSHBEHKEZW/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-24T07:11:42Z","links":{"resolver":"https://pith.science/pith/XIIYB7YV73ZB7CWLDSHBEHKEZW","bundle":"https://pith.science/pith/XIIYB7YV73ZB7CWLDSHBEHKEZW/bundle.json","state":"https://pith.science/pith/XIIYB7YV73ZB7CWLDSHBEHKEZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIIYB7YV73ZB7CWLDSHBEHKEZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XIIYB7YV73ZB7CWLDSHBEHKEZW","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":"874f199c3875a9014188c881c22e4e3266f129ed788cc886f46a79db6df21f65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T23:00:35Z","title_canon_sha256":"40c137e0f96f4031aeae00c41ec7570c4cd8e58f4b01662d80755fa110476783"},"schema_version":"1.0","source":{"id":"1306.4384","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4384","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4384v2","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4384","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"XIIYB7YV73ZB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XIIYB7YV73ZB7CWL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XIIYB7YV","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:c81d62a7a282fdb2fbd0f30be5b2342b05ad36da22d4c2e0653f7a55db5ff46e","target":"graph","created_at":"2026-05-18T03:11:09Z","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":"Given a graph $G$, the sparsest-cut problem asks to find the set of vertices $S$ which has the least expansion defined as $$\\phi_G(S) := \\frac{w(E(S,\\bar{S}))}{\\min \\set{w(S), w(\\bar{S})}}, $$ where $w$ is the total edge weight of a subset. Here we study the natural generalization of this problem: given an integer $k$, compute a $k$-partition $\\set{P_1, \\ldots, P_k}$ of the vertex set so as to minimize $$ \\phi_k(\\set{P_1, \\ldots, P_k}) := \\max_i \\phi_G(P_i). $$ Our main result is a polynomial time bi-criteria approximation algorithm which outputs a $(1 - \\e)k$-partition of the vertex set such ","authors_text":"Anand Louis, Konstantin Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T23:00:35Z","title":"Approximation Algorithm for Sparsest k-Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4384","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:cb29036b182d6c660a3a03a4b8ab45f1f27942256b72ab026c06a3a9011b6778","target":"record","created_at":"2026-05-18T03:11:09Z","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":"874f199c3875a9014188c881c22e4e3266f129ed788cc886f46a79db6df21f65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-18T23:00:35Z","title_canon_sha256":"40c137e0f96f4031aeae00c41ec7570c4cd8e58f4b01662d80755fa110476783"},"schema_version":"1.0","source":{"id":"1306.4384","kind":"arxiv","version":2}},"canonical_sha256":"ba1180ff15fef21f8acb1c8e121d44cda1ef407b112ad2420abe4e2998c307d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba1180ff15fef21f8acb1c8e121d44cda1ef407b112ad2420abe4e2998c307d9","first_computed_at":"2026-05-18T03:11:09.106514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:09.106514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"92/3MUW+6YmlMBr49c58PhuosIKetbyQAOozPJ9kal3M0Xm4oz+nkAlogvZr8zDzHGN6RICX0TrCL4AzPjXNAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:09.107303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.4384","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb29036b182d6c660a3a03a4b8ab45f1f27942256b72ab026c06a3a9011b6778","sha256:c81d62a7a282fdb2fbd0f30be5b2342b05ad36da22d4c2e0653f7a55db5ff46e"],"state_sha256":"76d8ae21e2a0a775b6dad62ba4ff7fe38375ebeae9132380a8ecf48a3230a0e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fy8Z6ul9SX8wrqdt5lTj/vWUteVUbSaOoEW9BmSV6adHLG933Baf85v6sPfyMIZ0ZycTOT5cOLNfwj2rMPgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T07:11:42.603257Z","bundle_sha256":"2b1651492da7a44d7f8d735d6fece1bc69b895596f7a0083038ee85ba1f7ff32"}}