{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PMRDJED4FOIOURDBRCKUBZHILS","short_pith_number":"pith:PMRDJED4","schema_version":"1.0","canonical_sha256":"7b2234907c2b90ea4461889540e4e85c8a2f4e7c569231ccb254c56e314e7270","source":{"kind":"arxiv","id":"1703.02743","version":1},"attestation_state":"computed","paper":{"title":"MSF and Connectivity in Limited Variants of the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Krzysztof Nowicki, Tomasz Jurdzinski","submitted_at":"2017-03-08T08:15:40Z","abstract_excerpt":"The congested clique is a synchronous, message-passing model of distributed computing in which each computational unit (node) in each round can send message of O(log n) bits to each other node of the network, where n is the number of nodes. This model has been considered under two extreme scanarios: unicast or broadcast. In the unicast model, a node can send (possibly) different message to each other node of the network. In contrast, in the broadcast model each node sends a single (the same) message to all other nodes. We study the congested clique model parametrized by the range r, the maximu"},"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":"1703.02743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T08:15:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"30a774e9b64c028b4a44799ba826c6db0b2cc28a913ef2678bba48af4ef8a06e","abstract_canon_sha256":"f43703ba3e42ab48c03e4b4bd8588dc7b2e8fad7f854839a69ccb10fb1c0694f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:22.782197Z","signature_b64":"yp+BVx/+jThSX30pveqcSu/xQvrTBbkYoxXtU3Q/ZxWeqqk/bkI89nh9oapI2Y4UrsOZn4rb+s+iGc1PR1xHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b2234907c2b90ea4461889540e4e85c8a2f4e7c569231ccb254c56e314e7270","last_reissued_at":"2026-05-18T00:39:22.781503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:22.781503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MSF and Connectivity in Limited Variants of the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Krzysztof Nowicki, Tomasz Jurdzinski","submitted_at":"2017-03-08T08:15:40Z","abstract_excerpt":"The congested clique is a synchronous, message-passing model of distributed computing in which each computational unit (node) in each round can send message of O(log n) bits to each other node of the network, where n is the number of nodes. This model has been considered under two extreme scanarios: unicast or broadcast. In the unicast model, a node can send (possibly) different message to each other node of the network. In contrast, in the broadcast model each node sends a single (the same) message to all other nodes. We study the congested clique model parametrized by the range r, the maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02743","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":"1703.02743","created_at":"2026-05-18T00:39:22.781618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02743v1","created_at":"2026-05-18T00:39:22.781618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02743","created_at":"2026-05-18T00:39:22.781618+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMRDJED4FOIO","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMRDJED4FOIOURDB","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMRDJED4","created_at":"2026-05-18T12:31:37.085036+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/PMRDJED4FOIOURDBRCKUBZHILS","json":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS.json","graph_json":"https://pith.science/api/pith-number/PMRDJED4FOIOURDBRCKUBZHILS/graph.json","events_json":"https://pith.science/api/pith-number/PMRDJED4FOIOURDBRCKUBZHILS/events.json","paper":"https://pith.science/paper/PMRDJED4"},"agent_actions":{"view_html":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS","download_json":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS.json","view_paper":"https://pith.science/paper/PMRDJED4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02743&json=true","fetch_graph":"https://pith.science/api/pith-number/PMRDJED4FOIOURDBRCKUBZHILS/graph.json","fetch_events":"https://pith.science/api/pith-number/PMRDJED4FOIOURDBRCKUBZHILS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/action/storage_attestation","attest_author":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/action/author_attestation","sign_citation":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/action/citation_signature","submit_replication":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/action/replication_record"}},"created_at":"2026-05-18T00:39:22.781618+00:00","updated_at":"2026-05-18T00:39:22.781618+00:00"}