{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EK77CZNZPEKPAABZHVCVE5JAK4","short_pith_number":"pith:EK77CZNZ","schema_version":"1.0","canonical_sha256":"22bff165b97914f000393d45527520572fe82a966a33bd066f52bd721392096e","source":{"kind":"arxiv","id":"1608.03313","version":2},"attestation_state":"computed","paper":{"title":"Tight Network Topology Dependent Bounds on Rounds of Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Arkadev Chattopadhyay, Atri Rudra, Michael Langberg, Shi Li","submitted_at":"2016-08-10T23:57:44Z","abstract_excerpt":"We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing, we fix the function and then vary the underlying network topology. This complements the recent such results on total communication that have received some attention. We also present some applications to distributed graph computation problems.\n  Our main contribution is a proof technique that allows us to reduce the problem on a general graph topology to a rel"},"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":"1608.03313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-10T23:57:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d358856637d500edb21ed7803cef199e89b0722dcc0777e44e747212e0b2883d","abstract_canon_sha256":"69d3c661a696b1ea9741971b4c66534f7ab033d0fc024f0f0c7051139cf8d466"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:45.087641Z","signature_b64":"NQ3KldGNZIU29wewWk8YjqTZ5vBRBuXxYaLw9uy3yMozPUs2ix8Y6T1Z9NL64gjb/LVSUKa1WPx5hO2pEECGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22bff165b97914f000393d45527520572fe82a966a33bd066f52bd721392096e","last_reissued_at":"2026-05-18T01:00:45.087205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:45.087205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Network Topology Dependent Bounds on Rounds of Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Arkadev Chattopadhyay, Atri Rudra, Michael Langberg, Shi Li","submitted_at":"2016-08-10T23:57:44Z","abstract_excerpt":"We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing, we fix the function and then vary the underlying network topology. This complements the recent such results on total communication that have received some attention. We also present some applications to distributed graph computation problems.\n  Our main contribution is a proof technique that allows us to reduce the problem on a general graph topology to a rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03313","kind":"arxiv","version":2},"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":"1608.03313","created_at":"2026-05-18T01:00:45.087264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03313v2","created_at":"2026-05-18T01:00:45.087264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03313","created_at":"2026-05-18T01:00:45.087264+00:00"},{"alias_kind":"pith_short_12","alias_value":"EK77CZNZPEKP","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EK77CZNZPEKPAABZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EK77CZNZ","created_at":"2026-05-18T12:30:12.583610+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/EK77CZNZPEKPAABZHVCVE5JAK4","json":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4.json","graph_json":"https://pith.science/api/pith-number/EK77CZNZPEKPAABZHVCVE5JAK4/graph.json","events_json":"https://pith.science/api/pith-number/EK77CZNZPEKPAABZHVCVE5JAK4/events.json","paper":"https://pith.science/paper/EK77CZNZ"},"agent_actions":{"view_html":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4","download_json":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4.json","view_paper":"https://pith.science/paper/EK77CZNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03313&json=true","fetch_graph":"https://pith.science/api/pith-number/EK77CZNZPEKPAABZHVCVE5JAK4/graph.json","fetch_events":"https://pith.science/api/pith-number/EK77CZNZPEKPAABZHVCVE5JAK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4/action/storage_attestation","attest_author":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4/action/author_attestation","sign_citation":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4/action/citation_signature","submit_replication":"https://pith.science/pith/EK77CZNZPEKPAABZHVCVE5JAK4/action/replication_record"}},"created_at":"2026-05-18T01:00:45.087264+00:00","updated_at":"2026-05-18T01:00:45.087264+00:00"}