{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4LYXVTWSC4U7YO7MRP2D4UW5PO","short_pith_number":"pith:4LYXVTWS","schema_version":"1.0","canonical_sha256":"e2f17aced21729fc3bec8bf43e52dd7bb836ce320f79d627d1c2220b0cccd24d","source":{"kind":"arxiv","id":"1805.07294","version":2},"attestation_state":"computed","paper":{"title":"Distributed Computation in Node-Capacitated Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Fabian Kuhn, Jason Li, John Augustine, Kristian Hinnenthal, Mohsen Ghaffari, Robert Gmyr","submitted_at":"2018-05-18T15:38:47Z","abstract_excerpt":"In this paper, we study distributed graph algorithms in networks in which the nodes have a limited communication capacity. Many distributed systems are built on top of an underlying networking infrastructure, for example by using a virtual communication topology known as an overlay network. Although this underlying network might allow each node to directly communicate with a large number of other nodes, the amount of communication that a node can perform in a fixed amount of time is typically much more limited. We introduce the Node-Capacitated Clique model as an abstract communication model, "},"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":"1805.07294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-18T15:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"3b3db042803c4ab3c2b822d28e97ddb2a05a736528cdfb5585e2f012fb627690","abstract_canon_sha256":"6cd14e1f25b69390289bebbdf4c5b8e83bde11d3166564c62d93abbbc8bc34ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:49.012931Z","signature_b64":"UaQWT5raLDH9UHBOr+7ajaMn3Tu+f0xyxJp30aiYpfUiwOPi9XQXivgIwV6SzOsZCkZLOOt3lBNevI3uW8I4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2f17aced21729fc3bec8bf43e52dd7bb836ce320f79d627d1c2220b0cccd24d","last_reissued_at":"2026-05-17T23:47:49.012423Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:49.012423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Computation in Node-Capacitated Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Fabian Kuhn, Jason Li, John Augustine, Kristian Hinnenthal, Mohsen Ghaffari, Robert Gmyr","submitted_at":"2018-05-18T15:38:47Z","abstract_excerpt":"In this paper, we study distributed graph algorithms in networks in which the nodes have a limited communication capacity. Many distributed systems are built on top of an underlying networking infrastructure, for example by using a virtual communication topology known as an overlay network. Although this underlying network might allow each node to directly communicate with a large number of other nodes, the amount of communication that a node can perform in a fixed amount of time is typically much more limited. We introduce the Node-Capacitated Clique model as an abstract communication model, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07294","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":"1805.07294","created_at":"2026-05-17T23:47:49.012500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07294v2","created_at":"2026-05-17T23:47:49.012500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07294","created_at":"2026-05-17T23:47:49.012500+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LYXVTWSC4U7","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LYXVTWSC4U7YO7M","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LYXVTWS","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/4LYXVTWSC4U7YO7MRP2D4UW5PO","json":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO.json","graph_json":"https://pith.science/api/pith-number/4LYXVTWSC4U7YO7MRP2D4UW5PO/graph.json","events_json":"https://pith.science/api/pith-number/4LYXVTWSC4U7YO7MRP2D4UW5PO/events.json","paper":"https://pith.science/paper/4LYXVTWS"},"agent_actions":{"view_html":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO","download_json":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO.json","view_paper":"https://pith.science/paper/4LYXVTWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07294&json=true","fetch_graph":"https://pith.science/api/pith-number/4LYXVTWSC4U7YO7MRP2D4UW5PO/graph.json","fetch_events":"https://pith.science/api/pith-number/4LYXVTWSC4U7YO7MRP2D4UW5PO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO/action/storage_attestation","attest_author":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO/action/author_attestation","sign_citation":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO/action/citation_signature","submit_replication":"https://pith.science/pith/4LYXVTWSC4U7YO7MRP2D4UW5PO/action/replication_record"}},"created_at":"2026-05-17T23:47:49.012500+00:00","updated_at":"2026-05-17T23:47:49.012500+00:00"}