{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RCUMNAJVODFFRAFAVQM7GBDF3J","short_pith_number":"pith:RCUMNAJV","schema_version":"1.0","canonical_sha256":"88a8c6813570ca5880a0ac19f30465da70c2934c42120912abe571c74e831497","source":{"kind":"arxiv","id":"1807.05139","version":1},"attestation_state":"computed","paper":{"title":"A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jennifer L. Welch, Reginald Frank","submitted_at":"2018-07-13T15:28:47Z","abstract_excerpt":"Synchronizing clocks in a distributed system in which processes communicate through messages with uncertain delays is subject to inherent errors. Prior work has shown upper and lower bounds on the best synchronization achievable in a variety of network topologies and assumptions about the uncertainty on the message delays. However, until now there has not been a tight closed-form expression for the optimal synchronization in $k$-ary $m$-cubes with wraparound, where $k$ is odd. In this paper, we prove a lower bound of $\\frac{1}{4}um\\left(k-\\frac{1}{k}\\right)$, where $k$ is the (odd) number of p"},"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.05139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-13T15:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"7818df31902bf2e4d0e788067de38988333a20ef79f4b7defd87bab2e28d986f","abstract_canon_sha256":"34c6e6ac2db63e20192e6b34429ec515ec28615b71487f872f51bc04495ba40a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.638147Z","signature_b64":"AJtjHxK+ZOLuXV8SvKsqkYXb7DrnEcoGjuiFqAiP5Dht71gDt5PXczpr4UsBvyt4BwTmLZidPTsm8ggSGCUkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a8c6813570ca5880a0ac19f30465da70c2934c42120912abe571c74e831497","last_reissued_at":"2026-05-18T00:10:48.637591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.637591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jennifer L. Welch, Reginald Frank","submitted_at":"2018-07-13T15:28:47Z","abstract_excerpt":"Synchronizing clocks in a distributed system in which processes communicate through messages with uncertain delays is subject to inherent errors. Prior work has shown upper and lower bounds on the best synchronization achievable in a variety of network topologies and assumptions about the uncertainty on the message delays. However, until now there has not been a tight closed-form expression for the optimal synchronization in $k$-ary $m$-cubes with wraparound, where $k$ is odd. In this paper, we prove a lower bound of $\\frac{1}{4}um\\left(k-\\frac{1}{k}\\right)$, where $k$ is the (odd) number of p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05139","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":"1807.05139","created_at":"2026-05-18T00:10:48.637682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05139v1","created_at":"2026-05-18T00:10:48.637682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05139","created_at":"2026-05-18T00:10:48.637682+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCUMNAJVODFF","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCUMNAJVODFFRAFA","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCUMNAJV","created_at":"2026-05-18T12:32:50.500415+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/RCUMNAJVODFFRAFAVQM7GBDF3J","json":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J.json","graph_json":"https://pith.science/api/pith-number/RCUMNAJVODFFRAFAVQM7GBDF3J/graph.json","events_json":"https://pith.science/api/pith-number/RCUMNAJVODFFRAFAVQM7GBDF3J/events.json","paper":"https://pith.science/paper/RCUMNAJV"},"agent_actions":{"view_html":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J","download_json":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J.json","view_paper":"https://pith.science/paper/RCUMNAJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05139&json=true","fetch_graph":"https://pith.science/api/pith-number/RCUMNAJVODFFRAFAVQM7GBDF3J/graph.json","fetch_events":"https://pith.science/api/pith-number/RCUMNAJVODFFRAFAVQM7GBDF3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/action/storage_attestation","attest_author":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/action/author_attestation","sign_citation":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/action/citation_signature","submit_replication":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/action/replication_record"}},"created_at":"2026-05-18T00:10:48.637682+00:00","updated_at":"2026-05-18T00:10:48.637682+00:00"}