{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LBVYB5MTZFYTZ6J66KULD3PIGS","short_pith_number":"pith:LBVYB5MT","canonical_record":{"source":{"id":"1711.06530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T13:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"bd42701f26ac88822805f60c2da11bb2fc1123893e546feb3a978f42a73bcea1","abstract_canon_sha256":"39c54a5915d696b741f91875f572a65fe58a16b5c7cbfb898bbabfb39b8fb66a"},"schema_version":"1.0"},"canonical_sha256":"586b80f593c9713cf93ef2a8b1ede834a11eb2703c30cffbbd5fc90ea202f6e5","source":{"kind":"arxiv","id":"1711.06530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06530","created_at":"2026-05-18T00:30:20Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06530v1","created_at":"2026-05-18T00:30:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06530","created_at":"2026-05-18T00:30:20Z"},{"alias_kind":"pith_short_12","alias_value":"LBVYB5MTZFYT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LBVYB5MTZFYTZ6J6","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LBVYB5MT","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LBVYB5MTZFYTZ6J66KULD3PIGS","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T13:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"bd42701f26ac88822805f60c2da11bb2fc1123893e546feb3a978f42a73bcea1","abstract_canon_sha256":"39c54a5915d696b741f91875f572a65fe58a16b5c7cbfb898bbabfb39b8fb66a"},"schema_version":"1.0"},"canonical_sha256":"586b80f593c9713cf93ef2a8b1ede834a11eb2703c30cffbbd5fc90ea202f6e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:20.821681Z","signature_b64":"+g3TBHfBshef3dLkQd1SGbztpIeKhQFX0/3V4xBETxFvWVrvyy/yweDnWs3OMNsw2c5bhGZaOETeBFha8t2YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"586b80f593c9713cf93ef2a8b1ede834a11eb2703c30cffbbd5fc90ea202f6e5","last_reissued_at":"2026-05-18T00:30:20.820874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:20.820874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06530","source_version":1,"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-18T00:30:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"be8hXfaVihFaQ8GfyQzxu/Ixc9XerFIhTBnzoDkFDwX1GdBqe+lSPgnHnHWLNx0IsylkUvJNdAgDvtqKyDNgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:42:35.746867Z"},"content_sha256":"5d1524379858e93d42e5b831f646ce03c0479738f280095eeb3f0f5db7cc4e14","schema_version":"1.0","event_id":"sha256:5d1524379858e93d42e5b831f646ce03c0479738f280095eeb3f0f5db7cc4e14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LBVYB5MTZFYTZ6J66KULD3PIGS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Clustering using Effective Resistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lap Chi Lau, Nima Anari, Shayan Oveis Gharan, Vedat Levi Alev","submitted_at":"2017-11-17T13:39:29Z","abstract_excerpt":"$ \\def\\vecc#1{\\boldsymbol{#1}} $We design a polynomial time algorithm that for any weighted undirected graph $G = (V, E,\\vecc w)$ and sufficiently large $\\delta > 1$, partitions $V$ into subsets $V_1, \\ldots, V_h$ for some $h\\geq 1$, such that\n  $\\bullet$ at most $\\delta^{-1}$ fraction of the weights are between clusters, i.e. \\[ w(E - \\cup_{i = 1}^h E(V_i)) \\lesssim \\frac{w(E)}{\\delta};\\]\n  $\\bullet$ the effective resistance diameter of each of the induced subgraphs $G[V_i]$ is at most $\\delta^3$ times the average weighted degree, i.e. \\[ \\max_{u, v \\in V_i} \\mathsf{Reff}_{G[V_i]}(u, v) \\less"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06530","kind":"arxiv","version":1},"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-18T00:30:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/0h0S469/TxDjR3Ilg1Yf/+pA8tRO/RnHYdIzMPD12LdJTyvFfPPR2YsQIF10iHU3kquC85Q2CdhpOfE6dECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:42:35.747225Z"},"content_sha256":"62a1caf497197c18f9c3a44e972b8aa132a769b3919f33b0417bdc8953afcaf2","schema_version":"1.0","event_id":"sha256:62a1caf497197c18f9c3a44e972b8aa132a769b3919f33b0417bdc8953afcaf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBVYB5MTZFYTZ6J66KULD3PIGS/bundle.json","state_url":"https://pith.science/pith/LBVYB5MTZFYTZ6J66KULD3PIGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBVYB5MTZFYTZ6J66KULD3PIGS/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-01T03:42:35Z","links":{"resolver":"https://pith.science/pith/LBVYB5MTZFYTZ6J66KULD3PIGS","bundle":"https://pith.science/pith/LBVYB5MTZFYTZ6J66KULD3PIGS/bundle.json","state":"https://pith.science/pith/LBVYB5MTZFYTZ6J66KULD3PIGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBVYB5MTZFYTZ6J66KULD3PIGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LBVYB5MTZFYTZ6J66KULD3PIGS","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":"39c54a5915d696b741f91875f572a65fe58a16b5c7cbfb898bbabfb39b8fb66a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T13:39:29Z","title_canon_sha256":"bd42701f26ac88822805f60c2da11bb2fc1123893e546feb3a978f42a73bcea1"},"schema_version":"1.0","source":{"id":"1711.06530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06530","created_at":"2026-05-18T00:30:20Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06530v1","created_at":"2026-05-18T00:30:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06530","created_at":"2026-05-18T00:30:20Z"},{"alias_kind":"pith_short_12","alias_value":"LBVYB5MTZFYT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LBVYB5MTZFYTZ6J6","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LBVYB5MT","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:62a1caf497197c18f9c3a44e972b8aa132a769b3919f33b0417bdc8953afcaf2","target":"graph","created_at":"2026-05-18T00:30:20Z","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":"$ \\def\\vecc#1{\\boldsymbol{#1}} $We design a polynomial time algorithm that for any weighted undirected graph $G = (V, E,\\vecc w)$ and sufficiently large $\\delta > 1$, partitions $V$ into subsets $V_1, \\ldots, V_h$ for some $h\\geq 1$, such that\n  $\\bullet$ at most $\\delta^{-1}$ fraction of the weights are between clusters, i.e. \\[ w(E - \\cup_{i = 1}^h E(V_i)) \\lesssim \\frac{w(E)}{\\delta};\\]\n  $\\bullet$ the effective resistance diameter of each of the induced subgraphs $G[V_i]$ is at most $\\delta^3$ times the average weighted degree, i.e. \\[ \\max_{u, v \\in V_i} \\mathsf{Reff}_{G[V_i]}(u, v) \\less","authors_text":"Lap Chi Lau, Nima Anari, Shayan Oveis Gharan, Vedat Levi Alev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T13:39:29Z","title":"Graph Clustering using Effective Resistance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06530","kind":"arxiv","version":1},"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:5d1524379858e93d42e5b831f646ce03c0479738f280095eeb3f0f5db7cc4e14","target":"record","created_at":"2026-05-18T00:30:20Z","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":"39c54a5915d696b741f91875f572a65fe58a16b5c7cbfb898bbabfb39b8fb66a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T13:39:29Z","title_canon_sha256":"bd42701f26ac88822805f60c2da11bb2fc1123893e546feb3a978f42a73bcea1"},"schema_version":"1.0","source":{"id":"1711.06530","kind":"arxiv","version":1}},"canonical_sha256":"586b80f593c9713cf93ef2a8b1ede834a11eb2703c30cffbbd5fc90ea202f6e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"586b80f593c9713cf93ef2a8b1ede834a11eb2703c30cffbbd5fc90ea202f6e5","first_computed_at":"2026-05-18T00:30:20.820874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:20.820874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+g3TBHfBshef3dLkQd1SGbztpIeKhQFX0/3V4xBETxFvWVrvyy/yweDnWs3OMNsw2c5bhGZaOETeBFha8t2YAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:20.821681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d1524379858e93d42e5b831f646ce03c0479738f280095eeb3f0f5db7cc4e14","sha256:62a1caf497197c18f9c3a44e972b8aa132a769b3919f33b0417bdc8953afcaf2"],"state_sha256":"f4b49a35525e35149e7cd765a3bd05adec557b6975450b9a65dd981cb63cdfc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vlifs93/rDv+N+ZYuqYlE1KupRA/rXjQlNtzZQ2stkwrsO5266Gljani8F5qXNgUh9rqbyhlVpGsEp146lmBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:42:35.749583Z","bundle_sha256":"f46a15c75833d128a54e064b310458938cc00d7490b63db8a35f84a66b3f6d17"}}