{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4SHIGRRBEMMCZXERQNEWYA5SE4","short_pith_number":"pith:4SHIGRRB","canonical_record":{"source":{"id":"1504.03294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-13T18:52:02Z","cross_cats_sorted":[],"title_canon_sha256":"0212bbd3a9055bfc1061050a03609dfb9f669636be64dfa37a7389d40f62b78b","abstract_canon_sha256":"94c39aa6c2b44ae8d7bc9bfca1e206924b11fbdf11da3c1580a8df4b63349beb"},"schema_version":"1.0"},"canonical_sha256":"e48e83462123182cdc9183496c03b2272e856550ca677f7c84f7f7b5553a2a92","source":{"kind":"arxiv","id":"1504.03294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03294","created_at":"2026-05-18T02:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03294v1","created_at":"2026-05-18T02:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03294","created_at":"2026-05-18T02:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"4SHIGRRBEMMC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4SHIGRRBEMMCZXER","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4SHIGRRB","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4SHIGRRBEMMCZXERQNEWYA5SE4","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-13T18:52:02Z","cross_cats_sorted":[],"title_canon_sha256":"0212bbd3a9055bfc1061050a03609dfb9f669636be64dfa37a7389d40f62b78b","abstract_canon_sha256":"94c39aa6c2b44ae8d7bc9bfca1e206924b11fbdf11da3c1580a8df4b63349beb"},"schema_version":"1.0"},"canonical_sha256":"e48e83462123182cdc9183496c03b2272e856550ca677f7c84f7f7b5553a2a92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:58.669376Z","signature_b64":"ADZkhPLidOY8tTCP/Z70tJa7T+TqzN2+wyTmHhPiJx30HJIG2vlotBS8twt8itVCA5qkERq3RDu4+6vLxuWrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e48e83462123182cdc9183496c03b2272e856550ca677f7c84f7f7b5553a2a92","last_reissued_at":"2026-05-18T02:18:58.668621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:58.668621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03294","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-18T02:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fx3BlB4TGVuQ8UDYCAcuaJLfg90tEFFWiXDiVV9gx8P94AN5aUe9qwPWcwcsdMbZ0G7C7HpYLxz/hhtu1GmrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:07.165634Z"},"content_sha256":"0048c276ab2bf6a499ff7fab3d7e78dfb5389af1cb087d12bf418511e29f3ee6","schema_version":"1.0","event_id":"sha256:0048c276ab2bf6a499ff7fab3d7e78dfb5389af1cb087d12bf418511e29f3ee6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4SHIGRRBEMMCZXERQNEWYA5SE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Cluster Structure of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Artur Czumaj, Christian Sohler, Pan Peng","submitted_at":"2015-04-13T18:52:02Z","abstract_excerpt":"We study the problem of recognizing the cluster structure of a graph in the framework of property testing in the bounded degree model. Given a parameter $\\varepsilon$, a $d$-bounded degree graph is defined to be $(k, \\phi)$-clusterable, if it can be partitioned into no more than $k$ parts, such that the (inner) conductance of the induced subgraph on each part is at least $\\phi$ and the (outer) conductance of each part is at most $c_{d,k}\\varepsilon^4\\phi^2$, where $c_{d,k}$ depends only on $d,k$. Our main result is a sublinear algorithm with the running time $\\widetilde{O}(\\sqrt{n}\\cdot\\mathrm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03294","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-18T02:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1PUij0c0dbktZyzWcsURrHXYKtf56PrdG4IfYiN23F/8y3TJu12V7FUs0s7vLoLl4GdYqAzfwDdlFwcGdUiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:07.166291Z"},"content_sha256":"d4a5c9e97f1312b15f9bbb725fe0a87b504c8a9806e28cb54e1cafdd835e236b","schema_version":"1.0","event_id":"sha256:d4a5c9e97f1312b15f9bbb725fe0a87b504c8a9806e28cb54e1cafdd835e236b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/bundle.json","state_url":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/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-26T19:59:07Z","links":{"resolver":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4","bundle":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/bundle.json","state":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4SHIGRRBEMMCZXERQNEWYA5SE4","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":"94c39aa6c2b44ae8d7bc9bfca1e206924b11fbdf11da3c1580a8df4b63349beb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-13T18:52:02Z","title_canon_sha256":"0212bbd3a9055bfc1061050a03609dfb9f669636be64dfa37a7389d40f62b78b"},"schema_version":"1.0","source":{"id":"1504.03294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03294","created_at":"2026-05-18T02:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03294v1","created_at":"2026-05-18T02:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03294","created_at":"2026-05-18T02:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"4SHIGRRBEMMC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4SHIGRRBEMMCZXER","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4SHIGRRB","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:d4a5c9e97f1312b15f9bbb725fe0a87b504c8a9806e28cb54e1cafdd835e236b","target":"graph","created_at":"2026-05-18T02:18:58Z","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 study the problem of recognizing the cluster structure of a graph in the framework of property testing in the bounded degree model. Given a parameter $\\varepsilon$, a $d$-bounded degree graph is defined to be $(k, \\phi)$-clusterable, if it can be partitioned into no more than $k$ parts, such that the (inner) conductance of the induced subgraph on each part is at least $\\phi$ and the (outer) conductance of each part is at most $c_{d,k}\\varepsilon^4\\phi^2$, where $c_{d,k}$ depends only on $d,k$. Our main result is a sublinear algorithm with the running time $\\widetilde{O}(\\sqrt{n}\\cdot\\mathrm","authors_text":"Artur Czumaj, Christian Sohler, Pan Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-13T18:52:02Z","title":"Testing Cluster Structure of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03294","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:0048c276ab2bf6a499ff7fab3d7e78dfb5389af1cb087d12bf418511e29f3ee6","target":"record","created_at":"2026-05-18T02:18:58Z","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":"94c39aa6c2b44ae8d7bc9bfca1e206924b11fbdf11da3c1580a8df4b63349beb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-13T18:52:02Z","title_canon_sha256":"0212bbd3a9055bfc1061050a03609dfb9f669636be64dfa37a7389d40f62b78b"},"schema_version":"1.0","source":{"id":"1504.03294","kind":"arxiv","version":1}},"canonical_sha256":"e48e83462123182cdc9183496c03b2272e856550ca677f7c84f7f7b5553a2a92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e48e83462123182cdc9183496c03b2272e856550ca677f7c84f7f7b5553a2a92","first_computed_at":"2026-05-18T02:18:58.668621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:58.668621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ADZkhPLidOY8tTCP/Z70tJa7T+TqzN2+wyTmHhPiJx30HJIG2vlotBS8twt8itVCA5qkERq3RDu4+6vLxuWrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:58.669376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0048c276ab2bf6a499ff7fab3d7e78dfb5389af1cb087d12bf418511e29f3ee6","sha256:d4a5c9e97f1312b15f9bbb725fe0a87b504c8a9806e28cb54e1cafdd835e236b"],"state_sha256":"09c065ee6cdf0c8f1e07a0dc9df77bf1a4dc620c7ef625b633e180cd8218dffd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99fKck6w65PMl5m2nQ96DzB884MAm/i4e1r6PW2ANqJVKzPzN+JIJAyhSSA87JLxcvcgvA4I9lRaNZQ5lekaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:59:07.169850Z","bundle_sha256":"d6ab477d4061217542c9679693f400d48c82b43af50cbdaf91b5dab812fd7421"}}