{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2YGCMJHQ45MOMOQTV7G6SRM7DP","short_pith_number":"pith:2YGCMJHQ","canonical_record":{"source":{"id":"1501.05758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-23T10:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"ff6c50c31222d247b87541dbcf83f94a95e3d18b1f1ea7900095b6db01eb5fdc","abstract_canon_sha256":"e45047678c9cb28493468c07615581d4fb1002e0993199d0bc48fbc2f4ea6ce3"},"schema_version":"1.0"},"canonical_sha256":"d60c2624f0e758e63a13afcde9459f1bedbf5c6469ddbb7764b0a14cd6795b02","source":{"kind":"arxiv","id":"1501.05758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05758","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05758v1","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05758","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"2YGCMJHQ45MO","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YGCMJHQ45MOMOQT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YGCMJHQ","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2YGCMJHQ45MOMOQTV7G6SRM7DP","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-23T10:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"ff6c50c31222d247b87541dbcf83f94a95e3d18b1f1ea7900095b6db01eb5fdc","abstract_canon_sha256":"e45047678c9cb28493468c07615581d4fb1002e0993199d0bc48fbc2f4ea6ce3"},"schema_version":"1.0"},"canonical_sha256":"d60c2624f0e758e63a13afcde9459f1bedbf5c6469ddbb7764b0a14cd6795b02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.209845Z","signature_b64":"u5bBGu8zAjsynnTo2kC+8ymt7L6OG6GZJTwZmApNIZG3QAAW52JKcw42kQYiLE4yn+DB3bNPO5iYydjo+HtIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d60c2624f0e758e63a13afcde9459f1bedbf5c6469ddbb7764b0a14cd6795b02","last_reissued_at":"2026-05-18T02:28:47.209468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.209468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05758","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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fn5ickaGHu5m46wr+BRv8/dzeXzs2hPNgwISxeGSetmKwzW77qKUdA37Kmosd41SVQaIq/IWFFOX3HL9kntrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:47:35.549177Z"},"content_sha256":"6b4c9f07f215acd499887202b685d95e4a8fe151d9597cfaeae9747b328fe2d3","schema_version":"1.0","event_id":"sha256:6b4c9f07f215acd499887202b685d95e4a8fe151d9597cfaeae9747b328fe2d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2YGCMJHQ45MOMOQTV7G6SRM7DP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Clock Synchronization with a Single Qudit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ad\\'an Cabello, Armin Tavakoli, Marek \\.Zukowski, Mohamed Bourennane","submitted_at":"2015-01-23T10:04:55Z","abstract_excerpt":"Clock synchronization for nonfaulty processes in multiprocess networks is indispensable for a variety of technologies. A reliable system must be able to resynchronize the nonfaulty processes upon some components failing causing the distribution of incorrect or conflicting information in the network. The task of synchronizing such networks is related to detectable Byzantine agreement (DBA), which can classically be solved using recursive algorithms if and only if less than one-third of the processes are faulty. Here we introduce a nonrecursive quantum algorithm that solves the DBA and achieves "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05758","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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6dt/anp+akjPGBvOE5BU+/YWAhsnhnJacJ7ES8d8dugfAM/cMDnLabejqSvVrdu9QyTTNPfS1IrfEVf8iZjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:47:35.550006Z"},"content_sha256":"5d8b5d542c287c814f4660d121aaa8b7fe190714bf3881b1c8fd2dd0ee7a91c5","schema_version":"1.0","event_id":"sha256:5d8b5d542c287c814f4660d121aaa8b7fe190714bf3881b1c8fd2dd0ee7a91c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YGCMJHQ45MOMOQTV7G6SRM7DP/bundle.json","state_url":"https://pith.science/pith/2YGCMJHQ45MOMOQTV7G6SRM7DP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YGCMJHQ45MOMOQTV7G6SRM7DP/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-01T02:47:35Z","links":{"resolver":"https://pith.science/pith/2YGCMJHQ45MOMOQTV7G6SRM7DP","bundle":"https://pith.science/pith/2YGCMJHQ45MOMOQTV7G6SRM7DP/bundle.json","state":"https://pith.science/pith/2YGCMJHQ45MOMOQTV7G6SRM7DP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YGCMJHQ45MOMOQTV7G6SRM7DP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2YGCMJHQ45MOMOQTV7G6SRM7DP","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":"e45047678c9cb28493468c07615581d4fb1002e0993199d0bc48fbc2f4ea6ce3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-23T10:04:55Z","title_canon_sha256":"ff6c50c31222d247b87541dbcf83f94a95e3d18b1f1ea7900095b6db01eb5fdc"},"schema_version":"1.0","source":{"id":"1501.05758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05758","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05758v1","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05758","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"2YGCMJHQ45MO","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YGCMJHQ45MOMOQT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YGCMJHQ","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:5d8b5d542c287c814f4660d121aaa8b7fe190714bf3881b1c8fd2dd0ee7a91c5","target":"graph","created_at":"2026-05-18T02:28:47Z","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":"Clock synchronization for nonfaulty processes in multiprocess networks is indispensable for a variety of technologies. A reliable system must be able to resynchronize the nonfaulty processes upon some components failing causing the distribution of incorrect or conflicting information in the network. The task of synchronizing such networks is related to detectable Byzantine agreement (DBA), which can classically be solved using recursive algorithms if and only if less than one-third of the processes are faulty. Here we introduce a nonrecursive quantum algorithm that solves the DBA and achieves ","authors_text":"Ad\\'an Cabello, Armin Tavakoli, Marek \\.Zukowski, Mohamed Bourennane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-23T10:04:55Z","title":"Quantum Clock Synchronization with a Single Qudit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05758","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:6b4c9f07f215acd499887202b685d95e4a8fe151d9597cfaeae9747b328fe2d3","target":"record","created_at":"2026-05-18T02:28:47Z","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":"e45047678c9cb28493468c07615581d4fb1002e0993199d0bc48fbc2f4ea6ce3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-23T10:04:55Z","title_canon_sha256":"ff6c50c31222d247b87541dbcf83f94a95e3d18b1f1ea7900095b6db01eb5fdc"},"schema_version":"1.0","source":{"id":"1501.05758","kind":"arxiv","version":1}},"canonical_sha256":"d60c2624f0e758e63a13afcde9459f1bedbf5c6469ddbb7764b0a14cd6795b02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d60c2624f0e758e63a13afcde9459f1bedbf5c6469ddbb7764b0a14cd6795b02","first_computed_at":"2026-05-18T02:28:47.209468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.209468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u5bBGu8zAjsynnTo2kC+8ymt7L6OG6GZJTwZmApNIZG3QAAW52JKcw42kQYiLE4yn+DB3bNPO5iYydjo+HtIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.209845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b4c9f07f215acd499887202b685d95e4a8fe151d9597cfaeae9747b328fe2d3","sha256:5d8b5d542c287c814f4660d121aaa8b7fe190714bf3881b1c8fd2dd0ee7a91c5"],"state_sha256":"6641ced0d1733ddfe303dce5020af21661fb537b9340372f0fc3b326c77103bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuGh24mGuRQM6P8hqjXCbzu2nQo6Lf3kO4Pog6KYF/9Q3MDIiY194rQsI96O3UML0McOo60Td/O9nrb/vBUBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:47:35.552487Z","bundle_sha256":"d7c9d31b80951909098b2c9ef11fa033e17f67c49a9eb3bdc7f0dc083388854b"}}