{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PBD36MH2D57AV5CGERKLYDXMWA","short_pith_number":"pith:PBD36MH2","schema_version":"1.0","canonical_sha256":"7847bf30fa1f7e0af4462454bc0eecb030c4472d70a6ee714e6f38b61e8ded4e","source":{"kind":"arxiv","id":"2103.07027","version":1},"attestation_state":"computed","paper":{"title":"Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Peter Robinson, Viktor Zamaraev","submitted_at":"2021-03-12T01:27:12Z","abstract_excerpt":"We give lower bounds on the communication complexity of graph problems in the multi-party blackboard model. In this model, the edges of an $n$-vertex input graph are partitioned among $k$ parties, who communicate solely by writing messages on a shared blackboard that is visible to every party. We show that any non-trivial graph problem on $n$-vertex graphs has blackboard communication complexity $\\Omega(n)$ bits, even if the edges of the input graph are randomly assigned to the $k$ parties. We say that a graph problem is non-trivial if the output cannot be computed in a model where every party"},"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":"2103.07027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-03-12T01:27:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"eb42785e087c3baa14807d795c087975b19afeaeefa22e317b51567901270302","abstract_canon_sha256":"807e0eea5ea05ca4e82e9afeb648c840fe77308bf376027b0dcd61a047c55e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:27.790887Z","signature_b64":"Cu/kCGTaDNzP3xSpfANx73ghNXLhLKPedlbfOjZ2rFqI00sCczFbhsKbBniLSns25Gzm2TJ+16Acm7gGkmmkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7847bf30fa1f7e0af4462454bc0eecb030c4472d70a6ee714e6f38b61e8ded4e","last_reissued_at":"2026-07-05T02:22:27.790462Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:27.790462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Peter Robinson, Viktor Zamaraev","submitted_at":"2021-03-12T01:27:12Z","abstract_excerpt":"We give lower bounds on the communication complexity of graph problems in the multi-party blackboard model. In this model, the edges of an $n$-vertex input graph are partitioned among $k$ parties, who communicate solely by writing messages on a shared blackboard that is visible to every party. We show that any non-trivial graph problem on $n$-vertex graphs has blackboard communication complexity $\\Omega(n)$ bits, even if the edges of the input graph are randomly assigned to the $k$ parties. We say that a graph problem is non-trivial if the output cannot be computed in a model where every party"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.07027","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.07027/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.07027","created_at":"2026-07-05T02:22:27.790530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.07027v1","created_at":"2026-07-05T02:22:27.790530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.07027","created_at":"2026-07-05T02:22:27.790530+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBD36MH2D57A","created_at":"2026-07-05T02:22:27.790530+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBD36MH2D57AV5CG","created_at":"2026-07-05T02:22:27.790530+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBD36MH2","created_at":"2026-07-05T02:22:27.790530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12589","citing_title":"Round and Communication Efficient Graph Coloring","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA","json":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA.json","graph_json":"https://pith.science/api/pith-number/PBD36MH2D57AV5CGERKLYDXMWA/graph.json","events_json":"https://pith.science/api/pith-number/PBD36MH2D57AV5CGERKLYDXMWA/events.json","paper":"https://pith.science/paper/PBD36MH2"},"agent_actions":{"view_html":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA","download_json":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA.json","view_paper":"https://pith.science/paper/PBD36MH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.07027&json=true","fetch_graph":"https://pith.science/api/pith-number/PBD36MH2D57AV5CGERKLYDXMWA/graph.json","fetch_events":"https://pith.science/api/pith-number/PBD36MH2D57AV5CGERKLYDXMWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA/action/storage_attestation","attest_author":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA/action/author_attestation","sign_citation":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA/action/citation_signature","submit_replication":"https://pith.science/pith/PBD36MH2D57AV5CGERKLYDXMWA/action/replication_record"}},"created_at":"2026-07-05T02:22:27.790530+00:00","updated_at":"2026-07-05T02:22:27.790530+00:00"}