{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HGO7TWYQWM4EP2RQYVKXMMWGQN","short_pith_number":"pith:HGO7TWYQ","schema_version":"1.0","canonical_sha256":"399df9db10b33847ea30c5557632c68342fd01ed75ea148139ee76505808ed41","source":{"kind":"arxiv","id":"1409.7853","version":1},"attestation_state":"computed","paper":{"title":"Quantum correction with three codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Aziz Mouzali, Fatiha Merazka","submitted_at":"2014-09-27T22:46:57Z","abstract_excerpt":"In this paper, we provise an implementation of five, seven and nine-qubits error correcting codes on a classical computer using the quantum simulator Feynman program. We also compare the three codes by computing the fidelity when double errors occurs in a depolarizing channel. As triple errors and more are considered very unlikely, it has negligible effect on the next results"},"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":"1409.7853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-27T22:46:57Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"7e3dbd5c3cb0b955ddf368ea4bf6b2a82730a38b6b044eef6c52bf2b1541159d","abstract_canon_sha256":"3798c0670b51a583d31f4932a68e627edb158b09544a3e966bf434a40f496b56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:40.373142Z","signature_b64":"Z3GendCOOGME+okpGAcNpBIW/ABUQwo/IUR45mau/pnWjRBbJvczo6TBsNsQ31Tjkh8SV5UQgJVKAqbE+2rbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399df9db10b33847ea30c5557632c68342fd01ed75ea148139ee76505808ed41","last_reissued_at":"2026-05-18T02:41:40.372595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:40.372595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum correction with three codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Aziz Mouzali, Fatiha Merazka","submitted_at":"2014-09-27T22:46:57Z","abstract_excerpt":"In this paper, we provise an implementation of five, seven and nine-qubits error correcting codes on a classical computer using the quantum simulator Feynman program. We also compare the three codes by computing the fidelity when double errors occurs in a depolarizing channel. As triple errors and more are considered very unlikely, it has negligible effect on the next results"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7853","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.7853","created_at":"2026-05-18T02:41:40.372684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7853v1","created_at":"2026-05-18T02:41:40.372684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7853","created_at":"2026-05-18T02:41:40.372684+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGO7TWYQWM4E","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGO7TWYQWM4EP2RQ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGO7TWYQ","created_at":"2026-05-18T12:28:30.664211+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/HGO7TWYQWM4EP2RQYVKXMMWGQN","json":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN.json","graph_json":"https://pith.science/api/pith-number/HGO7TWYQWM4EP2RQYVKXMMWGQN/graph.json","events_json":"https://pith.science/api/pith-number/HGO7TWYQWM4EP2RQYVKXMMWGQN/events.json","paper":"https://pith.science/paper/HGO7TWYQ"},"agent_actions":{"view_html":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN","download_json":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN.json","view_paper":"https://pith.science/paper/HGO7TWYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7853&json=true","fetch_graph":"https://pith.science/api/pith-number/HGO7TWYQWM4EP2RQYVKXMMWGQN/graph.json","fetch_events":"https://pith.science/api/pith-number/HGO7TWYQWM4EP2RQYVKXMMWGQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN/action/storage_attestation","attest_author":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN/action/author_attestation","sign_citation":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN/action/citation_signature","submit_replication":"https://pith.science/pith/HGO7TWYQWM4EP2RQYVKXMMWGQN/action/replication_record"}},"created_at":"2026-05-18T02:41:40.372684+00:00","updated_at":"2026-05-18T02:41:40.372684+00:00"}