{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:W434I7ZVJAONFC55IVDACSNX5Z","short_pith_number":"pith:W434I7ZV","schema_version":"1.0","canonical_sha256":"b737c47f35481cd28bbd45460149b7ee6cbaa81fd9ca0d1f4dcd17b590ad3685","source":{"kind":"arxiv","id":"1106.2922","version":2},"attestation_state":"computed","paper":{"title":"Fair and optimistic quantum contract signing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. Bouda, N. Paunkovic, P. Mateus","submitted_at":"2011-06-15T10:08:19Z","abstract_excerpt":"We present a fair and optimistic quantum contract signing protocol between two clients that requires no communication with the third trusted party during the exchange phase. We discuss its fairness and show that it is possible to design such a protocol for which the probability of a dishonest client to cheat becomes negligible, and scales as N^{-1/2}, where N is the number of messages exchanged between the clients. Our protocol is not based on the exchange of signed messages: its fairness is based on the laws of quantum mechanics. Thus, it is abuse-free, and the clients do not have to generate"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1106.2922","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-15T10:08:19Z","cross_cats_sorted":[],"title_canon_sha256":"ebcfa888de52e80d4929ae48af69ec95563a703bf93216ba4e453cf642d5020b","abstract_canon_sha256":"287c177e01cbcef58b7dbc7e0e6aff132f31d0962e867c8e60093924e1346afa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:01:37.035373Z","signature_b64":"SNgz3Ex7lnzYZVHbuanzvgoFTWBImjou7UIeBw7TD8JLn0njfAnqa1yz3h/4cEZtHekpE9gdmkV0S88bC3npBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b737c47f35481cd28bbd45460149b7ee6cbaa81fd9ca0d1f4dcd17b590ad3685","last_reissued_at":"2026-05-18T02:01:37.034734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:01:37.034734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair and optimistic quantum contract signing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. Bouda, N. Paunkovic, P. Mateus","submitted_at":"2011-06-15T10:08:19Z","abstract_excerpt":"We present a fair and optimistic quantum contract signing protocol between two clients that requires no communication with the third trusted party during the exchange phase. We discuss its fairness and show that it is possible to design such a protocol for which the probability of a dishonest client to cheat becomes negligible, and scales as N^{-1/2}, where N is the number of messages exchanged between the clients. Our protocol is not based on the exchange of signed messages: its fairness is based on the laws of quantum mechanics. Thus, it is abuse-free, and the clients do not have to generate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2922","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.2922","created_at":"2026-05-18T02:01:37.034831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2922v2","created_at":"2026-05-18T02:01:37.034831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2922","created_at":"2026-05-18T02:01:37.034831+00:00"},{"alias_kind":"pith_short_12","alias_value":"W434I7ZVJAON","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"W434I7ZVJAONFC55","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"W434I7ZV","created_at":"2026-05-18T12:26:44.992195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z","json":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z.json","graph_json":"https://pith.science/api/pith-number/W434I7ZVJAONFC55IVDACSNX5Z/graph.json","events_json":"https://pith.science/api/pith-number/W434I7ZVJAONFC55IVDACSNX5Z/events.json","paper":"https://pith.science/paper/W434I7ZV"},"agent_actions":{"view_html":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z","download_json":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z.json","view_paper":"https://pith.science/paper/W434I7ZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2922&json=true","fetch_graph":"https://pith.science/api/pith-number/W434I7ZVJAONFC55IVDACSNX5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/W434I7ZVJAONFC55IVDACSNX5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z/action/storage_attestation","attest_author":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z/action/author_attestation","sign_citation":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z/action/citation_signature","submit_replication":"https://pith.science/pith/W434I7ZVJAONFC55IVDACSNX5Z/action/replication_record"}},"created_at":"2026-05-18T02:01:37.034831+00:00","updated_at":"2026-05-18T02:01:37.034831+00:00"}