{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:T7NWD73SMF5JFZMWTARZ6JI4G2","short_pith_number":"pith:T7NWD73S","canonical_record":{"source":{"id":"1808.04807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-14T17:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"594a394725f0a42ff172a39e0a9f1c20bd1b32c17f4d6c94dec1503f3140d81b","abstract_canon_sha256":"e162d969688efe2a49a32176aa229f141f1c2ced85074b561491db3f9eb20584"},"schema_version":"1.0"},"canonical_sha256":"9fdb61ff72617a92e59698239f251c369bea00b579e13cd1a2cd8ea7c2e2b241","source":{"kind":"arxiv","id":"1808.04807","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04807","created_at":"2026-05-18T00:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04807v2","created_at":"2026-05-18T00:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04807","created_at":"2026-05-18T00:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"T7NWD73SMF5J","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T7NWD73SMF5JFZMW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T7NWD73S","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:T7NWD73SMF5JFZMWTARZ6JI4G2","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-14T17:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"594a394725f0a42ff172a39e0a9f1c20bd1b32c17f4d6c94dec1503f3140d81b","abstract_canon_sha256":"e162d969688efe2a49a32176aa229f141f1c2ced85074b561491db3f9eb20584"},"schema_version":"1.0"},"canonical_sha256":"9fdb61ff72617a92e59698239f251c369bea00b579e13cd1a2cd8ea7c2e2b241","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:28.059366Z","signature_b64":"012Y1KJvbqvpmMcM2IhlV30WYydhyGOLxQ/oLJIewSeErKEf8GxMbDQmiUKOqHpIm+Fu1Q+cA8aR/YvzAX3YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fdb61ff72617a92e59698239f251c369bea00b579e13cd1a2cd8ea7c2e2b241","last_reissued_at":"2026-05-18T00:05:28.058807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:28.058807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04807","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-18T00:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gfkp0JnMor1iWP8ITeUuFCRSTytzp7HsBGt/Jv3OKdlgJnIqxW9q5NEs6oZ394UNplBzuGF6uI52ROvTrupmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:33:45.290911Z"},"content_sha256":"66db64d9df04053abc0097dd7e8a78654b5eda80b89eeef95636b98de2d70b90","schema_version":"1.0","event_id":"sha256:66db64d9df04053abc0097dd7e8a78654b5eda80b89eeef95636b98de2d70b90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:T7NWD73SMF5JFZMWTARZ6JI4G2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Graph Clusterability: Algorithms and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aida Mousavifar, Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Yuval Peres","submitted_at":"2018-08-14T17:37:27Z","abstract_excerpt":"We consider the problem of testing graph cluster structure: given access to a graph $G=(V, E)$, can we quickly determine whether the graph can be partitioned into a few clusters with good inner conductance, or is far from any such graph? This is a generalization of the well-studied problem of testing graph expansion, where one wants to distinguish between the graph having good expansion (i.e.\\ being a good single cluster) and the graph having a sparse cut (i.e.\\ being a union of at least two clusters). A recent work of Czumaj, Peng, and Sohler (STOC'15) gave an ingenious sublinear time algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04807","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-18T00:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nf8XFjy+Q9+qsybRYU1Nakv6tbjQ/kg72bgtHEc4ZhAkWWDaNSuknnmBEl00UXBR8hJJZk8+AblG12tgHHZKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:33:45.291683Z"},"content_sha256":"97454bafdfb8133183d4f649bf2b780de548d889251c3f16f74335581a07a129","schema_version":"1.0","event_id":"sha256:97454bafdfb8133183d4f649bf2b780de548d889251c3f16f74335581a07a129"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7NWD73SMF5JFZMWTARZ6JI4G2/bundle.json","state_url":"https://pith.science/pith/T7NWD73SMF5JFZMWTARZ6JI4G2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7NWD73SMF5JFZMWTARZ6JI4G2/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-30T22:33:45Z","links":{"resolver":"https://pith.science/pith/T7NWD73SMF5JFZMWTARZ6JI4G2","bundle":"https://pith.science/pith/T7NWD73SMF5JFZMWTARZ6JI4G2/bundle.json","state":"https://pith.science/pith/T7NWD73SMF5JFZMWTARZ6JI4G2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7NWD73SMF5JFZMWTARZ6JI4G2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T7NWD73SMF5JFZMWTARZ6JI4G2","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":"e162d969688efe2a49a32176aa229f141f1c2ced85074b561491db3f9eb20584","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-14T17:37:27Z","title_canon_sha256":"594a394725f0a42ff172a39e0a9f1c20bd1b32c17f4d6c94dec1503f3140d81b"},"schema_version":"1.0","source":{"id":"1808.04807","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04807","created_at":"2026-05-18T00:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04807v2","created_at":"2026-05-18T00:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04807","created_at":"2026-05-18T00:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"T7NWD73SMF5J","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T7NWD73SMF5JFZMW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T7NWD73S","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:97454bafdfb8133183d4f649bf2b780de548d889251c3f16f74335581a07a129","target":"graph","created_at":"2026-05-18T00:05:28Z","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 consider the problem of testing graph cluster structure: given access to a graph $G=(V, E)$, can we quickly determine whether the graph can be partitioned into a few clusters with good inner conductance, or is far from any such graph? This is a generalization of the well-studied problem of testing graph expansion, where one wants to distinguish between the graph having good expansion (i.e.\\ being a good single cluster) and the graph having a sparse cut (i.e.\\ being a union of at least two clusters). A recent work of Czumaj, Peng, and Sohler (STOC'15) gave an ingenious sublinear time algorit","authors_text":"Aida Mousavifar, Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Yuval Peres","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-14T17:37:27Z","title":"Testing Graph Clusterability: Algorithms and Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04807","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:66db64d9df04053abc0097dd7e8a78654b5eda80b89eeef95636b98de2d70b90","target":"record","created_at":"2026-05-18T00:05:28Z","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":"e162d969688efe2a49a32176aa229f141f1c2ced85074b561491db3f9eb20584","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-14T17:37:27Z","title_canon_sha256":"594a394725f0a42ff172a39e0a9f1c20bd1b32c17f4d6c94dec1503f3140d81b"},"schema_version":"1.0","source":{"id":"1808.04807","kind":"arxiv","version":2}},"canonical_sha256":"9fdb61ff72617a92e59698239f251c369bea00b579e13cd1a2cd8ea7c2e2b241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fdb61ff72617a92e59698239f251c369bea00b579e13cd1a2cd8ea7c2e2b241","first_computed_at":"2026-05-18T00:05:28.058807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:28.058807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"012Y1KJvbqvpmMcM2IhlV30WYydhyGOLxQ/oLJIewSeErKEf8GxMbDQmiUKOqHpIm+Fu1Q+cA8aR/YvzAX3YAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:28.059366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04807","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66db64d9df04053abc0097dd7e8a78654b5eda80b89eeef95636b98de2d70b90","sha256:97454bafdfb8133183d4f649bf2b780de548d889251c3f16f74335581a07a129"],"state_sha256":"f0487b618f18c7bb3729c942c01f28b9230930b62b4f382f8a28068b62bba150"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/CdWBWYy4ywy2UVF7NAz3Iq1hhOT8nP7f5HHAPYn+bt2JLC9Yj89lhx3DF+D/cwmjUgn8kFVa81dkat7UvzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:33:45.295769Z","bundle_sha256":"56f763dea4590e0a93a463ed4632a6cefb6c8ef9961dd553027df19d6a942402"}}