{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VK7RFKZTCA3H2EZJTO2LS26JZO","short_pith_number":"pith:VK7RFKZT","schema_version":"1.0","canonical_sha256":"aabf12ab3310367d13299bb4b96bc9cb9bc2cd783ace2c137c054cc904fff787","source":{"kind":"arxiv","id":"1704.06092","version":1},"attestation_state":"computed","paper":{"title":"How Bandwidth Affects the $CONGEST$ Model","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dennis Olivetti","submitted_at":"2017-04-20T11:30:03Z","abstract_excerpt":"The $CONGEST$ model for distributed network computing is well suited for analyzing the impact of limiting the throughput of a network on its capacity to solve tasks efficiently. For many \"global\" problems there exists a lower bound of $\\Omega(D + \\sqrt{n/B})$, where $B$ is the amount of bits that can be exchanged between two nodes in one round of communication, $n$ is the number of nodes and $D$ is the diameter of the graph. Typically, upper bounds are given only for the case $B=O(\\log n)$, or for the case $B = +\\infty$. For $B=O(\\log n)$, the Minimum Spanning Tree (MST) construction problem c"},"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":"1704.06092","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2017-04-20T11:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"fc98b9a4a201ab12208fcfec6d87acfd2879586a5796358b811b5867c27584dc","abstract_canon_sha256":"548dfe7730157190f48cff76e24673b7ef975b7dfc7d6beb671227cbcd20787b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.336956Z","signature_b64":"PMvURjblRrfee0uy6a6tQuqHU2RujIEfn/NmVOPhK9sRnCgUjwxjBMxItVx4+NF847qb4prbQAHIkmzEdJ7gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aabf12ab3310367d13299bb4b96bc9cb9bc2cd783ace2c137c054cc904fff787","last_reissued_at":"2026-05-18T00:46:03.336359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.336359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Bandwidth Affects the $CONGEST$ Model","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dennis Olivetti","submitted_at":"2017-04-20T11:30:03Z","abstract_excerpt":"The $CONGEST$ model for distributed network computing is well suited for analyzing the impact of limiting the throughput of a network on its capacity to solve tasks efficiently. For many \"global\" problems there exists a lower bound of $\\Omega(D + \\sqrt{n/B})$, where $B$ is the amount of bits that can be exchanged between two nodes in one round of communication, $n$ is the number of nodes and $D$ is the diameter of the graph. Typically, upper bounds are given only for the case $B=O(\\log n)$, or for the case $B = +\\infty$. For $B=O(\\log n)$, the Minimum Spanning Tree (MST) construction problem c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06092","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":"1704.06092","created_at":"2026-05-18T00:46:03.336450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06092v1","created_at":"2026-05-18T00:46:03.336450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06092","created_at":"2026-05-18T00:46:03.336450+00:00"},{"alias_kind":"pith_short_12","alias_value":"VK7RFKZTCA3H","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VK7RFKZTCA3H2EZJ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VK7RFKZT","created_at":"2026-05-18T12:31:49.984773+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/VK7RFKZTCA3H2EZJTO2LS26JZO","json":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO.json","graph_json":"https://pith.science/api/pith-number/VK7RFKZTCA3H2EZJTO2LS26JZO/graph.json","events_json":"https://pith.science/api/pith-number/VK7RFKZTCA3H2EZJTO2LS26JZO/events.json","paper":"https://pith.science/paper/VK7RFKZT"},"agent_actions":{"view_html":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO","download_json":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO.json","view_paper":"https://pith.science/paper/VK7RFKZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06092&json=true","fetch_graph":"https://pith.science/api/pith-number/VK7RFKZTCA3H2EZJTO2LS26JZO/graph.json","fetch_events":"https://pith.science/api/pith-number/VK7RFKZTCA3H2EZJTO2LS26JZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO/action/storage_attestation","attest_author":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO/action/author_attestation","sign_citation":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO/action/citation_signature","submit_replication":"https://pith.science/pith/VK7RFKZTCA3H2EZJTO2LS26JZO/action/replication_record"}},"created_at":"2026-05-18T00:46:03.336450+00:00","updated_at":"2026-05-18T00:46:03.336450+00:00"}