{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:RF3BRWC76GKGLDQ6NGJCFKOMVP","short_pith_number":"pith:RF3BRWC7","schema_version":"1.0","canonical_sha256":"897618d85ff194658e1e699222a9ccabc696064a9b3ab152bc9bf7228f24709c","source":{"kind":"arxiv","id":"quant-ph/0504007","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic Model--Checking of Quantum Protocols","license":"","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Nikolaos Papanikolaou, Rajagopal Nagarajan, Simon Gay","submitted_at":"2005-04-01T23:09:29Z","abstract_excerpt":"We establish fundamental and general techniques for formal verification of quantum protocols. Quantum protocols are novel communication schemes involving the use of quantum-mechanical phenomena for representation, storage and transmission of data. As opposed to quantum computers, quantum communication systems can and have been implemented using present-day technology; therefore, the ability to model and analyse such systems rigorously is of primary importance.\n  While current analyses of quantum protocols use a traditional mathematical approach and require considerable understanding of the und"},"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":"quant-ph/0504007","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-01T23:09:29Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f8e1e36eb94fa0c87f727d0028f990ec6cc82d0db471e8d4a43ee6f42d651a04","abstract_canon_sha256":"cb1efee0262285d5b82d1de3ab54580ed8ef45978768b838b9cdf8731c99d9ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:56.797401Z","signature_b64":"Tvg0SlqhhycczR+2RbE8zuKSAOcvt+ZsFyipZsJ4O8mz+U8ulcssH2XMxmuVYc9i6t172obaTC39mJQDwxZnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897618d85ff194658e1e699222a9ccabc696064a9b3ab152bc9bf7228f24709c","last_reissued_at":"2026-07-04T14:47:56.797048Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:56.797048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Model--Checking of Quantum Protocols","license":"","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Nikolaos Papanikolaou, Rajagopal Nagarajan, Simon Gay","submitted_at":"2005-04-01T23:09:29Z","abstract_excerpt":"We establish fundamental and general techniques for formal verification of quantum protocols. Quantum protocols are novel communication schemes involving the use of quantum-mechanical phenomena for representation, storage and transmission of data. As opposed to quantum computers, quantum communication systems can and have been implemented using present-day technology; therefore, the ability to model and analyse such systems rigorously is of primary importance.\n  While current analyses of quantum protocols use a traditional mathematical approach and require considerable understanding of the und"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504007","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0504007/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"quant-ph/0504007","created_at":"2026-07-04T14:47:56.797100+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504007v2","created_at":"2026-07-04T14:47:56.797100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504007","created_at":"2026-07-04T14:47:56.797100+00:00"},{"alias_kind":"pith_short_12","alias_value":"RF3BRWC76GKG","created_at":"2026-07-04T14:47:56.797100+00:00"},{"alias_kind":"pith_short_16","alias_value":"RF3BRWC76GKGLDQ6","created_at":"2026-07-04T14:47:56.797100+00:00"},{"alias_kind":"pith_short_8","alias_value":"RF3BRWC7","created_at":"2026-07-04T14:47:56.797100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14881","citing_title":"QSeqSim: A Symbolic Simulator for Qiskit While Loops Using Sequential Quantum Circuits","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23756","citing_title":"Verification of Quantum Protocols Adopting Physically Admissible Schedulers","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP","json":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP.json","graph_json":"https://pith.science/api/pith-number/RF3BRWC76GKGLDQ6NGJCFKOMVP/graph.json","events_json":"https://pith.science/api/pith-number/RF3BRWC76GKGLDQ6NGJCFKOMVP/events.json","paper":"https://pith.science/paper/RF3BRWC7"},"agent_actions":{"view_html":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP","download_json":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP.json","view_paper":"https://pith.science/paper/RF3BRWC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0504007&json=true","fetch_graph":"https://pith.science/api/pith-number/RF3BRWC76GKGLDQ6NGJCFKOMVP/graph.json","fetch_events":"https://pith.science/api/pith-number/RF3BRWC76GKGLDQ6NGJCFKOMVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP/action/storage_attestation","attest_author":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP/action/author_attestation","sign_citation":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP/action/citation_signature","submit_replication":"https://pith.science/pith/RF3BRWC76GKGLDQ6NGJCFKOMVP/action/replication_record"}},"created_at":"2026-07-04T14:47:56.797100+00:00","updated_at":"2026-07-04T14:47:56.797100+00:00"}