{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4SHIGRRBEMMCZXERQNEWYA5SE4","short_pith_number":"pith:4SHIGRRB","schema_version":"1.0","canonical_sha256":"e48e83462123182cdc9183496c03b2272e856550ca677f7c84f7f7b5553a2a92","source":{"kind":"arxiv","id":"1504.03294","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.03294","created_at":"2026-05-18T02:18:58.668725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03294v1","created_at":"2026-05-18T02:18:58.668725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03294","created_at":"2026-05-18T02:18:58.668725+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SHIGRRBEMMC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SHIGRRBEMMCZXER","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SHIGRRB","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4","json":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4.json","graph_json":"https://pith.science/api/pith-number/4SHIGRRBEMMCZXERQNEWYA5SE4/graph.json","events_json":"https://pith.science/api/pith-number/4SHIGRRBEMMCZXERQNEWYA5SE4/events.json","paper":"https://pith.science/paper/4SHIGRRB"},"agent_actions":{"view_html":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4","download_json":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4.json","view_paper":"https://pith.science/paper/4SHIGRRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03294&json=true","fetch_graph":"https://pith.science/api/pith-number/4SHIGRRBEMMCZXERQNEWYA5SE4/graph.json","fetch_events":"https://pith.science/api/pith-number/4SHIGRRBEMMCZXERQNEWYA5SE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/action/storage_attestation","attest_author":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/action/author_attestation","sign_citation":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/action/citation_signature","submit_replication":"https://pith.science/pith/4SHIGRRBEMMCZXERQNEWYA5SE4/action/replication_record"}},"created_at":"2026-05-18T02:18:58.668725+00:00","updated_at":"2026-05-18T02:18:58.668725+00:00"}