{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7OSYFZTAX3DVO2TK22KHWLB6BR","short_pith_number":"pith:7OSYFZTA","canonical_record":{"source":{"id":"1403.6192","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T23:37:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09b8165aef13abdfb948eeebfa3f2838904b314f8d9a5b4574db3f242dcfb1ac","abstract_canon_sha256":"66f06a405522e994c79b212ac756f13092319739846754d123f839a8f11279e1"},"schema_version":"1.0"},"canonical_sha256":"fba582e660bec7576a6ad6947b2c3e0c7d288a8b8841e348442f6a63fec473f6","source":{"kind":"arxiv","id":"1403.6192","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6192","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6192v3","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6192","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"7OSYFZTAX3DV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7OSYFZTAX3DVO2TK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7OSYFZTA","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7OSYFZTAX3DVO2TK22KHWLB6BR","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6192","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T23:37:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09b8165aef13abdfb948eeebfa3f2838904b314f8d9a5b4574db3f242dcfb1ac","abstract_canon_sha256":"66f06a405522e994c79b212ac756f13092319739846754d123f839a8f11279e1"},"schema_version":"1.0"},"canonical_sha256":"fba582e660bec7576a6ad6947b2c3e0c7d288a8b8841e348442f6a63fec473f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:04.267782Z","signature_b64":"7QVHhbmM1aGpSDNHeNG2IGg3pGC84rhOyONMgR+YkpZWxR7jxM5XkZ6Dd6hMlyqkOcKuXguIU+r5EoFxrQKqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba582e660bec7576a6ad6947b2c3e0c7d288a8b8841e348442f6a63fec473f6","last_reissued_at":"2026-05-18T02:45:04.267189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:04.267189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6192","source_version":3,"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:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTyeCGLcBtgtyh2kKOPfPV/FRrRnGEM08P+aUnDtdyNnIsrr2iYidFxrJERLycbkoHIwplSXCylQjdtNc+asDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:24:48.815161Z"},"content_sha256":"046378ca74b362378d1bc48df80362989924362515746cdd85e0210441ce22bb","schema_version":"1.0","event_id":"sha256:046378ca74b362378d1bc48df80362989924362515746cdd85e0210441ce22bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7OSYFZTAX3DVO2TK22KHWLB6BR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinhong Yuan, Yixuan Xie, Yuichiro Fujiwara","submitted_at":"2014-03-24T23:37:40Z","abstract_excerpt":"Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes that satisfy special properties, only a few classes of cyclic codes have been proved to give promising quantum synchronizable codes. In this paper, using quadratic residue codes and their supercodes, we give a simple construction for quantum synchronizable codes whose synchronization capabilities attain the upper bound. The method is applicable to cyclic co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6192","kind":"arxiv","version":3},"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:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dh8AzPtdB4M6a8nd14mogAfjK3hWTMO4rfRojGFXXKlIKbBJbuBkEvW6CDMPSzLKhwSyVhdZHo43v64ONYDmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:24:48.815851Z"},"content_sha256":"5e2f559274c09ad641cb9b5e00ec10d61a9c30d80752eb96d2299540bd6cce4f","schema_version":"1.0","event_id":"sha256:5e2f559274c09ad641cb9b5e00ec10d61a9c30d80752eb96d2299540bd6cce4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OSYFZTAX3DVO2TK22KHWLB6BR/bundle.json","state_url":"https://pith.science/pith/7OSYFZTAX3DVO2TK22KHWLB6BR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OSYFZTAX3DVO2TK22KHWLB6BR/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-05-25T16:24:48Z","links":{"resolver":"https://pith.science/pith/7OSYFZTAX3DVO2TK22KHWLB6BR","bundle":"https://pith.science/pith/7OSYFZTAX3DVO2TK22KHWLB6BR/bundle.json","state":"https://pith.science/pith/7OSYFZTAX3DVO2TK22KHWLB6BR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OSYFZTAX3DVO2TK22KHWLB6BR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7OSYFZTAX3DVO2TK22KHWLB6BR","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":"66f06a405522e994c79b212ac756f13092319739846754d123f839a8f11279e1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T23:37:40Z","title_canon_sha256":"09b8165aef13abdfb948eeebfa3f2838904b314f8d9a5b4574db3f242dcfb1ac"},"schema_version":"1.0","source":{"id":"1403.6192","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6192","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6192v3","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6192","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"7OSYFZTAX3DV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7OSYFZTAX3DVO2TK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7OSYFZTA","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:5e2f559274c09ad641cb9b5e00ec10d61a9c30d80752eb96d2299540bd6cce4f","target":"graph","created_at":"2026-05-18T02:45:04Z","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":"Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes that satisfy special properties, only a few classes of cyclic codes have been proved to give promising quantum synchronizable codes. In this paper, using quadratic residue codes and their supercodes, we give a simple construction for quantum synchronizable codes whose synchronization capabilities attain the upper bound. The method is applicable to cyclic co","authors_text":"Jinhong Yuan, Yixuan Xie, Yuichiro Fujiwara","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T23:37:40Z","title":"Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6192","kind":"arxiv","version":3},"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:046378ca74b362378d1bc48df80362989924362515746cdd85e0210441ce22bb","target":"record","created_at":"2026-05-18T02:45:04Z","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":"66f06a405522e994c79b212ac756f13092319739846754d123f839a8f11279e1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T23:37:40Z","title_canon_sha256":"09b8165aef13abdfb948eeebfa3f2838904b314f8d9a5b4574db3f242dcfb1ac"},"schema_version":"1.0","source":{"id":"1403.6192","kind":"arxiv","version":3}},"canonical_sha256":"fba582e660bec7576a6ad6947b2c3e0c7d288a8b8841e348442f6a63fec473f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fba582e660bec7576a6ad6947b2c3e0c7d288a8b8841e348442f6a63fec473f6","first_computed_at":"2026-05-18T02:45:04.267189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:04.267189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7QVHhbmM1aGpSDNHeNG2IGg3pGC84rhOyONMgR+YkpZWxR7jxM5XkZ6Dd6hMlyqkOcKuXguIU+r5EoFxrQKqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:04.267782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6192","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:046378ca74b362378d1bc48df80362989924362515746cdd85e0210441ce22bb","sha256:5e2f559274c09ad641cb9b5e00ec10d61a9c30d80752eb96d2299540bd6cce4f"],"state_sha256":"ce4a49383afd115a082b9936a8daf5af72762edb64bb14e842bae9ca6e63201c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgPLiWwVM1oqn81JFsizORNxO7rAS4Q2M15SllgKAs9r2KJSZF/cDvIIC1gPSLbtcUQilv2R1SoIAaXaJUETDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:24:48.819267Z","bundle_sha256":"debae2d25c41c30e9b45879ff819ca9426561188f52f927e6515c1904f14194d"}}