{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4CIH7E723OJANEAI6JUA33MFAE","short_pith_number":"pith:4CIH7E72","schema_version":"1.0","canonical_sha256":"e0907f93fadb92069008f2680ded85011a95c9859aaea579c4c531f057ee70ac","source":{"kind":"arxiv","id":"1807.08738","version":2},"attestation_state":"computed","paper":{"title":"Random Sampling Applied to the MST Problem in the Node Congested Clique Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Krzysztof Nowicki","submitted_at":"2018-07-23T17:35:28Z","abstract_excerpt":"The Congested Clique model proposed by Lotker et al.[SICOMP'05] was introduced in order to provide a simple abstraction for overlay networks. Congested Clique is a model of distributed (or parallel) computing, in which there are $n$ players with unique identifiers from set [n], which perform computations in synchronous rounds. Each round consists of the phase of unlimited local computation and the communication phase. While communicating, each pair of players is allowed to exchange a single message of size $O(\\log n)$ bits.\n  Since, in a single round, each player can communicate with even $\\Th"},"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":"1807.08738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T17:35:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6f69d248b11ed1c70db6a8ab774f2c556e1c7c48851aa217f0aafb35d3d0e9b9","abstract_canon_sha256":"dc177881814b276b74c053463c37c237289b97ca53438535bc1010d32fcdd46e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:17.145407Z","signature_b64":"Cl5rXWuWphyufKAhCIZPwvCM1p/PZd59hsLSAwtWQMBwkp42FykzbbSt6z5SqApWfoQ2JsBZXflHfqhbs08uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0907f93fadb92069008f2680ded85011a95c9859aaea579c4c531f057ee70ac","last_reissued_at":"2026-05-18T00:07:17.144818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:17.144818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Sampling Applied to the MST Problem in the Node Congested Clique Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Krzysztof Nowicki","submitted_at":"2018-07-23T17:35:28Z","abstract_excerpt":"The Congested Clique model proposed by Lotker et al.[SICOMP'05] was introduced in order to provide a simple abstraction for overlay networks. Congested Clique is a model of distributed (or parallel) computing, in which there are $n$ players with unique identifiers from set [n], which perform computations in synchronous rounds. Each round consists of the phase of unlimited local computation and the communication phase. While communicating, each pair of players is allowed to exchange a single message of size $O(\\log n)$ bits.\n  Since, in a single round, each player can communicate with even $\\Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08738","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":"1807.08738","created_at":"2026-05-18T00:07:17.144894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08738v2","created_at":"2026-05-18T00:07:17.144894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08738","created_at":"2026-05-18T00:07:17.144894+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CIH7E723OJA","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CIH7E723OJANEAI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CIH7E72","created_at":"2026-05-18T12:32:05.422762+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/4CIH7E723OJANEAI6JUA33MFAE","json":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE.json","graph_json":"https://pith.science/api/pith-number/4CIH7E723OJANEAI6JUA33MFAE/graph.json","events_json":"https://pith.science/api/pith-number/4CIH7E723OJANEAI6JUA33MFAE/events.json","paper":"https://pith.science/paper/4CIH7E72"},"agent_actions":{"view_html":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE","download_json":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE.json","view_paper":"https://pith.science/paper/4CIH7E72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08738&json=true","fetch_graph":"https://pith.science/api/pith-number/4CIH7E723OJANEAI6JUA33MFAE/graph.json","fetch_events":"https://pith.science/api/pith-number/4CIH7E723OJANEAI6JUA33MFAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE/action/storage_attestation","attest_author":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE/action/author_attestation","sign_citation":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE/action/citation_signature","submit_replication":"https://pith.science/pith/4CIH7E723OJANEAI6JUA33MFAE/action/replication_record"}},"created_at":"2026-05-18T00:07:17.144894+00:00","updated_at":"2026-05-18T00:07:17.144894+00:00"}