{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PNVKEQ25S34TFO7M2ITDB42FN6","short_pith_number":"pith:PNVKEQ25","schema_version":"1.0","canonical_sha256":"7b6aa2435d96f932bbecd22630f3456f87d03a3a4757212f94f441bc2a0211d9","source":{"kind":"arxiv","id":"1705.04898","version":1},"attestation_state":"computed","paper":{"title":"Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Guy Even, Moti Medina, Reut Levi","submitted_at":"2017-05-13T23:17:28Z","abstract_excerpt":"In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the general graph model.\n  We first describe a general procedure for converting $\\epsilon$-testers with a number of rounds $f(D)$, where $D$ denotes the diameter of the graph, to $O((\\log n)/\\epsilon)+f((\\log n)/\\epsilon)$ rounds, where $n$ is the number of processors of the network. We then apply this procedure to obtain an optimal tester, in terms of $n$, for testing bipartiteness, whose round complexity is $O(\\epsilon^"},"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.04898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-13T23:17:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"720469a05bf8e57481fc4b9a6e768fc87d451770961077bc754dd315b2e5cb41","abstract_canon_sha256":"211f28e028cbf91e7da03a8d70b456eddadbeefe1cf46420b6527a4848471b80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:34.420291Z","signature_b64":"NQPelPKQ/kjmC8yV7mg5vlPqAwZplIdELkaqDmzfwGovDdX7n471q+Cd8h1Umt9UJOEJll6xkUXvoP3+ugF3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b6aa2435d96f932bbecd22630f3456f87d03a3a4757212f94f441bc2a0211d9","last_reissued_at":"2026-05-18T00:44:34.419915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:34.419915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Guy Even, Moti Medina, Reut Levi","submitted_at":"2017-05-13T23:17:28Z","abstract_excerpt":"In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the general graph model.\n  We first describe a general procedure for converting $\\epsilon$-testers with a number of rounds $f(D)$, where $D$ denotes the diameter of the graph, to $O((\\log n)/\\epsilon)+f((\\log n)/\\epsilon)$ rounds, where $n$ is the number of processors of the network. We then apply this procedure to obtain an optimal tester, in terms of $n$, for testing bipartiteness, whose round complexity is $O(\\epsilon^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04898","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":"1705.04898","created_at":"2026-05-18T00:44:34.419978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04898v1","created_at":"2026-05-18T00:44:34.419978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04898","created_at":"2026-05-18T00:44:34.419978+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNVKEQ25S34T","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNVKEQ25S34TFO7M","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNVKEQ25","created_at":"2026-05-18T12:31:37.085036+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/PNVKEQ25S34TFO7M2ITDB42FN6","json":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6.json","graph_json":"https://pith.science/api/pith-number/PNVKEQ25S34TFO7M2ITDB42FN6/graph.json","events_json":"https://pith.science/api/pith-number/PNVKEQ25S34TFO7M2ITDB42FN6/events.json","paper":"https://pith.science/paper/PNVKEQ25"},"agent_actions":{"view_html":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6","download_json":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6.json","view_paper":"https://pith.science/paper/PNVKEQ25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04898&json=true","fetch_graph":"https://pith.science/api/pith-number/PNVKEQ25S34TFO7M2ITDB42FN6/graph.json","fetch_events":"https://pith.science/api/pith-number/PNVKEQ25S34TFO7M2ITDB42FN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/action/storage_attestation","attest_author":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/action/author_attestation","sign_citation":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/action/citation_signature","submit_replication":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/action/replication_record"}},"created_at":"2026-05-18T00:44:34.419978+00:00","updated_at":"2026-05-18T00:44:34.419978+00:00"}