{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6TAI4N3HIQLZEHKITMR77FITYK","short_pith_number":"pith:6TAI4N3H","schema_version":"1.0","canonical_sha256":"f4c08e37674417921d489b23ff9513c29437f14c2f6929919f12f85d3ed22e51","source":{"kind":"arxiv","id":"1602.04095","version":3},"attestation_state":"computed","paper":{"title":"Deterministic graph connectivity in the broadcast congested clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ioan Todinca, Pedro Montealegre","submitted_at":"2016-02-12T16:04:14Z","abstract_excerpt":"We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the $n$ nodes of a graph receives a row of the adjacency matrix, and broadcasts a single sublinear size message to all other nodes. Communication rounds are synchronous. This model is sometimes called the broadcast congested clique. Specifically, we exhibit a deterministic protocol that computes the connected components of the input graph in $\\lceil 1/\\epsilon \\rceil$ rounds, each player communicating $\\mathcal{O}(n^{\\epsilon} \\cdot \\log n)$ bits per round, with $0 < \\epsilon \\leq 1$"},"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":"1602.04095","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-12T16:04:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"24ad724d158fc21d450e572c174607278ea32a5ca17340f447cd4b534e3e76f3","abstract_canon_sha256":"a74e2ab6d0dd2792542ded0c7f9b0cb8230e7efac98fe3254e826ca613fb1761"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:39.578796Z","signature_b64":"rbet4ceeLTg0I5XCrGSWZnAPA7A8hStEKFAk2Ce1+vds5lU0OzBkKPJJLXOum6qqt8EarwMUzTOVPH5MxjkqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4c08e37674417921d489b23ff9513c29437f14c2f6929919f12f85d3ed22e51","last_reissued_at":"2026-05-18T00:42:39.578114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:39.578114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic graph connectivity in the broadcast congested clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ioan Todinca, Pedro Montealegre","submitted_at":"2016-02-12T16:04:14Z","abstract_excerpt":"We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the $n$ nodes of a graph receives a row of the adjacency matrix, and broadcasts a single sublinear size message to all other nodes. Communication rounds are synchronous. This model is sometimes called the broadcast congested clique. Specifically, we exhibit a deterministic protocol that computes the connected components of the input graph in $\\lceil 1/\\epsilon \\rceil$ rounds, each player communicating $\\mathcal{O}(n^{\\epsilon} \\cdot \\log n)$ bits per round, with $0 < \\epsilon \\leq 1$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04095","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":"1602.04095","created_at":"2026-05-18T00:42:39.578216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04095v3","created_at":"2026-05-18T00:42:39.578216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04095","created_at":"2026-05-18T00:42:39.578216+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TAI4N3HIQLZ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TAI4N3HIQLZEHKI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TAI4N3H","created_at":"2026-05-18T12:30:04.600751+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/6TAI4N3HIQLZEHKITMR77FITYK","json":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK.json","graph_json":"https://pith.science/api/pith-number/6TAI4N3HIQLZEHKITMR77FITYK/graph.json","events_json":"https://pith.science/api/pith-number/6TAI4N3HIQLZEHKITMR77FITYK/events.json","paper":"https://pith.science/paper/6TAI4N3H"},"agent_actions":{"view_html":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK","download_json":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK.json","view_paper":"https://pith.science/paper/6TAI4N3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04095&json=true","fetch_graph":"https://pith.science/api/pith-number/6TAI4N3HIQLZEHKITMR77FITYK/graph.json","fetch_events":"https://pith.science/api/pith-number/6TAI4N3HIQLZEHKITMR77FITYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/action/storage_attestation","attest_author":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/action/author_attestation","sign_citation":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/action/citation_signature","submit_replication":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/action/replication_record"}},"created_at":"2026-05-18T00:42:39.578216+00:00","updated_at":"2026-05-18T00:42:39.578216+00:00"}