{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RRTAUOFSDXHTOKQ2HSN4TA5UR6","short_pith_number":"pith:RRTAUOFS","canonical_record":{"source":{"id":"1608.03820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-12T15:19:19Z","cross_cats_sorted":[],"title_canon_sha256":"3e20ca226da553f213b7b3cf2bfcd35ef26189593552fdaf556a495a8c5304e3","abstract_canon_sha256":"8fab0cac841a2b6b6e9f3f75a0149771860750f24ea57be4f3bdaa19a4000849"},"schema_version":"1.0"},"canonical_sha256":"8c660a38b21dcf372a1a3c9bc983b48faebee9d8533b6e6b09fb5b2b25f86bc4","source":{"kind":"arxiv","id":"1608.03820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03820","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03820v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03820","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"RRTAUOFSDXHT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RRTAUOFSDXHTOKQ2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RRTAUOFS","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RRTAUOFSDXHTOKQ2HSN4TA5UR6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-12T15:19:19Z","cross_cats_sorted":[],"title_canon_sha256":"3e20ca226da553f213b7b3cf2bfcd35ef26189593552fdaf556a495a8c5304e3","abstract_canon_sha256":"8fab0cac841a2b6b6e9f3f75a0149771860750f24ea57be4f3bdaa19a4000849"},"schema_version":"1.0"},"canonical_sha256":"8c660a38b21dcf372a1a3c9bc983b48faebee9d8533b6e6b09fb5b2b25f86bc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.312979Z","signature_b64":"Q/MVN1VwRCtb/5AZaxPMCVLYhE6Wi7bQ77bl8wTCPyUTyK3ibKvyFjdMldk6qJbBWAmiJJMYV929MwufZiMlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c660a38b21dcf372a1a3c9bc983b48faebee9d8533b6e6b09fb5b2b25f86bc4","last_reissued_at":"2026-05-18T01:09:11.312428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.312428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03820","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-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhWUJ7ZYJ8mE9mjBE7MsQDQVw97rTRf5GX5nK+TrcKR4kBp8DYSpw5+tmpgtgaXonNrix90USUnKJu32HDFjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:45:36.779048Z"},"content_sha256":"5ce3b6c3ad115c572ef6370babb0c1e8fd8aabc9a04b99237d65fc5ed0ec2d21","schema_version":"1.0","event_id":"sha256:5ce3b6c3ad115c572ef6370babb0c1e8fd8aabc9a04b99237d65fc5ed0ec2d21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RRTAUOFSDXHTOKQ2HSN4TA5UR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive cheating strategies for the relativistic $F_Q$ bit commitment protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'e Chailloux, R\\'emi Bricout","submitted_at":"2016-08-12T15:19:19Z","abstract_excerpt":"In this paper, we study relativistic bit commitment, which uses timing and location constraints to achieve information theoretic security. We consider the $F_Q$ multi-round bit commitment scheme introduced by Lunghi et al. [LKB+15]. This protocol was shown secure against classical adversaries as long as the number of rounds $m$ is small compared to $\\sqrt{Q}$ where $Q$ is the size of the used field in the protocol [CCL15,FF16].\n  In this work, we study classical attacks on this scheme. We use classical strategies for the $CHSH_Q$ game described in [BS15] to derive cheating strategies for this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03820","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-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjDE4Hx0TzoXvknW2jucJ9E94A3b8ZXgpZdSBg+h3fdAgJXrpYWZOoupRJ0/2sVJkxDxVp35sOitpsuY6GlsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:45:36.779396Z"},"content_sha256":"a29f268d3a1e398cb5a7aef749278ab660dc9ea76fafa6f9eaaec11a1af8c9e5","schema_version":"1.0","event_id":"sha256:a29f268d3a1e398cb5a7aef749278ab660dc9ea76fafa6f9eaaec11a1af8c9e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRTAUOFSDXHTOKQ2HSN4TA5UR6/bundle.json","state_url":"https://pith.science/pith/RRTAUOFSDXHTOKQ2HSN4TA5UR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRTAUOFSDXHTOKQ2HSN4TA5UR6/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-23T01:45:36Z","links":{"resolver":"https://pith.science/pith/RRTAUOFSDXHTOKQ2HSN4TA5UR6","bundle":"https://pith.science/pith/RRTAUOFSDXHTOKQ2HSN4TA5UR6/bundle.json","state":"https://pith.science/pith/RRTAUOFSDXHTOKQ2HSN4TA5UR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRTAUOFSDXHTOKQ2HSN4TA5UR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RRTAUOFSDXHTOKQ2HSN4TA5UR6","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":"8fab0cac841a2b6b6e9f3f75a0149771860750f24ea57be4f3bdaa19a4000849","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-12T15:19:19Z","title_canon_sha256":"3e20ca226da553f213b7b3cf2bfcd35ef26189593552fdaf556a495a8c5304e3"},"schema_version":"1.0","source":{"id":"1608.03820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03820","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03820v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03820","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"RRTAUOFSDXHT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RRTAUOFSDXHTOKQ2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RRTAUOFS","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:a29f268d3a1e398cb5a7aef749278ab660dc9ea76fafa6f9eaaec11a1af8c9e5","target":"graph","created_at":"2026-05-18T01:09:11Z","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":"In this paper, we study relativistic bit commitment, which uses timing and location constraints to achieve information theoretic security. We consider the $F_Q$ multi-round bit commitment scheme introduced by Lunghi et al. [LKB+15]. This protocol was shown secure against classical adversaries as long as the number of rounds $m$ is small compared to $\\sqrt{Q}$ where $Q$ is the size of the used field in the protocol [CCL15,FF16].\n  In this work, we study classical attacks on this scheme. We use classical strategies for the $CHSH_Q$ game described in [BS15] to derive cheating strategies for this ","authors_text":"Andr\\'e Chailloux, R\\'emi Bricout","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-12T15:19:19Z","title":"Recursive cheating strategies for the relativistic $F_Q$ bit commitment protocol"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03820","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:5ce3b6c3ad115c572ef6370babb0c1e8fd8aabc9a04b99237d65fc5ed0ec2d21","target":"record","created_at":"2026-05-18T01:09:11Z","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":"8fab0cac841a2b6b6e9f3f75a0149771860750f24ea57be4f3bdaa19a4000849","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-12T15:19:19Z","title_canon_sha256":"3e20ca226da553f213b7b3cf2bfcd35ef26189593552fdaf556a495a8c5304e3"},"schema_version":"1.0","source":{"id":"1608.03820","kind":"arxiv","version":1}},"canonical_sha256":"8c660a38b21dcf372a1a3c9bc983b48faebee9d8533b6e6b09fb5b2b25f86bc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c660a38b21dcf372a1a3c9bc983b48faebee9d8533b6e6b09fb5b2b25f86bc4","first_computed_at":"2026-05-18T01:09:11.312428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.312428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q/MVN1VwRCtb/5AZaxPMCVLYhE6Wi7bQ77bl8wTCPyUTyK3ibKvyFjdMldk6qJbBWAmiJJMYV929MwufZiMlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.312979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ce3b6c3ad115c572ef6370babb0c1e8fd8aabc9a04b99237d65fc5ed0ec2d21","sha256:a29f268d3a1e398cb5a7aef749278ab660dc9ea76fafa6f9eaaec11a1af8c9e5"],"state_sha256":"fb4b70baa23b18f084902444e1d535d3219c33f4fde01de2a3e57136046dc4ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OT6Kx9yhxwvQu4yM7jTTngfZakL4jZuoDqGLBfQhOMtPUmSiHJn8oPxCk10pQIF7Gs4TUHLmUP+gKCpsLYXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:45:36.781262Z","bundle_sha256":"9c2e0ce649de84d2feacb8fb9037d19830d0d9deb834d57339a174e34e997efc"}}