{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PMRDJED4FOIOURDBRCKUBZHILS","short_pith_number":"pith:PMRDJED4","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"},"canonical_sha256":"7b2234907c2b90ea4461889540e4e85c8a2f4e7c569231ccb254c56e314e7270","source":{"kind":"arxiv","id":"1703.02743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02743","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02743v1","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02743","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"PMRDJED4FOIO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PMRDJED4FOIOURDB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PMRDJED4","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PMRDJED4FOIOURDBRCKUBZHILS","target":"record","payload":{"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"},"canonical_sha256":"7b2234907c2b90ea4461889540e4e85c8a2f4e7c569231ccb254c56e314e7270","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"},"source_kind":"arxiv","source_id":"1703.02743","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ah+1HCi1gXNy32ACILVHmGwJV7srG47kNs7W8PquTOM8RqP+A3MPB2qQ1eDGagYoJb9YWJ7vAOwE96+u5W3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:42:15.656405Z"},"content_sha256":"592810a64be841c7168c5fb832153913b6db904be1f189e4e25a2c82565404c9","schema_version":"1.0","event_id":"sha256:592810a64be841c7168c5fb832153913b6db904be1f189e4e25a2c82565404c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PMRDJED4FOIOURDBRCKUBZHILS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REZIWu3+WJMeZzvnQaeN46+y3QSHbmFVYd+wT4v/szFFhWkpnDUbntqJjVXurdmkwhZwExXgwrTggrgfX/QcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:42:15.656750Z"},"content_sha256":"2d471fb64d06cc1eda9c851d938f1b25312ac1d74f4afee8a0ea8ed80ea05a75","schema_version":"1.0","event_id":"sha256:2d471fb64d06cc1eda9c851d938f1b25312ac1d74f4afee8a0ea8ed80ea05a75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/bundle.json","state_url":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMRDJED4FOIOURDBRCKUBZHILS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T18:42:15Z","links":{"resolver":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS","bundle":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/bundle.json","state":"https://pith.science/pith/PMRDJED4FOIOURDBRCKUBZHILS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMRDJED4FOIOURDBRCKUBZHILS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PMRDJED4FOIOURDBRCKUBZHILS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f43703ba3e42ab48c03e4b4bd8588dc7b2e8fad7f854839a69ccb10fb1c0694f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T08:15:40Z","title_canon_sha256":"30a774e9b64c028b4a44799ba826c6db0b2cc28a913ef2678bba48af4ef8a06e"},"schema_version":"1.0","source":{"id":"1703.02743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02743","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02743v1","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02743","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"PMRDJED4FOIO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PMRDJED4FOIOURDB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PMRDJED4","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:2d471fb64d06cc1eda9c851d938f1b25312ac1d74f4afee8a0ea8ed80ea05a75","target":"graph","created_at":"2026-05-18T00:39:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Krzysztof Nowicki, Tomasz Jurdzinski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T08:15:40Z","title":"MSF and Connectivity in Limited Variants of the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02743","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:592810a64be841c7168c5fb832153913b6db904be1f189e4e25a2c82565404c9","target":"record","created_at":"2026-05-18T00:39:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f43703ba3e42ab48c03e4b4bd8588dc7b2e8fad7f854839a69ccb10fb1c0694f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T08:15:40Z","title_canon_sha256":"30a774e9b64c028b4a44799ba826c6db0b2cc28a913ef2678bba48af4ef8a06e"},"schema_version":"1.0","source":{"id":"1703.02743","kind":"arxiv","version":1}},"canonical_sha256":"7b2234907c2b90ea4461889540e4e85c8a2f4e7c569231ccb254c56e314e7270","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b2234907c2b90ea4461889540e4e85c8a2f4e7c569231ccb254c56e314e7270","first_computed_at":"2026-05-18T00:39:22.781503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:22.781503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yp+BVx/+jThSX30pveqcSu/xQvrTBbkYoxXtU3Q/ZxWeqqk/bkI89nh9oapI2Y4UrsOZn4rb+s+iGc1PR1xHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:22.782197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:592810a64be841c7168c5fb832153913b6db904be1f189e4e25a2c82565404c9","sha256:2d471fb64d06cc1eda9c851d938f1b25312ac1d74f4afee8a0ea8ed80ea05a75"],"state_sha256":"39216c191ab49ad668173880442eeb23d8809bf5eb0f83aa34a7fb51de07093a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QR0uL2ZqARPH9FYtZ2upMlGTCXCJcRbKWnARtZao/w/5dR6oCOKmZsGT9EtB3V1M9YlnGagiC1bZxuWGRMVGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:42:15.658781Z","bundle_sha256":"0a32f37e7b3b984736d0ee43955500cbf35e6c70ec809d6e0a01841b9cca0111"}}