{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VBNP6QRHMFS3CPSJNRYHY5WPFN","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":"6eeaef2e3d8eb63ae8a20c800cb45b54609ab3cca118cf1c5999f63f357f21ca","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-22T08:35:09Z","title_canon_sha256":"ed1d8c088e2fcab1a76a4b966c2d8797b0033161a70513419ec98fa48eb51a4c"},"schema_version":"1.0","source":{"id":"1905.09016","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09016","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09016v1","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09016","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"pith_short_12","alias_value":"VBNP6QRHMFS3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VBNP6QRHMFS3CPSJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VBNP6QRH","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:dc0c761897d5aa89e46f051fcb6933916c7952721def88f3cf9aac4683d6aa8c","target":"graph","created_at":"2026-05-17T23:45:24Z","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 prove three new lower bounds for graph connectivity in the $1$-bit broadcast congested clique model, BCC$(1)$. First, in the KT-$0$ version of BCC$(1)$, in which nodes are aware of neighbors only through port numbers, we show an $\\Omega(\\log n)$ round lower bound for CONNECTIVITY even for constant-error randomized Monte Carlo algorithms. The deterministic version of this result can be obtained via the well-known \"edge-crossing\" argument, but, the randomized version of this result requires establishing new combinatorial results regarding the indistinguishability graph induced by inputs. In o","authors_text":"Shreyas Pai, Sriram V. Pemmaraju","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-22T08:35:09Z","title":"Connectivity Lower Bounds in Broadcast Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09016","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:ecd0c49c1748a8b8096786d72c3fdcf80992164ccaf6bdc06dae2570592feab7","target":"record","created_at":"2026-05-17T23:45:24Z","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":"6eeaef2e3d8eb63ae8a20c800cb45b54609ab3cca118cf1c5999f63f357f21ca","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-22T08:35:09Z","title_canon_sha256":"ed1d8c088e2fcab1a76a4b966c2d8797b0033161a70513419ec98fa48eb51a4c"},"schema_version":"1.0","source":{"id":"1905.09016","kind":"arxiv","version":1}},"canonical_sha256":"a85aff42276165b13e496c707c76cf2b41198f3ded17bf83b0b288cb46077f69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a85aff42276165b13e496c707c76cf2b41198f3ded17bf83b0b288cb46077f69","first_computed_at":"2026-05-17T23:45:24.587484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:24.587484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGwUG9drMMkw4A/cGC7qbhrVALzeoXsxyB01qFz6B5+VpYYr/D/5QMCd0xewZDaaUN+KGYvmPR9WEhO9y2X7Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:24.587989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09016","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecd0c49c1748a8b8096786d72c3fdcf80992164ccaf6bdc06dae2570592feab7","sha256:dc0c761897d5aa89e46f051fcb6933916c7952721def88f3cf9aac4683d6aa8c"],"state_sha256":"df644033dc023f7d669218c11f435501a386cd02c327947136c6560067b5791d"}