{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BREERR4GOZWNXPAFEMRM74IT6K","short_pith_number":"pith:BREERR4G","canonical_record":{"source":{"id":"1010.1112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-06T10:18:02Z","cross_cats_sorted":[],"title_canon_sha256":"308835d92f7c396c27e3c477330f0e8cc93c9adff8f13f6659bf7bbe133349d9","abstract_canon_sha256":"386c0b27ad6959c8c12134325b813b624291b8f117b61f2d31d69a123ea0673b"},"schema_version":"1.0"},"canonical_sha256":"0c4848c786766cdbbc052322cff113f2a06b88d4a604944468ab6af9269dfd26","source":{"kind":"arxiv","id":"1010.1112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1112","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1112v1","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1112","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"BREERR4GOZWN","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BREERR4GOZWNXPAF","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BREERR4G","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BREERR4GOZWNXPAFEMRM74IT6K","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-06T10:18:02Z","cross_cats_sorted":[],"title_canon_sha256":"308835d92f7c396c27e3c477330f0e8cc93c9adff8f13f6659bf7bbe133349d9","abstract_canon_sha256":"386c0b27ad6959c8c12134325b813b624291b8f117b61f2d31d69a123ea0673b"},"schema_version":"1.0"},"canonical_sha256":"0c4848c786766cdbbc052322cff113f2a06b88d4a604944468ab6af9269dfd26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:46.468641Z","signature_b64":"x+6BvZPIrwi4Ux8yAbIsl9yhhse4nIvnSMJa/bimcB93/yp2UIDdn/2GWrJiM2XhTE4UozdSPCXSvwXN96t9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c4848c786766cdbbc052322cff113f2a06b88d4a604944468ab6af9269dfd26","last_reissued_at":"2026-05-18T02:23:46.468000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:46.468000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1112","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-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jmv6sZw6B11dk3m6YdHlW2Taxrz0Eo0gPIjvzmsDanWytp4TIhUq34wC8xLmoWPyRPf7gqoNOke/+yx404ETCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:11:58.689064Z"},"content_sha256":"480b8e950e54c060b2f73175773397a3ace0f091b033975d4b66c81794cf8ce6","schema_version":"1.0","event_id":"sha256:480b8e950e54c060b2f73175773397a3ace0f091b033975d4b66c81794cf8ce6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BREERR4GOZWNXPAFEMRM74IT6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic and Energy-Optimal Wireless Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Leonid Barenboim, Rafail Ostrovsky, Shlomi Dolev","submitted_at":"2010-10-06T10:18:02Z","abstract_excerpt":"We consider the problem of clock synchronization in a wireless setting where processors must power-down their radios in order to save energy. Energy efficiency is a central goal in wireless networks, especially if energy resources are severely limited. In the current setting, the problem is to synchronize clocks of $m$ processors that wake up in arbitrary time points, such that the maximum difference between wake up times is bounded by a positive integer $n$, where time intervals are appropriately discretized. Currently, the best-known results for synchronization for single-hop networks of $m$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1112","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-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9eEUiYWBnkJsQLMiJ3A3JHFxs1TQu4eaTWiBevgziw4i5je8d3vX/VKu920T0/kCkIPvtbutDq6ayI+HI/IAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:11:58.689780Z"},"content_sha256":"99f87254bba98562808f20ee9f4d07e64a01401f65aa27feec1fc801111e290a","schema_version":"1.0","event_id":"sha256:99f87254bba98562808f20ee9f4d07e64a01401f65aa27feec1fc801111e290a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BREERR4GOZWNXPAFEMRM74IT6K/bundle.json","state_url":"https://pith.science/pith/BREERR4GOZWNXPAFEMRM74IT6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BREERR4GOZWNXPAFEMRM74IT6K/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-28T23:11:58Z","links":{"resolver":"https://pith.science/pith/BREERR4GOZWNXPAFEMRM74IT6K","bundle":"https://pith.science/pith/BREERR4GOZWNXPAFEMRM74IT6K/bundle.json","state":"https://pith.science/pith/BREERR4GOZWNXPAFEMRM74IT6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BREERR4GOZWNXPAFEMRM74IT6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BREERR4GOZWNXPAFEMRM74IT6K","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":"386c0b27ad6959c8c12134325b813b624291b8f117b61f2d31d69a123ea0673b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-06T10:18:02Z","title_canon_sha256":"308835d92f7c396c27e3c477330f0e8cc93c9adff8f13f6659bf7bbe133349d9"},"schema_version":"1.0","source":{"id":"1010.1112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1112","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1112v1","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1112","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"BREERR4GOZWN","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BREERR4GOZWNXPAF","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BREERR4G","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:99f87254bba98562808f20ee9f4d07e64a01401f65aa27feec1fc801111e290a","target":"graph","created_at":"2026-05-18T02:23:46Z","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 consider the problem of clock synchronization in a wireless setting where processors must power-down their radios in order to save energy. Energy efficiency is a central goal in wireless networks, especially if energy resources are severely limited. In the current setting, the problem is to synchronize clocks of $m$ processors that wake up in arbitrary time points, such that the maximum difference between wake up times is bounded by a positive integer $n$, where time intervals are appropriately discretized. Currently, the best-known results for synchronization for single-hop networks of $m$","authors_text":"Leonid Barenboim, Rafail Ostrovsky, Shlomi Dolev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-06T10:18:02Z","title":"Deterministic and Energy-Optimal Wireless Synchronization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1112","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:480b8e950e54c060b2f73175773397a3ace0f091b033975d4b66c81794cf8ce6","target":"record","created_at":"2026-05-18T02:23:46Z","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":"386c0b27ad6959c8c12134325b813b624291b8f117b61f2d31d69a123ea0673b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-06T10:18:02Z","title_canon_sha256":"308835d92f7c396c27e3c477330f0e8cc93c9adff8f13f6659bf7bbe133349d9"},"schema_version":"1.0","source":{"id":"1010.1112","kind":"arxiv","version":1}},"canonical_sha256":"0c4848c786766cdbbc052322cff113f2a06b88d4a604944468ab6af9269dfd26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c4848c786766cdbbc052322cff113f2a06b88d4a604944468ab6af9269dfd26","first_computed_at":"2026-05-18T02:23:46.468000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:46.468000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+6BvZPIrwi4Ux8yAbIsl9yhhse4nIvnSMJa/bimcB93/yp2UIDdn/2GWrJiM2XhTE4UozdSPCXSvwXN96t9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:46.468641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:480b8e950e54c060b2f73175773397a3ace0f091b033975d4b66c81794cf8ce6","sha256:99f87254bba98562808f20ee9f4d07e64a01401f65aa27feec1fc801111e290a"],"state_sha256":"a794bc6305a2a178d333d3ccd425f162a581abe3ca4cafac40f13b027c2be3eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9UAw5+q4cY1AN6Qt7e0PmozhDEaa0ys/xvXVJ3rjIljnWPmkikkNXbv8VQASH0BN5GQC2UgX+0HNCl/9Y+T3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:11:58.693657Z","bundle_sha256":"2f62ba51ff202510c5dbe7b93b429ab95d6352740edd20082d60b482b5b9dd26"}}