{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I3Y345POBPTV6OWOS62C22BOHU","short_pith_number":"pith:I3Y345PO","canonical_record":{"source":{"id":"1611.05117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-11-16T02:13:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a1ed9019eab2f603f25598ab0e57d31b9b1dafff78d3c0998b868626eb5795f7","abstract_canon_sha256":"4542a66bde241bf354423791936b3b877792eebfc2de075aec32b49d4b260d0a"},"schema_version":"1.0"},"canonical_sha256":"46f1be75ee0be75f3ace97b42d682e3d33aac6f81e70bed896510b8a25310426","source":{"kind":"arxiv","id":"1611.05117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05117","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05117v1","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05117","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"I3Y345POBPTV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I3Y345POBPTV6OWO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I3Y345PO","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I3Y345POBPTV6OWOS62C22BOHU","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-11-16T02:13:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a1ed9019eab2f603f25598ab0e57d31b9b1dafff78d3c0998b868626eb5795f7","abstract_canon_sha256":"4542a66bde241bf354423791936b3b877792eebfc2de075aec32b49d4b260d0a"},"schema_version":"1.0"},"canonical_sha256":"46f1be75ee0be75f3ace97b42d682e3d33aac6f81e70bed896510b8a25310426","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:27.925081Z","signature_b64":"zezusqwh8Un9XAS/SCDIt9OVOaiTt13RLQSyspbJFwpNmbvKZNXELSPUTClMLtPra8IDnMTb+Sh2tf/5IMkUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f1be75ee0be75f3ace97b42d682e3d33aac6f81e70bed896510b8a25310426","last_reissued_at":"2026-05-18T00:58:27.924447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:27.924447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05117","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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZFZLcFebt9xb+r0LlfP8JFmY5Pb59pwRfP7sT7Qek0WObsnBLOI5are/DkEOpRPO7CIBbAcxehp838+TExwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T23:34:50.508406Z"},"content_sha256":"43175143775f036dca069156b587ad6fc2f90abcbf100ee9bef32f3df239c37c","schema_version":"1.0","event_id":"sha256:43175143775f036dca069156b587ad6fc2f90abcbf100ee9bef32f3df239c37c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I3Y345POBPTV6OWOS62C22BOHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimation Theory Based Robust Phase Offset Estimation in the Presence of Delay Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.AP","authors_text":"Anantha K. Karthik, Rick S. Blum","submitted_at":"2016-11-16T02:13:07Z","abstract_excerpt":"This paper addresses the problem of robust clock phase offset estimation for the IEEE 1588 precision time protocol (PTP) in the presence of delay attacks. Delay attacks are one of the most effective cyber attacks in PTP, as they cannot be mitigated using typical security measures. In this paper, we consider the case where the slave node can exchange synchronization messages with multiple master nodes synchronized to the same clock. We first provide lower bounds on the best achievable performance for any phase offset estimation scheme in the presence of delay attacks. We then present a novel ph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05117","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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQCMWGKb7eSoME2lur+ENPTm3pfUJi1kppW7hlMMiy9zBQ1aHUAI8CD08PYGEfOpHHIbZ6OnyBNFs339/dJiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T23:34:50.508925Z"},"content_sha256":"2512128825565f69f18ebb048d42f04aa94c5d3500bf6cb2eca8a75679d9b395","schema_version":"1.0","event_id":"sha256:2512128825565f69f18ebb048d42f04aa94c5d3500bf6cb2eca8a75679d9b395"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3Y345POBPTV6OWOS62C22BOHU/bundle.json","state_url":"https://pith.science/pith/I3Y345POBPTV6OWOS62C22BOHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3Y345POBPTV6OWOS62C22BOHU/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-18T23:34:50Z","links":{"resolver":"https://pith.science/pith/I3Y345POBPTV6OWOS62C22BOHU","bundle":"https://pith.science/pith/I3Y345POBPTV6OWOS62C22BOHU/bundle.json","state":"https://pith.science/pith/I3Y345POBPTV6OWOS62C22BOHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3Y345POBPTV6OWOS62C22BOHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I3Y345POBPTV6OWOS62C22BOHU","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":"4542a66bde241bf354423791936b3b877792eebfc2de075aec32b49d4b260d0a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-11-16T02:13:07Z","title_canon_sha256":"a1ed9019eab2f603f25598ab0e57d31b9b1dafff78d3c0998b868626eb5795f7"},"schema_version":"1.0","source":{"id":"1611.05117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05117","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05117v1","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05117","created_at":"2026-05-18T00:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"I3Y345POBPTV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I3Y345POBPTV6OWO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I3Y345PO","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:2512128825565f69f18ebb048d42f04aa94c5d3500bf6cb2eca8a75679d9b395","target":"graph","created_at":"2026-05-18T00:58:27Z","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":"This paper addresses the problem of robust clock phase offset estimation for the IEEE 1588 precision time protocol (PTP) in the presence of delay attacks. Delay attacks are one of the most effective cyber attacks in PTP, as they cannot be mitigated using typical security measures. In this paper, we consider the case where the slave node can exchange synchronization messages with multiple master nodes synchronized to the same clock. We first provide lower bounds on the best achievable performance for any phase offset estimation scheme in the presence of delay attacks. We then present a novel ph","authors_text":"Anantha K. Karthik, Rick S. Blum","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-11-16T02:13:07Z","title":"Estimation Theory Based Robust Phase Offset Estimation in the Presence of Delay Attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05117","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:43175143775f036dca069156b587ad6fc2f90abcbf100ee9bef32f3df239c37c","target":"record","created_at":"2026-05-18T00:58:27Z","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":"4542a66bde241bf354423791936b3b877792eebfc2de075aec32b49d4b260d0a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-11-16T02:13:07Z","title_canon_sha256":"a1ed9019eab2f603f25598ab0e57d31b9b1dafff78d3c0998b868626eb5795f7"},"schema_version":"1.0","source":{"id":"1611.05117","kind":"arxiv","version":1}},"canonical_sha256":"46f1be75ee0be75f3ace97b42d682e3d33aac6f81e70bed896510b8a25310426","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46f1be75ee0be75f3ace97b42d682e3d33aac6f81e70bed896510b8a25310426","first_computed_at":"2026-05-18T00:58:27.924447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:27.924447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zezusqwh8Un9XAS/SCDIt9OVOaiTt13RLQSyspbJFwpNmbvKZNXELSPUTClMLtPra8IDnMTb+Sh2tf/5IMkUBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:27.925081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43175143775f036dca069156b587ad6fc2f90abcbf100ee9bef32f3df239c37c","sha256:2512128825565f69f18ebb048d42f04aa94c5d3500bf6cb2eca8a75679d9b395"],"state_sha256":"9bbbfa4f9441929b614cc309ff38bb310adb78b7e56da23db9927f9f13cd1031"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2icbVWyJjz5Gu0juYFQtqGB8RNa+ZpL8byeBn4hFDy5Rlv3/JdLhQ/ySFd4mm/zZY+efPAoUJHbeVUkf3RlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T23:34:50.511116Z","bundle_sha256":"4c271c9fcdc18e2a6b8c43d95909c8099feceee29bec16f57e91c3c3f3f29e76"}}