{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PNVKEQ25S34TFO7M2ITDB42FN6","short_pith_number":"pith:PNVKEQ25","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"},"canonical_sha256":"7b6aa2435d96f932bbecd22630f3456f87d03a3a4757212f94f441bc2a0211d9","source":{"kind":"arxiv","id":"1705.04898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04898","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04898v1","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04898","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"PNVKEQ25S34T","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNVKEQ25S34TFO7M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNVKEQ25","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PNVKEQ25S34TFO7M2ITDB42FN6","target":"record","payload":{"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"},"canonical_sha256":"7b6aa2435d96f932bbecd22630f3456f87d03a3a4757212f94f441bc2a0211d9","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"},"source_kind":"arxiv","source_id":"1705.04898","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-18T00:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LeaiJya4Z4/ccAKLYAeF80Bezj4J85w/Z1xTo0/i6uK1HQcjRbbKUlliBnp91Xv3e+RlIsBvLFJpZo2onjleBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:33:09.920500Z"},"content_sha256":"b7cd072f41f5999fdfaf0188ff410b8ee1fadda6a879e0083d3ec006d2efde73","schema_version":"1.0","event_id":"sha256:b7cd072f41f5999fdfaf0188ff410b8ee1fadda6a879e0083d3ec006d2efde73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PNVKEQ25S34TFO7M2ITDB42FN6","target":"graph","payload":{"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"},"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:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0G/0zj8GqBA7entipIniL2f28TAAM6JFJHf3Nj927SQ36BuVmJVIK6bcJq7XEGiJsh4bPZc0luW/UiQwxT4NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:33:09.921333Z"},"content_sha256":"aca69dcd4f8b52166fc49d3c0aca42d2f2f703c9f91f0feb542bf9fa50c6f1f3","schema_version":"1.0","event_id":"sha256:aca69dcd4f8b52166fc49d3c0aca42d2f2f703c9f91f0feb542bf9fa50c6f1f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/bundle.json","state_url":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNVKEQ25S34TFO7M2ITDB42FN6/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-31T16:33:09Z","links":{"resolver":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6","bundle":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/bundle.json","state":"https://pith.science/pith/PNVKEQ25S34TFO7M2ITDB42FN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNVKEQ25S34TFO7M2ITDB42FN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PNVKEQ25S34TFO7M2ITDB42FN6","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":"211f28e028cbf91e7da03a8d70b456eddadbeefe1cf46420b6527a4848471b80","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-13T23:17:28Z","title_canon_sha256":"720469a05bf8e57481fc4b9a6e768fc87d451770961077bc754dd315b2e5cb41"},"schema_version":"1.0","source":{"id":"1705.04898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04898","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04898v1","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04898","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"PNVKEQ25S34T","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNVKEQ25S34TFO7M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNVKEQ25","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:aca69dcd4f8b52166fc49d3c0aca42d2f2f703c9f91f0feb542bf9fa50c6f1f3","target":"graph","created_at":"2026-05-18T00:44:34Z","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":"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^","authors_text":"Guy Even, Moti Medina, Reut Levi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-13T23:17:28Z","title":"Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04898","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:b7cd072f41f5999fdfaf0188ff410b8ee1fadda6a879e0083d3ec006d2efde73","target":"record","created_at":"2026-05-18T00:44:34Z","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":"211f28e028cbf91e7da03a8d70b456eddadbeefe1cf46420b6527a4848471b80","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-13T23:17:28Z","title_canon_sha256":"720469a05bf8e57481fc4b9a6e768fc87d451770961077bc754dd315b2e5cb41"},"schema_version":"1.0","source":{"id":"1705.04898","kind":"arxiv","version":1}},"canonical_sha256":"7b6aa2435d96f932bbecd22630f3456f87d03a3a4757212f94f441bc2a0211d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b6aa2435d96f932bbecd22630f3456f87d03a3a4757212f94f441bc2a0211d9","first_computed_at":"2026-05-18T00:44:34.419915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:34.419915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NQPelPKQ/kjmC8yV7mg5vlPqAwZplIdELkaqDmzfwGovDdX7n471q+Cd8h1Umt9UJOEJll6xkUXvoP3+ugF3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:34.420291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7cd072f41f5999fdfaf0188ff410b8ee1fadda6a879e0083d3ec006d2efde73","sha256:aca69dcd4f8b52166fc49d3c0aca42d2f2f703c9f91f0feb542bf9fa50c6f1f3"],"state_sha256":"0e1aa0bef0968afb8249576652ea9888ee430f803fd86f49af8a509752b99dc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pk2odMvpCQCuXUytqIUlcinxZK5J5z2ihT5MnY5BZHrKG1JgmA0Updwyao4s/2FE1EPINXjSQZR+ystUi80KDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:33:09.926283Z","bundle_sha256":"fe8a8334b25ac594560730e294c9aa14c052803dcaad06b42bf5533b89748210"}}