{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6GX455SZOH4R5Q2FPN33P2QV7V","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":"5cce15fe0d45c904dbfef09c7aa620597a916af1da4b21de3f37d5df58b20acd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-03-25T19:58:18Z","title_canon_sha256":"26cb2b365d3a1bc7ba40820b905a70c25bc5974f221cd47bd9cc8d37dc2e185c"},"schema_version":"1.0","source":{"id":"2303.14550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.14550","created_at":"2026-07-05T05:54:43Z"},{"alias_kind":"arxiv_version","alias_value":"2303.14550v1","created_at":"2026-07-05T05:54:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14550","created_at":"2026-07-05T05:54:43Z"},{"alias_kind":"pith_short_12","alias_value":"6GX455SZOH4R","created_at":"2026-07-05T05:54:43Z"},{"alias_kind":"pith_short_16","alias_value":"6GX455SZOH4R5Q2F","created_at":"2026-07-05T05:54:43Z"},{"alias_kind":"pith_short_8","alias_value":"6GX455SZ","created_at":"2026-07-05T05:54:43Z"}],"graph_snapshots":[{"event_id":"sha256:2f0b21d1dcbf3d8148d2c436f2da8adeb231db8451443d1c92eb7078a4d04e82","target":"graph","created_at":"2026-07-05T05:54:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.14550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a new connection between a technical measure called $\\mu$-conductance that arises in the study of Markov chains for sampling convex bodies and the network community profile that characterizes size-resolved properties of clusters and communities in social and information networks. The idea of $\\mu$-conductance is similar to the traditional graph conductance, but disregards sets with small volume. We derive a sequence of optimization problems including a low-rank semi-definite program from which we can derive a lower bound on the optimal $\\mu$-conductance value. These ideas give the fir","authors_text":"C. Seshadhri, David F. Gleich, Yufan Huang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-03-25T19:58:18Z","title":"Theoretical bounds on the network community profile from low-rank semi-definite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14550","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:cbd7220449280d3769f029e7838d53f75e11452d5ebc6ac55d46a9fdd2a60c72","target":"record","created_at":"2026-07-05T05:54:43Z","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":"5cce15fe0d45c904dbfef09c7aa620597a916af1da4b21de3f37d5df58b20acd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-03-25T19:58:18Z","title_canon_sha256":"26cb2b365d3a1bc7ba40820b905a70c25bc5974f221cd47bd9cc8d37dc2e185c"},"schema_version":"1.0","source":{"id":"2303.14550","kind":"arxiv","version":1}},"canonical_sha256":"f1afcef65971f91ec3457b77b7ea15fd56593a5c79973bd3e77a31b6089388fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1afcef65971f91ec3457b77b7ea15fd56593a5c79973bd3e77a31b6089388fa","first_computed_at":"2026-07-05T05:54:43.336752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:54:43.336752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YC2XYKguzBr2hYJ6kZdw7i+CJ8D7WrOHwWvG/mHk/nckIKW8hSxI/GAbaqKUXw4Flr68R5m2LRHJ5kwhDhVuDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:54:43.337155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.14550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbd7220449280d3769f029e7838d53f75e11452d5ebc6ac55d46a9fdd2a60c72","sha256:2f0b21d1dcbf3d8148d2c436f2da8adeb231db8451443d1c92eb7078a4d04e82"],"state_sha256":"e80b5a4bf722c3e2b26db5f6353a397a35f575e5df5f8613d6131c18f1993904"}