{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VBNP6QRHMFS3CPSJNRYHY5WPFN","short_pith_number":"pith:VBNP6QRH","schema_version":"1.0","canonical_sha256":"a85aff42276165b13e496c707c76cf2b41198f3ded17bf83b0b288cb46077f69","source":{"kind":"arxiv","id":"1905.09016","version":1},"attestation_state":"computed","paper":{"title":"Connectivity Lower Bounds in Broadcast Congested Clique","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Shreyas Pai, Sriram V. Pemmaraju","submitted_at":"2019-05-22T08:35:09Z","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"},"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":"1905.09016","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-22T08:35:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ed1d8c088e2fcab1a76a4b966c2d8797b0033161a70513419ec98fa48eb51a4c","abstract_canon_sha256":"6eeaef2e3d8eb63ae8a20c800cb45b54609ab3cca118cf1c5999f63f357f21ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:24.587989Z","signature_b64":"YGwUG9drMMkw4A/cGC7qbhrVALzeoXsxyB01qFz6B5+VpYYr/D/5QMCd0xewZDaaUN+KGYvmPR9WEhO9y2X7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a85aff42276165b13e496c707c76cf2b41198f3ded17bf83b0b288cb46077f69","last_reissued_at":"2026-05-17T23:45:24.587484Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:24.587484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity Lower Bounds in Broadcast Congested Clique","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Shreyas Pai, Sriram V. Pemmaraju","submitted_at":"2019-05-22T08:35:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09016","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":"1905.09016","created_at":"2026-05-17T23:45:24.587552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09016v1","created_at":"2026-05-17T23:45:24.587552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09016","created_at":"2026-05-17T23:45:24.587552+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBNP6QRHMFS3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBNP6QRHMFS3CPSJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBNP6QRH","created_at":"2026-05-18T12:33:30.264802+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/VBNP6QRHMFS3CPSJNRYHY5WPFN","json":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN.json","graph_json":"https://pith.science/api/pith-number/VBNP6QRHMFS3CPSJNRYHY5WPFN/graph.json","events_json":"https://pith.science/api/pith-number/VBNP6QRHMFS3CPSJNRYHY5WPFN/events.json","paper":"https://pith.science/paper/VBNP6QRH"},"agent_actions":{"view_html":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN","download_json":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN.json","view_paper":"https://pith.science/paper/VBNP6QRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09016&json=true","fetch_graph":"https://pith.science/api/pith-number/VBNP6QRHMFS3CPSJNRYHY5WPFN/graph.json","fetch_events":"https://pith.science/api/pith-number/VBNP6QRHMFS3CPSJNRYHY5WPFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN/action/storage_attestation","attest_author":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN/action/author_attestation","sign_citation":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN/action/citation_signature","submit_replication":"https://pith.science/pith/VBNP6QRHMFS3CPSJNRYHY5WPFN/action/replication_record"}},"created_at":"2026-05-17T23:45:24.587552+00:00","updated_at":"2026-05-17T23:45:24.587552+00:00"}