{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GWW7RLL2CLECNMDPRG3PMG63YK","short_pith_number":"pith:GWW7RLL2","schema_version":"1.0","canonical_sha256":"35adf8ad7a12c826b06f89b6f61bdbc2840313fabd2f203d14c68fa8a58a672a","source":{"kind":"arxiv","id":"1705.08174","version":3},"attestation_state":"computed","paper":{"title":"Distributed Testing of Conductance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hendrik Fichtenberger, Yadu Vasudev","submitted_at":"2017-05-23T10:50:06Z","abstract_excerpt":"We study the problem of testing conductance in the setting of distributed computing and give a two-sided tester that takes $\\mathcal{O}(\\log(n) / (\\epsilon \\Phi^2))$ rounds to decide if a graph has conductance at least $\\Phi$ or is $\\epsilon$-far from having conductance at least $\\Phi^2 / 1000$ in the distributed CONGEST model. We also show that $\\Omega(\\log n)$ rounds are necessary for testing conductance even in the LOCAL model. In the case of a connected graph, we show that we can perform the test even when the number of vertices in the graph is not known a priori. This is the first two-sid"},"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":"1705.08174","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-23T10:50:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5cabf8681c69a05727aac697833c0f55739090bfcbd3cb8f0ea10757001871b3","abstract_canon_sha256":"a690d453d34b9ffec1e0f2b5c41d54d5c1faaa0b05d93954bcf4d06447afe989"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:30.888937Z","signature_b64":"GcW6/LzUqBR1ZzIIFn/o1kdyJNIIxCHT8ma4OKFox7NmhNLZfKcnKo3rD1rQxzMaou7CZbUnqnCtVZyH+lmOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35adf8ad7a12c826b06f89b6f61bdbc2840313fabd2f203d14c68fa8a58a672a","last_reissued_at":"2026-05-18T00:32:30.888292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:30.888292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Testing of Conductance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hendrik Fichtenberger, Yadu Vasudev","submitted_at":"2017-05-23T10:50:06Z","abstract_excerpt":"We study the problem of testing conductance in the setting of distributed computing and give a two-sided tester that takes $\\mathcal{O}(\\log(n) / (\\epsilon \\Phi^2))$ rounds to decide if a graph has conductance at least $\\Phi$ or is $\\epsilon$-far from having conductance at least $\\Phi^2 / 1000$ in the distributed CONGEST model. We also show that $\\Omega(\\log n)$ rounds are necessary for testing conductance even in the LOCAL model. In the case of a connected graph, we show that we can perform the test even when the number of vertices in the graph is not known a priori. This is the first two-sid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08174","kind":"arxiv","version":3},"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":"1705.08174","created_at":"2026-05-18T00:32:30.888424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08174v3","created_at":"2026-05-18T00:32:30.888424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08174","created_at":"2026-05-18T00:32:30.888424+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWW7RLL2CLEC","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWW7RLL2CLECNMDP","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWW7RLL2","created_at":"2026-05-18T12:31:18.294218+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/GWW7RLL2CLECNMDPRG3PMG63YK","json":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK.json","graph_json":"https://pith.science/api/pith-number/GWW7RLL2CLECNMDPRG3PMG63YK/graph.json","events_json":"https://pith.science/api/pith-number/GWW7RLL2CLECNMDPRG3PMG63YK/events.json","paper":"https://pith.science/paper/GWW7RLL2"},"agent_actions":{"view_html":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK","download_json":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK.json","view_paper":"https://pith.science/paper/GWW7RLL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08174&json=true","fetch_graph":"https://pith.science/api/pith-number/GWW7RLL2CLECNMDPRG3PMG63YK/graph.json","fetch_events":"https://pith.science/api/pith-number/GWW7RLL2CLECNMDPRG3PMG63YK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK/action/storage_attestation","attest_author":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK/action/author_attestation","sign_citation":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK/action/citation_signature","submit_replication":"https://pith.science/pith/GWW7RLL2CLECNMDPRG3PMG63YK/action/replication_record"}},"created_at":"2026-05-18T00:32:30.888424+00:00","updated_at":"2026-05-18T00:32:30.888424+00:00"}