{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HABUXVFPYJCIPDC6RZRA2KNLEL","short_pith_number":"pith:HABUXVFP","canonical_record":{"source":{"id":"1005.2894","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-05-17T11:56:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"73ef53d9bc7134eafd41a935e7180e22ea2f1b9a58bb6cc5692dad4898a74dc7","abstract_canon_sha256":"7d3a48cc693d7f2673aa4324751c2404707d390ad9f1cc68f82bb08c7691009c"},"schema_version":"1.0"},"canonical_sha256":"38034bd4afc244878c5e8e620d29ab22d07a386bb09856ba556c073c708a9b94","source":{"kind":"arxiv","id":"1005.2894","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2894","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2894v3","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2894","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"HABUXVFPYJCI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HABUXVFPYJCIPDC6","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HABUXVFP","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HABUXVFPYJCIPDC6RZRA2KNLEL","target":"record","payload":{"canonical_record":{"source":{"id":"1005.2894","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-05-17T11:56:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"73ef53d9bc7134eafd41a935e7180e22ea2f1b9a58bb6cc5692dad4898a74dc7","abstract_canon_sha256":"7d3a48cc693d7f2673aa4324751c2404707d390ad9f1cc68f82bb08c7691009c"},"schema_version":"1.0"},"canonical_sha256":"38034bd4afc244878c5e8e620d29ab22d07a386bb09856ba556c073c708a9b94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.727544Z","signature_b64":"NSy5rYqbdaipLYh8DeBpj6RNnLk+9HLTCCshGQxP6/4mAbWa7scyc1S15jPz5XQ0tm984PS16dlHRMZOX2j7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38034bd4afc244878c5e8e620d29ab22d07a386bb09856ba556c073c708a9b94","last_reissued_at":"2026-05-17T23:58:50.727063Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.727063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.2894","source_version":3,"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-17T23:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5KqiHwG9xU5/VaCKj/NaXqzF6LlKQ0hpXm1zwqV8OdXVAixr5Ju0HEFEX5gMoTCTOFNB8StetAeTluQO1JhlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:56:54.437955Z"},"content_sha256":"7ecdf821a378fb22202d80b21744173f39a4bec26245d86402fc4b77e3aa837f","schema_version":"1.0","event_id":"sha256:7ecdf821a378fb22202d80b21744173f39a4bec26245d86402fc4b77e3aa837f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HABUXVFPYJCIPDC6RZRA2KNLEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Gradient Clock Synchronization in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Fabian Kuhn, Rotem Oshman, Thomas Locher","submitted_at":"2010-05-17T11:56:31Z","abstract_excerpt":"We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are bett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2894","kind":"arxiv","version":3},"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-17T23:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8M28cjSfp+qCpsk63W4a2bGNy1dOcv6rZmeID0zMdBSOdlEBYYCIULonTf3fP5hDxhUzqZWAIDckVFW6IOVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:56:54.438300Z"},"content_sha256":"d9a2f3022288d1ad12e60e31dec9d2f9a0ecfa05f3bc749b42b78df25caef38b","schema_version":"1.0","event_id":"sha256:d9a2f3022288d1ad12e60e31dec9d2f9a0ecfa05f3bc749b42b78df25caef38b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HABUXVFPYJCIPDC6RZRA2KNLEL/bundle.json","state_url":"https://pith.science/pith/HABUXVFPYJCIPDC6RZRA2KNLEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HABUXVFPYJCIPDC6RZRA2KNLEL/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-05-21T05:56:54Z","links":{"resolver":"https://pith.science/pith/HABUXVFPYJCIPDC6RZRA2KNLEL","bundle":"https://pith.science/pith/HABUXVFPYJCIPDC6RZRA2KNLEL/bundle.json","state":"https://pith.science/pith/HABUXVFPYJCIPDC6RZRA2KNLEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HABUXVFPYJCIPDC6RZRA2KNLEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HABUXVFPYJCIPDC6RZRA2KNLEL","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":"7d3a48cc693d7f2673aa4324751c2404707d390ad9f1cc68f82bb08c7691009c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-05-17T11:56:31Z","title_canon_sha256":"73ef53d9bc7134eafd41a935e7180e22ea2f1b9a58bb6cc5692dad4898a74dc7"},"schema_version":"1.0","source":{"id":"1005.2894","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2894","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2894v3","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2894","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"HABUXVFPYJCI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HABUXVFPYJCIPDC6","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HABUXVFP","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:d9a2f3022288d1ad12e60e31dec9d2f9a0ecfa05f3bc749b42b78df25caef38b","target":"graph","created_at":"2026-05-17T23:58:50Z","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":"We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are bett","authors_text":"Christoph Lenzen, Fabian Kuhn, Rotem Oshman, Thomas Locher","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-05-17T11:56:31Z","title":"Optimal Gradient Clock Synchronization in Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2894","kind":"arxiv","version":3},"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:7ecdf821a378fb22202d80b21744173f39a4bec26245d86402fc4b77e3aa837f","target":"record","created_at":"2026-05-17T23:58:50Z","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":"7d3a48cc693d7f2673aa4324751c2404707d390ad9f1cc68f82bb08c7691009c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-05-17T11:56:31Z","title_canon_sha256":"73ef53d9bc7134eafd41a935e7180e22ea2f1b9a58bb6cc5692dad4898a74dc7"},"schema_version":"1.0","source":{"id":"1005.2894","kind":"arxiv","version":3}},"canonical_sha256":"38034bd4afc244878c5e8e620d29ab22d07a386bb09856ba556c073c708a9b94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38034bd4afc244878c5e8e620d29ab22d07a386bb09856ba556c073c708a9b94","first_computed_at":"2026-05-17T23:58:50.727063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:50.727063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NSy5rYqbdaipLYh8DeBpj6RNnLk+9HLTCCshGQxP6/4mAbWa7scyc1S15jPz5XQ0tm984PS16dlHRMZOX2j7Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:50.727544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2894","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ecdf821a378fb22202d80b21744173f39a4bec26245d86402fc4b77e3aa837f","sha256:d9a2f3022288d1ad12e60e31dec9d2f9a0ecfa05f3bc749b42b78df25caef38b"],"state_sha256":"aa14d0b82a8682f36b5181ed848e7e9d793664e5ca0706bd4bff547f429b05ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54VlaUUhqpXmx1VfcoYsBPBClILM6ZS5CuG4Lgfipo8rQ/uRWfpngvvYBUERQwR2zzSiKUo1VLO4y5TuF1ceAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T05:56:54.440227Z","bundle_sha256":"da0cb11952253a58387d9900e7962b9551d76b8478dc86557ad112b5a2fb7600"}}