{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SFWD2EABJ6KYKLUFFXCR5HDQYU","short_pith_number":"pith:SFWD2EAB","canonical_record":{"source":{"id":"1803.04168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-12T10:04:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"99465e3eec90d80eeec66246b76bb792f8c4003cdedd12e5f33ce147f4b46ae9","abstract_canon_sha256":"7c121ae3a9bdc59e5f417d9eff0b2d497d7be6d30731f4cf5f090b1757865691"},"schema_version":"1.0"},"canonical_sha256":"916c3d10014f95852e852dc51e9c70c526f5bd00fa7e5336bc6d4f253d3002d1","source":{"kind":"arxiv","id":"1803.04168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04168","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04168v1","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04168","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"pith_short_12","alias_value":"SFWD2EABJ6KY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SFWD2EABJ6KYKLUF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SFWD2EAB","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SFWD2EABJ6KYKLUFFXCR5HDQYU","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-12T10:04:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"99465e3eec90d80eeec66246b76bb792f8c4003cdedd12e5f33ce147f4b46ae9","abstract_canon_sha256":"7c121ae3a9bdc59e5f417d9eff0b2d497d7be6d30731f4cf5f090b1757865691"},"schema_version":"1.0"},"canonical_sha256":"916c3d10014f95852e852dc51e9c70c526f5bd00fa7e5336bc6d4f253d3002d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:32.438486Z","signature_b64":"y99qA8VPwwchLZSkJhoLZCRdU7/zaUuTcRPy9RS+N5PPLQMGvcHSM2WyfqSTzdjMqPDu88WQ4ehss+MI4pddBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"916c3d10014f95852e852dc51e9c70c526f5bd00fa7e5336bc6d4f253d3002d1","last_reissued_at":"2026-05-18T00:21:32.437942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:32.437942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04168","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-18T00:21:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqpvwkcl55gTj+PkhcWE0c1d+5XiSPHywkJnAYYBdmECQFhBh6jyvD0i5xK+AXsi8WQC5sOLy2BVuk7pIxGxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:02.070931Z"},"content_sha256":"05ed1311b0da777c3cd81984e839c427f3ff048addf1176d253bbc7d4ac322d6","schema_version":"1.0","event_id":"sha256:05ed1311b0da777c3cd81984e839c427f3ff048addf1176d253bbc7d4ac322d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SFWD2EABJ6KYKLUFFXCR5HDQYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Cao, Liangdong Lu, Ruihu Li, Wenping Ma, Yang Liu, Yuena Ma","submitted_at":"2018-03-12T10:04:15Z","abstract_excerpt":"The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this work, we propose a decomposition of the defining set of constacyclic codes. Using this method, we construct four classes of $q$-ary entanglement-assisted quantum MDS (EAQMDS) codes based on classical constacyclic MDS codes by exploiting less pre-shared maximally entangled states. We show that a class of $q$-ary EAQMDS have minimum distance upper limit greate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04168","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-18T00:21:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oArvrFp6wgfFdq3ge2/x/ExRw+gAJwX5VdhFj7JzIxbMzYJpvIaBJ2RWUcugQ5Iypi5kdLbItz/0UHhDKX8RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:02.071589Z"},"content_sha256":"44b9dba36bdb67c06bda7e32be7f05743d2cf858d7c56f19cfd2e0062bec8716","schema_version":"1.0","event_id":"sha256:44b9dba36bdb67c06bda7e32be7f05743d2cf858d7c56f19cfd2e0062bec8716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFWD2EABJ6KYKLUFFXCR5HDQYU/bundle.json","state_url":"https://pith.science/pith/SFWD2EABJ6KYKLUFFXCR5HDQYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFWD2EABJ6KYKLUFFXCR5HDQYU/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-27T00:24:02Z","links":{"resolver":"https://pith.science/pith/SFWD2EABJ6KYKLUFFXCR5HDQYU","bundle":"https://pith.science/pith/SFWD2EABJ6KYKLUFFXCR5HDQYU/bundle.json","state":"https://pith.science/pith/SFWD2EABJ6KYKLUFFXCR5HDQYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFWD2EABJ6KYKLUFFXCR5HDQYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SFWD2EABJ6KYKLUFFXCR5HDQYU","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":"7c121ae3a9bdc59e5f417d9eff0b2d497d7be6d30731f4cf5f090b1757865691","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-12T10:04:15Z","title_canon_sha256":"99465e3eec90d80eeec66246b76bb792f8c4003cdedd12e5f33ce147f4b46ae9"},"schema_version":"1.0","source":{"id":"1803.04168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04168","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04168v1","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04168","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"pith_short_12","alias_value":"SFWD2EABJ6KY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SFWD2EABJ6KYKLUF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SFWD2EAB","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:44b9dba36bdb67c06bda7e32be7f05743d2cf858d7c56f19cfd2e0062bec8716","target":"graph","created_at":"2026-05-18T00:21:32Z","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":"The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this work, we propose a decomposition of the defining set of constacyclic codes. Using this method, we construct four classes of $q$-ary entanglement-assisted quantum MDS (EAQMDS) codes based on classical constacyclic MDS codes by exploiting less pre-shared maximally entangled states. We show that a class of $q$-ary EAQMDS have minimum distance upper limit greate","authors_text":"Hao Cao, Liangdong Lu, Ruihu Li, Wenping Ma, Yang Liu, Yuena Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-12T10:04:15Z","title":"Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04168","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:05ed1311b0da777c3cd81984e839c427f3ff048addf1176d253bbc7d4ac322d6","target":"record","created_at":"2026-05-18T00:21:32Z","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":"7c121ae3a9bdc59e5f417d9eff0b2d497d7be6d30731f4cf5f090b1757865691","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-12T10:04:15Z","title_canon_sha256":"99465e3eec90d80eeec66246b76bb792f8c4003cdedd12e5f33ce147f4b46ae9"},"schema_version":"1.0","source":{"id":"1803.04168","kind":"arxiv","version":1}},"canonical_sha256":"916c3d10014f95852e852dc51e9c70c526f5bd00fa7e5336bc6d4f253d3002d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"916c3d10014f95852e852dc51e9c70c526f5bd00fa7e5336bc6d4f253d3002d1","first_computed_at":"2026-05-18T00:21:32.437942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:32.437942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y99qA8VPwwchLZSkJhoLZCRdU7/zaUuTcRPy9RS+N5PPLQMGvcHSM2WyfqSTzdjMqPDu88WQ4ehss+MI4pddBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:32.438486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05ed1311b0da777c3cd81984e839c427f3ff048addf1176d253bbc7d4ac322d6","sha256:44b9dba36bdb67c06bda7e32be7f05743d2cf858d7c56f19cfd2e0062bec8716"],"state_sha256":"c2464625b72106e1d94073dec9d3a8a5db7451855b239dd45963acf307c985bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOsIYbx9yJT5ESRljggAmJmukondRZSaZ2Fyd/V4JjCxMWLC9YqCCQ0lvC3QqClLYwi/jvtVOi8sFaFAIDtNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:24:02.074879Z","bundle_sha256":"af31ad7993f04d866d3ba2dfd2a6ce043ada7fdd5d30e30f9b199d3f336a63e4"}}