{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RCUMNAJVODFFRAFAVQM7GBDF3J","short_pith_number":"pith:RCUMNAJV","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"},"canonical_sha256":"88a8c6813570ca5880a0ac19f30465da70c2934c42120912abe571c74e831497","source":{"kind":"arxiv","id":"1807.05139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05139","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05139v1","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05139","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"RCUMNAJVODFF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCUMNAJVODFFRAFA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCUMNAJV","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RCUMNAJVODFFRAFAVQM7GBDF3J","target":"record","payload":{"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"},"canonical_sha256":"88a8c6813570ca5880a0ac19f30465da70c2934c42120912abe571c74e831497","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"},"source_kind":"arxiv","source_id":"1807.05139","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:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPtXTdWDno2nOF/t6FZaqURL9Fm2RMAAiDhdTXg8Rs2ObuMsSsYpy49L12H80HvHdBtJNeZteb4SYHsPPZ8SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:16:08.728747Z"},"content_sha256":"3316def95e779f41250fe3d017d252b571c65891350a250791b058e1e2f9ab70","schema_version":"1.0","event_id":"sha256:3316def95e779f41250fe3d017d252b571c65891350a250791b058e1e2f9ab70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RCUMNAJVODFFRAFAVQM7GBDF3J","target":"graph","payload":{"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"},"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:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvN188qzWpOPE432oH9ZQN1JRHPSQckMvAExupfH618cBptGJEAPBv7WVhrJjCLu/dYgjheYpBkv0JU3dqUhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:16:08.729099Z"},"content_sha256":"108f327a5d1902ce927dc8d33f17fdcae26e7d21a96dd5b309ec669078d448ba","schema_version":"1.0","event_id":"sha256:108f327a5d1902ce927dc8d33f17fdcae26e7d21a96dd5b309ec669078d448ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/bundle.json","state_url":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/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-25T05:16:08Z","links":{"resolver":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J","bundle":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/bundle.json","state":"https://pith.science/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCUMNAJVODFFRAFAVQM7GBDF3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RCUMNAJVODFFRAFAVQM7GBDF3J","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":"34c6e6ac2db63e20192e6b34429ec515ec28615b71487f872f51bc04495ba40a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-13T15:28:47Z","title_canon_sha256":"7818df31902bf2e4d0e788067de38988333a20ef79f4b7defd87bab2e28d986f"},"schema_version":"1.0","source":{"id":"1807.05139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05139","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05139v1","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05139","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"RCUMNAJVODFF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCUMNAJVODFFRAFA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCUMNAJV","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:108f327a5d1902ce927dc8d33f17fdcae26e7d21a96dd5b309ec669078d448ba","target":"graph","created_at":"2026-05-18T00:10:48Z","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":"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","authors_text":"Jennifer L. Welch, Reginald Frank","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-13T15:28:47Z","title":"A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05139","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:3316def95e779f41250fe3d017d252b571c65891350a250791b058e1e2f9ab70","target":"record","created_at":"2026-05-18T00:10:48Z","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":"34c6e6ac2db63e20192e6b34429ec515ec28615b71487f872f51bc04495ba40a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-13T15:28:47Z","title_canon_sha256":"7818df31902bf2e4d0e788067de38988333a20ef79f4b7defd87bab2e28d986f"},"schema_version":"1.0","source":{"id":"1807.05139","kind":"arxiv","version":1}},"canonical_sha256":"88a8c6813570ca5880a0ac19f30465da70c2934c42120912abe571c74e831497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88a8c6813570ca5880a0ac19f30465da70c2934c42120912abe571c74e831497","first_computed_at":"2026-05-18T00:10:48.637591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:48.637591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJtjHxK+ZOLuXV8SvKsqkYXb7DrnEcoGjuiFqAiP5Dht71gDt5PXczpr4UsBvyt4BwTmLZidPTsm8ggSGCUkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:48.638147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3316def95e779f41250fe3d017d252b571c65891350a250791b058e1e2f9ab70","sha256:108f327a5d1902ce927dc8d33f17fdcae26e7d21a96dd5b309ec669078d448ba"],"state_sha256":"b36fcf885720aded891273ee73e730677b5d20d6793963ec5a044d80305de078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTHWM0G9z74+V84utlPslRMffZEhNdEb/x8bwAg5gwGUGuxWuIhYtmIp+RPVfh6Na6dH250WXVRVxrlVrCyPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:16:08.731232Z","bundle_sha256":"efba08d693e2b2ff71c8d0aeb4b98b95e23d5801449be69102103853048218bc"}}